Three‐dimensional separate descendant‐based SPIHT algorithm for fast compression of high‐resolution medical image sequences. Issue 1 (1st January 2017)

• Record Type: Journal Article
• Authors: Song, Xiaoying; Huang, Qijun; Chang, Sheng; He, Jin; Wang, Hao
• Is Part Of: IET image processing. Volume 11:Issue 1(2017)
• Page Start: 80
• Page End: 87
• Publication Date: 2017-01-01
• Subjects: medical image processing -- image coding -- data compression -- image sequences -- trees (mathematics) -- wavelet transforms -- image scanners; three‐dimensional separate descendant based SPIRT algorithm -- high‐resolution medical image sequence -- image compression algorithm -- 3D SBD set partitioning in hierarchical tree algorithm -- 3D integer wavelet transform -- spatial‐temporal tree structure -- fast image coding scheme -- offspring set -- leaves set; Image processing -- Periodicals; 621.36705
• DOI: 10.1049/iet-ipr.2016.0564
• Languages: English
• ISSNs: 1751-9659

Abstract

Abstract : To provide a fast compression algorithm for high‐resolution medical image sequences, an efficient three‐dimensional (3D) separate descendant‐based (SBD) set partitioning in hierarchical trees (SPIHT) algorithm (3D SDB‐SPIHT) is proposed in this study. To accelerate the transformation, 3D integer wavelet transform is used first. Based on an efficient spatial–temporal tree structure, which is designed for the transformed coefficients, the authors propose a fast coding scheme by separating the descendant set into offspring set and leaves set. The proposed algorithm has more selectivity in deciding the scanning and coding of the descendant sets and hence the coding time is accelerated. Experimental results demonstrate that 3D SDB‐SPIHT compresses medical images faster compared with traditional 3D SPIHT and other variations of 3D SPIHT.