English
Related papers

Related papers: Low-rankness of Complex-valued Spectrogram and Its…

200 papers

The goal of this paper is to develop a novel numerical method for efficient multiplicative noise removal. The nonlocal self-similarity of natural images implies that the matrices formed by their nonlocal similar patches are low-rank. By…

Optimization and Control · Mathematics 2020-02-19 Xiaoxia Liu , Jian Lu , Lixin Shen , Chen Xu , Yuesheng Xu

Low-rank matrix factorizations are a class of linear models widely used in various fields such as machine learning, signal processing, and data analysis. These models approximate a matrix as the product of two smaller matrices, where the…

Machine Learning · Computer Science 2024-12-10 Olivier Vu Thanh

We solve a weakly supervised regression problem. Under "weakly" we understand that for some training points the labels are known, for some unknown, and for others uncertain due to the presence of random noise or other reasons such as lack…

Machine Learning · Computer Science 2021-04-15 Vladimir Berikov , Alexander Litvinenko

We study the problem of estimating a low-rank positive semidefinite (PSD) matrix from a set of rank-one measurements using sensing vectors composed of i.i.d. standard Gaussian entries, which are possibly corrupted by arbitrary outliers.…

Information Theory · Computer Science 2016-12-21 Yuanxin Li , Yue Sun , Yuejie Chi

Low-rank matrix estimation plays a central role in various applications across science and engineering. Recently, nonconvex formulations based on matrix factorization are provably solved by simple gradient descent algorithms with strong…

Signal Processing · Electrical Eng. & Systems 2021-04-07 Cong Ma , Yuanxin Li , Yuejie Chi

Low-rank matrix recovery from structured measurements has been a topic of intense study in the last decade and many important problems like matrix completion and blind deconvolution have been formulated in this framework. An important…

Information Theory · Computer Science 2020-04-13 Felix Krahmer , Dominik Stöger

Given underdetermined measurements of a Positive Semi-Definite (PSD) matrix $X$ of known low rank $K$, we present a new algorithm to estimate $X$ based on recent advances in non-convex optimization schemes. We apply this in particular to…

Optimization and Control · Mathematics 2020-01-29 Marcus Carlsson , Daniele Gerosa

We consider the problem of estimating the phases of K mixed complex signals from a multichannel observation, when the mixing matrix and signal magnitudes are known. This problem can be cast as a non-convex quadratically constrained…

Sound · Computer Science 2017-03-21 Antoine Deleforge , Yann Traonmilin

A new approach to solving a class of rankconstrained semi-definite programming (SDP) problems, which appear in many signal processing applications such as transmit beamspace design in multiple-input multiple-output (MIMO) radar, downlink…

Information Theory · Computer Science 2016-10-10 Matthew W. Morency , Sergiy A. Vorobyov

An estimation method is presented for polynomial phase signals, i.e., those adopting the form of a complex exponential whose phase is polynomial in its indices. Transcending the scope of existing techniques, the proposed estimator can…

Signal Processing · Electrical Eng. & Systems 2024-11-12 Heedong Do , Namyoon Lee , Angel Lozano

With active research in audio compression techniques yielding substantial breakthroughs, spectral reconstruction of low-quality audio waves remains a less indulged topic. In this paper, we propose a novel approach for reconstructing higher…

Sound · Computer Science 2021-08-10 Darshan Deshpande , Harshavardhan Abichandani

This paper proposes a robust reduced-rank scheme for adaptive beamforming based on joint iterative optimization (JIO) of adaptive filters. The novel scheme is designed according to the constant modulus (CM) criterion subject to different…

Information Theory · Computer Science 2013-01-30 Lei Wang , Rodrigo C. de Lamare

We introduce a new audio processing technique that increases the sampling rate of signals such as speech or music using deep convolutional neural networks. Our model is trained on pairs of low and high-quality audio examples; at test-time,…

Sound · Computer Science 2017-08-03 Volodymyr Kuleshov , S. Zayd Enam , Stefano Ermon

We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by a convex rank-reducing term similar to the trace norm. In…

Machine Learning · Computer Science 2008-12-11 Francis Bach , Julien Mairal , Jean Ponce

We study the problem of robust matrix completion (RMC), where the partially observed entries of an underlying low-rank matrix is corrupted by sparse noise. Existing analysis of the non-convex methods for this problem either requires the…

Information Theory · Computer Science 2025-04-28 Tianming Wang , Ke Wei

Affine matrix rank minimization problem is a fundamental problem with a lot of important applications in many fields. It is well known that this problem is combinatorial and NP-hard in general. In this paper, a continuous promoting low rank…

Optimization and Control · Mathematics 2017-05-02 Angang Cui , Jigen Peng , Haiyang Li , Chengyi Zhang , Yongchao Yu

By using the random matrix approach and generalized Blue's function representation we solve analytically the model of an effective two-level system coupled to a noise reservoir. We show that calculated spectral properties of the system are…

Condensed Matter · Physics 2009-10-30 Ewa Gudowska-Nowak , Gabor Papp , Juergen Brickmann

Phase noise correction is crucial to exploit full advantage of orthogonal frequency division multiplexing (OFDM) in modern high-data-rate communications. OFDM channel estimation with simultaneous phase noise compensation has therefore drawn…

Information Theory · Computer Science 2017-04-25 Zhongju Wang , Prabhu Babu , Daniel P. Palomar

We revisit the problem of robust principal component analysis with features acting as prior side information. To this aim, a novel, elegant, non-convex optimization approach is proposed to decompose a given observation matrix into a…

Machine Learning · Statistics 2017-09-15 Niannan Xue , Jiankang Deng , Yannis Panagakis , Stefanos Zafeiriou

We prove new results about the robustness of well-known convex noise-blind optimization formulations for the reconstruction of low-rank matrices from underdetermined linear measurements. Our results are applicable for symmetric rank-one…

Information Theory · Computer Science 2020-10-26 Felix Krahmer , Christian Kümmerle , Oleh Melnyk
‹ Prev 1 8 9 10 Next ›