Sciweavers

18 search results - page 3 / 4
» Fast pattern matching using orthogonal Haar transform
Sort
View
AGTIVE
2007
Springer
13 years 12 months ago
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
Gernot Veit Batz, Moritz Kroll, Rubino Geiß
TIT
2008
121views more  TIT 2008»
13 years 5 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut
ICASSP
2009
IEEE
14 years 15 days ago
Benchmarking flexible adaptive time-frequency transforms for underdetermined audio source separation
We have implemented several fast and flexible adaptive lapped orthogonal transform (LOT) schemes for underdetermined audio source separation. This is generally addressed by time-...
Andrew Nesbit, Emmanuel Vincent, Mark D. Plumbley
ICIP
2001
IEEE
14 years 7 months ago
Faster template matching without FFT
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...
Kimmo Fredriksson, Esko Ukkonen
IBPRIA
2005
Springer
13 years 11 months ago
An Approach to Vision-Based Person Detection in Robotic Applications
We present an approach to vision-based person detection in robotic applications that integrates top down template matching with bottom up classifiers. We detect components of the ...
Carlos D. Castillo, Carolina Chang