Published June 21, 1994 | Version public
Book Section - Chapter Open

X-Y separable pyramid steerable scalable kernels

Abstract

A new method for generating X-Y separable, steerable, scalable approximations of filter kernels is proposed which is based on a generalization of the singular value decomposition (SVD) to three dimensions. This "pseudo-SVD" improves upon a previous scheme due to Perona (1992) in that it reduces convolution time and storage requirements. An adaptation of the pseudo-SVD is proposed to generate steerable and scalable kernels which are suitable for use with a Laplacian pyramid. The properties of this method are illustrated experimentally in generating steerable and scalable approximations to an early vision edge-detection kernel.

Additional Information

© Copyright 1994 IEEE. The authors wish to acknowledge the following people: Mike Burl for his suggestions and work regarding the pyramid scheme; Thomas Leung for debugging the matlab code and helping with implementation; Jan de Leeuw and Steve Breiner for pointing out previous work done on 3D tensor decomposition.

Files

SHYcvpr94.pdf

Files (786.4 kB)

Name Size Download all
md5:975dc936daff98eaf6495833baf62b56
786.4 kB Preview Download

Additional details

Identifiers

Eprint ID
3438
Resolver ID
CaltechAUTHORS:SHYcvpr94

Dates

Created
2006-06-07
Created from EPrint's datestamp field
Updated
2021-11-08
Created from EPrint's last_modified field