Parametric distributional clustering for image segmentation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2352, Issue , 2002, Pages 577-591

  Hermes, Lothar ^a   Zöller, Thomas ^a   Buhmann, Joachim M ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Clustering; Image segmentation; Information theory; Maximum likelihood

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; COMPUTER VISION; IMAGE CODING; INFORMATION THEORY; MAXIMUM LIKELIHOOD;

CLUSTERING; DETERMINISTIC ANNEALING; DISTRIBUTIONAL CLUSTERING; EXPLORATORY DATA ANALYSIS; MULTI-SCALE OPTIMIZATION; SEGMENTATION ALGORITHMS; SEGMENTATION TECHNIQUES; UNSUPERVISED IMAGE SEGMENTATION;

IMAGE SEGMENTATION;

EID: 84949997658     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47977-5_38     Document Type: Conference Paper

References (17)

1. S. Borra and S. Sakar. A framework for performance characterization of intermediate–level grouping modules. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(11):1306–1312, 1997.
2. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. John Wiley & Sons, 1991.
3. I. Csizàr and G. Tusnady. Information geometry and alternating minimization procedures. In E. J. Dudewicz et al, editor, Recent Results in Estimation Theory and Related Topics, Statistics and Decisions, Supplement Issue No. 1. Oldenbourg, 1984.
4. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B, 39:1–38, 1977.
5. R. J. Hathaway. Another interpretation of the EM algorithm for mixture distributions. Statistics and Probability Letters, 4:53–56, 1986.
6. F. Heitz, P. Perez, and P. Bouthemy. Multiscale minimization of global energy functions in some visual recovery problems. CVGIP: Image Understanding, 59(1):125–134, 1994.
7. A. Jain and R. Dubes. Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, NJ 07632, 1988.
8. D. Martin, C. Fowlkes, D. Tal, and J. Malik. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In Proc. ICCV’01, 2001.
9. R. M Neal and G. E. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants. In M. I. Jordan, editor, Learning in Graphical Models. MIT Press, 1999.
10. F. Pereira, N. Tishby, and L. Lee. Distributional clustering of english words. In 30th International Meeting of the Association of Computational Linguistics, pages 183–190, Columbus, Ohio, 1993.
11. J. Puzicha and J. M. Buhmann. Multiscale annealing for unsupervised image segmentation. Computer Vision and Image Understanding, 76(3):213–230, 1999.
12. J. Puzicha, T. Hofmann, and J. M. Buhmann. Histogram clustering for unsupervised segmentation and image retrieval. Pattern Recognition Letters, 20:899–909, 1999.
13. J. Puzicha, T. Hofmann, and J. M. Buhmann. A theory of proximity based clustering: Structure detection by optimization. Pattern Recognition, 2000.
14. K. Rose, E. Gurewitz, and G. Fox. A deterministic annealing approach to clustering. Pattern Recognition Letters, 11:589–594, 1990.
15. K. Rose, E. Gurewitz, and G. Fox. Statistical mechanics and phse transitions in clustering. Physical Review Letters, 65(8):945–948, 1990.
16. Jianbo Shi and Jitendra Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888–905, 2000.
17. N. Tishby, F. Pereira, and W. Bialek. The information bottleneck method. In Proc. of the 37th annual Allerton Conference on Communication, Control, and Computing, 1999.