189 citations · 366 across the 11 of their papers we have counts for
11 papers
Classification Filtering
Ilker Bayram
We consider a streaming signal in which each sample is linked to a latent class. We assume that multiple classifiers are available, each providing class probabilities with varying…
Interbeat Interval Filtering
Ilker Bayram
A number of inhibitory and excitatory factors regulate the beating of the heart. Consequently, the inter-beat intervals (IBIs) are not constant but vary around a mean value, even i…
Time-Series Estimation from Randomly Time-Warped Observations
İlker Bayram
We consider the problem of estimating a signal from its warped observations. Such estimation is commonly performed by altering the observations through some inverse-warping, or sol…
An Exploratory Method for Smooth/Transient Decomposition
Ilker Bayram
We consider a separation problem where the observation consists of the sum of a high amplitude smooth signal and a low amplitude transient signal. We propose a method for decomposi…
Sparsity Within and Across Overlapping Groups
İlker Bayram
Recently, penalties promoting signals that are sparse within and across groups have been proposed. In this letter, we propose a generalization that allows to encode more intricate…
Multichannel Linear Prediction for Blind Reverberant Audio Source Separation
İlker Bayram, Savaşkan Bulek
A class of methods based on multichannel linear prediction (MCLP) can achieve effective blind dereverberation of a source, when the source is observed with a microphone array. We p…
A Penalty Function Promoting Sparsity Within and Across Groups
İlker Bayram, Savaşkan Bulek
We introduce a new weakly-convex penalty function for signals with a group behavior. The penalty promotes signals with a few number of active groups, where within each group, only…
The Douglas-Rachford Algorithm for Weakly Convex Penalties
İlker Bayram, Ivan W. Selesnick
The Douglas-Rachford algorithm is widely used in sparse signal processing for minimizing a sum of two convex functions. In this paper, we consider the case where one of the functio…
On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
Ilker Bayram
We consider the iterative shrinkage/thresholding algorithm (ISTA) applied to a cost function composed of a data fidelity term and a penalty term. The penalty is non-convex but the…
Enhanced Sparsity by Non-Separable Regularization
Ivan W. Selesnick, Iker Bayram
This paper develops a convex approach for sparse one-dimensional deconvolution that improves upon L1-norm regularization, the standard convex approach. We propose a sparsity-induci…
Sparse Signal Estimation by Maximally Sparse Convex Optimization
Ivan W. Selesnick, Ilker Bayram
This paper addresses the problem of sparsity penalized least squares for applications in sparse signal processing, e.g. sparse deconvolution. This paper aims to induce sparsity mor…