NDLI: Radix-(2×2) Hierarchical SVD for multi-dimensional images

Content Provider	IEEE Xplore Digital Library
Author	Kountchev, R. Kountcheva, R.
Copyright Year	2015
Description	Author affiliation: T&K Eng., Sofia, Bulgaria (Kountcheva, R.) \|\| Fac. of Radio Commun. & Video Technol., Tech. Univ. of Sofia, Sofia, Bulgaria (Kountchev, R.)
Abstract	The processing of multi-dimensional images is of high importance in contemporary communication and information technologies. It requires significant computational resources, and is an object of large number of scientific investigations. One of the most efficient methods used, is the well-known Singular Value Decomposition (SVD), which permits the achievement of high compression together with significant reduction of the features' space, used for objects recognition. The main problem with the SVD is its high computational complexity. One approach to overcome the problem is presented in this paper. It is based on new decomposition for multi-dimensional images, which are treated as sequences of single high-correlated images through the so-called radix-(2×2) Hierarchical SVD (HSVD) algorithm. In correspondence with this approach, the multi-dimensional image is represented as a third-order tensor, divided into sub-tensors of size 2×2×2, called kernels. Each kernel is decomposed through Hierarchical SVD, based on the SVD for matrices of size 2×2, binary two-level tree and rearrangement of the components in each level. After kernel unfolding are obtained 2 matrices of size 2×2 and on each is applies SVD, calculated by using simple mathematical relations. In the paper is given a HSVD algorithm for a matrix of size 4×4, whose computational structure is described as a binary two-level tree. Same algorithm is used for the tensor decomposition of size 4×4×4. The decomposition is generalized for tensors of size N×N×N for N=2n>4. The computational complexity of the algorithm is evaluated and compared to that of the iterative SVD. The basic advantages of the new approach are the low computational complexity and the tree-like structure of the algorithm, which permits the low-energy leaves to be cut-off through threshold-based selection. As a result, the new algorithm is suitable for parallel processing of multi-dimensional images.
Starting Page	45
Ending Page	55
File Size	561205
Page Count	11
File Format	PDF
ISBN	9781467375153
e-ISBN	9781467375160
DOI	10.1109/TELSKS.2015.7357735
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-10-14
Publisher Place	Serbia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Tensile stress Matrix decomposition Symmetric matrices Algorithm design and analysis Image coding Approximation methods Computational complexity Computational complexity of algorithm Multi-dimensional images Singular value decomposition Hierarchical singular value decomposition of tensors Radix-(2×2) hierarchical SVD
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Geometric structure of sum-of-rank-1 decompositions for n-dimensional order-p symmetric tensors

Adaptive Multilinear SVD for Structured Tensors

A Framework to Design Novel SVD Based Color Image Compression

Kronecker product approximation for preconditioning in three-dimensional imaging applications

2-Dimensional Singular Value Decomposition for 2D Maps and Images

Hierarchical singular value decomposition of tensors

Efficient and Accurate Rectangular Window Subspace Tracking

Singular Value Decomposition Watermarking Method for Medical Image

2-Dimensional singular value decomposition for 2D maps and images (2005)

Radix-(2×2) Hierarchical SVD for multi-dimensional images

Similar Documents

Geometric structure of sum-of-rank-1 decompositions for n-dimensional order-p symmetric tensors

Adaptive Multilinear SVD for Structured Tensors

A Framework to Design Novel SVD Based Color Image Compression

Kronecker product approximation for preconditioning in three-dimensional imaging applications

2-Dimensional Singular Value Decomposition for 2D Maps and Images

Hierarchical singular value decomposition of tensors

Efficient and Accurate Rectangular Window Subspace Tracking

Singular Value Decomposition Watermarking Method for Medical Image

2-Dimensional singular value decomposition for 2D maps and images (2005)

Radix-(2×2) Hierarchical SVD for multi-dimensional images