25 citations · 41 across the 7 of their papers we have counts for
8 papers
A divide-and-conquer algorithm for binary matrix completion
Melanie Beckerleg, Andrew Thompson
We propose an algorithm for low rank matrix completion for matrices with binary entries which obtains explicit binary factors. Our algorithm, which we call TBMC (\emph{Tiling for B…
Compressed Neighbour Discovery using Sparse Kerdock Matrices
Andrew Thompson, Robert Calderbank
We study the network-wide neighbour discovery problem in wireless networks in which each node in a network must discovery the network interface addresses (NIAs) of its neighbours.…
Adaptive DCTNet for Audio Signal Classification
Yin Xian, Yunchen Pu, Zhe Gan +2
In this paper, we investigate DCTNet for audio signal classification. Its output feature is related to Cohen's class of time-frequency distributions. We introduce the use of adapti…
The Cascading Haar Wavelet algorithm for computing the Walsh-Hadamard Transform
Andrew Thompson
We propose a novel algorithm for computing the Walsh-Hadamard Transform (WHT) which consists entirely of Haar wavelet transforms. We prove that the algorithm, which we call the Cas…
Compressive imaging using fast transform coding
Andrew Thompson, Robert Calderbank
We propose deterministic sampling strategies for compressive imaging based on Delsarte-Goethals frames. We show that these sampling strategies result in multi-scale measurements wh…
Quantitative recovery conditions for tree-based compressed sensing
Coralia Cartis, Andrew Thompson
As shown in [Blumensath and Davies 2009, Baraniuk et al. 2010], signals whose wavelet coefficients exhibit a rooted tree structure can be recovered using specially-adapted compress…
DCTNet and PCANet for acoustic signal feature extraction
Yin Xian, Andrew Thompson, Xiaobai Sun +2
We introduce the use of DCTNet, an efficient approximation and alternative to PCANet, for acoustic signal classification. In PCANet, the eigenfunctions of the local sample covarian…
A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing
Coralia Cartis, Andrew Thompson
We present a new recovery analysis for a standard compressed sensing algorithm, Iterative Hard Thresholding (IHT) (Blumensath and Davies, 2008), which considers the fixed points of…