Efficient Convex Optimization for Non-convex Non-smooth Image Restoration
From MaRDI portal
(Redirected from Publication:6495865)
Recommendations
- Efficient nonsmooth nonconvex optimization for image restoration and segmentation
- Non-convex and non-smooth variational decomposition for image restoration
- Simultaneous image enhancement and restoration with non-convex total variation
- Generalized nonconvex nonsmooth four-directional total variation with overlapping group sparsity for image restoration
- A fast nonconvex nonsmooth minimization method for image restoration and reconstruction
Cites work
- A ``nonconvex+nonconvex approach for image restoration with impulse noise removal
- A duality-based splitting method for ^1-TV image restoration with automatic regularization parameter choice
- A fast \(\ell_1\)-TV algorithm for image restoration
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A new nonconvex approach for image restoration with Gamma noise
- A nonconvex model with minimax concave penalty for image restoration
- A Robust Group-Sparse Representation Variational Method With Applications to Face Recognition
- A TVSCAD approach for image deblurring with impulsive noise
- Adaptive ADMM for Dictionary Learning in Convolutional Sparse Representation
- Adaptive Regularization of Some Inverse Problems in Image Analysis
- An algorithm for total variation minimization and applications
- An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
- An introduction to continuous optimization for imaging
- An introduction to total variation for image analysis
- Analysis of multi-stage convex relaxation for sparse regularization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Convex image denoising via non-convex regularization with parameter selection
- Convex non-convex image segmentation
- Exact penalty decomposition method for zero-norm minimization based on MPEC formulation
- scientific article; zbMATH DE number 4032473 (Why is no real title available?)
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- IDENT: identifying differential equations with numerical time evolution
- Image denoising using L^p-norm of mean curvature of image surface
- Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Minimization of L₁ over L₂ for sparse signal recovery with convergence guarantee
- Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- Nonconvex-TV based image restoration with impulse noise removal
- On $\ell_1$ Data Fitting and Concave Regularization for Image Recovery
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- Robust computation of linear models by convex relaxation
- Sparse Approximation via Penalty Decomposition Methods
- Sparse Signal Estimation by Maximally Sparse Convex Optimization
- Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Two-stage image segmentation based on nonconvex \(\ell_2-\ell_p\) approximation and thresholding
This page was built for publication: Efficient Convex Optimization for Non-convex Non-smooth Image Restoration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495865)
