Convex Multilabel Segmentation with Shearlet Regularization
نویسندگان
چکیده
Segmentation plays an important role in many preprocessing stages in image processing. Recently, convex relaxation methods for image multi-labeling were proposed in the literature. Often these models involve the total variation (TV) semi-norm as regularizing term. However, it is well-known that the TV functional is not optimal for the segmentation of textured regions. In recent years directional representation systems were proposed to cope with curved singularities in images. In particular, curvelets and shearlets provide an optimally sparse approximation in the class of piecewise smooth functions with C singularity boundaries. In this paper, we show that the discrete shearlet transform is suited as regularizer for the segmentation of curved structures. To this end, we have implemented a translation invariant finite discrete shearlet transform based on the FFT. We describe how the shearlet transform can be incorporated within the multi-label segmentation model and show how to find a minimizer of the corresponding functional by applying an alternating direction method of multipliers. Here the Parseval frame property of our shearlets come into the play. We demonstrate by numerical example that the shearlet regularized model can better segment curved textures than the TV regularized one and that the method can also cope with regularizers obtained from nonlocal means.
منابع مشابه
Convex multiclass segmentation with shearlet regularization
Segmentation plays an important role in many preprocessing stages in image processing. Recently, convex relaxation methods for image multi-labeling were proposed in the literature. Often these models involve the total variation (TV) semi-norm as regularizing term. However, it is well-known that the TV functional is not optimal for the segmentation of textured regions. In recent years directiona...
متن کاملA Narrow Band Method for the Convex Formulation of Discrete Multilabel Problems
We study a narrow band type algorithm to solve a discrete formulation of the convex relaxation of energy functionals with total variation regularization and non convex data terms. We prove that this algorithm converges to a local minimum of the original non linear optimization problem. We illustrate the algorithm with experiments for disparity computation in stereo and a multi-label segmentatio...
متن کاملCo-Sparse Textural Similarity for Image Segmentation
We propose an algorithm for segmenting natural images based on texture and color information, which leverages the co-sparse analysis model for image segmentation within a convex multilabel optimization framework. As a key ingredient of this method, we introduce a novel textural similarity measure, which builds upon the co-sparse representation of image patches. We propose a Bayesian approach to...
متن کاملMLSLR: Multilabel Learning via Sparse Logistic Regression
Multilabel learning, an emerging topic in machine learning, has received increasing attention in recent years. However, how to effectively tackle high-dimensional multilabel data, which are ubiquitous in real-world applications, is still an open issue in multilabel learning. Although many efforts have been made in variable selection for traditional data, little work concerns variable selection ...
متن کاملImage Reconstruction from Undersampled Fourier Data Using the Polynomial Annihilation Transform
Fourier samples are collected in a variety of applications including magnetic resonance imaging (MRI) and synthetic aperture radar (SAR). The data are typically under-sampled and noisy. In recent years, l regularization has received considerable attention in designing image reconstruction algorithms from undersampled and noisy Fourier data. The underlying image is assumed to have some sparsity ...
متن کامل