Antipodally invariant metrics for fast regression-based super-resolution

Dictionary-based super-resolution (SR) algorithms usually select dictionary atoms based on the distance or similarity metrics. Although the optimal selection of the nearest neighbors is of central importance for such methods, the impact of using proper metrics for SR has been overlooked in literature, mainly due to the vast usage of Euclidean distance. In this paper, we present a very fast regression-based algorithm, which builds on the densely populated anchored neighborhoods and sublinear search structures. We perform a study of the nature of the features commonly used for SR, observing that those features usually lie in the unitary hypersphere, where every point has a diametrically opposite one, i.e., its antipode, with same module and angle, but the opposite direction. Even though, we validate the benefits of using antipodally invariant metrics, most of the binary splits use Euclidean distance, which does not handle antipodes optimally. In order to benefit from both the worlds, we propose a simple yet effective antipodally invariant transform that can be easily included in the Euclidean distance calculation. We modify the original spherical hashing algorithm with this metric in our antipodally invariant spherical hashing scheme, obtaining the same performance as a pure antipodally invariant metric. We round up our contributions with a novel feature transform that obtains a better coarse approximation of the input image thanks to iterative backprojection. The performance of our method, which we named antipodally invariant SR, improves quality (Peak Signal to Noise Ratio) and it is faster than any other state-of-the-art method.Peer ReviewedPostprint (author's final draft

Distance-regular graphs

This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page

Algorithms for the Construction of Incoherent Frames Under Various Design Constraints

Unit norm finite frames are generalizations of orthonormal bases with many applications in signal processing. An important property of a frame is its coherence, a measure of how close any two vectors of the frame are to each other. Low coherence frames are useful in compressed sensing applications. When used as measurement matrices, they successfully recover highly sparse solutions to linear inverse problems. This paper describes algorithms for the design of various low coherence frame types: real, complex, unital (constant magnitude) complex, sparse real and complex, nonnegative real and complex, and harmonic (selection of rows from Fourier matrices). The proposed methods are based on solving a sequence of convex optimization problems that update each vector of the frame. This update reduces the coherence with the other frame vectors, while other constraints on its entries are also imposed. Numerical experiments show the effectiveness of the methods compared to the Welch bound, as well as other competing algorithms, in compressed sensing applications

The Lasserre hierarchy for equiangular lines with a fixed angle

We compute the second and third levels of the Lasserre hierarchy for the spherical finite distance problem. A connection is used between invariants in representations of the orthogonal group and representations of the general linear group, which allows computations in high dimensions. We give new linear bounds on the maximum number of equiangular lines in dimension $n$ with common angle $\arccos \alpha$. These are obtained through asymptotic analysis in $n$ of the semidefinite programming bound given by the second level.Comment: 25 pages, 2 figures. Submitted versio

Denoising and fast diffusion imaging with physically constrained sparse dictionary learning

International audienceDiffusion-weighted imaging (DWI) allows imaging the geometry of water diffusion in biological tissues. However, DW images are noisy at high b-values and acquisitions are slow when using a large number of measurements, such as in Diffusion Spectrum Imaging (DSI). This work aims to denoise DWI and reduce the number of required measurements, while maintaining data quality. To capture the structure of DWI data, we use sparse dictionary learning constrained by the physical properties of the signal: symmetry and positivity. The method learns a dictionary of diffusion profiles on all the DW images at the same time and then scales to full brain data. Its performance is investigated with simulations and two real DSI datasets. We obtain better signal estimates from noisy measurements than by applying mirror symmetry through the q-space origin, Gaussian denoising or state-of- the-art non-local means denoising. Using a high-resolution dictionary learnt on another subject, we show that we can reduce the number of images acquired while still generating high resolution DSI data. Using dictionary learning, one can denoise DW images effectively and perform faster acquisitions. Higher b-value acquisitions and DSI techniques are possible with approximately 40 measurements. This opens important perspectives for the connectomics community using DSI