This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Search for Publication

Year(s) from:  to 
Keywords (separated by spaces):

From edgels to parametrics curves

M. Stricker and A. Leonardis
Proc.~of the 9th Scandinavian Conference on Image Analysis (Uppsala)
June 1995


In many applications more than one curve type is needed to explain the edge data reasonably well. In this paper we present a robust algorithm which is designed to work concurrently with different curve types where each curve type selects its own domain of applicability. The major components of our algorithm are: a) A data-driven exploration of the edge data which produces estimates of possible curves. b) A selection which regards the curves produced by the exploration as hypotheses and decides which of them are needed to explain the edge data. c) A robust extension of a least squares algorithm which is initialized with the selected curves. We demonstrate with examples that our algorithm is robust and produces highly accurate results on both dense and sparse edge data.

Download in postscript format
  author = {M. Stricker and A. Leonardis},
  title = {From edgels to parametrics curves},
  booktitle = {Proc.~of the 9th Scandinavian Conference on Image Analysis (Uppsala)},
  year = {1995},
  month = {June},
  pages = {749-758},
  keywords = {fitting, parametric, edges}