Skip to main content

Agglomerative Grouping of Observations by Bounding Entropy Variation

  • Conference paper
  • 1865 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3663))

Abstract

An information theoretic framework for grouping observations is proposed. The entropy change incurred by new observations is analyzed using the Kalman filter update equations. It is found, that the entropy variation is caused by a positive similarity term and a negative proximity term. Bounding the similarity term in the spirit of the minimum description length principle and the proximity term in the spirit of maximum entropy inference a robust and efficient grouping procedure is devised. Some of its properties are demonstrated for the exemplary task of edgel grouping.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boyer, K.L., Sarkar, S.: Perceptual organization in computer vision: status, challenges, and potential. Comput. Vis. Image Underst. 76(1), 1–5 (1999)

    Article  Google Scholar 

  2. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, Chichester (1991)

    Book  MATH  Google Scholar 

  3. Crevier, D.: A probabilistic method for extracting chains of collinear segments. CVIU 76(1), 36–53 (1999)

    Google Scholar 

  4. Förstner, W., Wrobel, B.: Mathematical concepts in photogrammetry. In: McGlone, J.C., Mikhail, E.M., Bethel, J. (eds.) Manual of Photogrammetry, ASPRS (2004)

    Google Scholar 

  5. Guy, G., Medioni, G.: Inferring global perceptual contours from local features. Int. J. Comput. Vision 20(1-2), 113–133 (1996)

    Article  Google Scholar 

  6. Guy, G., Medioni, G.G.: Inference of surfaces, 3d curves, and junctions from sparse, noisy, 3d data. IEEE Trans. Pattern Anal. Mach. Intell. 19(11), 1265–1277 (1997)

    Article  Google Scholar 

  7. Jaynes, E.T.: On the rationale of maximum entropy methods. Proc. IEEE 70, 939–952 (1982)

    Article  Google Scholar 

  8. Koch, K.-R.: Parameter estimation and hypothesis testing in linear models. Springer, Heidelberg (1988)

    MATH  Google Scholar 

  9. Lowe, D.G.: Perceptual Organization and Visual Recognition. Kluwer Academic Publishers, Dordrecht (1985)

    Google Scholar 

  10. McCafferty, J.D.: Human And Machine Vision. Ellis Horwood (1990)

    Google Scholar 

  11. Medioni, G., Tang, C.-K., Lee, M.-S.: A Computational Framework for Segmentation and Grouping. Elsevier, Amsterdam (2000)

    MATH  Google Scholar 

  12. Mohan, R., Nevatia, R.: Perceptual organization for scene segmentation and description. IEEE Trans. Pattern Anal. Mach. Intell. 14(6), 616–635 (1992)

    Article  Google Scholar 

  13. Ommer, B., Buhmann, J.M.: A compositionality architecture for perceptual feature grouping. In: Rangarajan, A., Figueiredo, M.A.T., Zerubia, J. (eds.) EMMCVPR 2003. LNCS, vol. 2683, pp. 275–290. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Rissanen, J.: Minimum-Description-Length Principle. In: Kotz, S., Johnson, N.L. (eds.) Encyclopedia of Statistical Science, vol. 5, pp. 523–527. John Wiley & Sons, Chichester (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beder, C. (2005). Agglomerative Grouping of Observations by Bounding Entropy Variation. In: Kropatsch, W.G., Sablatnig, R., Hanbury, A. (eds) Pattern Recognition. DAGM 2005. Lecture Notes in Computer Science, vol 3663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11550518_13

Download citation

  • DOI: https://doi.org/10.1007/11550518_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28703-2

  • Online ISBN: 978-3-540-31942-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics