Related Experiment Video
Updated: Aug 20, 2026

Motion-Acuity Test for Visual Field Acuity Measurement with Motion-Defined Shapes
Published on: February 23, 2024
Computationally efficient wavelet affine invariant functions for shape recognition
1Department of Electrical and Computer Engineering, University of Delaware, Newark, DE 19716, USA. erdem@udel.edu
Abstract:
An affine invariant function for object recognition is constructed from wavelet coefficients of the object boundary. In previous works, undecimated dyadic wavelet transform was used to construct affine invariant functions. In this paper, an algorithm based on decimated wavelet transform is developed to compute an affine invariant function. As a result computational complexity is reduced without decreasing recognition performance. Experimental results are presented.
Related Concept Videos
Transformations of Functions III
Convolution: Math, Graphics, and Discrete Signals
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
Properties of Fourier series II
A function f(t) is...
Convolution Properties I
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
Convolution Properties II
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
Transformations of Functions II