On-The-Fly Approximation of Multivariate Total Variation Minimization
From MaRDI portal
Abstract: In the context of change-point detection, addressed by Total Variation minimization strategies, an efficient on-the-fly algorithm has been designed leading to exact solutions for univariate data. In this contribution, an extension of such an on-the-fly strategy to multivariate data is investigated. The proposed algorithm relies on the local validation of the Karush-Kuhn-Tucker conditions on the dual problem. Showing that the non-local nature of the multivariate setting precludes to obtain an exact on-the-fly solution, we devise an on-the-fly algorithm delivering an approximate solution, whose quality is controlled by a practitioner-tunable parameter, acting as a trade-off between quality and computational cost. Performance assessment shows that high quality solutions are obtained on-the-fly while benefiting of computational costs several orders of magnitude lower than standard iterative procedures. The proposed algorithm thus provides practitioners with an efficient multivariate change-point detection on-the-fly procedure.
Recommendations
- A coordinate descent method for total variation minimization
- An algorithm for total variation minimization and applications
- Efficient Minimization Method for a Generalized Total Variation Functional
- Fast optimization for multichannel total variation minimization with non-quadratic fidelity
- On a weighted total variation minimization problem
- Modular proximal optimization for multidimensional total-variation regularization
- Total variation minimization with an \(H^{-1}\) constraint
- Global Total Variation Minimization
- A note on the guarantees of total variation minimization
Cited in
(2)
This page was built for publication: On-The-Fly Approximation of Multivariate Total Variation Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4618330)