On a Polynomial Vector Field Model for Shape Representation
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.
KeywordsGreat Common Divisor Moment Invariant Shape Representation Polynomial Vector Polynomial Representation
Unable to display preview. Download preview PDF.
- 3.Chekroun, M., Darbon, J., Ciril, I.: On a polynomial vector field model for shape representation: mathematical foundation (in preparation)Google Scholar
- 6.GNU Multiple Precision library, ftp://ftp.gnu.org/gnu/gmp/
- 7.Hu, M.K.: Visual pattern recognition by moment invariants. IRE Transactions on Information Theory IT-8(2), 179–187 (1962)Google Scholar
- 14.Sonka, M., Hlavac, V., Boyle, R.: Image Processing, Analysis, and Machine Vision. In: PWS (1999)Google Scholar
- 16.Xu, C., Prince, J.L.: Snakes, Shapes, and Gradient Vector Flow. IEEE Transactions on Image Processing 7(3) (1998)Google Scholar