Matrix factorization techniques in machine learning, signal processing, and statistics

KL Du, MNS Swamy, ZQ Wang, WH Mow - Mathematics, 2023 - mdpi.com
Compressed sensing is an alternative to Shannon/Nyquist sampling for acquiring sparse or
compressible signals. Sparse coding represents a signal as a sparse linear combination of …

Robustness of spike deconvolution for neuronal calcium imaging

M Pachitariu, C Stringer, KD Harris - Journal of Neuroscience, 2018 - Soc Neuroscience
Calcium imaging is a powerful method to record the activity of neural populations in many
species, but inferring spike times from calcium signals is a challenging problem. We …

The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy

Q Denoyelle, V Duval, G Peyré, E Soubies - Inverse Problems, 2019 - iopscience.iop.org
This paper showcases the theoretical and numerical performance of the Sliding Frank–
Wolfe, which is a novel optimization algorithm to solve the BLASSO sparse spikes super …

Exact sparse approximation problems via mixed-integer programming: Formulations and computational performance

S Bourguignon, J Ninin, H Carfantan… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Sparse approximation addresses the problem of approximately fitting a linear model with a
solution having as few non-zero components as possible. While most sparse estimation …

Sliding-window based scale-frequency map for bird sound classification using 2d-and 3d-cnn

J Xie, M Zhu - Expert Systems with Applications, 2022 - Elsevier
Bird's call often contains distinctive information for discriminating different species. Previous
studies have investigated various features for bird sound classification. This paper proposes …

Information maximization perspective of orthogonal matching pursuit with applications to explainable ai

A Chattopadhyay, R Pilgrim… - Advances in Neural …, 2024 - proceedings.neurips.cc
Abstract Information Pursuit (IP) is a classical active testing algorithm for predicting an output
by sequentially and greedily querying the input in order of information gain. However, IP is …

Recovery of sparse signals using multiple orthogonal least squares

J Wang, P Li - IEEE Transactions on Signal Processing, 2016 - ieeexplore.ieee.org
Sparse recovery aims to reconstruct sparse signals from compressed linear measurements.
In this paper, we propose a sparse recovery algorithm called multiple orthogonal least …

Support recovery with orthogonal matching pursuit in the presence of noise

J Wang - IEEE Transactions on Signal processing, 2015 - ieeexplore.ieee.org
Support recovery of sparse signals from compressed linear measurements is a fundamental
problem in compressed sensing (CS). In this article, we study the orthogonal matching …

Optimal restricted isometry condition of normalized sampling matrices for exact sparse recovery with orthogonal least squares

J Kim, J Wang, B Shim - IEEE Transactions on Signal …, 2021 - ieeexplore.ieee.org
In this paper, we analyze the performance guarantee of the orthogonal least squares (OLS)
algorithm expressed in terms of the restricted isometry property (RIP). We show the …

Recovery conditions of sparse signals using orthogonal least squares-type algorithms

L Lu, W Xu, Y Wang, Z Tian - IEEE Transactions on Signal …, 2022 - ieeexplore.ieee.org
Orthogonal least squares (OLS)-type algorithms are efficient in reconstructing sparse
signals, which include the well-known OLS, multiple OLS (MOLS) and block OLS (BOLS). In …