On a Polynomial Vector Field Model for Shape Representation

From LRDE

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