19,306 research outputs found
Structured Sparsity Models for Multiparty Speech Recovery from Reverberant Recordings
We tackle the multi-party speech recovery problem through modeling the
acoustic of the reverberant chambers. Our approach exploits structured sparsity
models to perform room modeling and speech recovery. We propose a scheme for
characterizing the room acoustic from the unknown competing speech sources
relying on localization of the early images of the speakers by sparse
approximation of the spatial spectra of the virtual sources in a free-space
model. The images are then clustered exploiting the low-rank structure of the
spectro-temporal components belonging to each source. This enables us to
identify the early support of the room impulse response function and its unique
map to the room geometry. To further tackle the ambiguity of the reflection
ratios, we propose a novel formulation of the reverberation model and estimate
the absorption coefficients through a convex optimization exploiting joint
sparsity model formulated upon spatio-spectral sparsity of concurrent speech
representation. The acoustic parameters are then incorporated for separating
individual speech signals through either structured sparse recovery or inverse
filtering the acoustic channels. The experiments conducted on real data
recordings demonstrate the effectiveness of the proposed approach for
multi-party speech recovery and recognition.Comment: 31 page
Rank-preserving geometric means of positive semi-definite matrices
The generalization of the geometric mean of positive scalars to positive
definite matrices has attracted considerable attention since the seminal work
of Ando. The paper generalizes this framework of matrix means by proposing the
definition of a rank-preserving mean for two or an arbitrary number of positive
semi-definite matrices of fixed rank. The proposed mean is shown to be
geometric in that it satisfies all the expected properties of a rank-preserving
geometric mean. The work is motivated by operations on low-rank approximations
of positive definite matrices in high-dimensional spaces.Comment: To appear in Linear Algebra and its Application
Subsampling Algorithms for Semidefinite Programming
We derive a stochastic gradient algorithm for semidefinite optimization using
randomization techniques. The algorithm uses subsampling to reduce the
computational cost of each iteration and the subsampling ratio explicitly
controls granularity, i.e. the tradeoff between cost per iteration and total
number of iterations. Furthermore, the total computational cost is directly
proportional to the complexity (i.e. rank) of the solution. We study numerical
performance on some large-scale problems arising in statistical learning.Comment: Final version, to appear in Stochastic System
False Discovery and Its Control in Low Rank Estimation
Models specified by low-rank matrices are ubiquitous in contemporary
applications. In many of these problem domains, the row/column space structure
of a low-rank matrix carries information about some underlying phenomenon, and
it is of interest in inferential settings to evaluate the extent to which the
row/column spaces of an estimated low-rank matrix signify discoveries about the
phenomenon. However, in contrast to variable selection, we lack a formal
framework to assess true/false discoveries in low-rank estimation; in
particular, the key source of difficulty is that the standard notion of a
discovery is a discrete one that is ill-suited to the smooth structure
underlying low-rank matrices. We address this challenge via a geometric
reformulation of the concept of a discovery, which then enables a natural
definition in the low-rank case. We describe and analyze a generalization of
the Stability Selection method of Meinshausen and B\"uhlmann to control for
false discoveries in low-rank estimation, and we demonstrate its utility
compared to previous approaches via numerical experiments
A Harmonic Extension Approach for Collaborative Ranking
We present a new perspective on graph-based methods for collaborative ranking
for recommender systems. Unlike user-based or item-based methods that compute a
weighted average of ratings given by the nearest neighbors, or low-rank
approximation methods using convex optimization and the nuclear norm, we
formulate matrix completion as a series of semi-supervised learning problems,
and propagate the known ratings to the missing ones on the user-user or
item-item graph globally. The semi-supervised learning problems are expressed
as Laplace-Beltrami equations on a manifold, or namely, harmonic extension, and
can be discretized by a point integral method. We show that our approach does
not impose a low-rank Euclidean subspace on the data points, but instead
minimizes the dimension of the underlying manifold. Our method, named LDM (low
dimensional manifold), turns out to be particularly effective in generating
rankings of items, showing decent computational efficiency and robust ranking
quality compared to state-of-the-art methods
The geometry of low-rank Kalman filters
An important property of the Kalman filter is that the underlying Riccati
flow is a contraction for the natural metric of the cone of symmetric positive
definite matrices. The present paper studies the geometry of a low-rank version
of the Kalman filter. The underlying Riccati flow evolves on the manifold of
fixed rank symmetric positive semidefinite matrices. Contraction properties of
the low-rank flow are studied by means of a suitable metric recently introduced
by the authors.Comment: Final version published in Matrix Information Geometry, pp53-68,
Springer Verlag, 201
Atmospheric tomography with separate minimum variance laser and natural guide star mode control
This paper introduces a novel, computationally efficient, and practical atmospheric tomography wavefront control architecture with separate minimum variance laser and natural guide star mode estimation. The architecture is applicable to all laser tomography systems, including multi conjugate adaptive optics (MCAO), laser tomography adaptive optics (LTAO), and multi object adaptive optics (MOAO) systems. Monte Carlo simulation results for the Thirty Meter Telescope (TMT) MCAO system demonstrate its benefit over a previously introduced “ad hoc” split MCAO architecture, calling for further in-depth analysis and simulations over a representative ensemble of natural guide star (NGS) asterisms with optimized loop frame rates and modal gains
- …