Contour grouping and abstraction using simple part models

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

Volumn 6315 LNCS, Issue PART 5, 2010, Pages 603-616

  Sala, Pablo ^a   Dickinson, Sven ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

part vocabulary; perceptual grouping; shape abstraction

Indexed keywords

ABSTRACTING; IMAGE SEGMENTATION;

ACTIVE SHAPE MODELS; CONTOUR GROUPING; IDEALIZED MODELS; NOVEL APPLICATIONS; OVER SEGMENTATION; PART VOCABULARY; PERCEPTUAL GROUPING; SHAPE ABSTRACTION;

COMPUTER VISION;

EID: 78149329499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15555-0_44     Document Type: Conference Paper

References (17)

1. Zhu, Q., Song, G., Shi, J.: Untangling cycles for contour grouping. In: ICCV (2007)
2. Wang, J., Gu, E., Betke, M.: Mosaicshape: Stochastic region grouping with shape prior. In: CVPR (2005)
3. Stahl, J., Wang, S.: Globally optimal grouping for symmetric boundaries. In: CVPR (2006)
4. Jacobs, D.W.: Robust and efficient detection of salient convex groups. PAMI 18, 23-37 (1996)
5. Estrada, F., Jepson, A.: Perceptual grouping for contour extraction. In: ICPR (2002)
6. Lindeberg, T.: Detecting salient blob-like image structures and their scales with a scale-space primal sketch: A method for focus-of-attention. IJCV 11, 283-318 (1993)
7. Pentland, A.P.: Automatic extraction of deformable part models. IJCV 4, 107-126 (1990)
8. Pilu, M., Fisher, R.: Model-driven grouping and recognition of generic object parts from single images. In: ISIRS, Lisbon, Portugal (1996)
9. Liu, L., Sclaroff, S.: Deformable model-guided region split and merge of image regions. IVC 22, 343-354 (2004)
10. Sala, P., Dickinson, S.: Model-based perceptual grouping and shape abstraction. In: POCV, Anchorage, Alaska, pp. 1-8 (2008)
11. Buchin, K., Knauer, C., Kriegel, K., Schulz, A., Seidel, R.: On the number of cycles in planar graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 97-107. Springer, Heidelberg (2007)
12. Tiernan, J.C.: An efficient search algorithm to find the elementary circuits of a graph. Commun. ACM 13, 722-726 (1970)
13. Cootes, T.F., Taylor, C.J., Cooper, D.H., Graham, J.: Active shape models - their training and application. CVIU 61, 38-59 (1995)
14. Douglas, D., Peucker, T.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. CC 10, 112-122 (1973)
15. Tax, D., Duin, R.: Data description in subspaces. In: ICPR, vol. 2, pp. 672-675 (2000)
16. Mount, D.M., Arya, S.: ANN: A library for approximate nearest neighbor searching (2006), http://www.cs.umd.edu/~mount/ANN/
17. Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient graph-based image segmentation. IJCV 59, 167-181 (2004)