Difference between revisions of "Publications/chekroun.06.iciar"
From LRDE
Line 7: | Line 7: | ||
| publisher = Springer-Verlag |
| publisher = Springer-Verlag |
||
| address = Povoa de Varzim, Portugal |
| address = Povoa de Varzim, Portugal |
||
− | | lrdeprojects = |
+ | | lrdeprojects = Olena |
| abstract = In this paper we propose an efficient algorithm to perform a polynomial approximation of the vector field derived from the usual distance mapping method. The main ingredients consist of minimizing a quadratic functional and transforming this problem in an appropriate setting for implementation. With this approach, we reduce the problem of obtaining an approximating polynomial vector field to the resolution of a not expansive linear algebraic system. By this procedure, we obtain an analytical shape representation that relies only on some coefficients. Fidelity and numerical efficiency of our approach are presented on illustrative examples. |
| abstract = In this paper we propose an efficient algorithm to perform a polynomial approximation of the vector field derived from the usual distance mapping method. The main ingredients consist of minimizing a quadratic functional and transforming this problem in an appropriate setting for implementation. With this approach, we reduce the problem of obtaining an approximating polynomial vector field to the resolution of a not expansive linear algebraic system. By this procedure, we obtain an analytical shape representation that relies only on some coefficients. Fidelity and numerical efficiency of our approach are presented on illustrative examples. |
||
| lrdekeywords = Image |
| lrdekeywords = Image |
Latest revision as of 15:07, 22 February 2017
- Authors
- Mickael Chekroun, Jérôme Darbon, Igor Ciril
- Where
- Proceedings of the International Conference on Image Analysis and Recognition (ICIAR)
- Place
- Povoa de Varzim, Portugal
- Type
- inproceedings
- Publisher
- Springer-Verlag
- Projects
- Olena
- Keywords
- Image
- Date
- 2006-04-28
Abstract
In this paper we propose an efficient algorithm to perform a polynomial approximation of the vector field derived from the usual distance mapping method. The main ingredients consist of minimizing a quadratic functional and transforming this problem in an appropriate setting for implementation. With this approach, we reduce the problem of obtaining an approximating polynomial vector field to the resolution of a not expansive linear algebraic system. By this procedure, we obtain an analytical shape representation that relies only on some coefficients. Fidelity and numerical efficiency of our approach are presented on illustrative examples.
Bibtex (lrde.bib)
@InProceedings{ chekroun.06.iciar, author = {Mickael Chekroun and J\'er\^ome Darbon and Igor Ciril}, title = {On a Polynomial Vector Field Model for Shape Representation}, booktitle = {Proceedings of the International Conference on Image Analysis and Recognition (ICIAR)}, publisher = {Springer-Verlag}, year = 2006, address = {Povoa de Varzim, Portugal}, month = sep, abstract = {In this paper we propose an efficient algorithm to perform a polynomial approximation of the vector field derived from the usual distance mapping method. The main ingredients consist of minimizing a quadratic functional and transforming this problem in an appropriate setting for implementation. With this approach, we reduce the problem of obtaining an approximating polynomial vector field to the resolution of a not expansive linear algebraic system. By this procedure, we obtain an analytical shape representation that relies only on some coefficients. Fidelity and numerical efficiency of our approach are presented on illustrative examples.} }