Presentation | 2003/3/7 Nonlinear Optimization for Polygonalization LINH TruongKIEU, Atsushi IMIYA, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | In this paper, we aim to develop a polygonalization algorithm for the boundary of a discrete shape. We first derive a set of inequalities for the parameters of a Euclidean line from sample points, and an optimization criterion with respect to this system of inequalites. Second, we develop an algorithm for the computation of param- eters of the Euclidean lines from pixels on a plane. Finally using this algorithm, we introduce a polygonalization algorithm. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Discrete line / Discrete boundary / Discrete object / Polygonarization / Greedy algorithm |
Paper # | PRMU2002-250 |
Date of Issue |
Conference Information | |
Committee | PRMU |
---|---|
Conference Date | 2003/3/7(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Pattern Recognition and Media Understanding (PRMU) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Nonlinear Optimization for Polygonalization |
Sub Title (in English) | |
Keyword(1) | Discrete line |
Keyword(2) | Discrete boundary |
Keyword(3) | Discrete object |
Keyword(4) | Polygonarization |
Keyword(5) | Greedy algorithm |
1st Author's Name | LINH TruongKIEU |
1st Author's Affiliation | Shool of Science and Technology, Chiba University() |
2nd Author's Name | Atsushi IMIYA |
2nd Author's Affiliation | National Institute of Informatics |
Date | 2003/3/7 |
Paper # | PRMU2002-250 |
Volume (vol) | vol.102 |
Number (no) | 708 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |