You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
19 August 1997Motion field computation with a continuation algorithm
THe problem of dense motion field estimation usually comes down to the minimization of a non-convex energy function. This minimization is achieved thanks to multigrid methods or more often using the first order approximation of the structural model. In this paper we propose a different approach based on the estimation of the image properties which lead to a convex hamiltonian. These properties are used to define a continuation algorithm: approximations of original images are computed using these conditions and used for the first stage of our continuation algorithm. The modeled images are then gradually transformed back to the original ones while the process evolves. This method is tested on synthetic sequences and its results are compared with those of other methods.
The alert did not successfully save. Please try again later.
Frederic Bouchara, Jacques Richou, "Motion field computation with a continuation algorithm," Proc. SPIE 3101, New Image Processing Techniques and Applications: Algorithms, Methods, and Components II, (19 August 1997); https://doi.org/10.1117/12.281285