• DocumentCode
    755538
  • Title

    Scaling theorems for zero-crossings

  • Author

    Wu, Lide ; Xie, Zhaohui

  • Author_Institution
    Dept. of Comput. Sci., Fudan Univ., Shanghai, China
  • Volume
    12
  • Issue
    1
  • fYear
    1990
  • fDate
    1/1/1990 12:00:00 AM
  • Firstpage
    46
  • Lastpage
    54
  • 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;
  • fLanguage
    English
  • Journal_Title
    Pattern Analysis and Machine Intelligence, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0162-8828
  • Type

    jour

  • DOI
    10.1109/34.41383
  • Filename
    41383
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=755538