Recognition of user-defined video object models using weighted graph homomorphisms

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5022 I, Issue , 2003, Pages 542-553

  Farin, Dirk ^a   De With, Peter H N ^b   Effelsberg, Wolfgang ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Dynamic programming; Image segmentation; Inexact graph matching; Object recognition

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; FEATURE EXTRACTION; GRAPH THEORY; IMAGE SEGMENTATION; QUADRATIC PROGRAMMING;

EARTH MOVERS DISTANCE; INEXACT GRAPH MATCHING; USER-DEFINED VIDEO OBJECT MODELS; WEIGHTED GRAPH HOMOMORPHISMS;

OBJECT RECOGNITION;

EID: 0043128527     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.476522     Document Type: Conference Paper

References (14)

1. C. Carson, S. Belongie, H. Greenspan, and J. Malik, "Region-based image querying," in CVPR'97 Workshop on Content-Based Access of Image and Video Libraries, 1997.
2. J. Li, J. Z. Wang, and G. Wiederhold, "IRM: Integrated region matching for image retrieval," in ACM Multimedia, 2000.
3. Y. Chen and J. Z. Wang, "A region-based fuzzy feature matching approach to content-based image retrieval," IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1252-1267, 2002.
4. S. Gold and A. Rangarajan, "A graduated assignment algorithm for graph matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, 1996.
5. C. Schellewald and C. Schnörr, "Subgraph matching with semidefinite programming," tech. rep., CVPR, University of Mannheim, Nov. 2002.
6. M. Pelillo, K. Siddiqi, and S. W. Zucker, "Continuous-based heuristics for graph and tree isomorphisms, with application to computer vision," in NIPS 99 Workshop on Complexity and Neural Computation, Dec. 1999.
7. A. Torsello and E. R. Hancock, "Efficiently computing weighted tree edit distance using relaxation labeling," in Energy Minimization Methods in Computer Vision and Pattern Recognition, Third International Workshop, EMMCVPR 2001, France, Lecture Notes in Computer Science 2134, Springer, Sept. 2001.
8. D. Eppstein, "Subgraph isomorphism in planar graphs and related problems," tech. rep., Dept. of Information and Computer Science, University of California, May 1994.
9. H. Greenspan, G. Dvir, and Y. Rubner, "Region correspondence for image matching via EMD flow," in IEEE Workshop on Content-based Access of Image and Video Libraries, June 2000.
10. D. Farin and P. H. N. de With, "Towards real-time MPEG-4 segmentation: a fast implementation of region merging," in 21st Symposium on Information Theory in the Benelux, pp. 173-180, 2000.
11. T. Brox, D. Farin, and P. H. N. de With, "Multi-stage region merging for image segmentation," in 22nd Symposium on Information Theory in the Benelux, May 2001.
12. M. Pelillo, K. Siddiqi, and S. W. Zucker, "Matching hierarchical structures using association graphs," tech. rep., Yale University, Center for Computational Vision & Control, Nov. 1997.
13. S. Richter, G. Kühne, and O. Schuster, "Contour-based classification of video objects," in SPIE Proc. Storage and Retrieval for Media Databases, 4315, pp. 608-618, Jan. 2001.
14. R. Fablet, P. Bouthemy, and M. Gelgon, "Moving object detection in color image sequences using region-level graph labeling," in 6th IEEE International Conference on Image Processing, ICIP, Oct. 1999.