Hyperspectral Unmixing Based on Dual-Depth Sparse Probabilistic Latent Semantic Analysis

This paper presents a novel approach for spectral unmixing of remotely sensed hyperspectral data. It exploits probabilistic latent topics in order to take advantage of the semantics pervading the latent topic space when identifying spectral signatures and estimating fractional abundances from hyperspectral images. Despite the contrasted potential of topic models to uncover image semantics, they have been merely used in hyperspectral unmixing as a straightforward data decomposition process. This limits their actual capabilities to provide semantic representations of the spectral data. The proposed model, called dual-depth sparse probabilistic latent semantic analysis (DEpLSA), makes use of two different levels of topics to exploit the semantic patterns extracted from the initial spectral space in order to relieve the ill-posed nature of the unmixing problem. In other words, DEpLSA defines a first level of deep topics to capture the semantic representations of the spectra, and a second level of restricted topics to estimate endmembers and abundances over this semantic space. An experimental comparison in conducted using the two standard topic models and the seven state-of-the-art unmixing methods available in the literature. Our experiments, conducted using four different hyperspectral images, reveal that the proposed approach is able to provide competitive advantages over available unmixing approaches

Target concept learning from ambiguously labeled data

The multiple instance learning problem addresses the case where training data comes with label ambiguity, i.e., the learner has access only to inaccurately labeled data. For example, in target detection from remotely sensed hyperspectral imagery, targets are usually sub-pixel and the ground truthing of the targets according to GPS coordinates could drift across several meters. Thus the locations of the targets corresponding to the hyperspectral image are inaccurate. Training a supervised algorithm or extracting target signatures from this kind of labels is intractable. This dissertation investigates the topic target concept learning from ambiguously labeled data comprehensively; reviews and proposes several methods that either learn a set of representative or discriminative target concepts. The multiple instance hybrid estimator (MI-HE) maximizes the response of the hybrid detector under a generalized mean framework and estimates a set of discriminative target concepts. MI-HE adopts a linear mixture model and iterates between estimating a set of discriminative target and non-target signatures and solving a sparse unmixing problem. MI-HE preserves bag-level label information for each positive bag and is able to estimate a target concept that is commonly shared among positive bags. Furthermore, MI-HE has the potential to learn multiple signatures to address signature variability. After learning target concept, signature based detector could be applied for target detection. The presented algorithms were tested in many applications including simulated and real hyperspectral target detection, heartbeat characterization from ballistocardiogram signals and tree species classification from remotely sensed data. The presented algorithms were proven to be effective in learning high-quality target signatures and consistently achieved superior performance over the state-of-the-art comparison algorithms.Includes biblographical reference

Inférence bayésienne dans des problèmes inverses, myopes et aveugles en traitement du signal et des images

Les activités de recherche présentées concernent la résolution de problèmes inverses, myopes et aveugles rencontrés en traitement du signal et des images. Les méthodes de résolution privilégiées reposent sur une démarche d'inférence bayésienne. Celle-ci offre un cadre d'étude générique pour régulariser les problèmes généralement mal posés en exploitant les contraintes inhérentes aux modèles d'observation. L'estimation des paramètres d'intérêt est menée à l'aide d'algorithmes de Monte Carlo qui permettent d'explorer l'espace des solutions admissibles. Un des domaines d'application visé par ces travaux est l'imagerie hyperspectrale et, plus spécifiquement, le démélange spectral. Le second travail présenté concerne la reconstruction d'images parcimonieuses acquises par un microscope MRFM

Sparse representation based hyperspectral image compression and classification

Abstract This thesis presents a research work on applying sparse representation to lossy hyperspectral image compression and hyperspectral image classification. The proposed lossy hyperspectral image compression framework introduces two types of dictionaries distinguished by the terms sparse representation spectral dictionary (SRSD) and multi-scale spectral dictionary (MSSD), respectively. The former is learnt in the spectral domain to exploit the spectral correlations, and the latter in wavelet multi-scale spectral domain to exploit both spatial and spectral correlations in hyperspectral images. To alleviate the computational demand of dictionary learning, either a base dictionary trained offline or an update of the base dictionary is employed in the compression framework. The proposed compression method is evaluated in terms of different objective metrics, and compared to selected state-of-the-art hyperspectral image compression schemes, including JPEG 2000. The numerical results demonstrate the effectiveness and competitiveness of both SRSD and MSSD approaches. For the proposed hyperspectral image classification method, we utilize the sparse coefficients for training support vector machine (SVM) and k-nearest neighbour (kNN) classifiers. In particular, the discriminative character of the sparse coefficients is enhanced by incorporating contextual information using local mean filters. The classification performance is evaluated and compared to a number of similar or representative methods. The results show that our approach could outperform other approaches based on SVM or sparse representation. This thesis makes the following contributions. It provides a relatively thorough investigation of applying sparse representation to lossy hyperspectral image compression. Specifically, it reveals the effectiveness of sparse representation for the exploitation of spectral correlations in hyperspectral images. In addition, we have shown that the discriminative character of sparse coefficients can lead to superior performance in hyperspectral image classification.EM201

Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14)

The implicit objective of the biennial "international - Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST) is to foster collaboration between international scientific teams by disseminating ideas through both specific oral/poster presentations and free discussions. For its second edition, the iTWIST workshop took place in the medieval and picturesque town of Namur in Belgium, from Wednesday August 27th till Friday August 29th, 2014. The workshop was conveniently located in "The Arsenal" building within walking distance of both hotels and town center. iTWIST'14 has gathered about 70 international participants and has featured 9 invited talks, 10 oral presentations, and 14 posters on the following themes, all related to the theory, application and generalization of the "sparsity paradigm": Sparsity-driven data sensing and processing; Union of low dimensional subspaces; Beyond linear and convex inverse problem; Matrix/manifold/graph sensing/processing; Blind inverse problems and dictionary learning; Sparsity and computational neuroscience; Information theory, geometry and randomness; Complexity/accuracy tradeoffs in numerical methods; Sparsity? What's next?; Sparse machine learning and inference.Comment: 69 pages, 24 extended abstracts, iTWIST'14 website: http://sites.google.com/site/itwist1