The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2008 vol.30)
pp: 1132-1145
ABSTRACT
This paper introduces an image decomposition and simplification method based on the constrained connectivity paradigm. According to this paradigm, two pixels are said to be connected if they comply to a series of constraints defined in terms of simple measures such as the maximum grey level differences over well-defined pixel paths and regions. The resulting connectivity relation generates a unique partition of the image definition domain. The simplification of the image is then achieved by setting each segment of the partition to the mean value of the pixels falling within this segment. Fine to coarse partition hierarchies (and therefore images of increasing degree of simplification) are produced by varying the threshold value associated with each connectivity constraint. The paper also includes a generalisation to multichannel images, applications, a review of related image segmentation techniques, and pseudo-code for an implementation based on queue and stack data structures.
INDEX TERMS
Image Processing and Computer Vision, Hierarchical, Region growing, partitioning, Clustering, Segmentation, Graph-theoretic methods
CITATION
Pierre Soille, "Constrained Connectivity for Hierarchical Image Partitioning and Simplification", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.30, no. 7, pp. 1132-1145, July 2008, doi:10.1109/TPAMI.2007.70817
REFERENCES
[1] S. Horowitz, and T. Pavlidis, “Picture Segmentation by a Directed Split-and-Merge Procedure,” Proc. Second Int'l Joint Conf. Pattern Recognition, pp. 424-433, 1974.
[2] S. Horowitz and T. Pavlidis, “Picture Segmentation by a Tree Traversal Algorithm,” J. ACM, vol. 23, no. 2, pp. 368-388, Apr. 1976.
[3] S. Zucker, “Region Growing: Childhood and Adolescence,” Computer Graphics and Image Processing, vol. 5, pp. 382-399, 1976.
[4] C. Brice and C. Fennema, “Scene Analysis Using Regions,” Artificial Intelligence, vol. 1, no. 3-4, pp. 205-226, 1970.
[5] A. Rosenfeld, “Fuzzy Digital Topology,” Information and Control, vol. 40, pp. 76-87, 1979.
[6] J. Serra and P. Salembier, “Connected Operators and Pyramids,” Proc. SPIE Image Algebra and Morphological Image Processing IV, vol. 2030, E. Dougherty, P. Gader, and J. Serra, eds., pp. 65-76, July 1993.
[7] P. Salembier and J. Serra, “Flat Zones Filtering, Connected Operators, and Filters by Reconstruction,” IEEE Trans. Image Processing, vol. 4, no. 8, pp. 1153-1160, Aug. 1995.
[8] J. Crespo, R. Schafer, J. Serra, C. Gratin, and F. Meyer, “The Flat Zone Approach: A General Low-Level Region Merging Segmentation Method,” Signal Processing, vol. 62, no. 1, pp. 37-60, 1997.
[9] F. Meyer and P. Maragos, “Morphological Scale-Space Representation with Levelings,” Lecture Notes in Computer Science, vol. 1682, pp. 187-198, Sept. 1999.
[10] F. Meyer and P. Maragos, “Nonlinear Scale-Space Representation with Morphological Levelings,” J. Visual Comm. and Image Representation, vol. 11, no. 3, pp. 245-265, 2000.
[11] M. Nagao, T. Matsuyama, and Y. Ikeda, “Region Extraction and Shape Analysis in Aerial Photographs,” Computer Graphics and Image Processing, vol. 10, no. 3, pp. 195-223, July 1979.
[12] J. Gower and G. Ross, “Minimum Spanning Trees and Single Linkage Cluster Analysis,” Applied Statistics, vol. 18, no. 1, pp. 54-64, 1969.
[13] R. Duda, P. Hart, and D. Stork, Pattern Classification, second ed. Wiley Interscience, 2000.
[14] J. Kruskal, “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,” Proc. Am. Math. Soc., vol. 7, no. 1, pp. 48-50, Feb. 1956.
[15] S. Hambrusch, X. He, and R. Miller, “Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer,” Proc. Fourth ACM Symp. Parallel Algorithms and Architectures, pp. 100-108, 1992.
[16] S. Hambrusch, X. He, and R. Miller, “Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer,” J. Parallel and Distributed Computing, vol. 20, no. 1, pp. 56-68, 1994.
[17] Y. Wang and P. Bhattacharya, “On Parameter-Dependent Connected Components of Gray Images,” Pattern Recognition, vol. 29, no. 8, pp. 1359-1368, Aug. 1996.
[18] A. Rosenfeld, “On Connectivity Properties of Grayscale Pictures,” Pattern Recognition, vol. 16, no. 1, pp. 47-50, 1983.
[19] A. Rosenfeld, “The Fuzzy Geometry of Image Subsets,” Pattern Recognition Letters, vol. 2, no. 5, pp. 311-317, Sept. 1984.
[20] I. Bloch, “Fuzzy Connectivity and Math. Morphology,” Pattern Recognition Letters, vol. 14, pp. 483-488, 1993.
[21] S. Dellepiane and F. Fontana, “Extraction of Intensity Connectedness for Image Processing,” Pattern Recognition Letters, vol. 16, no. 3, pp. 313-324, Mar. 1995.
[22] S. Dellepiane, F. Fontana, and G. Vernazza, “Nonlinear Image Labeling for Multivalued Image Segmentation,” IEEE Trans. Image Processing, vol. 5, no. 3, pp. 429-446, Mar. 1996.
[23] U. Braga-Neto and J. Goutsias, “Grayscale Level Connectivity: Theory and Applications,” IEEE Trans. Image Processing, vol. 13, no. 12, pp. 1567-1580, Dec. 2004.
[24] R. Cormack, “A Review of Classification (with discussion),” J.Royal Statistical Soc. A, vol. 134, pp. 321-367, 1971.
[25] R. Paranjape, W. Morrow, and R. Rangayyan, “Adaptive-Neighborhood Histogram Equalization for Image Enhancement,” Computer Vision, Graphics, and Image Processing: Graphical Models and Image Processing, vol. 54, no. 3, pp. 259-267, 1992.
[26] U. Braga-Neto, “Alternating Sequential Filters by Adaptive-Neighborhood Structuring Functions,” Proc. Int'l Symp. Math. Morphology and Its Applications to Image and Signal Processing, Computational Imaging and Vision, vol. 5, pp. 139-146, Kluwer, 1996.
[27] G. Estabrook, “A Mathematical Model in Graph Theory for Biological Applications,” J. Theoretical Biology, vol. 12, pp. 297-310, 1966.
[28] M. Nagao and T. Matsuyama, A Structural Analysis of Complex Aerial Photographs. Plenum, 1980.
[29] A. Baraldi and F. Parmiggiani, “Single Linkage Region Growing Algorithms Based on the Vector Degree of Match,” IEEE Trans. Geoscience and Remote Sensing, vol. 34, no. 1, pp.137-148, Jan. 1996.
[30] T. Lindeberg, “Effective Scale: A Natural Unit for Measuring Scale-Space Lifetime,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 10, pp. 1068-1074, Oct. 1993.
[31] Y. Leung, J.-Z. Zhang, and Z.-B. Xu, “Clustering by Scale-Space Filtering,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 12, pp. 1396-1410, Dec. 2000.
[32] U. Braga-Neto and J. Goutsias, “Object-Based Image Analysis Using Multiscale Connectivity,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 6, pp. 892-907, June 2005.
[33] V. Nunes de Lima, IMAGE2000 and CLC2000: Products and Methods, EUR 21757 EN. Joint Research Centre, http://www.ec-gis.org/sdi/publist/pdfsnunes2005eur2000.pdf , 2005.
[34] T. Pavlidis, “Segmentation of Pictures and Maps through Functional Approximation,” Computer Graphics and Image Processing, vol. 1, pp. 360-370, 1972.
[35] P. Besl and R. Jain, “Segmentation through Variable-Order Surface Fitting,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 2, pp. 167-192, Mar. 1988.
[36] J.-M. Beaulieu and M. Goldberg, “Hierarchy in Picture Segmentation: A Stepwise Optimization Approach,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 2, pp. 150-163, June 1989.
[37] R. Schoenmakers, “Integrated Methodology for Segmentation of Large Optical Satellite Images in Land Applications of Remote Sensing,” EUR 16292 EN, European Commission, Joint Research Centre, Sept. 1995, PhD dissertation of Katholieke Universiteit Nijmegen, http://www.cs.ru.nl/ths/dissertationsSchoenmakers-phd95.ps.gz .
[38] S. Tanimoto, “Pictorial Feature Distortion in a Pyramid,” Computer Graphics and Image Processing, vol. 5, pp. 333-352, 1976.
[39] M. Li, W. Grosky, and R. Jain, “Normalized Quadtrees with Respect to Translations,” Computer Graphics and Image Processing, vol. 20, pp. 72-81, 1982.
[40] M. Bister, J. Cornelis, and A. Rosenfeld, “A Critical View of Pyramid Segmentation Algorithms,” Pattern Recognition Letters, vol. 11, pp. 605-617, Sept. 1990.
[41] A. Montanvert, P. Meer, and A. Rosenfeld, “Hierarchical Image Analysis Using Irregular Tessellations,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 4, pp. 307-316, Apr. 1991.
[42] K. Cho and P. Meer, “Image Segmentation from Consensus Information,” Computer Vision and Image Understanding, vol. 68, no. 1, pp. 72-89, Oct. 1997.
[43] P. Felzenszwalb and D. Huttenlocher, “Image Segmentation Using Local Variations,” Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, pp. 98-104, 1998.
[44] P. Felzenszwalb and D. Huttenlocher, “Efficient Graph-Based Segmentation,” Int'l J. Computer Vision, vol. 59, no. 2, pp. 167-181, , 2004.
[45] L. Guigues, H. Le Men, and J.-P. Cocquerez, “The Hierarchy of the Cocoons of a Graph and Its Application to Image Segmentation,” Pattern Recognition Letters, vol. 24, no. 8, pp. 1059-1066, 2003.
[46] C. Zahn, “Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters,” IEEE Trans. Computers, vol. 20, no. 1, pp. 68-86, Jan. 1971.
[47] Z. Wu and R. Leahy, “An Optimal Graph-Theoretic Approach to Data Clustering: Theory and Its Applications to Image Segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 11, pp. 1101-1113, Nov. 1993.
[48] J. Shi and J. Malik, “Normalized Cuts and Image Segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, Aug. 2000, An initial version appeared in the Proc. 1997 IEEE Conf. Computer Vision and Pattern Recognition.
[49] W. Kropatsch and Y. Haxhimusa, “Grouping and Segmentation in a Hierarchy of Graphs,” Proc. 16th IS&T SPIE Ann. Symp. Computational Imaging II, C. Bouman and E. Miller, eds., pp. 193-204, May 2004.
[50] R. Marfil, L. Molina-Tanco, A. Bandera, J. Rodriguez, and F. Sandoval, “Pyramid Segmentation Algorithms Revisited,” Pattern Recognition, vol. 39, no. 8, pp. 1430-1451, 2006.
[51] D. Comaniciu and P. Meer, “Mean Shift: A Robust Approach toward Feature Space Analysis,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 603-619, May 2002.
[52] P. Soille, “Morphological Partitioning of Multispectral Images,” J.Electronic Imaging, vol. 5, no. 3, pp. 252-265, July 1996.
[53] L. Vincent and P. Soille, “Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp.583-598, June 1991.
[54] R. Nock and F. Nielsen, “Statistical Region Merging,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 11, pp. 1452-1458, Nov. 2004.
[55] D. Brunner and P. Soille, “Iterative Area Filtering of Multichannel Images,” Image and Vision Computing, vol. 25, no. 8, pp. 1352-1364, Aug. 2007.
[56] R. Adams and L. Bischof, “Seeded Region Growing,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 6, pp. 641-647, June 1994.
[57] A. Mehnert and P. Jackway, “An Improved Seeded Region Growing,” Pattern Recognition Letters, vol. 18, pp. 1065-1071, 1997.
[58] G. Coray, A. Noetzel, and S. Selkow, “Order Independence in Local Clustering Algorithms,” Computer Graphics and Image Processing, vol. 4, pp. 120-132, 1975.
[59] A. Jain, M. Murty, and P. Flynn, “Data Clustering: A Review,” ACM Computing Surveys, vol. 31, no. 3, pp. 264-323, Sept. 1999.
[60] N. Ahuja, “On Detection and Representation of Multiscale Low-Level Image Structure,” ACM Computing Surveys, vol. 27, no. 3, pp.304-306, Sept. 1995.
[61] J.-P. Sutcliffe, “On the Logical Necessity and Priority of a Monothetic Conception of Class, and on the Consequent Inadequacy of Polythetic Accounts of Category and Categorization,” New Approaches in Classification and Data Analysis, E. Diday, Y.Lechevallier, M. Schrader, P. Bertrand, and B. Burtchy, eds., pp.55-63, Springer, 1994.
[62] P. Soille, “Morphological Image Compositing,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 5, pp. 673-683, May 2006.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool