2008
DOI: 10.1002/nla.576
|View full text |Cite
|
Sign up to set email alerts
|

Multigrid solution of the optical flow system using a combined diffusion‐ and curvature‐based regularizer

Abstract: Optical flow techniques are used to compute an approximate motion field in an image sequence. We apply a variational approach for the optical flow using a simple data term but introducing a combined diffusion-and curvature-based regularizer. The same data term arises in image registration problems where a deformation field between two images is computed. For optical flow problems, usually a diffusionbased regularizer should dominate, whereas for image registration a curvature-based regularizer is more appropri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(7 citation statements)
references
References 36 publications
(44 reference statements)
0
7
0
Order By: Relevance
“…This approach has proved to be very useful in the understanding of MG methods when solving nonlinear problems; see for instance Refs. [20–22, 24, 29, 30, 29, 32, 51–52] for interesting examples and discussions.…”
Section: Numerical Solution For the Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…This approach has proved to be very useful in the understanding of MG methods when solving nonlinear problems; see for instance Refs. [20–22, 24, 29, 30, 29, 32, 51–52] for interesting examples and discussions.…”
Section: Numerical Solution For the Formulationmentioning
confidence: 99%
“…For examples of successful developments in various image processing applications, refer to Refs. [20–33] where the Euler–Lagrange systems of partial differential equations (PDEs) can be of second‐ or fourth‐order. Previous work on NMG techniques for deformable image registration using free‐form or nonrigid deformations in Refs.…”
Section: Introductionmentioning
confidence: 99%
“…It is worth to notice that although the main application of LFA is to evaluate the performance of an algorithm on linear problems with constant coefficients on an infinite grid, LFA is a tool that has been used to get some insight of discrete nonlinear operators; see the works of [17,30,[32][33][34] and the references therein. In this work, we use LFA to study the fixed point methods (8), (12) and (16) and even though they have been designed to get the solution of nonlinear problems, they can be seen as linear algorithms for u i, j k + 1 since all coefficients in Algorithm 2 are constant while iterating over q.…”
Section: Local Fourier Analysismentioning
confidence: 99%
“…In order to have a simple and stable numerical scheme as noted in several works in different contexts; see e.g. [25], [32] and [35, p.56-79], σ [ν] lm is approximated by…”
Section: ) Outer Iterationmentioning
confidence: 99%