Learn More
The theory of sampling signals with finite rate of innovation (FRI) has shown that it is possible to perfectly recover classes of non-bandlimited signals such as streams of Diracs from uniform samples. Most of previous papers, however, have to some extent only focused on the sampling of periodic or finite duration signals. In this paper we propose a novel(More)
Traditional Finite Rate of Innovation (FRI) theory has considered the problem of sampling continuous-time signals. This framework can be naturally extended to the case where the input is a discrete-time signal. Here we present a novel approach which uses both the traditional FRI sampling scheme, based on the annihilating filter method, and the fact that in(More)
The current methods used to convert analogue signals into discrete-time sequences have been deeply influenced by the classical Shannon–Whittaker–Kotelnikov sampling theorem. This approach restricts the class of signals that can be sampled and perfectly reconstructed to bandlimited signals. During the last few years, a new framework has emerged that(More)
In [1,2] we presented a multiview image coding scheme. The approach is based on extracting depth layers from multiview images. Each layer is related to an object in the scene and is highly redundant. We exploit this redundancy by using a properly disparity compensated Wavelet Transform, followed by quantisation and entropy coding of the transform(More)
The problem of finding the sparse representation of a signal has attracted a lot of attention over the past years. In particular, uniqueness conditions and reconstruction algorithms have been established by relaxing a non-convex optimisation problem. The finite rate of innovation (FRI) theory is an alternative approach that solves the sparsity problem using(More)
We present a novel algorithm - ProSparse Denoise - that can solve the sparsity recovery problem in the presence of noise when the dictionary is the union of Fourier and identity matrices. The algorithm is based on a proper use of Cadzow routine and Prony's method and exploits the duality of Fourier and identity matrices. The algorithm has low complexity(More)
  • 1