Efficient unsupervised estimation of second-order B-spline contour descriptors

Tarek A. El Doker, Phillip A. Mlsna

Research output: Contribution to conferencePaper

3 Scopus citations

Abstract

A novel unsupervised algorithm is presented for efficient and global computation of periodic second-order B-spline approximations to closed boundaries. Key local geometric information is extracted from a smoothed version of the boundary. This local information allows intelligent partitioning of the boundary and construction of an initial system of equations that often produces a very good approximation. Additional equations are introduced as local constraints to control occasional violations of the user-specified absolute error tolerance. The overdetermined systems of equations are solved by a standard least-squares approach. Computational complexity is compared to two previous algorithms. Experimental results are also provided.

Original languageEnglish (US)
PagesII565-II568
StatePublished - Dec 1 2002
Event2002 45th Midwest Symposium on Circuits and Systems - Tulsa, OK, United States
Duration: Aug 4 2002Aug 7 2002

Other

Other2002 45th Midwest Symposium on Circuits and Systems
CountryUnited States
CityTulsa, OK
Period8/4/028/7/02

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Efficient unsupervised estimation of second-order B-spline contour descriptors'. Together they form a unique fingerprint.

  • Cite this

    El Doker, T. A., & Mlsna, P. A. (2002). Efficient unsupervised estimation of second-order B-spline contour descriptors. II565-II568. Paper presented at 2002 45th Midwest Symposium on Circuits and Systems, Tulsa, OK, United States.