activity
20112017
most citedSimultaneously sparse and low-rank abundance matrix estimation for hyperspectral image unmixing

137 citations · 283 across the 11 of their papers we have counts for

collaborators

11 papers

cs.LG2017★ 3 cited

Alternating Iteratively Reweighted Minimization Algorithms for Low-Rank Matrix Factorization

Paris V. Giampouras, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas

Nowadays, the availability of large-scale data in disparate application domains urges the deployment of sophisticated tools for extracting valuable knowledge out of this huge bulk…

cs.CV2017

Low-rank and Sparse NMF for Joint Endmembers' Number Estimation and Blind Unmixing of Hyperspectral Images

Paris V. Giampouras, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas

Estimation of the number of endmembers existing in a scene constitutes a critical task in the hyperspectral unmixing process. The accuracy of this estimate plays a crucial role in…

stat.ML2016

Online Low-Rank Subspace Learning from Incomplete Data: A Bayesian View

Paris V. Giampouras, Athanasios A. Rontogiannis, Konstantinos E. Themelis +1

Extracting the underlying low-dimensional space where high-dimensional signals often reside has long been at the center of numerous algorithms in the signal processing and machine…

cs.CV2015

Sparsity-aware Possibilistic Clustering Algorithms

Spyridoula D. Xenaki, Konstantinos D. Koutroumbas, Athanasios A. Rontogiannis

In this paper two novel possibilistic clustering algorithms are presented, which utilize the concept of sparsity. The first one, called sparse possibilistic c-means, exploits spars…

cs.CV2015★ 1 cited

On the convergence of the sparse possibilistic c-means algorithm

Spyridoula D. Xenaki, Konstantinos D. Koutroumbas, Athanasios A. Rontogiannis

In this paper, a convergence proof for the recently proposed sparse possibilistic c-means (SPCM) algorithm is provided, utilizing the celebrated Zangwill convergence theorem. It is…

cs.CV2015★ 137 cited

Simultaneously sparse and low-rank abundance matrix estimation for hyperspectral image unmixing

Paris Giampouras, Konstantinos Themelis, Athanasios Rontogiannis +1

In a plethora of applications dealing with inverse problems, e.g. in image processing, social networks, compressive sensing, biological data processing etc., the signal of interest…

cs.CV2014★ 63 cited

A Novel Adaptive Possibilistic Clustering Algorithm

Spyridoula D. Xenaki, Konstantinos D. Koutroumbas, Athanasios A. Rontogiannis

In this paper a novel possibilistic c-means clustering algorithm, called Adaptive Possibilistic c-means, is presented. Its main feature is that {\it all} its parameters, after thei…

stat.ME2014

Semisupervised hyperspectral image unmixing using a variational Bayes algorithm

Konstantinos E. Themelis, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas

This technical report presents a variational Bayes algorithm for semisupervised hyperspectral image unmixing. The presented Bayesian model employs a heavy tailed, nonnegatively tru…

stat.ML2014★ 58 cited

A variational Bayes framework for sparse adaptive estimation

Konstantinos E. Themelis, Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas

Recently, a number of mostly -norm regularized least squares type deterministic algorithms have been proposed to address the problem of \emph{sparse} adaptive signal estima…

stat.CO2013★ 1 cited

Approximating the mean of a truncated normal distribution

Konstantinos D. Koutroumbas, Konstantinos E. Themelis, Athanasios A. Rontogiannis

A non trivial problem that arises in several applications is the estimation of the mean of a truncated normal distribution. In this paper, an iterative deterministic scheme for app…

astro-ph.IM2011★ 20 cited

On the unmixing of MEx/OMEGA hyperspectral data

Konstantinos E. Themelis, Frédéric Schmidt, Olga Sykioti +3

This article presents a comparative study of three different types of estimators used for supervised linear unmixing of two MEx/OMEGA hyperspectral cubes. The algorithms take into…