检索结果-内蒙古大学图书馆

New high-fidelity medical image compression based on modified set partitioning in hierarchical trees

OPTICAL ENGINEERING 2003年第7期42卷 1956-1963页

作者： Tal, SC Chen, YY Yan, WC Natl Cheng Kung Univ Inst Elect Engn Tainan Taiwan

Medical images must be compressed before transmission due to bandwidth and storage limitations. The set partitioning in hierarchical trees (SPIHT) algorithm is an efficient method for lossy and lossless coding of medical images. We propose some modifications to the SPIHT algorithm. It is based on the idea of the insignificant correlation of wavelet coefficients among medium- and high-frequency subbands. In this scheme, insignificant wavelet coefficients that correspond to the same spatial location in the medium subbands can be used to reduce the redundancy by a combined function proposed in associated with the modified SPIHT. In high-frequency subbands, the modified SPIHT proposes a dictator to reduce the interband redundancy. Experimental results indicate that the proposed technique improves the quality of the reconstructed medical image in terms of both the peak signal-to-noise ratio (PSNR) and the perceptual results over JPEG2000 and the original SPIHT at the same bit rate. (C) 2003 Society of Photo-Optical Instrumentation Engineers.

关键词： set partitioning in hierarchical trees JPEG2000

来源：评论

学校读者我要写书评

暂无评论

Advancements in Lossless and Reversible Compression of Digital Pathology Images via Auto-Recursive set partitioning in hierarchical trees and Wavelet Decomposition

引用

TRAITEMENT DU SIGNAL 2023年第6期40卷 2723-2730页

作者： Yuan, Goh Jee Adam, Afzan Hasan, Mohammad Kamrul Alyasseri, Zaid Abdi Alkareem Fauzi, Mohammad Faizal Ahmad Chan, Elaine Wan Ling Univ Kebangsaan Malaysia Fac Informat Sci & Technol Ctr Artificial Intelligence Technol Bangi 43300 Malaysia Univ Kufa Informat Technol Res & Dev Ctr Kufa Iraq Univ Warith Al Anbiyaa Coll Engn Karbala Iraq Multimedia Univ Fac Engn Jalan Multimedia Cyberjaya 63100 Selangor Malaysia Int Med Univ Inst Res Dev & Innovat Kuala Lumpur 57000 Malaysia

set partitioning in hierarchical trees (SPIHT) represents a leading-edge algorithm in nearlossless image compression, leveraging the Discrete Wavelet Transform. However, its effectiveness diminishes when applied to high-resolution images such as Digital Pathology Images (DPIs). This research aims to enhance the SPIHT algorithm specifically for DPIs by investigating the impact of applying various wavelets in the wavelet decomposition process and the introduction of auto-recursion in the SPIHT algorithm. An extensive selection of wavelet types were tested within the wavelet decomposition process integral to the SPIHT algorithm. The ultimate goal was to identify the wavelet that yields the highest compression ratio and the one that maintains the highest data consistency. The proposed auto-recursion was also examined against the original n-recursive algorithm to discern differences in compression performance. The results indicated that the BIOR 5.5 wavelet is more apt for achieving a high compression ratio, while the BIOR 3.9 wavelet is more suitable for securing high compression quality in the compression of high-resolution DPIs. The newly introduced auto-recursion feature contributes significantly to optimizing the quality of the compressed image. Visual verification of the compressed image's quality, for any potential loss of detail, was carried out through expert validation in a clinical setting. This expert validation confirmed that the proposed algorithm can produce higher quality compressed images with negligible loss of quality. Thus, this research offers a partial solution to current challenges in digital pathology related to storage, transfer, and archiving of high-resolution DPIs, by providing a more effective compression algorithm.

关键词： image compression set partitioning in hierarchical trees digital pathology high resolution image

来源：评论

学校读者我要写书评

暂无评论

Modified set partitioning in hierarchical trees algorithm based on hierarchical subbands

引用

JOURNAL OF ELECTRONIC IMAGING 2015年第3期24卷 033004-033004页

作者： Ochoa Dominguez, Humberto de J. Vergara Villegas, Osslan O. Cruz Sanchez, Vianey G. Univ Autonoma Ciudad Juarez Signal Proc Grp Elect & Comp Engn Dept Ciudad Juarez 32310 Chihuahua Mexico

This paper introduces a modified set partitioning in hierarchical trees (SPIHT) algorithm that reduces the number of comparison operations and, consequently, the execution time needed to encode an image as compared to the SPIHT algorithm. The threshold of each independent subband is calculated after applying the discrete wavelet transform to the image. Scanning of the sets inside the subbands is determined by the magnitude of the thresholds that establishes a hierarchical scanning not only for the set of coefficients with larger magnitude, but also for the subbands. The algorithm uses the set partitioning technique to sort the transform coefficients. Results show that the modified SPIHT significantly reduces the number of operations and the execution time without sacrificing visual quality and the PSNR of the recovered image. (C) The Authors.

关键词： image coding transform coding image processing embedded coding set partitioning in hierarchical trees

来源：评论

学校读者我要写书评

暂无评论

Low bit rate image compression core for onboard space applications

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2006年第1期16卷 114-128页

作者： Corsonello, P Perri, S Staino, G Lanuzza, M Cocorullo, G Univ Calabria Dept Elect Comp Sci & Syst I-87036 Arcavacata Di Rende CS Italy

This paper presents low-cost, purpose optimized discrete wavelet transform-based image compressors for future space-crafts and microsatellites. The hardware solution proposed here exploits a modified set partitioning in hierarchical trees algorithm and ensures that appropriate reconstructed image qualities can be achieved also for compression ratios over 100:1. Several implementations are presented varying the parallelism level and the tile size. Obtained results demonstrate that, using a parallel implementation operating on a 64 x 64 size tile, a maximum data rate of about 18 Mpixels/s can be sustained. In this case, only 4500 slices and 24 BlockRAMs of a XILINX Virtex II device are required.

关键词： field programmable gate arrays (FPGAs) image coding set partitioning in hierarchical trees wavelet transform

来源：评论

学校读者我要写书评

暂无评论

New approach based on Shapiro's embedded zero-tree wavelet algorithm for image compression

引用

OPTICAL ENGINEERING 2007年第7期46卷

作者： Ouafi, Abdelkrim Baarir, Zine-Eddine Taleb-Ahmed, Abdelmalik Doghmane, Noureddine Zitouni, Athmane Univ Mohamed Khider Dept Elect Mexico City 07000 DF Mexico Image Appl LESIA Lab Experts Syst Mexico City 07000 DF Mexico Univ Valenciennes & Hainaut Cambresis Res Lab F-59313 Le Mt Houy 9 Valenciennes France CNRS UMR 8530 LAMIH F-59313 Le Mt Houy 9 Valenciennes France Univ Annaba Fac Engn Sci Dept Elect Annaga 23000 Algeria

We propose a new approach to image compression based on the principle of Shapiro's embedded zero-tree wavelet (EZW) algorithm. Our approach, the efficient EZW (E-EZW), uses six symbols instead of the four used in the original Shapiro's algorithm to minimize the redundant symbols, and optimizes the coding by binary regrouping of the information. This approach can produce results that have a significant improvement over the peak signal-to-noise ratio and compression ratio obtained by Shapiro without affecting the computing time. These results are also comparable to those obtained using the set partitioning in hierarchical trees (SPIHT), set partitioning embedded block (SPECK), and JPEG2000 algorithms. (c) 2007 Society of Photo-Optical Instrumentation Engineers.

关键词： image compression Shapiro's embedded zero-tree wavelet algorithm efficient embedded zero-tree wavelet entropy coding peak signal-to-noise ratio compression ratio set partitioning in hierarchical trees set partitioning embedded block JPEG2000

来源：评论

学校读者我要写书评

暂无评论

A Speed- and Power-Efficient SPIHT Design for Wearable Quality-On-Demand ECG Applications

引用

IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS 2018年第5期22卷 1456-1465页

作者： Hsieh, Jui-Hung Hung, King-Chu Lin, Yu-Ling Shih, Meng-Ju Natl Kaohsiung First Univ Sci & Technol Dept Comp & Commun Engn Kaohsiung 824 Taiwan Natl Chiao Tung Univ Dept Biol Sci & Technol Hsinchu 300 Taiwan

In this paper, a speed and power-efficient set partitioning in hierarchical trees (SPIHT) design is introduced for one-dimensional (1-D) wavelet-based electrocardiography (ECG) compression systems with quality guarantee. To achieve real-time and low-power design objectives toward wearable quality-on-demand (QoD) ECG applications, we first propose a coding-time-and computation-efficient SPIHT algorithm using various types of coding status register files to overcome the disadvantages of low coding speeds and complicated hardware architectures characterizing prior SPIHT algorithms resulting from the necessity of dynamic computation and arrangement in the sorting and refinement processing phase. Second, a highly pipelined and power-efficient very large scale integration (VLSI) architecture is developed to implement a high-performance and low-power SPIHT design based on the proposed algorithm. The final simulation results demonstrate that our proposed algorithm can speed up the average coding time 1.52 to 2.74 times compared to prior work with an identical compression ratio for an 11-level 1024 x 1 1 - D discrete wavelet transform at diverse target percentage root-mean-square differences (PRDT) on various MIT-BIH arrhythmia datasets. Applied to wearable wavelet-based QoD ECG applications, our proposed VLSI architecture attains a working frequency of 740 MHz and consumes an average of 23 mu W of power with Taiwan Semiconductor Manufacturing Company 90-nm CMOS technology, which shows the effectiveness of speed and power over the state-of-the-art designs.

关键词： set partitioning in hierarchical trees ECG low-power design wearable device

来源：评论

学校读者我要写书评

暂无评论

Joint watermarking and encryption for still visual data

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2013年第3期67卷 593-606页

作者： Taneja, Nidhi Bhatnagar, Gaurav Raman, Balasubramanian Gupta, Indra Indian Inst Technol Dept Elect Engn Roorkee 247667 Uttar Pradesh India Univ Windsor Dept Elect & Comp Engn Windsor ON N9B 3P4 Canada Indian Inst Technol Dept Math Roorkee 247667 Uttar Pradesh India

Joint watermarking and encryption is an upcoming security solution that combines leading but complementary techniques to achieve an enhanced security level. Real time applications using joint watermarking and encryption framework has three requirements: data to be efficiently compressed, watermarking technique to sustain compression, and encryption technique to be developed in a way so as not to disturb the compression efficiency. Finding an optimal solution that combines the three techniques while fulfilling these requirements is a challenging problem. This paper thus, proposes a wavelet domain based joint watermarking and encryption framework that employs singular value decomposition based watermark embedding and sign bit encryption prior to compression. The varying significance of different subbands has been considered to encrypt the data without adversely effecting the compression ratio. Experimental analysis using various evaluation parameters and attack scenarios has revealed the ability of the proposed framework to prove content-ownership, even from the encrypted data. Comparative analysis with the existing techniques reflect its ability to provide better security with less computational resources. This makes it a preferable solution for data security at all stages of data archival, transmission or distribution.

关键词： Joint watermarking and encryption Singular value decomposition set partitioning in hierarchical trees

来源：评论

学校读者我要写书评

暂无评论

Degradative encryption: An efficient way to protect SPIHT compressed images

引用

OPTICS COMMUNICATIONS 2012年第24期285卷 4891-4900页

作者： Xiang, Tao Qu, Jinyu Yu, Chenyun Fu, Xinwen Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Univ Massachusetts Dept Comp Sci Lowell MA 01854 USA

Degradative encryption, a new selective image encryption paradigm, is proposed to encrypt only a small part of image data to make the detail blurred but keep the skeleton discernible. The efficiency is further optimized by combining compression and encryption. A format-compliant degradative encryption algorithm based on set partitioning in hierarchical trees (SPIHT) is then proposed, and the scheme is designed to work in progressive mode for gaining a tradeoff between efficiency and security. Extensive experiments are conducted to evaluate the strength and efficiency of the scheme, and it is found that less than 10% data need to be encrypted for a secure degradation. In security analysis, the scheme is verified to be immune to cryptographic attacks as well as those adversaries utilizing image processing techniques. The scheme can find its wide applications in online try-and-buy service on mobile devices, searchable multimedia encryption in cloud computing, etc. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Selective encryption Degradative encryption set partitioning in hierarchical trees Joint compression and encryption

来源：评论

学校读者我要写书评

暂无评论

A novel hardware-efficient spatial orientation tree-based image compression algorithm and its field programmable gate array implementation

引用

TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES 2019年第5期27卷 3823-3836页

作者： Lone, Mohd Rafi Hakim, Najeeb-ud-Din Natl Inst Technol Dept Elect & Commun Srinagar Jammu & Kashmir India

set partitioning in hierarchical trees (SPIHT) has become a popular research topic for more than a decade now. This is because it is simple, besides having compression efficiency close to the state-of-the-art JPEG2000 standard. The main drawback of SPIHT is that it uses three lists to store addresses of coefficients during its operation. These lists are dynamic and in worst cases need to store more number of addresses than total coefficients. In this work, a novel hardware-efficient spatial orientation tree-based algorithm is proposed and its hardware implementation is carried out. The wavelet transformed image is partitioned into 2 x 2 blocks. Each node of spatial orientation tree (SOT) represent a block of coefficients, rather than a single coefficient. Two small state-tables are used in this algorithm to store the status of each block. In addition to this, two extremely small lists are used to store the node addresses of a single SOT tree. To store the state-tables and lists for 512 x 512 image, only 0.88% of the memory needed by SPIHT is required for five levels of dyadic decomposition. The peak-signal-to-noise ratio (PSNR) gain of 0.1 dB to 0.3 dB at low bit rates (below 1 bpp) and 0.6 dB to 1.2 dB at high bit rates (above 1.75 bpp) in comparison to SPIHT is observed for test image Lena. A field programmable gate array (FPGA) implementation targeted for Xilinx Zynq Z-7020 is presented in the paper. The proposed architecture saves 90% of the FPGA area used by SPIHT. The hardware efficiency of the proposed architecture is better in comparison to different existing architectures.

关键词： Image compression set partitioning in hierarchical trees discrete wavelet transform progressive image coding spatial orientation tree

来源：评论

学校读者我要写书评

暂无评论

Joint SPIHT compression and selective encryption

引用

APPLIED SOFT COMPUTING 2014年 21卷 159-170页

作者： Xiang, Tao Qu, Jinyu Xiao, Di Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China

JCSE-SPIHT, an algorithm of joint compression and selective encryption based on set partitioning in hierarchical trees (SPIHT), is proposed to achieve image encryption and compression simultaneously. It can protect SPIHT compressed images by only fast scrambling a tiny portion of crucial data during the coding process while keeping all the virtues of SPIHT intact. Intensive experiments are conducted to validate and evaluate the proposed algorithm;the results show that the efficiency and the compression performance of JCSE-SPIHT are very close to original SPIHT. In security analysis, JCSE-SPIHT is proved to be immune to various attacks not only from traditional cryptanalysis, but also by utilizing sophisticated image processing techniques. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Selective encryption Joint compression and encryption set partitioning in hierarchical trees

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：