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

IEEE International Symposium on Circuits and Systems

作者： Yun-Fu Liu Jing-Ming Guo Zong-Jhe Wu Hua Lee Department of Electrical Engineering National Taiwan University of Science and Technology Taipei Taiwan Department of Electrical and Computer Engineering University of California Santa Barbara Santa Barbara CA

ISBN: (纸本)9781479983926

In this study, an improved block truncation coding (BTC) image compression scheme, namely Near-Aperiodic Dot-Diffused BTC (NADDBTC), is described. Firstly, the existing regular structures for the generation of bitmap are completely modified for aperiodic compressed results. Moreover, an adaptive quantization levels selection strategy and two parameters Class Matrix (CM) and Diffused Matrix (DM) for image compression are developed and co-optimized. The improvements produce results of superior image quality. Furthermore, the adaptive quantization levels are introduced for balanced false contour, impulsive noise, and blocking artifact. Experimental results demonstrate that the proposed NADDBTC is capable of providing excellent image quality and visual perception, as well as processing efficiency, similar to DDBTC by exploiting the innate parallelism advantage of dot diffusion.

关键词： Image compression block truncation coding dot diffusion digital halftoning optimization block truncation coding Image compression Data compression Image quality bit map adaptive quantization Visual Perception

来源：评论

学校读者我要写书评

暂无评论

Improved color image coding schemes based on single bit map block truncation coding

引用

OPTICAL ENGINEERING 2014年第9期53卷

作者： Hu, Yu-Chen Chang, I-Cheng Liu, Kuo-Yu Hung, Che-Lun Providence Univ Dept Comp Sci & Informat Management Taichung 43301 Taiwan Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Hualien Taiwan Providence Univ Dept Comp Sci & Commun Engn Taichung 43301 Taiwan

Two color image coding schemes based on single bit map block truncation coding are proposed in this paper. The first scheme employs the optimal rule for single bit map generation. In addition, the quantization level recomputation process is designed. By using these two techniques, a fixed bit rate image coding scheme is introduced. To further cut down the required bit rates of the first scheme, the similar block prediction technique and the bit map omission technique are employed in the second scheme. According to the experimental results, the first scheme proposed significantly improves the image qualities of the compressed images compared to the traditional single bit map block truncation coding scheme. In addition, good image qualities of the compressed images are achieved by the second scheme while keeping bit rates low. (C) 2014 Society of Photo-Optical Instrumentation Engineers (SPIE)

关键词： color image coding block truncation coding single bit map block truncation coding similar block prediction bit map omission

来源：评论

学校读者我要写书评

暂无评论

The method for image retrieval based on multi-factors correlation utilizing block truncation coding

引用

PATTERN RECOGNITION 2014年第10期47卷 3293-3303页

作者： Wang Xingyuan Wang Zongyu Dalian Univ Technol Fac Elect Informat & Elect Engn Dalian 116024 Peoples R China

In this paper, we proposed multi-factors correlation (MFC) to describe the image, structure element correlation (SEC), gradient value correlation (GVC) and gradient direction correlation (GDC). At first, the RGB color space image is converted to a bitmap image and a mean color component image utilizing the block truncation coding (BTC). Then, three correlations will be used to extract the image feature. The structure elements can effectively represent the bitmap which is generated by BTC, and SEC can effectively denote the bitmap's structure and the correlation of the block in the bitmap. GVC and GDC can effectively denote the gradient relation, which is computed by a mean color component image. Formed by SEC, GVC and GDC, the image feature vectors can effectively represent the image. In the end, the results demonstrate that the method has better performance than other image retrieval methods in the experiment. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Content based image retrieval block truncation coding Multi-factors correlation Structure element correlation Gradient value correlation Gradient direction correlation

来源：评论

学校读者我要写书评

暂无评论

Embedding intensity image in grid-cross down-sampling (GCD) binary holograms based on block truncation coding

引用

OPTICS COMMUNICATIONS 2013年第1期304卷 62-70页

作者： Tsang, P. W. M. Poon, T. -C. Jiao, A. S. M. City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China Virginia Tech Bradley Dept Elect & Comp Engn Blacksburg VA 24061 USA Chinese Acad Sci Shanghai Inst Opt & Fine Mech SIOM Shanghai 201800 Peoples R China

Past research has demonstrated that a three-dimensional (3D) intensity image can be preserved to a reasonable extent with a binary Fresnel hologram called the grid-cross down-sampling (GCD) binary hologram, if the intensity image is first down-sampled with a grid-cross lattice prior to the generation of the hologram. It has also been shown that the binary hologram generated with such means can be embedded with a binary image without causing observable artifact on the reconstructed image. Hence, the method can be further extended to embed an intensity image by binarizing it with error diffusion. Despite the favorable findings, the visual quality of the retrieved embedded intensity image from the hologram is rather poor. In this paper, we propose a method to overcome this problem. First, we employ the block truncation coding (BTC) to convert the intensity image into a binary bit stream. Next, the binary bit stream is embedded into the GCD binary hologram. The embedded image can be recovered with a BTC decoder, as well as a noise suppression scheme if the hologram is partially damaged. Experimental results demonstrate that with our proposed method, the visual quality of the embedded intensity image is superior to that of the existing approach, and the extracted image preserves favorably even if the binary hologram is damaged and contaminated with noise. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Computer generated hologram GCD binary hologram Multi-direction down-sampling block truncation 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

来源：评论

学校读者我要写书评

暂无评论

A secure secret image sharing with steganography and authentication by Hamming code (15,11) for compressed images

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2024年第11期83卷 31933-31955页

作者： Charoghchi, Sara Mashhadi, Samaneh Iran Univ Sci & Technol Sch Math Cryptog & Data Secur Lab Tehran Narmak Iran

The impressive increase in the rate of image transmission via internet has, more than ever, highlighted the importance of image securing techniques. One of the efficient solutions to secure images is Secret Image Sharing (SIS) with stegranography and authentication where an image is distributed among the shareholders without raising adversaries' suspicion. Additionally, the cheats of the dealer and share holders in the reconstruction of the image are discoverable. This means that the integration of the shares is verifiable. Although almost all the images on internet are compressed, the majority of proposed SIS schemes with steganography are not applicable to compressed images which is the area that our work attemps to improve. In this paper a novel SIS scheme based on homogeneous linear recursion (HLR) with steganography and authentication for Absolute Moment block truncation coding (AMBTC) compressed images is proposed. For steganography Hamming code (15,11) is applied which enables embedding with little changes so that the stego and cover images are visually and statistically very similar. An additional merit is that the reconstructed image is of an acceptable quality. What is more, authentication algorithm makes it possible for the scheme to detect any form of cheating and secures it against passive steganographic attacks.

关键词： Homogeneous linear recursion Secret image sharing block truncation coding Steganography Authentication

来源：评论

学校读者我要写书评

暂无评论

Robust data hiding scheme for highly compressed image exploiting btc with hamming code

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2024年第3期83卷 8591-8628页

作者： Datta, Kankana Jana, Biswapati Singh, Prabhash Kumar Chakraborty, Mamata Dalui Dept Comp Applicat Haldia Inst Technol HIT Campus Purba Medinipur W Bengal India Vidyasagar Univ Dept Comp Sci Midnapore W Bengal India Natl Inst Technol Dept Comp Sci & Engn Durgapur W Bengal India

Compression techniques can be used on digital content to minimize duplication and maintain internet traffic, while ensuring the quality of the decoded object. Two functionalities such as data concealing and images compression can be combined into a single module, reducing the risk of responder attacks while improving execution efficacy. This study exploits block truncation coding (BTC) with (7, 4) Hamming error correction and detection code to render a robust data hiding policy within highly compressed images. To compress the host image, BTC has been utilized which divides the image into (4 x 4) blocks. These blocks are categorized into two groups namely complex and smooth, based on threshold value where each smooth block accommodate two secret data bits encoded in it employing (7, 4) Hamming code whereas complex block remain unaltered. On the other hand, the Vertical Redundancy Check (V RC) approach greatly aids in determining the location of the hidden message bit. The cover or host image can be partially recovered due to the lossy property of BTC image compression scheme. To test its robustness and imperceptibility, several standard NIST approved steganalysis and statistical attacks are carried out. The developed technique is found to be secure and strong against a variety of geometrical attacks. The virtues of the proposed scheme are presented by comparing experimental results to the state-of-the-art schemes. The anticipated consequence highlighted certain outstanding magnificent aspects in the fields of verification of image, tamper recognition, and digital forgery sensing, all of which are essential to the contemporary technological life. This scheme benefits a wide range of government and business sectors, as well as health care, security, intellectual property rights, commercial and defense.

关键词： Data hiding Hamming error correcting code Even parity Vertical redundancy checking block truncation coding Image compression Secret message

来源：评论

学校读者我要写书评

暂无评论

Bit plane modification for improving MSE-near optimal DPCM-based block truncation coding

引用

DIGITAL SIGNAL PROCESSING 2013年第4期23卷 1171-1180页

作者： Choi, Kang-Sun Korea Univ Technol & Educ Sch Elect Elect & Commun Engn Cheonan 330708 Chungnam South Korea

A hybrid method of block truncation coding (BTC) and differential pulse code modulation (DPCM) offers better visual quality than the standard BTC for small block sizes due to its inherent multitone representation. Recently, a two-level quantizer design method has been proposed to increase the coding performance of the DPCM-BTC framework. However, the design method is near optimal in the sense that its coding performance depends on the initial bit plane patterns. In this paper, we propose a bit plane modification (BPM) algorithm to achieve further performance improvement. The BPM algorithm, inspired by error diffusion, effectively distributes large quantization error at a certain pixel to its neighboring pixels having small quantization errors by changing partial bit patterns. Experimental results show that the proposed algorithm successfully achieves much higher coding performance than various conventional BTC methods. The average PSNR performance of the proposed method is 2.31 dB, 5.15 dB, and 5.15 dB higher than that of BTC, DPCM-BTC, and a recently developed BTC scheme using error diffusion and bilateral filtering, respectively. (C) 2013 Elsevier Inc. All rights

关键词： Quantizer optimization Differential pulse code modulation block truncation coding Error diffusion

来源：评论

学校读者我要写书评

暂无评论

High performance reversible data hiding for block truncation coding compressed images

引用

SIGNAL IMAGE AND VIDEO PROCESSING 2013年第2期7卷 297-306页

作者： Sun, Wei Lu, Zhe-Ming Wen, Yu-Chun Yu, Fa-Xin Shen, Rong-Jun Zhejiang Univ Sch Aeronaut & Astronaut Hangzhou 310027 Zhejiang Peoples R China

Reversible data hiding has been a hot research topic because it can recover both the host media and hidden data without distortion. Because most digital images are stored and transmitted in compressed forms, such as JPEG, vector quantization, and block truncation coding (BTC), the reversible data hiding schemes in compressed domains have been paid more and more attention. Compared with transform coding, BTC has a significantly low complexity and less memory requirement, it therefore becomes an ideal data hiding domain. Traditional data hiding schemes in the BTC domain modify the BTC encoding stage or BTC-compressed data according to the secret bits, and they have a relatively low efficiency and meanwhile may reduce the image quality. This paper presents a novel reversible data hiding scheme based on the joint neighbor coding technique for BTC-compressed images by further losslessly encoding the BTC-compressed data according to the secret bits. First, BTC is performed on the original image to obtain the BTC-compressed data that can be represented by a high mean table, a low mean table, and a bitplane sequence. Then, the secret data are losslessly embedded in both the high mean and low mean tables. Our hiding scheme is a lossless method based on the relation among the current value and the neighboring ones in mean tables. In addition, it can averagely embed 2 bits in each mean value, which increases the capacity and efficiency. Experimental results show that our scheme outperforms three existing BTC-based data hiding works, in terms of the bit rate, capacity, and efficiency.

关键词： Data hiding Reversible data hiding Joint neighbor coding block truncation coding

来源：评论

学校读者我要写书评

暂无评论

Adaptive Reversible Visible Watermarking Based on Total Variation for BTC-Compressed Images

引用

Computers, Materials & Continua 2023年第3期74卷 5173-5189页

作者： Hengfu Yang Mingfang Jiang Zhichen Gao School of Computer Science Hunan First Normal UniversityChangsha410205China Hunan Provincial Key Laboratory of Informationization Technology for Basic Education Changsha410205China Department of Applied Mathematics and Statistics College of Engineering and Applied SciencesStony Brook UniversityNY 11794USA

Few previous Reversible Visible Watermarking(RVW)schemes have both good transparency and watermark *** adaptive RVW scheme that integrates Total Variation and visual perception in block truncation coding(BTC)compressed domain,called TVB-RVW is proposed in this paper.A new mean image estimation method for BTC-compressed images is first developed with the help of Total ***,a visual perception factor computation model is devised by fusing texture and luminance *** adaptive watermark embedding strategy is used to embed the visible watermark with the effect of the visual perception factor in the BTC ***,a lossless embedding method of the encrypted visible watermark is exploited to deter illegal watermark *** visible watermark can be removed since the visual perception factor and the estimated mean image remain unchanged before and after watermark *** experiments validate the superiority of the proposed algorithm over previous RVW schemes in BTC in terms of the visual quality of watermarked images and watermark visibility,and it can achieve a good balance between transparency and watermark visibility.

关键词： Reversible visible watermark block truncation coding visual perception total variation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：