Issue No. 01 - January (1990 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.41383
<p>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/sup -k mod X mod / can be included; the proofs are based on calculus completely and so can be more easily understood.</p>
pattern recognition; scaling theorems; zero-crossings; polynomial functions; smoothness conditions; pattern recognition; polynomials
Z. Xie and L. Wu, "Scaling Theorems for Zero-Crossings," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 12, no. , pp. 46-54, 1990.