2006
DOI: 10.1007/11744078_14
|View full text |Cite
|
Sign up to set email alerts
|

Revisiting the Brightness Constraint: Probabilistic Formulation and Algorithms

Abstract: Abstract. In this paper we introduce a principled approach to modeling the image brightness constraint for optical flow algorithms. Using a simple noise model, we derive a probabilistic representation for optical flow. This representation subsumes existing approaches to flow modeling, provides insights into the behaviour and limitations of existing methods and leads to modified algorithms that outperform other approaches that use the brightness constraint. Based on this representation we develop algorithms for… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…One way to mitigate this problem is to add a prior (soft constraint) on the expected range of motions (Simoncelli et al 1991, Govindu 2006. This can be accomplished by adding a small value to the diagonal of A, which essentially biases the solution towards smaller ∆u values that still (mostly) minimize the squared error.…”
mentioning
confidence: 99%
“…One way to mitigate this problem is to add a prior (soft constraint) on the expected range of motions (Simoncelli et al 1991, Govindu 2006. This can be accomplished by adding a small value to the diagonal of A, which essentially biases the solution towards smaller ∆u values that still (mostly) minimize the squared error.…”
mentioning
confidence: 99%
“…However, many of these works are based on simplifying assumptions such as locally constant flow or a Gaussian distribution of brightness constancy errors. In [19,26,44], probabilistic approaches are applied to obtain improved models of optical flow. In contrast to our work, these methods do not apply a fully probabilistic approach, but fall back to a maximum aposteriori (MAP) estimate, i.e.…”
Section: Related Workmentioning
confidence: 99%
“…Optical flow methods are classified into local methods, such as the Lucas/Kanade technique (Lucas and Kanade, 1981), and into global techniques as the Horn/Schunck approach (Horn and Schunck, 1981). For general information on optical flow algorithms, the reader is referred to the following references, which include performance evaluations of different optical flow techniques (Barron et al, 1994;Govindu, 2006), first applications of optical flow techniques to fluid flows (Corpetti et al, 2006;Liu and Shen, 2008) and a comparison between optical flow and cross-correlation methods (Liu et al, 2015).…”
Section: Introductionmentioning
confidence: 99%