Abstract
In this paper, we present a new type of alternating-optimization-based possibilistic c-shell algorithm for clustering-template-based shapes. A cluster prototype consists of a copy of the template after translation, scaling, rotation, and/or affine transformations. This extends the capability of shell clustering beyond a few standard geometrical shapes that have been in the literature so far. We use a number of 2-D datasets, consisting of both synthetic and real-world images, to illustrate the capability of our algorithm in detecting generic-template-based shapes in images. We also describe a progressive clustering procedure aimed to relax the requirements for a known number of clusters and good initialization, as well as new performance measures of shell-clustering algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
