Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/39935
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZelniker, Emanuel Emilen
dc.contributor.authorClarkson, I. Vaughan L.en
dc.date.issued2003en
dc.identifier.citationDigital image computing : techniques and applications ; proceedings of the VIIth Biennial Australian Pattern Recognition Society Conference, DICTA 2003 / Sun C., Talbot H., Ourselin S. and Adriaansen T. (eds.), pp. 509-518.en
dc.identifier.isbn064309041Xen
dc.identifier.urihttp://hdl.handle.net/2440/39935-
dc.description.abstractIn this paper, we present an interpretation of the Maximum Likelihood Estimator (MLE) and the Delogne-K˚asa Estimator (DKE) for circle-parameter estimation via convolution. Under a certain model for theoretical images, this convolution is an exact description of the MLE. We use our convolution based MLE approach to find good starting estimates for the parameters of a circle, that is, the centre and radius. It is then possible to treat these estimates as preliminary estimates into the Newton-Raphson method which further refines these circle estimates and enables sub-pixel accuracy. We present closed form solutions to the Cram´er-Rao Lower Bound of each estimator and discuss fitting circles to noisy points along a full circle as well as along arcs. We compare our method to the DKE which uses a least squares approach to solve for the circle parameters.en
dc.description.statementofresponsibilityEmanuel E. Zelniker and I. Vaughan L. Clarksonen
dc.language.isoenen
dc.publisherCSIRO Publishingen
dc.subjectcircle-parameter estimation; convolution; estimators; likelihooden
dc.titleMaximum-likelihood circle-parameter estimation via convolutionen
dc.typeConference paperen
dc.contributor.schoolSchool of Computer Scienceen
dc.contributor.conferenceAustralian Pattern Recognition Society. Conference (7th : 2003 : Sydney, N.S.W.)en
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.