Fast algorithms for histogram matching: Application to texture synthesis

Texture synthesis is the ability to create ensembles of images of similar structures from sample textures that have been photographed. The method we employ for texture synthesis is based on histogram matching of images at multiple scales and orientations. This paper reports two fast and in one case simple algorithms for histogram matching. We show that the sort-matching and the optimal cumulative distribution function (CDF)-matching (OCM) algorithms provide high computational speed compared to that provided by the conventional approach. The sort-matching algorithm also provides exact histogram matching. Results of texture synthesis using either method show no subjective perceptual differences. The sort-matching algorithm is attractive because of its simplicity and speed, however as the size of the image increases, the OCM algorithm may be preferred for optimal computational speed.

[1]  Robin N. Strickland,et al.  Wavelet transforms for detecting microcalcifications in mammograms , 1996, IEEE Trans. Medical Imaging.

[2]  R Strickland,et al.  An approach to the synthesis of biological tissue. , 1997, Optics express.

[3]  John W. Woods,et al.  Subband Image Coding , 1990 .

[4]  R. F. Wagner,et al.  Aperture optimization for emission imaging: effect of a spatially varying background. , 1990, Journal of the Optical Society of America. A, Optics and image science.

[5]  Eero P. Simoncelli.  Shiftable multi-scale transforms [or "What's wrong with orthonormal wavelets"] , 1992 .

[6]  Ernest L. Hall,et al.  Almost Uniform Distributions for Computer Image Enhancement , 1974, IEEE Transactions on Computers.

[7]  A. Burgess.  Statistically defined backgrounds: performance of a modified nonprewhitening observer model. , 1994, Journal of the Optical Society of America. A, Optics, image science, and vision.

[8]  Kyle J. Myers,et al.  Model observers for assessment of image quality , 1993 .

[9]  Rangaraj M. Rangayyan,et al.  Adaptive-neighborhood histogram equalization for image enhancement , 1992, CVGIP Graph. Model. Image Process..

[10]  Alexei A. Goon,et al.  Texture classification based on comparison of second-order statistics. I. Two-point probability density function estimation and distance measure , 1999 .

[11]  H H Barrett,et al.  Effect of random background inhomogeneity on observer detection performance. , 1992, Journal of the Optical Society of America. A, Optics and image science.

[12]  Paul S. Heckbert,et al.  Survey of Texture Mapping , 1986, IEEE Computer Graphics and Applications.

[13]  Greg Turk,et al.  Generating textures on arbitrary surfaces using reaction-diffusion , 1991, SIGGRAPH.

[14]  Andrew Witkin,et al.  Reaction-diffusion textures , 1991, SIGGRAPH.

[15]  Liyun Yu,et al.  Synthesis of textured complex backgrounds , 1998 .

[16]  J. P. Lewis,et al.  Algorithms for solid noise synthesis , 1989, SIGGRAPH.

[17]  Philip F. Judy.  Detection of clusters of simulated calcifications in lumpy noise backgrounds , 1996, Medical Imaging.

[18]  M Kunt.  Image coding. , 1988, Scanning microscopy. Supplement.

[19]  Rama Chellappa,et al.  Texture synthesis using 2-D noncausal autoregressive models , 1985, IEEE Trans. Acoust. Speech Signal Process..

[20]  Edward H. Adelson,et al.  Shiftable multiscale transforms , 1992, IEEE Trans. Inf. Theory.

[21]  John D. Austin,et al.  Adaptive histogram equalization and its variations , 1987 .

[22]  E.E. Pissaloux,et al.  Image Processing , 1994, Proceedings. Second Euromicro Workshop on Parallel and Distributed Processing.

[23]  Anil K. Jain,et al.  Markov Random Field Texture Models , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  M. Wegener.  Destriping multiple sensor imagery by improved histogram matching , 1990 .