Parsing Silhouettes without Boundary Curvature

Modena, Italy September 10-September 14

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ICIAP.2007.101

14th International Conference on Imag ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Ralf Juengling Articles by Lakshman Prasad

	ASCII Text	x
	Ralf Juengling, Lakshman Prasad, "Parsing Silhouettes without Boundary Curvature," Image Analysis and Processing, International Conference on, pp. 665-670, 14th International Conference on Image Analysis and Processing (ICIAP 2007), 2007.

	BibTex	x
	@article{ 10.1109/ICIAP.2007.101, author = {Ralf Juengling and Lakshman Prasad}, title = {Parsing Silhouettes without Boundary Curvature}, journal ={Image Analysis and Processing, International Conference on}, volume = {0}, year = {2007}, isbn = {0-7695-2877-5}, pages = {665-670}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICIAP.2007.101}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Image Analysis and Processing, International Conference on TI - Parsing Silhouettes without Boundary Curvature SN - 0-7695-2877-5 SP665 EP670 A1 - Ralf Juengling, A1 - Lakshman Prasad, PY - 2007 KW - Shape Decomposition KW - Delaunay triangulation KW - Saliency Network KW - Perceptual Grouping VL - 0 JA - Image Analysis and Processing, International Conference on ER -

Ralf Juengling, Portland State University, USA

Lakshman Prasad, Los Alamos National Laboratory, USA

We describe a new decomposition algorithm for two-dimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes ("ribbons") by grouping skeleton fragments into long smooth spines. The parts are then obtained by cutting the ribbons along lines of mutual intersection. With this approach we find part cuts that obey heuristic rules of early vision [17] without using boundary curvature.

Index Terms:

Shape Decomposition, Delaunay triangulation, Saliency Network, Perceptual Grouping

Citation:

Ralf Juengling, Lakshman Prasad, "Parsing Silhouettes without Boundary Curvature," iciap, pp.665-670, 14th International Conference on Image Analysis and Processing (ICIAP 2007), 2007

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.