Related papers: Blind Source Separation over Space
This paper aims to address two fundamental challenges arising in eigenvector estimation and inference for a low-rank matrix from noisy observations: (1) how to estimate an unknown eigenvector when the eigen-gap (i.e. the spacing between the…
We address overcrowding estimates for the singular values of random iid matrices, as well as for the eigenvalues of random Wigner matrices. We show evidence of long range separation under arbitrary perturbation even in matrices of discrete…
Blind source separation is one of the major analysis tool to extract relevant information from multichannel data. While being central, joint deconvolution and blind source separation (DBSS) methods are scarce. To that purpose, a DBSS…
We provide an example of a distribution preserving source separation method, which aims at addressing perceptual shortcomings of state-of-the-art methods. Our approach uses unconditioned generative models of signal sources. Reconstruction…
We proposed and demonstrated an optical pulse sampling method for photonic blind source separation. It can separate large bandwidth of mixed signals by small sampling frequency, which can reduce the workload of digital signal processing.
We review the well-known matched filter method for the detection of point sources in astronomical images. This is shown to be optimal (that is, to saturate the Cramer--Rao bound) under stated conditions that are very strong: an isolated…
We focus on an alignment-free method to estimate the underlying signal from a large number of noisy randomly shifted observations. Specifically, we estimate the mean, power spectrum, and bispectrum of the signal from the observations. Since…
This paper addresses the high dimensionality problem in blind source separation (BSS), where the number of sources is greater than two. Two pairwise iterative schemes are proposed to tackle this high dimensionality problem. The two pairwise…
The paradigm of self-supervision focuses on representation learning from raw data without the need of labor-consuming annotations, which is the main bottleneck of current data-driven methods. Self-supervision tasks are often used to…
We present a novel two-view geometry estimation framework which is based on a differentiable robust loss function fitting. We propose to treat the robust fundamental matrix estimation as an implicit layer, which allows us to avoid…
We consider the multichannel blind deconvolution problem where we observe the output of multiple channels that are all excited with the same unknown input. From these observations, we wish to estimate the impulse responses of each of the…
Homography estimation is often an indispensable step in many computer vision tasks. The existing approaches, however, are not robust to illumination and/or larger viewpoint changes. In this paper, we propose bidirectional implicit…
Supervised learning methods with missing data have been extensively studied not just due to the techniques related to low-rank matrix completion. Also in unsupervised learning one often relies on imputation methods. As a matter of fact,…
Blind gain and phase calibration (BGPC) is a bilinear inverse problem involving the determination of unknown gains and phases of the sensing system, and the unknown signal, jointly. BGPC arises in numerous applications, e.g., blind albedo…
In this article, we develop an algorithm for probabilistic and constrained projection pursuit. Our algorithm called ADIS (automated decomposition into sources) accepts arbitrary non-linear contrast functions and constraints from the user…
We present a method of reliably extracting the flux of individual sources from sky maps in the presence of noise and a source population in which number counts are a steeply falling function of flux. The method is an extension of a standard…
We present a method for obtaining unbiased signal estimates in the presence of a significant unknown background, eliminating the need for a parametric model for the background itself. Our approach is based on a minimal set of conditions for…
We experimentally demonstrate a universal, parameter-independent test for asymmetric source discrimination. The test allows us to discriminate faint sources well beyond the diffraction limit by exploiting spatial mode demultiplexing (SPADE)…
We make use of a large set of fast simulations of an intensity mapping experiment with characteristics similar to those expected of the Square Kilometre Array (SKA) in order to study the viability and limits of blind foreground subtraction…
We present a new scheme for extracting approximate values in ``the improved perturbation method'', which is a sort of resummation technique capable of evaluating a series outside the radius of convergence. We employ the distribution profile…