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

Tarek A. El Doker, Phillip A. Mlsna

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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)
Title of host publicationMidwest Symposium on Circuits and Systems
Volume2
StatePublished - 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

Fingerprint

Splines
Computational complexity

ASJC Scopus subject areas

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

Cite this

El Doker, T. A., & Mlsna, P. A. (2002). Efficient unsupervised estimation of second-order B-spline contour descriptors. In Midwest Symposium on Circuits and Systems (Vol. 2)

Efficient unsupervised estimation of second-order B-spline contour descriptors. / El Doker, Tarek A.; Mlsna, Phillip A.

Midwest Symposium on Circuits and Systems. Vol. 2 2002.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

El Doker, TA & Mlsna, PA 2002, Efficient unsupervised estimation of second-order B-spline contour descriptors. in Midwest Symposium on Circuits and Systems. vol. 2, 2002 45th Midwest Symposium on Circuits and Systems, Tulsa, OK, United States, 8/4/02.
El Doker TA, Mlsna PA. Efficient unsupervised estimation of second-order B-spline contour descriptors. In Midwest Symposium on Circuits and Systems. Vol. 2. 2002
El Doker, Tarek A. ; Mlsna, Phillip A. / Efficient unsupervised estimation of second-order B-spline contour descriptors. Midwest Symposium on Circuits and Systems. Vol. 2 2002.
@inproceedings{ca5b1b2f26754df686c6c46d83420f38,
title = "Efficient unsupervised estimation of second-order B-spline contour descriptors",
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.",
author = "{El Doker}, {Tarek A.} and Mlsna, {Phillip A.}",
year = "2002",
language = "English (US)",
volume = "2",
booktitle = "Midwest Symposium on Circuits and Systems",

}

TY - GEN

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

AU - El Doker, Tarek A.

AU - Mlsna, Phillip A.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036976597&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036976597&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0036976597

VL - 2

BT - Midwest Symposium on Circuits and Systems

ER -