Scaling theorems for zero-crossings
Lide Wu
Zhaohui Xie
Dept. of Comput. Sci., Fudan Univ., Shanghai;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Jan 1990
Volume: 12,
Issue: 1
On page(s): 46-54
ISSN: 0162-8828
References Cited: 6
CODEN: ITPIDJ
INSPEC Accession Number: 3606840
Digital Object Identifier: 10.1109/34.41383
Current Version Published: 2002-08-06
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
