Parsing Silhouettes without Boundary Curvature

We describe a new decomposition algorithm for twodimensional, 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.

• Type: Conference
• Year: 2007
• Where: ICIAP
• Authors: Ralf Juengling, Lakshman Prasad
• Keywords: ICIAP 2007, Image Processing, Long Smooth Spines, Polygonal Shapes, Skeleton Fragments