Title :
Scaling theorems for zero-crossings
Author :
Wu, Lide ; Xie, Zhaohui
Author_Institution :
Dept. of Comput. Sci., Fudan Univ., Shanghai, China
fDate :
1/1/1990 12:00:00 AM
Abstract :
Two scaling theorems are given. Instead of delta functions, polynomial functions are used as input. The advantages are twofold: the smoothness conditions on kernels are not required, so that kernels of the form e-k|X| can be included; the proofs are based on calculus completely and so can be more easily understood
Keywords :
pattern recognition; polynomials; pattern recognition; polynomial functions; scaling theorems; smoothness conditions; zero-crossings; Calculus; Computer science; Computer vision; Detectors; Filters; Hydrogen; Image edge detection; Kernel; Laplace equations; Polynomials;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
