Change search
ReferencesLink to record
Permanent link

Direct link
On the Construction of a Scale-Space for Discrete Images
KTH, School of Computer Science and Communication (CSC), Computational Biology, CB.ORCID iD: 0000-0002-9081-2170
1988 (English)Report (Other academic)
Abstract [en]

In this paper we address the formulation of a scale-space theory for discrete images. We denote a one-dimensional kernel a scale-space kernel if it reduces the number of local extrema and discuss which discrete kernels are possible scale-space kernels. Unimodality and positivity properties are shown to hold for such kernels as well as their Fourier transforms. An explicit expression characterizing all discrete scale-space kernels is given.

We propose that there is only one reasonable way to define a scale-space family of images L(x; t) for a one-dimensional discrete signal f(x) namely by convolution with the family of discrete kernels T(n; t) = e^(-t) I_nt(t) where I_n is the modified Bessel function of order n.

With this representation, comprising a continuous scale parameter, we are no longer restricted to specific predetermined levels of scale. Further, T(n; t) appears naturally in the solution of a discretized version of the heat equation, both in one and two dimensions.

The family T(n; t) (t >= 0) is the only one-parameter family of discrete symmetric shift-invariant kernels satisfying both necessary scale-space requirements and the semigroup property T(n; s) * T(n; t) = T(n; s+t). Similar arguments applied in the continuous case uniquely lead to the family of Gaussian kernels.

The commonly adapted technique with a sampled Gaussian produces undesirable effects. It is shown that scale-space violations might occur in the family of functions generated by convolution with the sampled Gaussian kernel. The result exemplifies that properties derived in the continuous case might be violated after discretization.

A discussion about the numerical implementation is performed and an algorithm generating the filter coefficients is supplied.

Place, publisher, year, edition, pages
KTH Royal Institute of Technology, 1988. , 51 p.
National Category
Computer Science Computer Vision and Robotics (Autonomous Systems) Mathematics
URN: urn:nbn:se:kth:diva-58947OAI: diva2:474472

QC 20150616

Available from: 2012-01-09 Created: 2012-01-09 Last updated: 2015-06-16Bibliographically approved

Open Access in DiVA

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

Search in DiVA

By author/editor
Lindeberg, Tony
By organisation
Computational Biology, CB
Computer ScienceComputer Vision and Robotics (Autonomous Systems)Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 38 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

Total: 294 hits
ReferencesLink to record
Permanent link

Direct link