ML Anthology

Contour Grouping Based on Local Symmetry

Nagesh Adluru, Longin Jan Latecki, Rolf Lakämper, Thomas Young, Xiang Bai, Ari D. Gross
ICCV 2007 pp. 1-8
doi:10.1109/ICCV.2007.4408879 /iccv/2007/adluru2007iccv-contour/

Abstract

The paper deals with grouping of edges to contours of shapes using only local symmetry and continuity. Shape skeletons are used to generate the search space for a version of the Markov Chain Monte Carlo approach utilizing particle filters to find the most likely skeleton. Intuitively this means that grouping of edge segments is performed by walking along the skeleton. The particle search, which is an adapted version of a successful algorithm in robot mapping, is assisted by a reference model of a shape, which is expressed as the sequence of sample points and radii of maximal skeleton disks. This model is sufficiently flexible to represent non-rigid deformations, but restrictive enough to perform well on real, noisy image data. The order of skeleton points (and their corresponding segments) found by the particles defines the grouping.

PDF ICCV Semantic Scholar

Cite

Text

Adluru et al. "Contour Grouping Based on Local Symmetry." IEEE/CVF International Conference on Computer Vision, 2007. doi:10.1109/ICCV.2007.4408879

Markdown

[Adluru et al. "Contour Grouping Based on Local Symmetry." IEEE/CVF International Conference on Computer Vision, 2007.](https://mlanthology.org/iccv/2007/adluru2007iccv-contour/) doi:10.1109/ICCV.2007.4408879

BibTeX

@inproceedings{adluru2007iccv-contour,
  title     = {{Contour Grouping Based on Local Symmetry}},
  author    = {Adluru, Nagesh and Latecki, Longin Jan and Lakämper, Rolf and Young, Thomas and Bai, Xiang and Gross, Ari D.},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {2007},
  pages     = {1-8},
  doi       = {10.1109/ICCV.2007.4408879},
  url       = {https://mlanthology.org/iccv/2007/adluru2007iccv-contour/}
}