Statistical mechanics of digital halftoning

11/08/2010
by   Jun-ichi Inoue, et al.
0

We consider the problem of digital halftoning from the view point of statistical mechanics. The digital halftoning is a sort of image processing, namely, representing each grayscale in terms of black and white binary dots. The digital halftoning is achieved by making use of the threshold mask, namely, for each pixel, the halftoned binary pixel is determined as black if the original grayscale pixel is greater than or equal to the mask value and is determined as white vice versa. To determine the optimal value of the mask on each pixel for a given original grayscale image, we first assume that the human-eyes might recognize the black and white binary halftoned image as the corresponding grayscale one by linear filters. The Hamiltonian is constructed as a distance between the original and the recognized images which is written in terms of the threshold mask. We are confirmed that the system described by the Hamiltonian is regarded as a kind of antiferromagnetic Ising model with quenched disorders. By searching the ground state of the Hamiltonian, we obtain the optimal threshold mask and the resulting halftoned binary dots simultaneously. From the power-spectrum analysis, we find that the binary dots image is physiologically plausible from the view point of human-eyes modulation properties. We also propose a theoretical framework to investigate statistical performance of inverse digital halftoning, that is, the inverse process of halftoning. From the Bayesian inference view point, we rigorously show that the Bayes-optimal inverse-halftoning is achieved on a specific condition which is very similar to the so-called Nishimori line in the research field of spin glasses.

READ FULL TEXT

page 5

page 7

page 8

page 9

page 15

research
01/20/2010

Spatial Domain Watermarking Scheme for Colored Images Based on Log-average Luminance

In this paper a new watermarking scheme is presented based on log-averag...
research
06/03/2020

Spread of Influence in Graphs

Consider a graph G and an initial configuration where each node is black...
research
03/17/2019

Discriminating Original Region from Duplicated One in Copy-Move Forgery

Since images are used as evidence in many cases, validation of digital i...
research
06/30/2011

Visual Secret Sharing Scheme using Grayscale Images

Pixel expansion and the quality of the reconstructed secret image has be...
research
01/05/2020

Undetectable Radios: Covert Communication under Spectral Mask Constraints

We consider the problem of covert communication over continuous-time add...
research
06/14/2015

The Artists who Forged Themselves: Detecting Creativity in Art

Creativity and the understanding of cognitive processes involved in the ...
research
05/23/2023

SXVCS: An XOR-based Visual Cryptography Scheme without Noise via Linear Algebra

Visual Cryptography Schemes (VCS) based on the "XOR" operation (XVCS) ex...

Please sign up or login with your details

Forgot password? Click here to reset