Efficient shape matching via graph cuts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4679 LNCS, Issue , 2007, Pages 39-54

  Schmidt, Frank R ^a   Töppe, Eno ^a   Cremers, Daniel ^a   Boykov, Yuri ^b  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; TIME DOMAIN ANALYSIS;

DYNAMIC TIME WARPING; SHORTEST PATH FORMULATION;

GRAPH THEORY;

EID: 38149064507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74198-5_4     Document Type: Conference Paper

References (23)

1. Appleton, B.C.: Globally minimal contours and surfaces for image segmentation. PhD thesis, University of Queensland, Australia (December 2004)
2. Bakircioglu, M., Grenander, M., Khaneja, N., Miller, M.I.: Curve matching on brain surfaces using frenet distances. Human Brain Mapping, pp. 329-333 (1998)
3. Basri, R., Costa, L., Geiger, D., Jacobs, D.: Determining the similarity of deformable shapes. Vision Research 38, 2365-2385 (1998)
4. Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. on Patt. Anal. and Mach. Intell. 26(9), 1124-1137 (2004)
5. Dryden, I.L., Mardia, K.V.: Statistical Shape Analysis. Wiley, Chichester (1998)
6. Elias, P., Feinstein, A., Shannon, C.E.: A note on the maximum flow through a network. IRE Transactions on Information Theory (later IEEE Transactions on Information Theory) IT-2, 117-199 (1956)
7. Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8, 399-404 (1956)
8. Galilei, G.: Discorsi e dimostrazioni matematiche, informo a due nuoue scienze attenti alia mecanica i movimenti locali. appresso gli Elsevirii; Opere VIII (2) (1638)
9. Gdalyahu, Y., Weinshall, D.: Flexible syntactic matching of curves and its application to automatic hierarchical classication of silhouettes. IEEE Trans. on Patt. Anal. and Mach. Intell. 21(12), 1312-1328 (1999)
10. Geiger, D., Gupta, A., Costa, L.A., Vlontzos, J.: Dynamic programming for detecting, tracking and matching deformable contours. IEEE Trans. on Patt. Anal. and Mach. Intell. 17(3), 294-302 (1995)
11. Greig, D.M., Porteous, B.T., Seheult, A.H.: Exact maximum a posteriori estimation for binary images. J. Roy. Statist. Soc. Ser. B. 51(2), 271-279 (1989)
12. Ishikawa, H.: Exact optimization for Markov random fields with convex priors. IEEE Trans. on Patt. Anal. and Mach. Intell. 25(10), 1333-1336 (2003)
13. Kendall. D.G.: The diffusion of shape. Advances in Applied Probability 9, 428-430 (1977)
14. Latecki, L.J., Lakämper, R.: Shape similarity measure based on correspondence of visual parts. IEEE Trans. on Patt. Anal. and Mach. Intell. 22(10), 1185-1190 (2000)
15. Manay, S., Cremers, D., Hong, B.-W., Yezzi, A., Soatto, S.: Integral invariants for shape matching. IEEE Trans. on Patt. Anal. and Mach. Intell. 28(10), 1602-1618 (2006)
16. McConnell, R., Kwok, R., Curlander, J.C., Kober, W., Pang, S.S.: ψ -s correlation and dynamic time warping: two methods for tracking ice floes in sar images. IEEE Trans. on Geosc. and Rem. Sens. 29, 1004-1012 (1991)
17. Mokhtarian, F., Mackworth, A.: A theory of multiscale, curvature-based shape representation for planar curves. IEEE Trans. on Patt. Anal. and Mach. Intell. 14, 789-805 (1992)
18. Pitiot, A., Delingette, H., Toga, A., Thompson, P.: Learning object correspondences with the observed transport shape measure. In: Information Processing in Medical Imaging, pp. 25-37 (July 2003)
19. Sebastian, T., Klein, P., Kimia, B.: On aligning curves. IEEE Trans. on Patt. Anal. and Mach. Intell. 25(1), 116-125 (2003)
20. Sharvit, D., Chan, J., Tek, H., Kimia, B.: Symmetry-based indexing of image databases (1998)
21. Thompson, D.W.: On Growth and Form. Cambridge University Press, Cambridge (1917)
22. Trouve, A., Younes, L.: Diffeomorphic matching problems in one dimension: Designing and minimizing matching functions. In: Europ. Conf. on Computer Vision, pp. 573-587 (2000)
23. Whitney, H.: Congruent graphs and the connectivity of graphs. Amer. J. Math. 54, 150-168 (1932)