kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Scale-space for discrete signals
KTH, School of Computer Science and Communication (CSC), Computational Biology, CB.ORCID iD: 0000-0002-9081-2170
1990 (English)In: IEEE Transactions on Pattern Analysis and Machine Intelligence, ISSN 0162-8828, E-ISSN 1939-3539, Vol. 12, no 3, p. 234-254Article in journal (Refereed) Published
Abstract [en]

This article addresses the formulation of a scale-space theory for discrete signals. In one dimension it is possible to characterize the smoothing transformations completely and an exhaustive treatment is given, answering the following two main questions:

  • Which linear transformations remove structure in the sense that the number of local extrema (or zero-crossings) in the output signal does not exceed the number of local extrema (or zero-crossings) in the original signal?
  • How should one create a multi-resolution family of representations with the property that a signal at a coarser level of scale never contains more structure than a signal at a finer level of scale?

It is proposed that there is only one reasonable way to define a scale-space for 1D discrete signals comprising a continuous scale parameter, namely by (discrete) convolution with the family of kernels T(n; t) = e^{-t} I_n(t), where I_n are the modified Bessel functions of integer order. Similar arguments applied in the continuous case uniquely lead to the Gaussian kernel.

Some obvious discretizations of the continuous scale-space theory are discussed in view of the results presented. It is shown that the kernel T(n; t) arises naturally in the solution of a discretized version of the diffusion equation. The commonly adapted technique with a sampled Gaussian can lead to undesirable effects since scale-space violations might occur in the corresponding representation. The result exemplifies the fact that properties derived in the continuous case might be violated after discretization.

A two-dimensional theory, showing how the scale-space should be constructed for images, is given based on the requirement that local extrema must not be enhanced, when the scale parameter is increased continuously. In the separable case the resulting scale-space representation can be calculated by separated convolution with the kernel T(n; t).

The presented discrete theory has computational advantages compared to a scale-space implementation based on the sampled Gaussian, for instance concerning the Laplacian of the Gaussian. The main reason is that the discrete nature of the implementation has been taken into account already in the theoretical formulation of the scale-space representation.

Place, publisher, year, edition, pages
IEEE Computer Society, 1990. Vol. 12, no 3, p. 234-254
National Category
Computer Sciences Computer Vision and Robotics (Autonomous Systems) Mathematics Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-58057DOI: 10.1109/34.49051ISI: A1990CP94300002Scopus ID: 2-s2.0-0025398919OAI: oai:DiVA.org:kth-58057DiVA, id: diva2:472968
Note

QC 20130419

Available from: 2013-04-19 Created: 2012-01-04 Last updated: 2024-01-22Bibliographically approved

Open Access in DiVA

fulltext(410 kB)2698 downloads
File information
File name FULLTEXT01.pdfFile size 410 kBChecksum SHA-512
d59ca3927486d03eda08d454718fe962910e1869aa96e3eea2063af4afcd890fd891d8177a1f2a7f47756c7a9ec2053c6b21cf7f83d068113c9c661beda88c64
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusAt author's home pageACM Digital Library

Authority records

Lindeberg, Tony

Search in DiVA

By author/editor
Lindeberg, Tony
By organisation
Computational Biology, CB
In the same journal
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer SciencesComputer Vision and Robotics (Autonomous Systems)MathematicsSignal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 2698 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 3761 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf