Estimating complexity of 2D shapes

2005 IEEE 7th Workshop on Multimedia Signal Processing

Volumn , Issue , 2005, Pages

  Chen, Yinpeng ^a   Sundaram, Hari ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; RANDOM PROCESSES; REAL TIME SYSTEMS; SENSORY PERCEPTION;

KOLMOGOROV COMPLEXITY; SHAPE COMPLEXITY; SHAPE RANDOMNESS;

IMAGE CLASSIFICATION;

EID: 42749106220     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MMSP.2005.248668     Document Type: Conference Paper

References (8)

1. T. BRINKHOFF, H.-P. KRIEOEL, R. SCHNEIDER, et al. (1995). Measuring the complexity of polygonal objects, Proceedings of the Third ACM International Workshop on Advances in Geographical Information Systems, 109-117,
2. B. CHAZELLE and J. INCERPI (1984). Triangulation and shape complexity. ACM transactions on Graphics 3:135-152.
3. Y. CHEN and H. SUNDARAM (2005). A Computationally Efficient 3D Shape Rejection Algorithm, to appear in Proc. International Conference on Multimedia and Expo 2005.
4. T. M. COVER and J. A. THOMAS (1991). Elements of information theory. Wiley New York.
5. D. L. PAGE, A. KOSCHAN, S. R. SUKUMAR, et al. (2003). Shape analysis algorithm based on information theory, Proceedings of the International Conference on Image Processing, 14-17, Barcelona, Spain.
6. K. SIDDIQI and B. B. KIMIA (1993). Parts of visual form: Computational aspects, Proc. IEEE Conf. on Computer Vision and Pattern Recognition, 75-81,
7. G. TOUSSAINT (1991). Efficient triangulation of simple polygons. Visual Computer 7:280-295.
8. A. TVERSKY (1977). Features of Similarity. Psychological Review 84(4): pp 327 - 352.