1996
DOI: 10.1109/34.481542
|View full text |Cite
|
Sign up to set email alerts
|

A fast scalable algorithm for discontinuous optical flow estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
32
0

Year Published

1997
1997
2008
2008

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 46 publications
(32 citation statements)
references
References 29 publications
0
32
0
Order By: Relevance
“…Ghosal and Vanȇk [14] proposed using a smoothed aggregate restriction/prolongation operator inspired by the algebraic multigrid concept introduced by Ruge of strongly coupled nodes [29]. Although similar to the technique that we present here in the sense that a data-driven aggregation operator is proposed, an important difference between our work and [14] is that their aggregation technique will not preserve a lattice structure at coarse levels. Additionally, our method is parameterfree.…”
Section: Introductionmentioning
confidence: 80%
See 3 more Smart Citations
“…Ghosal and Vanȇk [14] proposed using a smoothed aggregate restriction/prolongation operator inspired by the algebraic multigrid concept introduced by Ruge of strongly coupled nodes [29]. Although similar to the technique that we present here in the sense that a data-driven aggregation operator is proposed, an important difference between our work and [14] is that their aggregation technique will not preserve a lattice structure at coarse levels. Additionally, our method is parameterfree.…”
Section: Introductionmentioning
confidence: 80%
“…Problems with this structure have become increasingly important in image pro-cessing applications such as segmentation [1][2][3], colorization [4], matting [5,6] and filtering [7,8]. Similar systems have also been studied in the context of visual reconstruction [12] and optical flow [14].…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Performance evaluations such as [9,35] showed that variational methods belong to the best performing techniques for computing the optic flow field. It is thus not surprising that a lot of research has been carried out in order to improve these techniques even further: These amendments include refined model assumptions with discontinuity-preserving constraints [2,28,42,62,65,73,91] or spatiotemporal regularisation [11,61,92], improved data terms with modified constraints [3,26,62,74] or nonquadratic penalisation [11,43,56,26], and efficient multigrid algorithms [15,22,39,38,78,95] for minimising these energy functionals. The goal of the present chapter is to analyse the data term and the smoothness term in detail and to survey some of our recent results on variational optic flow computation.…”
Section: Introductionmentioning
confidence: 99%