The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Recently, it was shown that it is possible to sample classes of 1D and 2-D signals with finite rate of innovation (FRI) [9, 4, 5, 3, 2, 7]. In particular, in [7], we presented loc...
In this paper, we adopt local Fourier transform as a texture representation scheme and derive eight characteristic maps for describing different aspects of co-occurrence relations...
In this work we present a new approach to two - dimensional robust spline smoothing. The proposed method is based on M-estimator algorithms but unlike in other M-estimator based i...
Abstract. We present a general method for the computation of PDFbased characteristics of the tissue micro-architecture in MR imaging. The approach relies on the approximation of th...