Direct least squares fitting of ellipses:
Abstract: "This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac-b²=1 the new method incorporates the ellipticity co...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1996
|
| Series: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
794 |
| Subjects: | |
| Summary: | Abstract: "This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac-b²=1 the new method incorporates the ellipticity constraint into the normalization factor. The new method combines several advantages: (i) It is ellipse-specific so that even bad data will always return an ellipse; (ii) It can be solved naturally by a generalized eigensystem and (iii) it is extremely robust, efficient and easy to implement. We compare the proposed method to other approaches and show its robustness on several examples in which other non-ellipse-specific approaches would fail or require computationally expensive iterative refinements. Source code for the algorithm is supplied and a demonstration is available on http://www.dai.ed.ac.uk/groups/mvu/ellipse-demo.html" |
| Physical Description: | 15 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011049638 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961111s1996 |||| 00||| engod | ||
| 035 | |a (OCoLC)35736593 | ||
| 035 | |a (DE-599)BVBBV011049638 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Fitzgibbon, Andrew W. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Direct least squares fitting of ellipses |c Fitzgibbon, A. W. ; Pilu, M. ; Fisher, R. B. |
| 264 | 1 | |a Edinburgh |c 1996 | |
| 300 | |a 15 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 794 | |
| 520 | 3 | |a Abstract: "This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac-b²=1 the new method incorporates the ellipticity constraint into the normalization factor. The new method combines several advantages: (i) It is ellipse-specific so that even bad data will always return an ellipse; (ii) It can be solved naturally by a generalized eigensystem and (iii) it is extremely robust, efficient and easy to implement. We compare the proposed method to other approaches and show its robustness on several examples in which other non-ellipse-specific approaches would fail or require computationally expensive iterative refinements. Source code for the algorithm is supplied and a demonstration is available on http://www.dai.ed.ac.uk/groups/mvu/ellipse-demo.html" | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Pattern recognition, image processing and remote sensing |2 sigle | |
| 650 | 4 | |a Computer vision | |
| 650 | 4 | |a Curve fitting | |
| 650 | 4 | |a Ellipse | |
| 700 | 1 | |a Pilu, Maurizio |e Verfasser |4 aut | |
| 700 | 1 | |a Fisher, Robert B. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 794 |w (DE-604)BV010450646 |9 794 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007400083 | ||
Record in the Search Index
| _version_ | 1804125539323084800 |
|---|---|
| any_adam_object | |
| author | Fitzgibbon, Andrew W. Pilu, Maurizio Fisher, Robert B. |
| author_facet | Fitzgibbon, Andrew W. Pilu, Maurizio Fisher, Robert B. |
| author_role | aut aut aut |
| author_sort | Fitzgibbon, Andrew W. |
| author_variant | a w f aw awf m p mp r b f rb rbf |
| building | Verbundindex |
| bvnumber | BV011049638 |
| ctrlnum | (OCoLC)35736593 (DE-599)BVBBV011049638 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02174nam a2200361 cb4500</leader><controlfield tag="001">BV011049638</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961111s1996 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35736593</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011049638</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fitzgibbon, Andrew W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Direct least squares fitting of ellipses</subfield><subfield code="c">Fitzgibbon, A. W. ; Pilu, M. ; Fisher, R. B.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">794</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac-b²=1 the new method incorporates the ellipticity constraint into the normalization factor. The new method combines several advantages: (i) It is ellipse-specific so that even bad data will always return an ellipse; (ii) It can be solved naturally by a generalized eigensystem and (iii) it is extremely robust, efficient and easy to implement. We compare the proposed method to other approaches and show its robustness on several examples in which other non-ellipse-specific approaches would fail or require computationally expensive iterative refinements. Source code for the algorithm is supplied and a demonstration is available on http://www.dai.ed.ac.uk/groups/mvu/ellipse-demo.html"</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Pattern recognition, image processing and remote sensing</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer vision</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Curve fitting</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ellipse</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pilu, Maurizio</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fisher, Robert B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">794</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">794</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007400083</subfield></datafield></record></collection> |
| id | DE-604.BV011049638 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:10Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007400083 |
| oclc_num | 35736593 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 15 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Fitzgibbon, Andrew W. Verfasser aut Direct least squares fitting of ellipses Fitzgibbon, A. W. ; Pilu, M. ; Fisher, R. B. Edinburgh 1996 15 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 794 Abstract: "This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac-b²=1 the new method incorporates the ellipticity constraint into the normalization factor. The new method combines several advantages: (i) It is ellipse-specific so that even bad data will always return an ellipse; (ii) It can be solved naturally by a generalized eigensystem and (iii) it is extremely robust, efficient and easy to implement. We compare the proposed method to other approaches and show its robustness on several examples in which other non-ellipse-specific approaches would fail or require computationally expensive iterative refinements. Source code for the algorithm is supplied and a demonstration is available on http://www.dai.ed.ac.uk/groups/mvu/ellipse-demo.html" Bionics and artificial intelligence sigle Pattern recognition, image processing and remote sensing sigle Computer vision Curve fitting Ellipse Pilu, Maurizio Verfasser aut Fisher, Robert B. Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 794 (DE-604)BV010450646 794 |
| spellingShingle | Fitzgibbon, Andrew W. Pilu, Maurizio Fisher, Robert B. Direct least squares fitting of ellipses Bionics and artificial intelligence sigle Pattern recognition, image processing and remote sensing sigle Computer vision Curve fitting Ellipse |
| title | Direct least squares fitting of ellipses |
| title_auth | Direct least squares fitting of ellipses |
| title_exact_search | Direct least squares fitting of ellipses |
| title_full | Direct least squares fitting of ellipses Fitzgibbon, A. W. ; Pilu, M. ; Fisher, R. B. |
| title_fullStr | Direct least squares fitting of ellipses Fitzgibbon, A. W. ; Pilu, M. ; Fisher, R. B. |
| title_full_unstemmed | Direct least squares fitting of ellipses Fitzgibbon, A. W. ; Pilu, M. ; Fisher, R. B. |
| title_short | Direct least squares fitting of ellipses |
| title_sort | direct least squares fitting of ellipses |
| topic | Bionics and artificial intelligence sigle Pattern recognition, image processing and remote sensing sigle Computer vision Curve fitting Ellipse |
| topic_facet | Bionics and artificial intelligence Pattern recognition, image processing and remote sensing Computer vision Curve fitting Ellipse |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT fitzgibbonandreww directleastsquaresfittingofellipses AT pilumaurizio directleastsquaresfittingofellipses AT fisherrobertb directleastsquaresfittingofellipses |