Image Processing with Pyramidal-Recursive Structures

Abstract

Chapter 5 is devoted to the processing of images represented by pyramidal-recursive structures. The primary purpose of this chapter is to show that various operations with images may be performed not based on their initial description, but by considering the hierarchical data structure. This enables showing that many algorithms of image processing, based on a pyramidal-recursive representation, have a complexity that depends on the number of structure nodes M rather than on the number of pixels of the initial image N. As follows from the previous chapter, M is 2–8 times less than N for greyscale images, and 5–40 times less for binary images, depending on the class and complexity of the image processed. This results in a considerable reduction of computational expenditure as compared with traditional algorithms.