1998
DOI: 10.1007/bfb0054752
|View full text |Cite
|
Sign up to set email alerts
|

Discrete wavelet analysis: A new framework for fast optic flow computation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

1999
1999
2011
2011

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(18 citation statements)
references
References 17 publications
0
18
0
Order By: Relevance
“…Two sequences (fig 1, fig 2) where the camera undergoes an uniform translation motion and two sequences (fig 3, fig 4) where the robot turns on itself. In each case we have to compare our results with the method proposed by Bernard [2]. This method is also based on a projection of the Brightness Change Constraint Equation (1) on a basis wavelets but it supposes the flow is locally constant on the support of this one.…”
Section: Experiments and Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Two sequences (fig 1, fig 2) where the camera undergoes an uniform translation motion and two sequences (fig 3, fig 4) where the robot turns on itself. In each case we have to compare our results with the method proposed by Bernard [2]. This method is also based on a projection of the Brightness Change Constraint Equation (1) on a basis wavelets but it supposes the flow is locally constant on the support of this one.…”
Section: Experiments and Resultsmentioning
confidence: 99%
“…and the approximation [2] show that if we replace is not large, i.e there exists M such that v < M s…”
Section: Temporal Aliasingmentioning
confidence: 95%
See 2 more Smart Citations
“…In [30], an adaptive method is designed to choose the best scales to avoid the aperture problem in estimating the local motion field. In [31], a successive approximation scheme is proposed to compute optical flow in a Laplacian pyramid structure.…”
Section: Thementioning
confidence: 99%