Mallat's Matching Pursuit of sperm whale clicks in real-time using Daubechies 15 wavelets

Author(s):  
Fabien Lelandais ◽  
Herve Glotin
2010 ◽  
Vol 71 (11) ◽  
pp. 1011-1019 ◽  
Author(s):  
Serge Zaugg ◽  
Mike van der Schaar ◽  
Ludwig Houégnigan ◽  
Cédric Gervaise ◽  
Michel André

Author(s):  
C. Laplanche ◽  
O. Adam ◽  
M. Lopatka ◽  
J.-F. Motsch

In this paper is presented a novel area efficient Fast Fourier transform (FFT) for real-time compressive sensing (CS) reconstruction. Among various methodologies used for CS reconstruction algorithms, Greedy-based orthogonal matching pursuit (OMP) approach provides better solution in terms of accurate implementation with complex computations overhead. Several computationally intensive arithmetic operations like complex matrix multiplication are required to formulate correlative vectors making this algorithm highly complex and power consuming hardware implementation. Computational complexity becomes very important especially in complex FFT models to meet different operational standards and system requirements. In general, for real time applications, FFT transforms are required for high speed computations as well as with least possible complexity overhead in order to support wide range of applications. This paper presents an hardware efficient FFT computation technique with twiddle factor normalization for correlation optimization in orthogonal matching pursuit (OMP). Experimental results are provided to validate the performance metrics of the proposed normalization techniques against complexity and energy related issues. The proposed method is verified by FPGA synthesizer, and validated with appropriate currently available comparative analyzes.


Author(s):  
Ryo Hirotsu ◽  
Tamaki Ura ◽  
Junichi Kojima ◽  
Harumi Sugimatsu ◽  
Rajendar Bahl ◽  
...  
Keyword(s):  

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Yinghui Quan ◽  
Yachao Li ◽  
Xiaoxiao Gao ◽  
Mengdao Xing

This paper presents a novel real-time compressive sensing (CS) reconstruction which employs high density field-programmable gate array (FPGA) for hardware acceleration. Traditionally, CS can be implemented using a high-level computer language in a personal computer (PC) or multicore platforms, such as graphics processing units (GPUs) and Digital Signal Processors (DSPs). However, reconstruction algorithms are computing demanding and software implementation of these algorithms is extremely slow and power consuming. In this paper, the orthogonal matching pursuit (OMP) algorithm is refined to solve the sparse decomposition optimization for partial Fourier dictionary, which is always adopted in radar imaging and detection application. OMP reconstruction can be divided into two main stages: optimization which finds the closely correlated vectors and least square problem. For large scale dictionary, the implementation of correlation is time consuming since it often requires a large number of matrix multiplications. Also solving the least square problem always needs a scalable matrix decomposition operation. To solve these problems efficiently, the correlation optimization is implemented by fast Fourier transform (FFT) and the large scale least square problem is implemented by Conjugate Gradient (CG) technique, respectively. The proposed method is verified by FPGA (Xilinx Virtex-7 XC7VX690T) realization, revealing its effectiveness in real-time applications.


2015 ◽  
Vol 740 ◽  
pp. 562-567
Author(s):  
Xiu Ying Li ◽  
Rui Xu ◽  
Cheng Zhao

Transportation vehicle tracking systems need to equip with a tracking algorithm with not only good tracking accuracy, but also fast computation speed to meet the real time changes of vehicles.l1tracker has good tracking accuracy, but the high computational complexity limits its application in real-time systems. In order to solve this problem, this paper proposed a novel algorithm that utilize compressive sensing to reduce dimensions and improved Sparsity Adaptive Matching Pursuit (SAMP) algorithm to rebuild the coefficients of templates. The experimental results show that thel1-FSAMP algorithm not only improves the running speed, but also reduces the average tracking errors by 83% compared to thel1-OMP algorithm. The results show that the proposed algorithm is suitable for practical real-time tracking of transportation vehicles.


Sign in / Sign up

Export Citation Format

Share Document