Practical, Unified, Motion and Missing Data Treatment in Degraded Video

By Antonin Chambolle. Journal of Mathematical Imaging and Vision, 2004

320 citations recorded by the source corpus.

Subfields: Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/4a76beb9e86d233b2e544a56e6f4e92417f25c47

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

Citations in the corpus

Image Decomposition into a Bounded Variation Component and an Oscillating Component (2005, methodology): “In [ 3 ] is given a sufficient condition ensuring the convergence of the algorithm:”
Image Recovery via Nonlocal Operators (2010, methodology): “There are many fast methods to minimize (4 )s uch as [ 5 , 8, 13, 14].”
Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems (2009, methodology): “The literature on numerical methods for solving (1.1) abounds and include for example methods based on: PDE and xed point techniques, smoothing approximation methods, primal-dual Newton-based methods, dual methods, primal-dual active set methods, interior point algorithms and second-order cone progr”
Total Variation Minimization and a Class of Binary MRF Models (2005, methodology): “We will compare the two algorithms described in sections 3.3 and 3.4 to the algorithm introduced in [ 9 ], for minimizing (2).”
Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction (2010, methodology): “where the right-most term enforces u v for suciently small mization with respect to u corresponds to solving the ROF model, which is done using a gradient projection method [ 12 , 16, 4], and the minimization for v can be solved using an explicit formula.”
Structure-Texture Image Decomposition—Modeling, Algorithms, and Parameter Selection (2006, methodology): “…= 1, . . . , N} (15) This problem can be solved by a fixed point method: p0 = 0 and pn+1i, j = pni, j + τ (∇(div(pn) − f/λ))i, j 1 + τ |(∇(div(pn) − f/λ))i, j | (16) In Chambolle (2004) is given a sufficient condition ensuring the convergence of the algorithm: it is shown that as long as τ ≤ 1/8,…”
Space-Time Completion of Video (2007, methodology): “In [ 19 ], a method has been proposed for employing spatiotemporal information to correct scratches and noise in poorquality video sequences.”
Sparse Reconstruction by Separable Approximation (2008, background): “This function is not separable in the sense of (8) or (9), though it is the sum of terms that each involve only a few components of . The subproblem (5) has the form of an image denoising problem, for which efficient algorithms are known (see, for example, [ 12 ], [20], [38], and [45]).”
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging (2011, background): “• PGD: O(1/N) projected (sub)gradient descent on the dual ROF problem (66 )[ 2, 7]. • CFP: Chambolle’s fixed-point algorithm proposed in [ 6 ], on the dual ROF problem (66).”