233 research outputs found
Sparse image super-resolution via superset selection and pruning
This note extends the superset method for sparse signal recovery from bandlimited measurements to the two-dimensional case. The algorithm leverages translation-invariance of the Fourier basis functions by constructing a Hankel tensor, and identifying the signal subspace from its range space. In the noisy case, this method determines a superset which then needs to undergo pruning. The method displays reasonable robustness to noise, and unlike â„“ [subscript 1] minimization, always succeeds in the noiseless case.United States. Air Force Office of Scientific ResearchTOTAL (Firm)Alfred P. Sloan FoundationNational Science Foundation (U.S.)United States. Office of Naval Researc
Super-Resolution in Phase Space
This work considers the problem of super-resolution. The goal is to resolve a
Dirac distribution from knowledge of its discrete, low-pass, Fourier
measurements. Classically, such problems have been dealt with parameter
estimation methods. Recently, it has been shown that convex-optimization based
formulations facilitate a continuous time solution to the super-resolution
problem. Here we treat super-resolution from low-pass measurements in Phase
Space. The Phase Space transformation parametrically generalizes a number of
well known unitary mappings such as the Fractional Fourier, Fresnel, Laplace
and Fourier transforms. Consequently, our work provides a general super-
resolution strategy which is backward compatible with the usual Fourier domain
result. We consider low-pass measurements of Dirac distributions in Phase Space
and show that the super-resolution problem can be cast as Total Variation
minimization. Remarkably, even though are setting is quite general, the bounds
on the minimum separation distance of Dirac distributions is comparable to
existing methods.Comment: 10 Pages, short paper in part accepted to ICASSP 201
Accuracy of spike-train Fourier reconstruction for colliding nodes
We consider Fourier reconstruction problem for signals F, which are linear
combinations of shifted delta-functions. We assume the Fourier transform of F
to be known on the frequency interval [-N,N], with an absolute error not
exceeding e > 0. We give an absolute lower bound (which is valid with any
reconstruction method) for the "worst case" reconstruction error of F in
situations where the nodes (i.e. the positions of the shifted delta-functions
in F) are known to form an l elements cluster of a size h << 1. Using
"decimation" reconstruction algorithm we provide an upper bound for the
reconstruction error, essentially of the same form as the lower one. Roughly,
our main result states that for N*h of order of (2l-1)-st root of e the worst
case reconstruction error of the cluster nodes is of the same order as h, and
hence the inside configuration of the cluster nodes (in the worst case
scenario) cannot be reconstructed at all. On the other hand, decimation
algorithm reconstructs F with the accuracy of order of 2l-st root of e
A hybrid algorithm for Bayesian network structure learning with application to multi-label learning
We present a novel hybrid algorithm for Bayesian network structure learning,
called H2PC. It first reconstructs the skeleton of a Bayesian network and then
performs a Bayesian-scoring greedy hill-climbing search to orient the edges.
The algorithm is based on divide-and-conquer constraint-based subroutines to
learn the local structure around a target variable. We conduct two series of
experimental comparisons of H2PC against Max-Min Hill-Climbing (MMHC), which is
currently the most powerful state-of-the-art algorithm for Bayesian network
structure learning. First, we use eight well-known Bayesian network benchmarks
with various data sizes to assess the quality of the learned structure returned
by the algorithms. Our extensive experiments show that H2PC outperforms MMHC in
terms of goodness of fit to new data and quality of the network structure with
respect to the true dependence structure of the data. Second, we investigate
H2PC's ability to solve the multi-label learning problem. We provide
theoretical results to characterize and identify graphically the so-called
minimal label powersets that appear as irreducible factors in the joint
distribution under the faithfulness condition. The multi-label learning problem
is then decomposed into a series of multi-class classification problems, where
each multi-class variable encodes a label powerset. H2PC is shown to compare
favorably to MMHC in terms of global classification accuracy over ten
multi-label data sets covering different application domains. Overall, our
experiments support the conclusions that local structural learning with H2PC in
the form of local neighborhood induction is a theoretically well-motivated and
empirically effective learning framework that is well suited to multi-label
learning. The source code (in R) of H2PC as well as all data sets used for the
empirical tests are publicly available.Comment: arXiv admin note: text overlap with arXiv:1101.5184 by other author
Greedy Signal Space Methods for Incoherence and Beyond
Compressive sampling (CoSa) has provided many methods for signal recovery of signals compressible with respect to an orthonormal basis. However, modern applications have sparked the emergence of approaches for signals not sparse in an orthonormal basis but in some arbitrary, perhaps highly overcomplete, dictionary. Recently, several signal-space greedy methods have been proposed to address signal recovery in this setting. However, such methods inherently rely on the existence of fast and accurate projections which allow one to identify the most relevant atoms in a dictionary for any given signal, up to a very strict accuracy. When the dictionary is highly overcomplete, no such projections are currently known; the requirements on such projections do not even hold for incoherent or well-behaved dictionaries. In this work, we provide an alternate analysis for signal space greedy methods which enforce assumptions on these projections which hold in several settings including those when the dictionary is incoherent or structurally coherent. These results align more closely with traditional results in the standard CoSa literature and improve upon previous work in the signal space setting
The Multiplicative Zak Transform, Dimension Reduction, and Wavelet Analysis of LIDAR Data
This thesis broadly introduces several techniques within the context of timescale analysis. The representation, compression and reconstruction of DEM and LIDAR data types is studied with directional wavelet methods and the wedgelet decomposition. The optimality of the contourlet transform, and then the wedgelet transform is evaluated with a valuable new structural similarity index. Dimension reduction for material classification is conducted with a frame-based kernel pipeline and a spectral-spatial method using wavelet packets. It is shown that these techniques can improve on baseline material classification methods while significantly reducing the amount of data. Finally, the multiplicative Zak transform is modified to allow the study and partial characterization of wavelet frames
- …