- Journal Home
- Volume 22 - 2025
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
We consider a unified variational PDEs model to solve the optic flow problem for large displacements and varying illumination. Although, the energy functional is nonconvex and severely nonlinear, we show that the model offers a well suited framework to extend the efficient methods we used for small displacements. In particular, we resort to an adaptive control of the diffusion and the illumination coefficients which allows us to preserve the edges and to obtain a sparse vector field. We develop a combined space-time parallel programming strategy based on a Schwarz domain decomposition method to speed up the computations and to handle high resolution images, and the parareal algorithm, to enhance the speedup and to achieve a lowest-energy local minimum. This full parallel method gives raise to several iterative schemes and allows us to obtain a good balance between several objectives, e.g. accuracy, cost reduction, time saving and achieving the "best" local minimum. We present several numerical simulations to validate the different algorithms and to compare their performances.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/12796.html} }We consider a unified variational PDEs model to solve the optic flow problem for large displacements and varying illumination. Although, the energy functional is nonconvex and severely nonlinear, we show that the model offers a well suited framework to extend the efficient methods we used for small displacements. In particular, we resort to an adaptive control of the diffusion and the illumination coefficients which allows us to preserve the edges and to obtain a sparse vector field. We develop a combined space-time parallel programming strategy based on a Schwarz domain decomposition method to speed up the computations and to handle high resolution images, and the parareal algorithm, to enhance the speedup and to achieve a lowest-energy local minimum. This full parallel method gives raise to several iterative schemes and allows us to obtain a good balance between several objectives, e.g. accuracy, cost reduction, time saving and achieving the "best" local minimum. We present several numerical simulations to validate the different algorithms and to compare their performances.