Title :
Deformable kernels for early vision
Abstract :
A technique is presented that allows (1) computing the best approximation of a given family using linear combinations of a small number of basis functions; and (2) describing all finite-dimensional families, i.e. the families of filters for which a finite-dimensional representation is possible with no error. The technique is general and can be applied to generating filters in arbitrary dimensions. Experimental results that demonstrate the applicability of the technique to generating multi-orientation multiscale 2-D edge-detection kernels are presented. The implementation issues are also discussed
Keywords :
computer vision; computerised pattern recognition; computerised picture processing; arbitrary dimensions; basis functions; best approximation; deformable kernels; early vision; finite-dimensional families; finite-dimensional representation; multiscale 2-D edge-detection kernels; Anisotropic magnetoresistance; Convolution; Frequency; Information filtering; Information filters; Interpolation; Kernel; Laboratories; Nonlinear filters; Signal processing algorithms;
Conference_Titel :
Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on
Conference_Location :
Maui, HI
Print_ISBN :
0-8186-2148-6
DOI :
10.1109/CVPR.1991.139691