1.3 Error Diffusion – Basic Concepts

Slides:



Advertisements
Similar presentations
11/11/02 IDR Workshop Dealing With Location Uncertainty in Images Hasan F. Ates Princeton University 11/11/02.
Advertisements

Contrast-Aware Halftoning Hua Li and David Mould April 22,
Binary Shading using Geometry and Appearance Bert Buchholz Tamy Boubekeur Doug DeCarlo Marc Alexa Telecom ParisTech – CNRS Rutgers University TU Berlin.
Spatial Filtering (Chapter 3)
Image Processing A brief introduction (by Edgar Alejandro Guerrero Arroyo)
2004 COMP.DSP CONFERENCE Survey of Noise Reduction Techniques Maurice Givens.
CS 551 / CS 645 Antialiasing. What is a pixel? A pixel is not… –A box –A disk –A teeny tiny little light A pixel is a point –It has no dimension –It occupies.
Half Toning. Continuous Half Toning Color Half Toning.
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
Introduction to electrical and computer engineering Jan P. Allebach School of Electrical and Computer Engineering
Digital Halftoning.
Spatial-based Enhancements Lecture 3 prepared by R. Lathrop 10/99 updated 10/03 ERDAS Field Guide 6th Ed. Ch 5: ;
Screen Ruling, Print Resolution AM, FM and Hybrid Halftoning Sasan Gooran Linköping University LiU-Norrköping.
IDL GUI for Digital Halftoning Final Project for SIMG-726 Computing For Imaging Science Changmeng Liu
IMAGE SAMPLING AND IMAGE QUANTIZATION 1. Introduction
INTERPOLATED HALFTONING, REHALFTONING, AND HALFTONE COMPRESSION Prof. Brian L. Evans Collaboration.
Digital image processing Chapter 3. Image sampling and quantization IMAGE SAMPLING AND IMAGE QUANTIZATION 1. Introduction 2. Sampling in the two-dimensional.
09/17/02 (C) 2002, University of Wisconsin, CS 559 Last Time Color Spaces File formats.
Halftoning With Pre- Computed Maps Objective Image Quality Measures Halftoning and Objective Quality Measures for Halftoned Images.
AM-FM Screen Design Using Donut Filters
02/05/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Mach Banding –Humans exaggerate sharp boundaries, but not fuzzy ones.
LUT Method For Inverse Halftone 資工四 林丞蔚 林耿賢. Outline Introduction Methods for Halftoning LUT Inverse Halftone Tree Structured LUT Conclusion.
3.7 Adaptive filtering Joonas Vanninen Antonio Palomino Alarcos.
Halftoning-Inspired Methods for Foveation in Variable Acuity Superpixel Imager Cameras Thayne R. Coffman 1,2 Prof. Brian L. Evans 1 (presenting) Prof.
Tree-Structured Method for LUT Inverse Halftoning IEEE Transactions on Image Processing June 2002.
Suppression of Musical Noise Artifacts in Audio Noise Reduction by Adaptive 2D filtering Alexey Lukin AES Member Moscow State University, Moscow, Russia.
Error Diffusion (ED) Li Yang Campus Norrköping (ITN), University of Linköping.
1 Embedded Signal Processing Laboratory The University of Texas at Austin Austin, TX USA 1 Mr. Vishal Monga,
Entropy vs. Average Code-length Important application of Shannon’s entropy measure is in finding efficient (~ short average length) code words The measure.
Spatial Filtering (Chapter 3) CS474/674 - Prof. Bebis.
Tone Dependent Color Error Diffusion Halftoning
Adaptive Median Filter
2.1 Direct Binary Search (DBS)
Digital Image Processing Lecture 10: Image Restoration
Digital Communications Chapter 13. Source Coding
Lossy Compression of Stochastic Halftones with JBIG2
Presented by :Yuting Bao
Tone Dependent Color Error Diffusion
Multi-Class Error-Diffusion with Blue-Noise Property
Thayne Coffman EE381K-14 May 3, 2005
Last update on June 15, 2010 Doug Young Suh
Variations on Error Diffusion: Retrospectives and Future Trends
Reinstating Floyd-Steinberg: Improved Metrics for Quality Assessment
1.1 Halftoning Fundamentals
School of Electrical and
FM Halftoning Via Block Error Diffusion
Image Analysis Image Restoration.
Content-Sensitive Screening in Black and White
Color Error Diffusion with Generalized Optimum Noise Shaping
Data Conversion Slides by Prof. Brian L. Evans, Dept. of ECE, UT Austin, and Dr. Thomas D. Kite, Audio Precision, Beaverton, OR
Spectral processing of point-sampled geometry
Tone Dependent Color Error Diffusion
1.2 Design of Periodic, Clustered-Dot Screens
DIGITAL HALFTONING Sasan Gooran.
A Review in Quality Measures for Halftoned Images
Contrast-Aware Halftoning
Digital Image Processing
IMAGE SAMPLING AND IMAGE QUANTIZATION 1. Introduction
2.2 Design of Aperiodic, Dispersed-Dot Screens
Reduction of blocking artifacts in DCT-coded images
Adaptive Filter A digital filter that automatically adjusts its coefficients to adapt input signal via an adaptive algorithm. Applications: Signal enhancement.
Tone Dependent Color Error Diffusion Halftoning
Govt. Polytechnic Dhangar(Fatehabad)
Digital Image Processing Lecture 3: Image Display & Enhancement
An Algorithm for Compression of Bilevel Images
FUNDAMENTAL CONCEPTS OF PARALLEL PROGRAMMING
A Parallel Algorithm for Hardware Implementation of Inverse Halftoning
REDUKSI NOISE Pertemuan-8 John Adler
Learning and Memorization
Review and Importance CS 111.
Presentation transcript:

1.3 Error Diffusion – Basic Concepts

Synopsis Error diffusion architecture Error diffusion textures Edge enhancement effect of error diffusion Spectral analysis of error diffusion Variations on a theme Tone-dependent error diffusion

Error Diffusion Architecture

Description of the Algorithm

2-D Error Diffusion Weighting Filters

1-D Example

2-D Error Diffusion – Floyd-Steinberg Weights Texture Artifacts in Midtones

2-D Error Diffusion – Floyd-Steinberg Weights Texture Artifacts in Highlights

Error Diffusion Characteristics At each step, error diffusion preserves local average over part of image that has been binarized and part that is yet to be binarized No fixed number of quantization levels Requires more computation than screening Excellent detail rendition (sharpens image) Generally good texture with some exceptions: Texture contouring Worm-like patterns in highlights and shadows Texture cliques in midtones Texture used to render a given gray level may be context-dependent

Two Views of Error Diffusion

Fourier Analysis Combining (1) and (3), In Fourier domain, Rearranging, we get where is a high-pass filter This shows that the spectrum of the binary image consists of the spectrum of the continuous-tone image plus a high-pass filtered version of the spectrum of the quantization error.

Knox’s Empirical Model for Quantization Error* We cannot find an analytical expression for Knox proposed the following model Correlation coefficient – Residual – (generally some image-dependence) ED Weights c 1-D 0.0 Floyd and Steinberg 0.55 Jarvis, Judice, and Ninke 0.80 *K. T. Knox, “Error Image in Error Diffusion,” SPIE Vol. 1657 (1992)

Application to Fourier Analysis Combining (4) and (5), we get The first term shows the origins of the sharpening effect that is characteristic of error diffusion. To the extent that the residual is uncorrelated with the original image, the second term will look like blue noise. High-emphasis filter High-pass noise

Knox’s Experimental Results Halftone Image Quantized Error Image The parameter in the upper right-hand corner is the correlation coefficient c 1-D Floyd-Steinberg Jarvis, Judice, Ninke

Spectral Characteristics of Error Diffusion clustered dot dither continuous tone error diffusion Bayer dither

Synopsis Error diffusion architecture Error diffusion textures Edge enhancement effect of error diffusion Spectral analysis of error diffusion Variations on a theme Tone-dependent error diffusion

Variations on a Theme Non-lexicographic scan raster Serpentine raster Peano scan Block-based scans Modifications to weights Randomized weights Adaptive weights Tone-dependent weights Threshold modulation Control sharpening Encourage clustering Serpentine Raster

Early Work Knox (1993) developed a spectral analysis for serpentine raster, and showed that it eliminates the asymmetry in the error weighting frequency response that is due to the causal nature of the filter. Ulichney (1986, 1987) experimented with many different combinations of scan rasters, weight sets, and randomization techniques, and concluded that a serpentine raster, Floyd-Steinberg coefficients, and 50% randomization yielded the best results.

Threshold Modulation Basic equation for threshold modulation Image-independent threshold modulation where is a periodic screen function – encourages periodic clustered-dot behavior (Billotet-Hoffman and Bryngdahl, 1983) Image-dependent threshold modulation where is a constant that controls degree of edge enhancement (Eschbach, 1991) Approximately cancels edge enhancement intrinsic to standard error diffusion Yields standard error diffusion Results in more edge enhancement than is provided by standard error diffusion

Tone-Dependent Error Diffusion Introduction Previous work related to TDED: R. Eschbach, JEI 1993 J. Shu, SID 1996 V. Ostromoukhov, US Patent 1998 V. Ostromoukhov, SIGGRAPH 2001 Our approach: The weights and thresholds are optimized based on a HVS model. Use variable weight locations to reduce worm like artifacts.

Conventional Error Diffusion f[m,n] u[m,n] g[m,n] + Q(•) - + - wk,l d[m,n]

Tone Dependent Error Diffusion [Li and Allebach, 2004] Weights and thresholds vary depending on the input f[m,n] u[m,n] g[m,n] + Q(•) - + - d[m,n] wk,l(f[m,n]) X

Tone Dependent Error Diffusion Quantization process: p[m,n;0.5] Midtone halftone pattern generated with direct binary search (DBS) Problem: How to optimize tU, tL and wk,l for each gray level.

Optimization of TDED parameters DBS |DFT|2 + Constant Patch (absorptance a) Normalized MSE - TDED |DFT|2 Update weights and thresholds Cost function

Optimal weights and thresholds X

Floyd-Steinberg vs TDED

Floyd-Steinberg vs TDED

TDED vs DBS TDED DBS

Efficient Implementation of Error Diffusion Reduced Lookup-table error diffusion Removal of DBS midtone pattern – direct binary flipping (DBF) Interpolation of weights and thresholds Memory-efficient/parallelizable approaches to error diffusion Block-based error diffusion Block-interlaced pinwheel error diffusion Serial block-based error diffusion Error-quantized error diffusion Compressible error diffusion

Prototypical System Architecture High Speed Memory High Speed Memory High Speed Memory . . . Processor Processor Processor Bus There may be only one of these I/O Low Speed Memory

Implementation Issues – Parallelizability and Memory Access Conventional error diffusion is inherently a serial process. Cannot process any given pixel until all pixels that feed error to it have already been processed. This limits opportunities for parallelism. Must have access to the entire previous/next line of continuous-tone error/image data. This impacts memory and/or bandwidth requirements. It is a problem when we want to go very cheap or very fast.

Memory Requirements for Raster Implementation x storage of errors for next line storage of errors from previous line storage of errors from previous line and current pixel n m m+1 n-1 n+1 For low cost or large format printers, on-chip memory is not sufficient to buffer error information for one entire image row All errors have to be written out to off-chip memory

Strategies for Artifact Reduction: Serpentine Raster Conventional Raster Serpentine Raster

Block Interlaced Pinwheel Error Diffusion (BIP-ED) with Serpentine Raster Process outward spiral (black) blocks first. Then process inward spiral (green) blocks.

Application of TDED to BIP-ED Adapt tone dependent error diffusion to pinwheel architecture. Use different TDED filters for different block types and different locations within blocks. Randomly initialize outward spiral ED to break up periodic patterns. Initialize inward spiral ED using errors diffused from neighboring outward spiral blocks to eliminate boundary artifacts.

BIP-TDED Block size 8x8 Block size 32x32

Pinwheel Error Diffusion Conventional Tone Dependent BIP-TDED vs TDED Pinwheel Error Diffusion Block size 128x128 Conventional Tone Dependent Error Diffusion

Stages for Strip-based Processing 4 2 1 6 3 7 5 8 Outward spiral block Inward spiral block