Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Memos (1959 - 2004)
  5. Fingerprints Theorems for Zero-Crossings

Fingerprints Theorems for Zero-Crossings

Thumbnail Image
Download
Name

AIM-730.pdf

Size

3.28 MB

Format

Adobe PDF

Checksum (MD5)

267ea0bae99960651a69913ed81c77b3

Thumbnail Image
Download
Name

AIM-730.ps

Size

4.19 MB

Format

PostScript

Checksum (MD5)

41b646678d9edf9caab52b699a2c40ef

Author(s)
Yuille, A.L.
•
Poggio, Tomaso A
Date Issued
October 1, 1983
Series/Report no.
AIM-730
Abstract
We prove that the scale map of the zero-crossings of almost all signals filtered by the second derivative of a gaussian of variable size determines the signal uniquely, up to a constant scaling and a harmonic function. Our proof provides a method for reconstructing almost all signals from knowledge of how the zero-crossing contours of the signal, filtered by a gaussian filter, change with the size of the filter. The proof assumes that the filtered signal can be represented as a polynomial of finite, albeit possibly very high, order. An argument suggests that this restriction is not essential. Stability of the reconstruction scheme is briefly discussed. The result applies to zero- and level-crossings of linear differential operators of gaussian filters. The theorem is extended to two dimensions, that is to images. These results are reminiscent of Logan's theorem. They imply that extrema of derivatives at different scales are a complete representation of a signal.
Persistent DSpace Link
http://hdl.handle.net/1721.1/6390
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.