Digital Halftoning. Sasan Gooran. PhD Course May 2013

Similar documents
Image Processing. Michael Kazhdan ( /657) HB Ch FvDFH Ch. 13.1

C. A. Bouman: Digital Image Processing - January 9, Digital Halftoning

Human Vision, Color and Basic Image Processing

Fig 1: Error Diffusion halftoning method

Prof. Feng Liu. Fall /04/2018

Evaluation of Visual Cryptography Halftoning Algorithms

A New Hybrid Multitoning Based on the Direct Binary Search

Error Diffusion and Delta-Sigma Modulation for Digital Image Halftoning

Addressing the colorimetric redundancy in 11-ink color separation

PART II. DIGITAL HALFTONING FUNDAMENTALS

Cluster-Dot Halftoning based on the Error Diffusion with no Directional Characteristic

Multi-Level Colour Halftoning Algorithms

WORKING WITH COLOR Monitor Placement Place the monitor at roughly right angles to a window. Place the monitor at least several feet from any window

Image Rendering for Digital Fax

Printer Model and Least-Squares Halftoning Using Genetic Algorithms

Analysis and Design of Vector Error Diffusion Systems for Image Halftoning

Error Diffusion without Contouring Effect

Low Noise Color Error Diffusion using the 8-Color Planes

Half-Tone Watermarking. Multimedia Security

Grayscale and Resolution Tradeoffs in Photographic Image Quality. Joyce E. Farrell Hewlett Packard Laboratories, Palo Alto, CA

Direct Binary Search Based Algorithms for Image Hiding

Hybrid Halftoning A Novel Algorithm for Using Multiple Halftoning Techniques

KODAK NEXFINITY Digital Press. 256 Shades of Gray

Performance Evaluation of Floyd Steinberg Halftoning and Jarvis Haltonong Algorithms in Visual Cryptography

Image Distortion Maps 1

Virtual Restoration of old photographic prints. Prof. Filippo Stanco

Chapter 11. Preparing a Document for Prepress and Printing Delmar, Cengage Learning

Image Processing COS 426

Color Image Quantization and Dithering Method Based on Human Visual System Characteristics*

Image Processing. Image Processing. What is an Image? Image Resolution. Overview. Sources of Error. Filtering Blur Detect edges

Screening Basics Technology Report

A Robust Nonlinear Filtering Approach to Inverse Halftoning

Image Processing for feature extraction

Digital Halftoning Using Two-Dimensional Carriers with a Noninteger Period

Problem Sheet 1 Probability, random processes, and noise

Image Processing. Adam Finkelstein Princeton University COS 426, Spring 2019

Image Filtering. Median Filtering

Factors Governing Print Quality in Color Prints

Comparison of Various Error Diffusion Algorithms Used in Visual Cryptography with Raster Scan and Serpentine Scan

Graphics and Image Processing Basics

Tutorial Version 5.1.xx March 2016 John Champlain and Jeff Woodcock

Color Noise Analysis

What is an image? Images and Displays. Representative display technologies. An image is:

A New Metric for Color Halftone Visibility

Bidirectional Serpentine Scan Based Error Diffusion Technique for Color Image Visual Cryptography

A Rumination of Error Diffusions in Color Extended Visual Cryptography P.Pardhasaradhi #1, P.Seetharamaiah *2

Plane-dependent Error Diffusion on a GPU

Monochrome Image Reproduction

ECC419 IMAGE PROCESSING

On Filter Techniques for Generating Blue Noise Mask

Lecture 1: image display and representation

On Filter Techniques for Generating Blue Noise Mask

XM (Cross Modulated) Screening Technology

Sampling and pixels. CS 178, Spring Marc Levoy Computer Science Department Stanford University. Begun 4/23, finished 4/25.

Image and Video Processing

Digital halftoning by means of green-noise masks

Introduction to Digital Imaging CS/HACU 116, Fall 2001 Digital Image Representation Page 1 of 7

Comparison of various Error Diffusion Algorithms Used in Visual Cryptography with Raster scan

Images and Displays. CS4620 Lecture 15

DIGITAL halftoning is a technique used by binary display

Reinstating Floyd-Steinberg: Improved Metrics for Quality Assessment of Error Diffusion Algorithms

קורס גרפיקה ממוחשבת 2008 סמסטר ב' Image Processing 1 חלק מהשקפים מעובדים משקפים של פרדו דוראנד, טומס פנקהאוסר ודניאל כהן-אור

Module 6 STILL IMAGE COMPRESSION STANDARDS

Visual Cryptography Scheme for Color Images Using Half Toning Via Direct Binary Search with Adaptive Search and Swap

Image Representation and Processing

Images and Displays. Lecture Steve Marschner 1

Algorithm-Independent Color Calibration for Digital Halftoning

Adobe Photoshop PS2, Part 3

HXM Screening module. Technical Note Hqn077. December 2010

Halftoning via Direct Binary Search using a Hard Circular Dot Overlap Model

How Big Is Color? John Seymour* Keywords: Halftone, Scanning, Moiré, Screening, Fourier, Resolution, Colorimetry. Abstract

A COMPARATIVE STUDY ON IMAGE COMPRESSION USING HALFTONING BASED BLOCK TRUNCATION CODING FOR COLOR IMAGE

Image Processing. What is an image? קורס גרפיקה ממוחשבת 2008 סמסטר ב' Converting to digital form. Sampling and Reconstruction.

Image Evaluation and Analysis of Ink Jet Printing System (I) - MTF Measurement and Analysis of Ink Jet Images -

UNIT III - LINE AND HALFTONE PHOTOGRAPHY

18 1 Printing Techniques. 1.1 Basic Printing Techniques

AM Screening 1200 dpi / 175 lpi

Resizing Images. 1. Resizing Images for the Web or PowerPoint. a. In Photoshop, open the image you wish to resize.

Implementation of Colored Visual Cryptography for Generating Digital and Physical Shares

Measurement of printer parameters for model-based halftoning

Understand brightness, intensity, eye characteristics, and gamma correction, halftone technology, Understand general usage of color

Special Print Quality Problems of Ink Jet Printers

High Resolution Analysis of Optical and Physical Dot Gain

Green-Noise Digital Halftoning

1 Tone Dependent Color Error Diusion Project Report Multidimensional DSP, Spring 2003 Vishal Monga Abstract Conventional grayscale error diusion halft

Printer Model + Genetic Algorithm = Halftone Masks

Time division multiplexing The block diagram for TDM is illustrated as shown in the figure

VISUAL CRYPTOGRAPHY for COLOR IMAGES USING ERROR DIFFUSION AND PIXEL SYNCHRONIZATION

Digital Images. Digital Images. Digital Images fall into two main categories

CHAPTER. delta-sigma modulators 1.0

Digital Images. Back to top-level. Digital Images. Back to top-level Representing Images. Dr. Hayden Kwok-Hay So ENGG st semester, 2010

Image Smoothing. Controlling printed output. Printing. Using color. Paper handling. Maintenance. Troubleshooting. Administration.

Fundamentals of Multimedia

Fast Inverse Halftoning

SCANNING GUIDELINES Peter Thompson (rev. 9/21/02) OVERVIEW

Evaluation Tool for Halftoning Algorithms

Outline: Getting the Best Scans

Reinstating Floyd-Steinberg: Improved Metrics for Quality Assessment of Error Diffusion Algorithms

Review of graininess measurements

MULTIMEDIA SYSTEMS

Transcription:

Digital Halftoning Sasan Gooran PhD Course May 2013

DIGITAL IMAGES (pixel based) Scanning Photo Digital image ppi (pixels per inch): Number of samples per inch

ppi (pixels per inch) ppi (scanning resolution): Number of samples per inch The higher ppi the better the representation of the con-tone image (Photo) Higher ppi requires more memory ppi should not be unncessarily high Choice of ppi????

ppi = 72

ppi = 36

ppi = 18

DIGITAL IMAGES Memory bits/pixel Grayscale 8 256 tones RGB 3*8=24 256^3=16.7 million colors

DIGITAL HALFTONING Since most printing devices are not able to reproduce different shadows of gray the original digital image has to be transformed into an image containing white (0 s) and black (1 s)

Halftoning

DIGITAL HALFTONING Con-tone Halftoned Prepress Halftoning Print Image Image

DIGITAL HALFTONING Example Periodic and clustered dots (AM)

DIGITAL HALFTONING Example Non-periodic and dispersed dots (FM)

HALFTONE CELL Pixel (/a number of pixels) Halftone cell The fractional area covered by the ink corresponds to the value of the pixel (or the area)

HALFTONE CELL Halftone cell Original image Halftoned image

SCREEN RULING/ FREQUENCY lpi (lines per inch): Number of halftone cells per inch The higher lpi the better the print (?!) High lpi requires more stable print press etc. Does a higher lpi always lead to a better print? (to be answered later)

RULE OF THUMB ppi = D esired s ize*2 lpi Original size * Ex. A 10 x 15 cm 2 photo that is supposed to be 20 x 30 cm 2 when printed at 150 lpi has to be scanned with a ppi about 2*2*150 = 600.

Micro dot HALFTONE CELL dpi: Number of micro dots per inch This halftone cell represents at most 8 2 + 1= 65 gray tones

HALFTONE CELL Micro dot Screen ruling: number of halftone cells per inch (lpi) Halftone cell In this case: 17 gray tones Resolution: number of micro dots per inch (dpi)

lpi & dpi lpi: Number of halftone cells per inch A halftone cell consists of micro dots dpi: Number of micro dots per inch The ratio dpi/lpi decides the size of the halftone cell

lpi & dpi dpi lpi 2 + 1= number of gray tones

lpi & dpi (Example) Assume that dpi is fixed at 600 lpi = 150 only gives 17 gray tones lpi = 100 only gives 37 gray tones lpi = 50 gives 145 gray tones Does a higher lpi always lead to a better print? Not necessarily!

High lpi, few gray tones

Lower lpi, more gray tones

Low lpi, more gray tones but large halftone dots, (not satisfying)

AM & FM HALFTONING AM (Amplitude Modulated) The size of the dots is variable, their frequency is constant FM (Frequency Modulated) 1st generation The size of the dots is constant, their frequency varies FM (Frequency Modulated) 2nd generation The size of the dots and their frequency vary

AM & FM (1st & 2nd Generation) Halftone AM FM, 1st FM, 2nd

AM & FM Halftone AM FM

FM Halftone, 1st and 2nd generation First Second

Hybrid Halftoning FM_1 FM_2 AM

THRESHOLDING b( m, n) = 1, 0, if if g( m, n) t( m, n) g( m, n) < t( m, n) g and b are the original and the halftoned image, respectively. t is the threshold matrix.

THRESHOLDING 0.6 1 0.1 0.3 0.2 0 Original Originalbild image Threshold Tröskelmatris matrix Halftoned Rastrerad image bild This threshold matrix represents 10 gray tones

THRESHOLD MATRIX Example: Line 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

THRESHOLD MATRIX Example: Spiral 1 2 3 4 12 13 14 5 11 16 15 6 10 9 8 7

THRESHOLD MATRIX Clustered & Dispersed, 45 degrees 14 12 13 16 19 21 20 17 5 4 3 10 28 29 30 23 6 1 2 11 27 32 31 22 9 7 8 15 24 26 25 18 19 21 20 17 14 12 13 16 28 29 30 23 5 4 3 10 27 32 31 22 6 1 2 11 24 26 25 18 9 7 8 15 Clustered 1 30 8 28 2 29 7 27 17 9 24 16 18 10 23 15 5 25 3 32 6 26 4 31 21 13 19 11 22 14 20 12 2 29 7 27 1 30 8 28 18 10 23 15 17 9 24 16 6 26 4 31 5 25 3 32 22 14 20 12 21 13 19 11 Dispersed

TABLE HALFTONING Mean Original image Halftoned image

TABLE HALFTONING Clustered Dispersed

FM HALFTONING Error Diffusion Original image Error filter Halftoned image

Error Diffusion The threshold value is 0.5 Suffers from artifacts, See specially the highlights and shadows and also the mid-tone regions

Error Diffusion The threshold value is a random number between 0.25 and 0.75 Better?

Iterative Method Controlling Dot Placement (IMCDP) Assumptions: The original continuous-tone image is scaled between 0 and 1 0 and 1 represent white and black respectively The binary/halftoned image is totally white to begin with

IMCDP The mean of the density values of the original image corresponds to the area of the inked regions Original Image Binary Image The first dot is placed where the original image has its largest density value

IMCDP The impact of the placed dot is fed back to the original image by a filter Original Image Binary Image The next dot is placed where the modified image has its largest density value

Iterative Halftoning, IMCDP Original IMCDP

IMCDP(filter) A Gaussian filter is used Experiments show that an 11 x 11 Gaussian filter leads to satisfactory results in most cases The size of the filter should be changing for the light and dark parts of the original image

IMCDP(filter) For halftoning of a constant image with a coverage of p% the size of the filter is decided by: a = 100 / p The size of the filter is (2a + 1) x (2a + 1) rounded

IMCDP(filter) 11 x 11 filter 21 x 21 filter

IMCDP

Models of Visual Perception { 1.1 } (0.114 ) H( f ) = 2.6(0.0192+ 0.114 f )exp f f is the frequency in cycles/ degree The spacing between the dots is given by: 1 f 1 1 180 = τ = 2arctan( ) = degrees 2Rd Rd π R is the printer resolution and d is the viewing distance.

Models of Visual Perception Viewing distance, d = 30 inches Printer resolution, R = 300 dpi

A simple Printer Model (Dot overlap Model) β γ T α 0 0 0 0 0 0 0 0 0 1 1 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 β α α 2β α β β 2 α γ 1 1 2α 1 α α 1 2α γ α 2β α β β α β 0 0 0 0 b(i,j) b p(i,j) p( i, j) = 1 if b( i, f1α + f2β f3γ if b( i, j) j) = 1 = 0

Least Square Model Based Algorithm g(original) EYE MODEL z b(binary) PRINTER MODEL EYE MODEL w 2, j i, j ) ε = ( z i w i j The squared error One way: Start with an initial binary image b. For each pixel (i,j) find the binary value b(i,j) that minimizes ε.

Objective Quality Measures

Objective Quality Measure (Halftone Images) Why difficult? A method that works well for certain kinds of images, might produce results of low quality for other images The definition of a good halftoning method may vary from application to application There might be a number of requests that cannot be formulated by a simple objective measure And so on

Objective Quality Measure (Halftone Images) A number of criteria The original grayscale image and the binary image should be as similar as possible (How to define this similarity?) The black dots in the highlights (and the white dots in the shadows) should be placed homogeneously. In color case, the color should also be reproduced as accurate as possible And so on

A simple measure e = ( b( i, j) g( i, j)) 2 i, j g is the original image and b is the resulting binary image Which image b gives the lowest error e?

SNR (Signal-to-Noise ratio) g( i, j) 2 SNR( db) = 10 log 10 ( i, j ( g( i, j) b( i, j)) 2 ) i, j

SNR These kinds of measures are very easy to apply but they assume that the distortion is only caused by additive noise. These measures don t correlate well with our perceived visual quality

Quantization Noise Spectrum (QNS) The quantization noise is defined as: q( i, j) = g( i, j) b( i, j) The quantization noise spectrum (QNS) is defined as: Q( k, l ) 2 Q is the 2-dimensional Fourier transform of q The smaller the quantization noise spectrum, the more similar b and g are.

Similarity By similarity we mean the perceptual similarity. Since the eye acts as a low-pass filter it is desirable that the QNS is is small in the low pass region, that means: e = Ω Q( k, l ) 2 is small Ω denotes a low-pass region.

QNS (Example) g = 1/32 Error diffusion IMCDP

QNS The error e has been calculated for the images shown in previous slide when W is a circular low-pass region that occupy 12.5% of the image. The error is slightly smaller for the image halftoned by ED than the one by IMCDP!!!! Therefore: It is not only the magnitude of the QNS in the low-pass region that is important. The shape of QNS also plays a significant role. Desirable: A more or less circularly symmetric QNS with small magnitude in the low pass region

QNS (Example) Error diffusion IMCDP

QNS (Example) Error diffusion IMCDP

Homogeneousness One way of studying the characteristic of a halftoning method is to study the halftone patterns (tints) produced by the method. By a halftone pattern we mean the result of halftoning a constant image. We want the dots in the halftone pattern to be placed as homogeneously as possible over the entire image The set of distances from each dot to its closest dot gives a good picture of how close/far the dots in the halftone pattern are placed. The couple mean value and standard deviation of the data in this set can be used as a measure for homogeneousness of the pattern. (NOTE: Useful for very light and dark tones only) Desirable: Big mean value and small standard deviation

Homogeneousness 11 x 11 filter 21 x 21 filter (Mean value, standard deviation)=(7.28, 1.19) for the image to the left and (8.76, 0.82) for the image to the right

Frequency Response Original ED (Floyd & Steinberg filter) ED (Jarvis-Judice-Ninke filter) IMCDP The frequency is increased from left to right

Frequency Gain Use the original image in the previous page as the input image and Compute the frequency gain: G ( f ) = I I out in I out and I in are the Fourier transform of the output and the input Image, respectively. Desirable: G(f) is close to 1 at low frequencies.

Frequency Gain ED (F & S) ED (J & J & N) IMCDP

Frequency Gain From the previous diagrams we see that error diffusion methods have a tendency of high-pass filtering (edge enhancement) the original image The frequency gain for the image halftoned by IMCDP is very close to 1 at low frequencies The gain at higher frequencies are not of any particular interest because the eye is less sensitive there

Halftone Image Quality A method that works well for certain images, might produce results of low quality for other images. An image with two gray levels (0.49 in the left half and 0.5 in the right half) is halftoned by Floyd-Steinberg error diffusion 0.49 0.5 Original image Error diffusion While the border between these two gray levels are hardly detected by the eye, it is emphasized by error diffusion because of a sudden change of pattern structure