2D Shape Classification and Retrieval

@inproceedings{McNeill20052DSC,
  title={2D Shape Classification and Retrieval},
  author={Graham McNeill and Sethu Vijayakumar},
  booktitle={IJCAI},
  year={2005}
}
We present a novel correspondence-based technique for efficient shape classification and retrieval. Shape boundaries are described by a set of (ad hoc) equally spaced points – avoiding the need to extract “landmark points”. By formulating the correspondence problem in terms of a simple generative model, we are able to efficiently compute matches that incorporate scale, translation, rotation and reflection invariance. A hierarchical scheme with likelihood cut-off provides additional speed-up. In… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS
20 Citations
13 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Matching problems for unlabelled configurations

  • J. T. Kent, K. V. Mardia, C. C. Taylor
  • Bioinformatics, Images, and Wavelets, pages 33–36
  • 2004
2 Excerpts

Super . Fast correspondencebased system for shaperetrieval

  • J. B.
  • Patt . Recog . Lett .
  • 2004

Bookstein . Landmark methods for forms without landmarks : morphometrics of group differences in outline shape

  • L. F.
  • Med . Im . Anal .
  • 1996

Similar Papers

Loading similar papers…