20,306 research outputs found
Persistent Homology in Sparse Regression and its Application to Brain Morphometry
Sparse systems are usually parameterized by a tuning parameter that
determines the sparsity of the system. How to choose the right tuning parameter
is a fundamental and difficult problem in learning the sparse system. In this
paper, by treating the the tuning parameter as an additional dimension,
persistent homological structures over the parameter space is introduced and
explored. The structures are then further exploited in speeding up the
computation using the proposed soft-thresholding technique. The topological
structures are further used as multivariate features in the tensor-based
morphometry (TBM) in characterizing white matter alterations in children who
have experienced severe early life stress and maltreatment. These analyses
reveal that stress-exposed children exhibit more diffuse anatomical
organization across the whole white matter region.Comment: submitted to IEEE Transactions on Medical Imagin
Extrinsic Methods for Coding and Dictionary Learning on Grassmann Manifolds
Sparsity-based representations have recently led to notable results in
various visual recognition tasks. In a separate line of research, Riemannian
manifolds have been shown useful for dealing with features and models that do
not lie in Euclidean spaces. With the aim of building a bridge between the two
realms, we address the problem of sparse coding and dictionary learning over
the space of linear subspaces, which form Riemannian structures known as
Grassmann manifolds. To this end, we propose to embed Grassmann manifolds into
the space of symmetric matrices by an isometric mapping. This in turn enables
us to extend two sparse coding schemes to Grassmann manifolds. Furthermore, we
propose closed-form solutions for learning a Grassmann dictionary, atom by
atom. Lastly, to handle non-linearity in data, we extend the proposed Grassmann
sparse coding and dictionary learning algorithms through embedding into Hilbert
spaces.
Experiments on several classification tasks (gender recognition, gesture
classification, scene analysis, face recognition, action recognition and
dynamic texture classification) show that the proposed approaches achieve
considerable improvements in discrimination accuracy, in comparison to
state-of-the-art methods such as kernelized Affine Hull Method and
graph-embedding Grassmann discriminant analysis.Comment: Appearing in International Journal of Computer Visio
Why Does a Kronecker Model Result in Misleading Capacity Estimates?
Many recent works that study the performance of multi-input multi-output
(MIMO) systems in practice assume a Kronecker model where the variances of the
channel entries, upon decomposition on to the transmit and the receive
eigen-bases, admit a separable form. Measurement campaigns, however, show that
the Kronecker model results in poor estimates for capacity. Motivated by these
observations, a channel model that does not impose a separable structure has
been recently proposed and shown to fit the capacity of measured channels
better. In this work, we show that this recently proposed modeling framework
can be viewed as a natural consequence of channel decomposition on to its
canonical coordinates, the transmit and/or the receive eigen-bases. Using tools
from random matrix theory, we then establish the theoretical basis behind the
Kronecker mismatch at the low- and the high-SNR extremes: 1) Sparsity of the
dominant statistical degrees of freedom (DoF) in the true channel at the
low-SNR extreme, and 2) Non-regularity of the sparsity structure (disparities
in the distribution of the DoF across the rows and the columns) at the high-SNR
extreme.Comment: 39 pages, 5 figures, under review with IEEE Trans. Inform. Theor
- …