Hierarchical SVD-based image decomposition with tree structure

This work is devoted to one new approach for decomposition of images represented by matrices of size 2n × 2n or 3n × 3n, based on the multiple application of the singular value decomposition (SVD) over image blocks of relatively small size (2 × 2 or 3 × 3), obtained after division of the original image matrix. The new decomposition, called hierarchical singular value decomposition (?SVD), has tree structure of the kind binary or three nodes tree of n hierarchical levels. Its basic advantages over the famous SVD are: the reduced computational complexity, the opportunity for parallel and recursive processing of the image blocks, based on relatively simple algebraic relations, the high concentration of the image energy in the first decomposition components, and the ability to accelerate the calculations through cutting off the tree branches in the decomposition levels, where the corresponding eigenvalues are very small. The HSVD algorithm is generalised for images of unspecified size. The offered decomposition opens new opportunities for fast image processing in various application areas: image compression, filtering, segmentation, merging, digital watermarking, dimensionality reduction, etc. Copyright © 2015 Inderscience Enterprises Ltd.