Abstract
When building a representation like the scale-space primal sketch, several computational aspects must be considered. Algorithms are needed for smoothing grey-level images, detecting grey-level blobs in smoothed grey-level images, registering bifurcations, linking grey-level blobs across scales into scale-space blobs, and computing the scale-space blob volumes. In this chapter how this can be done will be briefly described. Before starting, it should be remarked that some algorithmic descriptions will, by necessity, be somewhat technical. Therefore, the reader is recommended to keep the overview description from chapter 7 in mind when penetrating this material. It should also be emphasized that, although the treatment deals mainly with the two-dimensional case, the ideas behind it are general and can (with appropriate modifications) be applied both in lower and higher dimensions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Lindeberg, T. (1994). Algorithm for computing the scale-space primal sketch. In: Scale-Space Theory in Computer Vision. The Springer International Series in Engineering and Computer Science, vol 256. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6465-9_9
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6465-9_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5139-7
Online ISBN: 978-1-4757-6465-9
eBook Packages: Springer Book Archive