2012
DOI: 10.1109/tcsvt.2012.2202070
|View full text |Cite
|
Sign up to set email alerts
|

Robust Local Optical Flow for Feature Tracking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
84
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 116 publications
(84 citation statements)
references
References 24 publications
0
84
0
Order By: Relevance
“…Despite the limitations of the quadratic penalty, this approach has become very popular for its implementation simplicity, low computational cost and available code in the OpenCV library [36,41]. However, robust estimation is often advocated [27,32,76,193,215] as mentioned in Section 3, especially for polynomial models, to deal with the frequent case of multiple motions in the estimation domain. Among the variety of optimization methods used in case of robust penalty function, the Iterative Reweighted Least Squares (IRLS) [119] and gradient descent approaches have mostly been used.…”
Section: Optimizationmentioning
confidence: 99%
See 3 more Smart Citations
“…Despite the limitations of the quadratic penalty, this approach has become very popular for its implementation simplicity, low computational cost and available code in the OpenCV library [36,41]. However, robust estimation is often advocated [27,32,76,193,215] as mentioned in Section 3, especially for polynomial models, to deal with the frequent case of multiple motions in the estimation domain. Among the variety of optimization methods used in case of robust penalty function, the Iterative Reweighted Least Squares (IRLS) [119] and gradient descent approaches have mostly been used.…”
Section: Optimizationmentioning
confidence: 99%
“…Among the variety of optimization methods used in case of robust penalty function, the Iterative Reweighted Least Squares (IRLS) [119] and gradient descent approaches have mostly been used. IRLS proceeds by successive optimizations of quadratic problems weighted by a function of the current estimate and is implemented in the Motion2D software [193,215] with. Gradient descent approaches are often coupled with Graduated Non-Convexity (GNC) [27,33] to cope with non-convexity of (19).…”
Section: Optimizationmentioning
confidence: 99%
See 2 more Smart Citations
“…2 shows an example for the segmented image where each colour represents a homogeneous region, our assumption is that regions' discontinuity is the motion discontinuity. So that, rather than estimating optical flow for each pixel as in [23,24,25] or estimation a single optical flow for each block by assuming that all pixels in a certain block [26] have the same motion, we assume that motion of all pixels in each homogeneous region is the same. Therefore, we suggest modifying Eqs.…”
Section: B Segmentation-based Horn-schunck Algorithmmentioning
confidence: 99%