The scale invariant feature transform and the integral invariants are two well known approaches for visual feature extraction. Each of these approaches has been successfully applied to global localization of mobile robots. In this paper, we propose applying a combination of the two concepts. We demonstrate that extracting the integral invariants from the scale space does indeed improve the loca...

Article history: Article Received : 12 January 2015 Revised: 1 May 2015 Accepted: 8 May 2015

It is known that the Williamson construction for Hadamard matrices can be generalized to constructions using sums of tensor products. This paper describes a specific construction using real monomial representations of Clifford algebras, and its connection with graphs of amicability and anti-amicability. It is proven that this construction works for all such representations where the order of th...

The distance transform has been proposed for use in computer vision for a number of applications such as matching and skeletonisation. This paper proposes two things: (1) a multi-scale distance transform to overcome the need to choose edge thresholds and scale and (2) the addition of various saliency factors such as edge strength, length and curvature to the basic distance transform to improve ...

In this work, we present two parallel algorithms for the large-scale discrete Fourier transform (DFT) on Tensor Processing Unit (TPU) clusters. The are associated with DFT formulations: one formulation, denoted as KDFT, is based Kronecker product; other famous Cooley-Tukey algorithm and phase adjustment, FFT. Both KDFT FFT formulations take full advantage of TPU's strength in matrix multiplicat...