Robust generalized maximum correntropy criterion algorithms for active noise control
As a robust nonlinear similarity measure, the maximum correntropy criterion (MCC) has
been successfully applied to active noise control (ANC) for impulsive noise. The default …
been successfully applied to active noise control (ANC) for impulsive noise. The default …
Multi-channel linear prediction-based speech dereverberation with sparse priors
The quality of speech signals recorded in an enclosure can be severely degraded by room
reverberation. In this paper, we focus on a class of blind batch methods for speech …
reverberation. In this paper, we focus on a class of blind batch methods for speech …
Compressed sensing-speech coding scheme for mobile communications
A new source coding is proposed for secure and robust speech communications. The
method is based on the combination of compressed sensing and split-multistage vector …
method is based on the combination of compressed sensing and split-multistage vector …
New mobile communication system design for Rayleigh environments based on compressed sensing‐source coding
A new end‐to‐end communication system is proposed to increase transmission speed,
robustness, and security in order to meet the requirements of mobile systems that know an …
robustness, and security in order to meet the requirements of mobile systems that know an …
Estimating nonlinear chirp modes exploiting sparsity
The decomposition of nonlinear chirp modes is a challenging task, typically requiring prior
knowledge of the number of modes a signal contains. In this work, we present a greedy …
knowledge of the number of modes a signal contains. In this work, we present a greedy …
Sequential error concealment for video/images by sparse linear prediction
In this paper, we propose a novel sequential error concealment algorithm for video and
images based on sparse linear prediction. Block-based coding schemes in packet loss …
images based on sparse linear prediction. Block-based coding schemes in packet loss …
A branch-and-bound algorithm for quadratically-constrained sparse filter design
This paper presents an exact algorithm for sparse filter design under a quadratic constraint
on filter performance. The algorithm is based on branch-and-bound, a combinatorial …
on filter performance. The algorithm is based on branch-and-bound, a combinatorial …
Supersparse linear integer models for interpretable classification
Scoring systems are classification models that only require users to add, subtract and
multiply a few meaningful numbers to make a prediction. These models are often used …
multiply a few meaningful numbers to make a prediction. These models are often used …