Shape complexity based on mutual information

Proceedings - International Conference on Shape Modeling and Applications, SMI'05

Volumn 2005, Issue , 2005, Pages 357-362

  Rigau, Jaume ^a   Feixas, Miquel ^a   Sbert, Mateu ^a  

^a UNIVERSITY OF GIRONA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES; IMAGE RETRIEVAL; INTEGRAL EQUATIONS; OBJECT RECOGNITION; PSYCHOLOGY COMPUTING;

INTEGRAL GEOMETRY; OBJECT LOCALIZATION; SHAPE COMPLEXITY;

COMPUTER VISION;

EID: 33846112993     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMI.2005.42     Document Type: Conference Paper

References (17)

1. R. Badii and A. Politi. Complexity. Hierarchical Structures and Scaling in Physics. Cambridge University Press, 1997.
2. F. Castro and M. Sbert. Aplication of quasi-monte carlo sampling to the multi-path method for radiosity. In 3rd International Conference on Monte Carlo and Quasi-Monte Carlo methods in Scientific Computing, June 1998. Held in Claremont (CA), USA.
3. F. Cazals and M. Sbert. Some integral geometry tools to estimate the complexity of 3D scenes. Research Report 3204, INRIA, July 1997.
4. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley Series in Telecommunications, 1991.
5. M. Feixas, E. del Acebo, P. Bekaert, and M. Sbert. An information theory framework for the analysis of scene complexity. Computer Graphics Forum (Proceedings of Eurographics'99), 18(3):95-106, September 1999.
6. D. P. Feldman and J. P. Crutchfield. Discovering noncritical organization: Statistical mechanical, information theoreticand computational views of patterns in one-dimensional spin systems. Working Paper 98-04-026, Santa Fe Institute, Santa Fe (NM), USA, April 1998.
7. J. Feldman and M. Singh. Information along contours and object boundaries. Psychological Review, 2004. In press.
8. B. Gärtner. Fast and robust smallest enclosing balls. In Proceedings of 7th Annual European Symposium on Algorithms (ESA), volume 1643 of Lecture Notes in Computer Science, pages 325-338. Springer-Verlag Vienna-New York, 1999.
9. P. Grassberger. Toward a quantitative theory of self-generated complexity. International Journal of Theoretical Physics, 25(9):907-938, 1986.
10. W. Li. On the relationship between complexity and entropy for markov chains and regular languages. Complex Systems, 5(4):381-399, 1991.
11. A. B. Novikoff. Integral Geometry as a Tool in Pattern Perception, pages 347-368. Pergamon Press, Elmsford (NY), USA, 1962.
12. R. Osada, T. Funkhouser, B. Chazelle, and D. Dobkin. Shape distributions. ACM Transaction on Graphics, 21(4):807-832, October 2002.
13. D. L. Page, A. F. Koschan, S. R. Sukumar, B. Roui-Abidi, and M. A. Abidi. Shape analysis algorithm based on information theory. In IEEE International Conference on Image Processing (Proceedings of ICIP'03), volume 1, pages 229-232, September 2003. Held in Barcelona, Spain.
14. L. A. Santaló. Integral Geometry and Geometric Probability. Addison-Wesley, Reading (MA), USA, 1976.
15. M. Sbert. An integral geometry based method for fast form-factor computation. Computer Graphics Forum (Proceedings of Eurographics'93), 12(3):409-420, 1993. Held in Barcelona, Spain.
16. H. Solomon. Geometric Probability, volume 28 of CBMSNFS Regional Conference Series in Applied Mathematics. SIAM, Philadelphia (PA), USA, 1978.
17. E. Wong and J. Steppe. Invariant Recognition of Geometric Shapes, pages 535-546. Academic Press, New York (NY), USA, 1969.