Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2019
Correlation‐guided multi‐object tracking with correlation feature transfer
IET Computer Vision (CVI2), Volume 13, Issue 2March 2019, Pages 139–145https://doi.org/10.1049/iet-cvi.2018.5011Here, the authors propose a correlation‐guided Monte Carlo Markov chain (MCMC) solver to promote the efficiency for tracking multiple objects under recursive Bayesian filtering framework. Instead of randomly proposing the target location according to ...
- research-articleJuly 2018
High‐throughput and compact reconfigurable architectures for recursive filters
IET Communications (CMU2), Volume 12, Issue 13Pages 1616–1623https://doi.org/10.1049/iet-com.2018.0085This study presents various high‐throughput reconfigurable architectures and their hardware implementation characteristics for infinite impulse response (IIR) filters. It is known that finite word length effects can be alleviated, to some extent, by ...
- research-articleMarch 2018
Automatic Hierarchical Parallelization of Linear Recurrences
ASPLOS '18: Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating SystemsMarch 2018, Pages 128–138https://doi.org/10.1145/3173162.3173168Linear recurrences encompass many fundamental computations including prefix sums and digital filters. Later result values depend on earlier result values in recurrences, making it a challenge to compute them in parallel. We present a new work- and space-...
Also Published in:
ACM SIGPLAN Notices: Volume 53 Issue 2, February 2018 - articleMay 2016
Design of recursive digital integrators and differentiators using particle swarm optimization
International Journal of Circuit Theory and Applications (IJCTA), Volume 44, Issue 5May 2016, Pages 948–967https://doi.org/10.1002/cta.2115This paper presents a new method for designing digital recursive integrators and differentiators by using nonlinear stochastic global optimization based on particle swarm optimization PSO. A modified PSO is used to optimize the unknown coefficients of ...
- research-articleOctober 2015
Single‐carrier underwater acoustic communication combined with channel shortening and dichotomous coordinate descent recursive least squares with variable forgetting factor
IET Communications (CMU2), Volume 9, Issue 15Pages 1867–1876https://doi.org/10.1049/iet-com.2014.1176In this study, the authors propose a novel decision feedback equaliser (DFE)‐based receiver, which combines channel shortening methods and dichotomous coordinate descent (DCD) recursive least squares (RLS) adaptive algorithm with variable forgetting ...
-
- research-articleMay 2015
Joint frequency domain equalisation and phase noise estimation for single‐carrier modulations in doubly‐selective channels
IET Communications (CMU2), Volume 9, Issue 8Pages 1138–1146https://doi.org/10.1049/iet-com.2014.0900In this study the authors propose a novel joint detection and phase noise estimation scheme suited for severely time‐dispersive channels. The authors consider single‐carrier modulations combined with frequency domain equalisation schemes where the ...
- research-articleNovember 2013
Blind channel‐shortening for multipath channels using a recursive prediction‐error filter with additional prediction delay
IET Communications (CMU2), Volume 7, Issue 16Pages 1844–1851https://doi.org/10.1049/iet-com.2012.0583The prediction‐error filter is a well‐known tool for blind communication channel equalisation. For multipath channels, it has two disadvantages considered here. First, in transversal form, it must be substantially longer than the impulse response of the ...
- articleSeptember 2010
A low-cost, low-complexity, and memory-free architecture of novel recursive DFT and IDFT algorithms for DTMF application
IEEE Transactions on Circuits and Systems II: Express Briefs (TCS), Volume 57, Issue 9September 2010, Pages 711–715https://doi.org/10.1109/TCSII.2010.2056413A low-computational complexity and low-cost recursive discrete Fourier transform (RDFT) design using the Chinese remainder theorem is proposed in this brief. The proposed algorithm reduces multiplications by 74% and additions by 73% compared to the ...
- articleAugust 2010
Low-computation-cycle, power-efficient, and reconfigurable design of recursive DFT for portable digital radio mondiale receiver
IEEE Transactions on Circuits and Systems II: Express Briefs (TCS), Volume 57, Issue 8August 2010, Pages 647–651https://doi.org/10.1109/TCSII.2010.2050950Low-cost, fast-computational, power-efficient, and reconfigurable design for recursive discrete Fourier transform (RDFT) is proposed in this brief. The proposed method is the first integration that collated both the prime factor algorithm (PFA) and the ...
- articleJanuary 2007
Novel design and analysis procedures for differential-based filters on silicon: Research Articles
- Sébastien Darfeuille,
- Julien Lintignat,
- Zoheir Sassi,
- Bruno Barelaud,
- Laurent Billonnet,
- Bernard Jarry,
- Hervé Marie,
- Philippe Meunier,
- Patrice Gamand
International Journal of RF and Microwave Computer-Aided Engineering (RFMCE), Volume 17, Issue 1January 2007, Pages 49–55In this paper, we present the design and realization of active recursive filters on Silicon employing differential circuits. A noise analysis method dedicated to the optimization of differential circuits is also introduced. © 2006 Wiley Periodicals, ...
- articleDecember 2006
Improving Deriche-style Recursive Gaussian Filters
Journal of Mathematical Imaging and Vision (JMIV), Volume 26, Issue 3December 2006, Pages 293–299https://doi.org/10.1007/s10851-006-8464-zGaussian smoothing filters and Gaussian derivative filters can be estimated by recursive IIR filters, as shown by Deriche [3, 4]. The design of those filters does, however, not enforce the important property that derivative filters should have an ...
- articleJanuary 2004
Construction of semi-recursive PR-filter banks via generalised lifting
Signal Processing (SIGN), Volume 84, Issue 1January 2004, Pages 77–93https://doi.org/10.1016/j.sigpro.2003.07.016Two-channel filter banks with perfect reconstruction (PR) are used in different applications. Growing attention is paid to them, especially in relation to the discrete wavelet transformation. Typically, such filter banks consist of a combination of ...
- articleJanuary 2003
A comparison of evolutionary algorithms for tracking time-varying recursive systems
EURASIP Journal on Advances in Signal Processing (JASP), Volume 2003January 2003, Pages 834–840https://doi.org/10.1155/S1110865703303117A comparison is made of the behaviour of some evolutionary algorithms in time-varying adaptive recursive filter systems. Simulations show that an algorithm including random immigrants outperforms a more conventional algorithm using the breeder genetic ...
- articleFebruary 2002
Robust motion estimation using spatial Gabor-like filters
Signal Processing (SIGN), Volume 82, Issue 2February 2002, Pages 297–309https://doi.org/10.1016/S0165-1684(01)00188-8This paper presents a new algorithm for motion estimation. It combines Gabor-like filter decomposition and robust least-squares estimation in a multiresolution framework. The spatial Gabor-like filter bank, based on recursive implementation, provides a ...
- ArticleJune 1996
Distributed arithmetic-based architectures for high speed IIR filter design
ICPADS '96: Proceedings of the 1996 International Conference on Parallel and Distributed SystemsJune 1996, Page 156Dedicated VLSI has been considered as an effective method to realize the DSP algorithms which require massive amount of computations. To speed up the computing, parallel processing and pipelining techniques are often employed. However, for those ...
- ArticleNovember 1995
Fast LoG filtering using recursive filters
ISCV '95: Proceedings of the International Symposium on Computer VisionNovember 1995, Page 133Marr and Hildreth's theory of LoG filtering with multiple scales has been extensively elaborated. One problem with LoG filtering is that it is very time-consuming, especially with a large size of filters. This paper presents a recursive convolution ...
- ArticleOctober 1995
Performance analysis and FTF version of the generalized sliding window recursive least-squares (GSWRLS) algorithm
ASILOMAR '95: Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)October 1995, Page 685We derive a new RLS algorithm: the generalized sliding window RLS (GSWRLS) algorithm and its fast numerically stabilized version: the GSW SFTF algorithm. The generalised window used consists of an exponential decay with base /spl lambda/ for the first L ...
- ArticleOctober 1995
Design of stable 3-dimensional recursive digital filters
ASILOMAR '95: Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)October 1995, Page 1011In this paper a method of generating 3-variable strictly Hurwitz polynomials (SHPs) and very strictly Hurwitz polynomials (VSHPs) by using the properties of positive definite matrices and a resistive matrix is presented. It is shown that the derived 3-...
- ArticleOctober 1995
Estimating cardiac motion from image sequences using recursive comb filtering
ICIP '95: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2October 1995, Page 2496A framework for temporal analysis of left ventricular (LV) endocardial wall motion is presented. This approach uses harmonic estimation to model the periodic nature of cardiac motion. A method for flow vector computation is presented which defines a ...
- ArticleOctober 1995
Thin nets and crest lines: application to satellite data and medical images
ICIP '95: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2October 1995, Page 2468We describe a new approach for extracting crest lines and thin nets. The key point of our approach is to model thin nets as the crest lines of the image surface. Crest lines are the lines where one of the two principal curvatures is locally extremal. We ...