Robust contour matching via the order-preserving assignment problem

IEEE Transactions on Image Processing

Volumn 15, Issue 7, 2006, Pages 1831-1838

  Scott, Clayton ^a   Nowak, Robert ^b  

^a Rice University   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

Assignment problem; Contour matching; Dynamic programming; MPEG 7 shape database; Shape descriptors

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATABASE SYSTEMS; DYNAMIC PROGRAMMING; IMAGE COMPRESSION; OPTIMIZATION; PROBLEM SOLVING;

ASSIGNMENT PROBLEM; CONTOUR MATCHING; SHAPE DATABASE; SHAPE DESCRIPTORS;

PATTERN MATCHING;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; COMPUTER GRAPHICS; IMAGE ENHANCEMENT; IMAGE SUBTRACTION; INFORMATION RETRIEVAL; MATHEMATICAL COMPUTING; METHODOLOGY; SIGNAL PROCESSING; VIDEORECORDING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER GRAPHICS; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; INFORMATION STORAGE AND RETRIEVAL; NUMERICAL ANALYSIS, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; SIGNAL PROCESSING, COMPUTER-ASSISTED; SUBTRACTION TECHNIQUE; VIDEO RECORDING;

EID: 33745626833     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2006.877038     Document Type: Article

References (26)

1. S. Belongie, J. Malik, and J. Puzicha, "Shape matching and object recognition using shape contexts," IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 4, pp. 509-522, Apr. 2002.
2. H. Chui, "Non-Rigid Point Matching: Algorithms, Extensions, and Applications," Ph.D. dissertation, Dept. Elect. Eng., Yale Univ., New Haven, CT, May 2001.
3. C. Grigorescu and N. Petkov, "Distance sets for shape filters and shape recognition," IEEE Trans. Image Process., vol. 12, no. 10, pp. 1274-1286, Oct. 2003.
4. G. McNeill and S. Vijayakumar, "2D shape classification and retrievail," presented at the Int. Joint Conf. Artificial Intelligence, Edinburgh, U.K., 2005.
5. H. Ling and D. Jacobs, "Using the inner-distance for classification of articulated shapes," presented at the IEEE Conf. Computer Vision and Pattern Recognition, San Diego, CA, 2005.
6. L. J. Latecki and R. Lakämper, "Shape similarity measure based on correspondence of visual parts," IEEE Trans. Pattern Anal. Mach. Intell., vol. 22, no. 10, pp. 1185-1190, Oct. 2000.
7. N. Ueda and S. Suzuki, "Learning visual models from shape contours using multiscale convex/concave structure matching," IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, no. 4, pp. 337-352, Apr. 1993.
8. Y. Gdalyahu and D. Weinshall, "Flexible syntactic matching of curves and its application to automatic hierarchical classification of silhouettes," IEEE Trans. Pattern Anal. Mach. Intell., vol. 21, no. 12, pp. 1312-1328, Dec. 1999.
9. F. Mokhtarian, S. Abbasi, and J. Kittler, "Efficient and robust retrieval by shape content through curvature scale space," in Image Databases and Multi-Media Search, A.W.M. Smeulders and R. Jain, Eds. Singapore: World Scientific, 1997, pp. 51-58.
10. D. Tell and S. Carlsson, "Combining appearance and topology for wide baseline matchine," presented at the 7th Eur. Conf. Computer Vision, A. Heyden, G. Slparr, M. Nielsen, and P. Johansen, Eds., 2002.
11. T. Sebastian, P. Klein, and B. Kimia, "On aligning curves," IEEE Trans. Pattern Anal. Mach. Intell., vol. 25, no. 1, pp. 116-124, Jan. 2003.
12. E. Milios and E. Petrakis, "Shape retrieval based on dynamic programming," IEEE Trans. Image Process., vol. 9, no. 1, pp. 141-147, Jan. 2000.
13. I. Bartolini, P. Ciaccia, and M. Patella, "WARP: Accurate retrieval of shapes using phase of Fourier descriptors and time warping distance," IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 1, pp. 142-147, Jan. 2005.
14. S. Wang, T. Kubota, and T. Richardson, "Shape correspondence through landmark sliding," in Proc. Computer Vision Pattern Recognition, 2004, pp. 143-150.
15. B. Luo and E. R. Hancock, "Structural graph matching using the EM algorithm and singular value decomposition," IEEE Trans. Pattern Anal. Mach. Intell., vol. 23, no. 10, pp. 1120-1136, Oct. 2001.
16. J. M. Coughlan and S. J. Ferreira, "Finding deformable shapes usiing loopy belief propagation," in Proc. Eur. Conf. Computer Vision, 2002, pp. 453-468.
17. M. DeH'Amico and P. Toth, "Algorithms and codes fen dense assignment problems: The state of the art," Discrete Appl. Math., vol. 100, pp. 17-48, 2000.
18. C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
19. R. Jonker and A. Volgenant, "A shortest augmenting path algorithm for dense and sparse linear assignment problems," Computing, vol. 38, pp. 325-340, 1987.
20. D. Forney, "The Viterbi algorithm," Proc. IEEE, vol. 61, no. 3, pp. 268-278, Mar. 1973.
21. M. Maes, "On a cyclic string-to-string correction problem," Inf. Process. Lett., vol. 35, pp. 73-78, 1990.
22. D. Sharvit, J. Chan, H. Tek, and B. Kimia, "Symmetry-based indexing of image databases," J. Vis. Commun. Image Represent., vol. 9, no. 4, pp. 366-380, 1998.
23. L. J. Latecki, R. Lakamper, and U. Eckhardt, "Shape descriptors for nonrigid shapes with a single closed contour," in Proc. IEEE Conf. Computer Vision Pattern Recognition, 2000, pp. 424-429.
24. T. Adamek and N. O'Connor, "Efficient contour-based shape representation and matching," in Proc. 5th ACM SIGMM Int. Workshop Multimedia Information Retrieval, 2003, pp. 138-143.
25. B. Super, "Fast correspondence-based system for shape retrieval," Pattern Recognit. Lett., vol. 25, no. 2, pp. 217-225, 2004.
26. Z. Tu and A. Yuille, "Shape matching and recognition using generative models and informative features," presented at the 8th Eur. Conf. Computer Vision, 2004.