Results 1 - 10
of
425
DTAM: Dense Tracking and Mapping in Real-Time
"... DTAM is a system for real-time camera tracking and reconstruction which relies not on feature extraction but dense, every pixel methods. As a single hand-held RGB camera flies over a static scene, we estimate detailed textured depth maps at selected keyframes to produce a surface patchwork with mill ..."
Abstract
-
Cited by 128 (5 self)
- Add to MetaCart
(Show Context)
DTAM is a system for real-time camera tracking and reconstruction which relies not on feature extraction but dense, every pixel methods. As a single hand-held RGB camera flies over a static scene, we estimate detailed textured depth maps at selected keyframes to produce a surface patchwork with millions of vertices. We use the hundreds of images available in a video stream to improve the quality of a simple photometric data term, and minimise a global spatially regularised energy functional in a novel non-convex optimisation framework. Interleaved, we track the camera’s 6DOF motion precisely by frame-rate whole image alignment against the entire dense model. Our algorithms are highly parallelisable throughout and DTAM achieves realtime performance using current commodity GPU hardware. We demonstrate that a dense model permits superior tracking performance under rapid motion compared to a state of the art method using features; and also show the additional usefulness of the dense model for real-time scene interaction in a physics-enhanced augmented reality application. 1.
A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
, 2013
"... We propose a new first-order splitting algorithm for solving jointly the primal and dual formulations of large-scale convex minimization problems involving the sum of a smooth function with Lipschitzian gradient, a nonsmooth proximable function, and linear composite functions. This is a full splitti ..."
Abstract
-
Cited by 60 (10 self)
- Add to MetaCart
(Show Context)
We propose a new first-order splitting algorithm for solving jointly the primal and dual formulations of large-scale convex minimization problems involving the sum of a smooth function with Lipschitzian gradient, a nonsmooth proximable function, and linear composite functions. This is a full splitting approach, in the sense that the gradient and the linear operators involved are applied explicitly without any inversion, while the nonsmooth functions are processed individually via their proximity operators. This work brings together and notably extends several classical splitting schemes, like the forward–backward and Douglas–Rachford methods, as well as the recent primal–dual method of Chambolle and Pock designed for problems with linear composite terms.
Real-time minimization of the piecewise smooth Mumford-Shah functional
- in Proceedings of the European Conference on Computer Vision (ECCV), 2014
"... Abstract. We propose an algorithm for eciently minimizing the piece-wise smooth Mumford-Shah functional. The algorithm is based on an extension of a recent primal-dual algorithm from convex to non-convex optimization problems. The key idea is to rewrite the proximal operator in the primal-dual algor ..."
Abstract
-
Cited by 36 (26 self)
- Add to MetaCart
Abstract. We propose an algorithm for eciently minimizing the piece-wise smooth Mumford-Shah functional. The algorithm is based on an extension of a recent primal-dual algorithm from convex to non-convex optimization problems. The key idea is to rewrite the proximal operator in the primal-dual algorithm using Moreau’s identity. The resulting al-gorithm computes piecewise smooth approximations of color images at 15-20 frames per second at VGA resolution using GPU acceleration. Compared to convex relaxation approaches [18], it is orders of mag-nitude faster and does not require a discretization of color values. In contrast to the popular Ambrosio-Tortorelli approach [2], it naturally combines piecewise smooth and piecewise constant approximations, it does not require an epsilon-approximation and it is not based on an alternation scheme. The achieved energies are in practice at most 5% o ↵ the optimal value for one-dimensional problems. Numerous experi-ments demonstrate that the proposed algorithm is well-suited to perform discontinuity-preserving smoothing and real-time video cartooning.
Iteration-complexity of block-decomposition algorithms and the alternating minimization augmented Lagrangian method
, 2010
"... In this paper, we consider the monotone inclusion problem consisting of the sum of a continuous monotone map and a point-to-set maximal monotone operator with a separable two-block structure and introduce a framework of block-decomposition prox-type algorithms for solving it which allows for each on ..."
Abstract
-
Cited by 29 (2 self)
- Add to MetaCart
In this paper, we consider the monotone inclusion problem consisting of the sum of a continuous monotone map and a point-to-set maximal monotone operator with a separable two-block structure and introduce a framework of block-decomposition prox-type algorithms for solving it which allows for each one of the single-block proximal subproblems to be solved in an approximate sense. Moreover, by showing that any method in this framework is also a special instance of the hybrid proximal extragradient (HPE) method introduced by Solodov and Svaiter, we derive corresponding convergence rate results. We also describe some instances of the framework based on specific and inexpensive schemes for solving the singleblock proximal subproblems. Finally, we consider some applications of our methodology to: i) propose new algorithms for the monotone inclusion problem consisting of the sum of two maximal monotone operators, and; ii) study the complexity of the classical alternating minimization augmented Lagrangian method for a class of linearly constrained convex programming problems with proper closed convex objective functions.
X.: Convergence analysis of primal-dual algorithms for total variation image restoration
, 2010
"... Abstract. Recently, some attractive primal-dual algorithms have been proposed for solving a saddle-point problem, with particular applications in the area of total variation (TV) image restoration. This paper focuses on the convergence analysis of existing primal-dual algorithms and shows that the i ..."
Abstract
-
Cited by 29 (2 self)
- Add to MetaCart
(Show Context)
Abstract. Recently, some attractive primal-dual algorithms have been proposed for solving a saddle-point problem, with particular applications in the area of total variation (TV) image restoration. This paper focuses on the convergence analysis of existing primal-dual algorithms and shows that the involved parameters of those primal-dual algorithms (including the step sizes) can be significantly enlarged if some simple correction steps are supplemented. As a result, we present some primal-dual-based contraction methods for solving the saddle-point problem. These contraction methods are in the prediction-correction fashion in the sense that the predictor is generated by a primal-dual method and it is corrected by some simple correction step at each iteration. In addition, based on the context of contraction type methods, we provide a novel theoretical framework for analyzing the convergence of primal-dual algorithms which simplifies existing convergence analysis substantially.
Distributed basis pursuit
- IEEE Trans. Sig. Proc
, 2012
"... Abstract—We propose a distributed algorithm for solving the optimization problem Basis Pursuit (BP). BP finds the least-norm solution of the underdetermined linear system and is used, for example, in compressed sensing for reconstruction. Our algorithm solves BP on a distributed platform such as a s ..."
Abstract
-
Cited by 28 (7 self)
- Add to MetaCart
(Show Context)
Abstract—We propose a distributed algorithm for solving the optimization problem Basis Pursuit (BP). BP finds the least-norm solution of the underdetermined linear system and is used, for example, in compressed sensing for reconstruction. Our algorithm solves BP on a distributed platform such as a sensor network, and is designed to minimize the communication between nodes. The algorithm only requires the network to be connected, has no notion of a central processing node, and no node has access to the entire matrix at any time. We consider two scenarios in which either the columns or the rows of are distributed among the compute nodes. Our algorithm, named D-ADMM, is a decentralized implementation of the alternating direction method of multipliers. We show through numerical simulation that our algorithm requires considerably less communications between the nodes than the state-of-the-art algorithms. Index Terms—Augmented Lagrangian, basis pursuit (BP), distributed optimization, sensor networks.
Continuous Multiclass Labeling Approaches and Algorithms
- SIAM J. Imag. Sci
, 2011
"... We study convex relaxations of the image labeling problem on a con-tinuous domain with regularizers based on metric interaction potentials. The generic framework ensures existence of minimizers and covers a wide range of relaxations of the originally combinatorial problem. We focus on two specific r ..."
Abstract
-
Cited by 27 (4 self)
- Add to MetaCart
(Show Context)
We study convex relaxations of the image labeling problem on a con-tinuous domain with regularizers based on metric interaction potentials. The generic framework ensures existence of minimizers and covers a wide range of relaxations of the originally combinatorial problem. We focus on two specific relaxations that differ in flexibility and simplicity – one can be used to tightly relax any metric interaction potential, while the other one only covers Euclidean metrics but requires less computational effort. For solving the nonsmooth discretized problem, we propose a globally conver-gent Douglas-Rachford scheme, and show that a sequence of dual iterates can be recovered in order to provide a posteriori optimality bounds. In a quantitative comparison to two other first-order methods, the approach shows competitive performance on synthetical and real-world images. By combining the method with an improved binarization technique for non-standard potentials, we were able to routinely recover discrete solutions within 1%–5 % of the global optimum for the combinatorial image labeling problem. 1 Problem Formulation The multi-class image labeling problem consists in finding, for each pixel x in the image domain Ω ⊆ Rd, a label `(x) ∈ {1,..., l} which assigns one of l class labels to x so that the labeling function ` adheres to some local data fidelity as well as nonlocal spatial coherency constraints. This problem class occurs in many applications, such as segmentation, mul-tiview reconstruction, stitching, and inpainting [PCF06]. We consider the vari-ational formulation inf `:Ω→{1,...,l} f(`), f(`):= Ω s(x, `(x))dx ︸ ︷ ︷ ︸ data term + J(`). ︸ ︷ ︷ ︸ regularizer
A convex approach to minimal partitions
- J. IMAGING SCI
, 2012
"... We describe a convex relaxation for a family of problems of minimal perimeter partitions. The minimization of the relaxed problem can be tackled numerically, we describe an algorithm and show some results. In most cases, our relaxed problem finds a correct numerical approximation of the optimal solu ..."
Abstract
-
Cited by 24 (9 self)
- Add to MetaCart
(Show Context)
We describe a convex relaxation for a family of problems of minimal perimeter partitions. The minimization of the relaxed problem can be tackled numerically, we describe an algorithm and show some results. In most cases, our relaxed problem finds a correct numerical approximation of the optimal solution: we give some arguments to explain why it should be so, and also discuss some situation where it fails.
Parallel proximal algorithm for image restoration using hybrid regularization
- IEEE Transactions on Image Processing
, 2011
"... Regularization approaches have demonstrated their effectiveness for solving ill-posed problems. However, in the context of variational restoration methods, a challenging question remains, namely how to find a good regularizer. While total variation introduces staircase effects, wavelet domain regula ..."
Abstract
-
Cited by 24 (7 self)
- Add to MetaCart
(Show Context)
Regularization approaches have demonstrated their effectiveness for solving ill-posed problems. However, in the context of variational restoration methods, a challenging question remains, namely how to find a good regularizer. While total variation introduces staircase effects, wavelet domain regularization brings other artefacts, e.g. ringing. However, a trade-off can be made by introducing a hybrid regularization including several terms non necessarily acting in the same domain (e.g. spatial and wavelet transform domains). While this approachwas shown to provide good results for solving deconvolution problems in the presence of additive Gaussian noise, an important issue is to efficiently deal with this hybrid regularization for more general noise models. To solve this problem, we adopt a convex optimization framework where the criterion to be minimized is split in the sum of more than two terms. For spatial domain regularization, isotropic or anisotropic total variation definitions using various gradient filters are considered. An accelerated version of the Parallel Proximal Algorithm is proposed to perform the minimization. Some difficulties in the computation of the proximity operators involved in this algorithm are also addressed in this paper. Numerical experiments performed in the context of Poisson data recovery, show the good behaviour of the algorithm as well as promising results concerning the use of hybrid regularization techniques.
Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts
- In In Advances in Neural Information Processing Systems (NIPS
"... Spectral clustering is based on the spectral relaxation of the normalized/ratio graph cut criterion. While the spectral relaxation is known to be loose, it has been shown recently that a non-linear eigenproblem yields a tight relaxation of the Cheeger cut. In this paper, we extend this result consid ..."
Abstract
-
Cited by 24 (7 self)
- Add to MetaCart
(Show Context)
Spectral clustering is based on the spectral relaxation of the normalized/ratio graph cut criterion. While the spectral relaxation is known to be loose, it has been shown recently that a non-linear eigenproblem yields a tight relaxation of the Cheeger cut. In this paper, we extend this result considerably by providing a characterization of all balanced graph cuts which allow for a tight relaxation. Although the resulting optimization problems are non-convex and non-smooth, we provide an efficient first-order scheme which scales to large graphs. Moreover, our approach comes with the quality guarantee that given any partition as initialization the algorithm either outputs a better partition or it stops immediately. 1
