TY - JOUR
T1 - Local histograms and image occlusion models
AU - Massar, Melody L.
AU - Bhagavatula, Ramamurthy
AU - Fickus, Matthew
AU - Kovačević, Jelena
N1 - Funding Information:
The authors are extremely grateful to Dr. Carlos Castro and Dr. John A. Ozolek for introducing us to the motivating application and for providing us with raw image data and manually segmented ground truth labels used throughout this article. We also thank the two anonymous reviewers for their many helpful comments and suggestions. This work is supported by NSF DMS 1042701 and CCF 1017278, AFOSR F1ATA01103J001 and F1ATA00183G003NIH, NIH-R03-EB009875 and 5P01HD047675-02, the PA State Tobacco Settlement and the Kamlet–Smith Bioinformatics Grant. Parts of the work were presented at ISBI 2010 [2] and SBEC 2010 [14]. The views expressed in this article are those of the authors and do not reflect the official policy or position of the United States Air Force, Department of Defense, or the U.S. Government.
PY - 2013/5
Y1 - 2013/5
N2 - The local histogram transform of an image is a data cube that consists of the histograms of the pixel values that lie within a fixed neighborhood of any given pixel location. Such transforms are useful in image processing applications such as classification and segmentation, especially when dealing with textures that can be distinguished by the distributions of their pixel intensities and colors. We, in particular, use them to identify and delineate biological tissues found in histology images obtained via digital microscopy. In this paper, we introduce a mathematical formalism that rigorously justifies the use of local histograms for such purposes. We begin by discussing how local histograms can be computed as systems of convolutions. We then introduce probabilistic image models that can emulate textures one routinely encounters in histology images. These models are rooted in the concept of image occlusion. A simple model may, for example, generate textures by randomly speckling opaque blobs of one color on top of blobs of another. Under certain conditions, we show that, on average, the local histograms of such model-generated-textures are convex combinations of more basic distributions. We further provide several methods for creating models that meet these conditions; the textures generated by some of these models resemble those found in histology images. Taken together, these results suggest that histology textures can be analyzed by decomposing their local histograms into more basic components. We conclude with a proof-of-concept segmentation-and-classification algorithm based on these ideas, supported by numerical experimentation.
AB - The local histogram transform of an image is a data cube that consists of the histograms of the pixel values that lie within a fixed neighborhood of any given pixel location. Such transforms are useful in image processing applications such as classification and segmentation, especially when dealing with textures that can be distinguished by the distributions of their pixel intensities and colors. We, in particular, use them to identify and delineate biological tissues found in histology images obtained via digital microscopy. In this paper, we introduce a mathematical formalism that rigorously justifies the use of local histograms for such purposes. We begin by discussing how local histograms can be computed as systems of convolutions. We then introduce probabilistic image models that can emulate textures one routinely encounters in histology images. These models are rooted in the concept of image occlusion. A simple model may, for example, generate textures by randomly speckling opaque blobs of one color on top of blobs of another. Under certain conditions, we show that, on average, the local histograms of such model-generated-textures are convex combinations of more basic distributions. We further provide several methods for creating models that meet these conditions; the textures generated by some of these models resemble those found in histology images. Taken together, these results suggest that histology textures can be analyzed by decomposing their local histograms into more basic components. We conclude with a proof-of-concept segmentation-and-classification algorithm based on these ideas, supported by numerical experimentation.
KW - Classification
KW - Local histogram
KW - Occlusion
KW - Segmentation
KW - Texture
UR - http://www.scopus.com/inward/record.url?scp=84875222317&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84875222317&partnerID=8YFLogxK
U2 - 10.1016/j.acha.2012.07.005
DO - 10.1016/j.acha.2012.07.005
M3 - Article
AN - SCOPUS:84875222317
SN - 1063-5203
VL - 34
SP - 469
EP - 487
JO - Applied and Computational Harmonic Analysis
JF - Applied and Computational Harmonic Analysis
IS - 3
ER -