Results 1 - 10
of
39
A douglas-Rachford splitting approach to nonsmooth convex variational signal recovery
- IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING
, 2007
"... Under consideration is the large body of signal recovery problems that can be formulated as the problem of minimizing the sum of two (not necessarily smooth) lower semicontinuous convex functions in a real Hilbert space. This generic problem is analyzed and a decomposition method is proposed to so ..."
Abstract
-
Cited by 86 (22 self)
- Add to MetaCart
(Show Context)
Under consideration is the large body of signal recovery problems that can be formulated as the problem of minimizing the sum of two (not necessarily smooth) lower semicontinuous convex functions in a real Hilbert space. This generic problem is analyzed and a decomposition method is proposed to solve it. The convergence of the method, which is based on the Douglas-Rachford algorithm for monotone operator-splitting, is obtained under general conditions. Applications to non-Gaussian image denoising in a tight frame are also demonstrated.
Joint Bayesian Endmember Extraction and Linear Unmixing for Hyperspectral Imagery
"... Abstract—This paper studies a fully Bayesian algorithm for endmember extraction and abundance estimation for hyperspectral imagery. Each pixel of the hyperspectral image is decomposed as a linear combination of pure endmember spectra following the linear mixing model. The estimation of the unknown e ..."
Abstract
-
Cited by 67 (29 self)
- Add to MetaCart
(Show Context)
Abstract—This paper studies a fully Bayesian algorithm for endmember extraction and abundance estimation for hyperspectral imagery. Each pixel of the hyperspectral image is decomposed as a linear combination of pure endmember spectra following the linear mixing model. The estimation of the unknown endmember spectra is conducted in a unified manner by generating the posterior distribution of abundances and endmember parameters under a hierarchical Bayesian model. This model assumes conjugate prior distributions for these parameters, accounts for nonnegativity and fulladditivity constraints, and exploits the fact that the endmember proportions lie on a lower dimensional simplex. A Gibbs sampler is proposed to overcome the complexity of evaluating the resulting posterior distribution. This sampler generates samples distributed according to the posterior distribution and estimates the unknown parameters using these generated samples. The accuracy of the joint Bayesian estimator is illustrated by simulations conducted on synthetic and real AVIRIS images. Index Terms—Bayesian inference, endmember extraction, hyperspectral imagery, linear spectral unmixing, MCMC methods. I.
Semi-supervised linear spectral unmixing using a hierarchical Bayesian model for hyperspectral imagery
, 2008
"... This paper proposes a hierarchical Bayesian model that can be used for semi-supervised hyperspectral image unmixing. The model assumes that the pixel reflectances result from linear combinations of pure component spectra contaminated by an additive Gaussian noise. The abundance parameters appearing ..."
Abstract
-
Cited by 50 (25 self)
- Add to MetaCart
(Show Context)
This paper proposes a hierarchical Bayesian model that can be used for semi-supervised hyperspectral image unmixing. The model assumes that the pixel reflectances result from linear combinations of pure component spectra contaminated by an additive Gaussian noise. The abundance parameters appearing in this model satisfy positivity and additivity constraints. These constraints are naturally expressed in a Bayesian context by using appropriate abundance prior distributions. The posterior distributions of the unknown model parameters are then derived. A Gibbs sampler allows one to draw samples distributed according to the posteriors of interest and to estimate the unknown abundances. An extension of the algorithm is finally studied for mixtures with unknown numbers of spectral components belonging to a know library. The performance of the different unmixing strategies is evaluated via simulations conducted on synthetic and real data.
Nonlinear unmixing of hyperspectral images using a generalized bilinear model
- IEEE Trans. Geosci. and Remote Sensing
"... Nonlinear models have recently shown interesting properties for spectral unmixing. This paper considers a generalized bilinear model recently introduced for unmixing hyperspectral images. Different algorithms are studied to estimate the parameters of this bilinear model. The positivity and sum-to-on ..."
Abstract
-
Cited by 41 (21 self)
- Add to MetaCart
Nonlinear models have recently shown interesting properties for spectral unmixing. This paper considers a generalized bilinear model recently introduced for unmixing hyperspectral images. Different algorithms are studied to estimate the parameters of this bilinear model. The positivity and sum-to-one constraints for the abundances are ensured by the proposed algorithms. The performance of the resulting unmixing strategy is evaluated via simulations conducted on synthetic and real data. Index Terms — hyperspectral imagery, spectral unmixing, bilinear model, Bayesian inference, MCMC methods, gradient descent algorithm, least square algorithm. 1.
Hyperspectral Remote Sensing Data Analysis and Future Challenges
"... Abstract—Hyperspectral remote sen-sing ..."
(Show Context)
Enhancing hyperspectral image unmixing with spatial correlations
, 2011
"... This paper describes a new algorithm for hyperspectral image unmixing. Most unmixing algorithms proposed in the literature do not take into account the possible spatial correlations between the pixels. In this paper, a Bayesian model is introduced to exploit these correlations. The image to be unmi ..."
Abstract
-
Cited by 23 (13 self)
- Add to MetaCart
This paper describes a new algorithm for hyperspectral image unmixing. Most unmixing algorithms proposed in the literature do not take into account the possible spatial correlations between the pixels. In this paper, a Bayesian model is introduced to exploit these correlations. The image to be unmixed is assumed to be partitioned into regions (or classes) where the statistical properties of the abundance coefficients are homogeneous. A Markov random field, is then proposed to model the spatial dependencies between the pixels within any class. Conditionally upon a given class, each pixel is modeled by using the classical linear mixing model with additive white Gaussian noise. For this model, the posterior distributions of the unknown parameters and hyperparameters allow the parameters of interest to be inferred. These parameters include the abundances for each pixel, the means and variances of the abundances for each class, as well as a classification map indicating the classes of all pixels in the image. To overcome the complexity of the posterior distribution, we consider a Markov chain Monte Carlo method that generates samples asymptotically distributed according to the posterior. The generated samples are then used for parameter and hyperparameter estimation. The accuracy of the proposed algorithms is illustrated on synthetic and real data.
SUPER RESOLUTION BASED ON FAST REGISTRATION AND MAXIMUM A POSTERIORI RECONSTRUCTION
"... In this paper we propose a maximum a posteriori (MAP) framework for the super resolution problem, i.e. reconstructing high-resolution images from shifted, rotated, low-resolution degraded observations. The main contributions of this work are two; first, the use of a new locally adaptive edge preserv ..."
Abstract
-
Cited by 15 (4 self)
- Add to MetaCart
(Show Context)
In this paper we propose a maximum a posteriori (MAP) framework for the super resolution problem, i.e. reconstructing high-resolution images from shifted, rotated, low-resolution degraded observations. The main contributions of this work are two; first, the use of a new locally adaptive edge preserving prior for the super resolution problem. Second an efficient two-step reconstruction methodology that includes first an initial registration using only the low resolution degraded observations. This is followed by a fast iterative algorithm implemented in the discrete Fourier transform domain in which the restoration, interpolation and the registration subtasks of this problem are preformed simultaneously. We present examples with both synthetic and real data that demonstrate the advantages of the proposed framework.
Variational Posterior Distribution Approximation in Bayesian Super Resolution Reconstruction of Multispectral Images
, 2007
"... In this paper we present a super resolution Bayesian methodology for pansharpening of multispectral images. By following the hierarchical Bayesian framework, and by applying variational methods to approximate probability distributions this methodology is able to: a) incorporate prior knowledge on th ..."
Abstract
-
Cited by 11 (6 self)
- Add to MetaCart
In this paper we present a super resolution Bayesian methodology for pansharpening of multispectral images. By following the hierarchical Bayesian framework, and by applying variational methods to approximate probability distributions this methodology is able to: a) incorporate prior knowledge on the expected characteristics of the multispectral images, b) use the sensor characteristics to model the observation process of both panchromatic and multispectral images, c) include information on the unknown parameters in the model in the form of hyperprior distributions, and d) estimate the parameters of the hyperprior distributions on the unknown parameters together with the unknown parameters, and the high resolution multispectral image. Using real data, the pansharpened multispectral images are compared with the images obtained by other parsharpening methods and their quality is assessed both qualitatively and quantitatively.
A Total Variation Regularization Based Super-Resolution Reconstruction Algorithm for Digital Video
, 2007
"... Super-resolution (SR) reconstruction technique is capable of producing a high-resolution image from a sequence of low-resolution images. In this paper, we study an efficient SR algorithm for digital video. To effectively deal with the intractable problems in SR video reconstruction, such as inevitab ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
Super-resolution (SR) reconstruction technique is capable of producing a high-resolution image from a sequence of low-resolution images. In this paper, we study an efficient SR algorithm for digital video. To effectively deal with the intractable problems in SR video reconstruction, such as inevitable motion estimation errors, noise, blurring, missing regions, and compression artifacts, the total variation (TV) regularization is employed in the reconstruction model. We use the fixed-point iteration method and preconditioning techniques to efficiently solve the associated nonlinear Euler-Lagrange equations of the corresponding variational problem in SR. The proposed algorithm has been tested in several cases of motion and degradation. It is also compared with the Laplacian regularization-based SR algorithm and other TV-based SR algorithms. Experimental results are presented to illustrate the effectiveness of the proposed algorithm.
