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

block truncation image bit plane coding

OPTICAL ENGINEERING 2002年第10期41卷 2476-2478页

作者： Wu, YG Leader Univ Inst Appl Informat Dept Comp Sci & Informat Engn Tainan Taiwan

block truncation coding (BTC) is a successful image compression technique due to its simple and fast computational burden. The bit rate is fixed to 2.0 bits/pixel, whose performance is moderate in terms of compression ratio compared to other compression schemes such as discrete cosine transform (DCT), vector quantization (VQ), wavelet transform coding (WTC), etc. Two kinds of overheads are required for BTC coding: bit plane and quantization values, respectively. A new technique is presented to reduce the bit plane overhead. Conventional bit plane overhead is 1.0 bits/pixel;we decrease it to 0.734 bits/pixel while maintaining the same decoded quality as absolute moment BTC (AMBTC) does for the "Lena" image. Compared to other published bit plane coding strategies, the proposed method outperforms all of the existing methods. (C) 2002 Society of Photo-Optical Instrumentation Engineers.

关键词： block truncation coding bit plane compression coding

来源：评论

学校读者我要写书评

暂无评论

VLSI implementation of image compressor using probabilistic run length coding

引用

EXPERT SYSTEMS 2025年第1期42卷

作者： Boddu, Mahesh Mandal, Soumitra Kumar Maulana Abul Kalam Azad Univ Technol Dept Elect Engn Kolkata India Natl Inst Tech Teachers Training & Res Kolkata Dept Elect Engn Kolkata West Bengal India

Multimedia applications, such as image processing including image and video transfer, heavily rely on reduction. The traditional device methods to picture reduction use more space, energy, and processing time. The majority of current efforts use the Golomb-Rice encoding, due to its larger memory requirement and higher computing difficulty. So, this research concentrated on hardware design-oriented probability run length (PRL) coding technique based on lossless colour image compression. The block truncation coding (BTC) features of the compression process are used by the suggested PRL method. The proposed image compression hardware consists of various modules such as a Parameter calculator, fuzzy table, bitmap generator, BTC parameters training, prediction, and error control, and PRL-based finite state machine (PRL-FSM). The proposed image compressor utilizes the parameter calculator block, which estimates the block type based on the image pixel intensities for each sub-block. Thus, each block of the image is compressed by using a new block type and generates a variable block size. The proposed method utilizes the PRL-BTC encoding method, which also calculates the probability of error between the compressed image to the test image. The process is iterated until the performance trade-off between hardware cost and compression ratio (CR) is achieved. Hence, both smooth regions and non-smooth regions of images are perfectly compressed by the probability-based block selection. The simulation results show that the proposed method resulted in a better area, power, delay metrics, peak signal-to-noise ratio (PSNR), and CR compared to the state of art approaches.

关键词： block truncation coding compression fuzzy logic Golomb-Rice encoder PRL-FSM probabilistic run-length encoding

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Method for Foreground Detection Using Codebook Model

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2011年第6期21卷 804-815页

作者： Guo, Jing-Ming Liu, Yun-Fu Hsia, Chih-Hsien Shih, Min-Hsiung Hsu, Chih-Sheng Natl Taiwan Univ Sci & Technol Taipei 10607 Taiwan

This paper presents a hierarchical scheme with block-based and pixel-based codebooks for foreground detection. The codebook is mainly used to compress information to achieve a high efficient processing speed. In the block-based stage, 12 intensity values are employed to represent a block. The algorithm extends the concept of the block truncation coding, and thus it can further improve the processing efficiency by enjoying its low complexity advantage. In detail, the block-based stage can remove most of the backgrounds without reducing the true positive rate, yet it has low precision. To overcome this problem, the pixel-based stage is adopted to enhance the precision, which also can reduce the false positive rate. Moreover, the short-term information is employed to improve background updating for adaptive environments. As documented in the experimental results, the proposed algorithm can provide superior performance to that of the former related approaches.

关键词： Background subtraction block truncation coding foreground detection shadow detection surveillance

来源：评论

学校读者我要写书评

暂无评论

Improving BTC image compression using a fuzzy complement edge operator

引用

SIGNAL PROCESSING 2008年第12期88卷 2989-2997页

作者： Amarunnishad, T. M. Govindan, V. K. Mathew, Abraham T. Natl Inst Technol Dept Elect Engn Calicut 673601 Kerala India Natl Inst Technol Dept Comp Engn Calicut 673601 Kerala India

A simple and easy to implement technique for improving block truncation coding (BTC) is proposed. The method is based on replacement of bit block obtained using the conventional BTC method with the fuzzy logical bit block (LBB) such that the sample mean and standard deviation in each image block are preserved. This fuzzy LBB is obtained from the fuzzy edge image by using the Yager involutive fuzzy complement edge operator (YIFCEO). The input image is encoded with the block mean and standard deviation and the fuzzy LBB. Experimental results show an improvement of visual quality of reconstructed images and peak signal-to-noise ratio (PSNR) when compared to the conventional BTC. The raggedness and jagged appearance and the ringing artifacts at sharp edges are greatly reduced in the reconstructed images. With the use of YIFCEO, the proposed method is shown to be more flexible to determine the visual quality of the reconstructed images. (C) 2008 Elsevier B.V. All rights reserved.

关键词： block truncation coding fuzzy complement membership function edge image

来源：评论

学校读者我要写书评

暂无评论

An adaptive image steganography using AMBTC compression and interpolation technique

引用

OPTIK 2016年第1期127卷 471-477页

作者： Tang, Mingwei Zeng, Shenke Chen, Xiaoliang Hu, Jie Du, Yajun Xihua Univ Sch Math & Comp Sci Technol Chengdu 610039 Peoples R China Southwest Jiaotong Univ Sch Informat Sci & Technol Chengdu 610031 Peoples R China

It is a hot topic in the design of information hiding algorithm by a combination of compressed technique and interpolation technique in the future. Higher capacity and better image quality are one of the foremost research contents of information hiding. In recent years, an adaptive information hiding has been a hot content of research in the field of information hiding and network security. This paper proposed an adaptive image steganography using absolute moment block truncation coding compression (AMBTC compression) and interpolation technique (ASAI), which can improve the performance of information hiding scheme. The ASAI scheme proposed can offer the benefits of high embedding capacity with low computational complexity and good image quality. The experimental results demonstrate that the proposed ASAI scheme has superior performance than others. (C) 2015 Elsevier GmbH. All rights reserved.

关键词： Steganography Compression technique Interpolation technique High capacity block truncation coding

来源：评论

学校读者我要写书评

暂无评论

Constructions of general (k, n) reversible AMBTC-based visual cryptography with two decryption options

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2017年第Oct.期48卷 182-194页

作者： Yang, Ching-Nung Wu, Xiaotian Chou, Yung-Chien Fu, Zhangjie Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Hualien Taiwan Jinan Univ Dept Comp Sci Guangzhou Guangdong Peoples R China Nanjing Univ Informat Sci & Technol Nanjing Jiangsu Peoples R China Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Beijing Peoples R China

In this paper, a general method of (k, n) threshold Reversible Absolute moment block truncation coding Visual Cryptography Scheme (RAVCS) is introduced for sharing a binary secret image into multiple absolute moment block truncation coding (AMBTC) shadows. A (k, k) RAVCS is firstly proposed to encode a secret by referencing one ABMTC image. Then, the proposed (k, k) RAVCS is adopted to share the same secret into multiple groups of shadows by referencing multiple images. Those multiple groups of shadows are distributed to participants according to a matrix generated by the proposed shadow distribution algorithms. When any k or more participants share their shadows, the secret image is revealed by OR or XOR decryption. Further, those AMBTC shadows can be losslessly reverted to their original forms. Sufficient theoretical analysis and extensive experimental results are provided in this paper, showing the effectiveness and advantages of the proposed method. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Visual cryptography block truncation coding Reversible Meaningful shadows OR decryption XOR decryption

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2012年第4期58卷 1276-1284页

作者： Park, Jincheol Lee, Sanghoon Yonsei Univ Dept Elect & Elect Engn Seoul 120749 South Korea

In order to utilize the liquid crystal display (LCD) overdrive technique, it is necessary to store the previous frame in frame memory and compress the frame to reduce the memory burden, in particular, when the frame size is large. When an image is displayed in the LCD, the motion blur mainly occurs near the edge, so that structural information is very important when compressing the image. Recently, a structural similarity (SSIM) index has been proposed to measure the quality based on the image structure. In this paper, we propose an image compression and adaptive mode selection algorithm for maximizing the SSIM performance. In the simulation results, we compare our results with conventional schemes and demonstrate that the SSIM based scheme provides a significant performance improvement.(1)

关键词： LCD overdrive technique overdrive block truncation coding structural similarity variable block size

来源：评论

学校读者我要写书评

暂无评论

Reversible self-verifying and self-recovering technique for color image demosaicking

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2021年第16期80卷 24949-24968页

作者： Lin, Yu-Hsiu Hu, Yu-Chen Chen, Wu-Lin Acharya, Biswaranjan Natl Taipei Univ Technol Grad Inst Automat Technol Taipei 106344 Taiwan Providence Univ Dept Comp Sci & Informat Management 200 Sec 7 Taiwan Blvd Taichung 43301 Taiwan KIIT Deemed Be Univ Sch Comp Engn Bhubaneswar Odisha India

This paper develops an integrity protection technique based on image demosaicking. To provide the reversible property, the rebuilt components in color pixels are used for secret data embedding. The random value and the hashed result of the most significant high-order bits of the color components are employed to generate the authentication code for each rebuilt component. In addition, the optimal single bit map block truncation coding (OSBMBTC) technique is adopted for generating recovery codes. A block-based image recovery procedure is designed to reconstruct the modified areas. Experimental results reveal that the illegally tampered objects in the test images can be found in these tests even when 87.5% pixels are modified. From the results, the image quality of the recovery image is acceptable when 50% of pixels are modified. Moreover, the demosaicked image can be reversibly constructed when the embedded image is not tampered.

关键词： Color filter array Image demosaicking Tamper detection Image recovery block truncation coding Reversibility preserving

来源：评论

学校读者我要写书评

暂无评论

A secure removable visible watermarking for BTC compressed images

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2015年第6期74卷 1725-1739页

作者： Yang, Hengfu Yin, Jianping Natl Univ Def Technol Sch Comp Changsha 410073 Hunan Peoples R China Hunan First Normal Univ Dept Informat Sci & Engn Changsha 410205 Hunan Peoples R China

A novel removable visible watermarking (RVW) algorithm by combining block truncation coding (BTC) and chaotic map (RVWBCM) is presented in this paper. It embeds a visible watermark in the BTC codes of images, namely both the host image and the watermarked image are BTC compressed images. First, the original image is divided into watermarked region and non-watermarked region, and a predicted version of original image can be obtained by predicting pixel values in watermarked region. Second, adaptive embedding factors are computed according to the image features. Third, the watermark is adaptively embedded into two quantization levels of the BTC compressed image in visible manner. Meanwhile, to further prevent illegal watermark removal, original bi-level watermark is encrypted and then losslessly embedded in invisible manner by adjusting the relationship of two quantization levels. At the receiver's end, only authorized users can exactly extract original bi-level watermark according the relationship of two quantization levels of BTC codes and succeed in remove the embedded visible watermark to reconstruct the original image. The experimental results show that this scheme can achieve a good balance between perceptual transparence and the watermark strength (watermark visibility) and can resist common image processing attacks. The proposed algorithm has low complexity and simplicity of implementation due to the use of BTC. It can be applicable to copyright notification and secure access control in mobile communication.

关键词： Removable visible watermark block truncation coding Chaotic maps Image smoothness

来源：评论

学校读者我要写书评

暂无评论

Quadtree-segmented image compression method using vector quantization and cubic B-spline interpolation

引用

IMAGING SCIENCE JOURNAL 2004年第2期52卷 106-116页

作者： Chang, CC Chuang, JC Chung, CY Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Chiayi 621 Taiwan Natl Chiao Tung Univ Dept Comp & Informat Sci Hsinchu Taiwan

A novel hybrid image compression method based on quadtree is proposed, involving two techniques: vector quantization (VQ) and cubic B-spline interpolation. Traditional block-based image compression methods, such as VQ, block truncation coding and others, do not take the relationship of neighbouring blocks into consideration, which results in a limit to their compression rate. To put it another way, if the relationships between neighbouring blocks can be included in the scheme by application of the quadtree technique and the VQ method, as well as cubic B-spline interpolation, which is exactly what is attempted in this paper, the performance of image compression can be improved significantly. According to the experimental results, this method can achieve satisfactory results in terms of the compression rate, while maintaining an acceptable image quality compared with block-based image compression methods.

关键词： vector quantization cubic B-spline interpolation quadtree bilinear JPEG block truncation coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：