← Search

Christian Jutten

11 accepted papers

2020

A Novel Pruning Approach for Bagging Ensemble Regression Based on Sparse Representation

ICASSP 2020accepted

This work aims to propose an approach for pruning a bagging ensemble regression (BER) model based on sparse representation, which we call sparse representation pruning (SRP). Firstly, a BER model with a specific number of subensembles should be trained. Then, the BER model is pruned by our sparse re…

Cited by 0SourceScholar
2020

Gradient-Based Algorithm with Spatial Regularization for Optimal Sensor Placement

ICASSP 2020accepted

In this paper, we are interested in optimal sensor placement for signal extraction. Recently, a new criterion based on output signal to noise ratio has been proposed for sensor placement. However, to solve the optimization problem, a greedy approach is used over a grid, which is not optimal. To impr…

Cited by 0SourceScholar
2020

Low Mutual and Average Coherence Dictionary Learning Using Convex Approximation

ICASSP 2020accepted

In dictionary learning, a desirable property for the dictionary is to be of low mutual and average coherences. Mutual coherence is defined as the maximum absolute correlation between distinct atoms of the dictionary, whereas the average coherence is a measure of the average correlations. In this pap…

Cited by 3SourceScholar
2019

Optimal Sensor Placement for Signal Extraction

ICASSP 2019accepted

This paper focuses on the optimal sensor placement problem with the purpose of signal extraction in an underdetermined noisy setting. Assuming prior information on the spatial gain of the measured signal and on the spatial noise correlation, we propose a sensor placement criterion based on the maxim…

Cited by 0SourceScholar
2018

Joint Independent Subspace Analysis by Coupled Block Decomposition: Non-Identifiable Cases

ICASSP 2018accepted

This paper deals with the identifiability of joint independent subspace analysis of real-valued Gaussian stationary data with uncorrelated samples. This model is not identifiable when each mixture is considered individually. Algebraically, this model amounts to coupled block decomposition of several…

Cited by 0SourceScholar
2017

Blind compensation of polynomial mixtures of Gaussian signals with application in nonlinear blind source separation

ICASSP 2017accepted

In this paper, a proof is provided to show that Gaussian signals will lose their Gaussianity if they are passed through a polynomial of an order greater than 1. This can help in blind compensation of polynomial nonlinearities on Gaussian sources by forcing the output to follow a Gaussian distributio…

Cited by 0SourceScholar
2017

Improved Local Spectral Unmixing of hyperspectral data using an algorithmic regularization path for collaborative sparse regression

ICASSP 2017accepted

Local Spectral Unmixing (LSU) methods perform the unmixing of hyperspectral data locally in regions of the image. The endmembers and their abundances in each pixel are extracted region-wise, instead of globally to mitigate spectral variability effects, which are less severe locally. However, it requ…

Cited by 0SourceScholar
2016

An alternative proof for the identifiability of independent vector analysis using second order statistics

ICASSP 2016accepted

In this paper, we present an alternative proof for characterizing the (non-) identifiability conditions of independent vector analysis (IVA). IVA extends blind source separation to several mixtures by taking into account statistical dependencies between mixtures. We focus on IVA in the presence of r…

Cited by 0SourceScholar
2015

Image interpolation using Gaussian Mixture Models with spatially constrained patch clustering

ICASSP 2015accepted

In this paper we address the problem of image interpolation using Gaussian Mixture Models (GMM) as a prior. Previous methods of image restoration with GMM have not considered spatial (geometric) distance between patches in clustering, failing to fully exploit the coherency of nearby patches. The GMM…

Cited by 0SourceScholar
2015

Real-time independent vector analysis with Student's t source prior for convolutive speech mixtures

ICASSP 2015accepted

A common approach to blind source separation is to use independent component analysis. However when dealing with realistic convolutive audio and speech mixtures, processing in the frequency domain at each frequency bin is required. As a result this introduces the permutation problem, inherent in ind…

Cited by 0SourceScholar