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

Deep Concatenated Residual Networks for Improving Quality of Halftoning-Based BTC Decoded Image

JOURNAL OF IMAGING 2021年第2期7卷 13-13页

作者： Prasetyo, Hen Prayuda, Alim Wicaksono Hari Hsia, Chih-Hsien Guo, Jing-Ming Univ Sebelas Maret Dept Informat Surakarta 57126 Indonesia Natl Ilan Univ Dept Comp Sci & Informat Engn Yilan 260 Taiwan Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei 106335 Taiwan

This paper presents a simple technique for improving the quality of the halftoning-based block truncation coding (H-BTC) decoded image. The H-BTC is an image compression technique inspired from typical block truncation coding (BTC). The H-BTC yields a better decoded image compared to that of the classical BTC scheme under human visual observation. However, the impulsive noise commonly appears on the H-BTC decoded image. It induces an unpleasant feeling while one observes this decoded image. Thus, the proposed method presented in this paper aims to suppress the occurring impulsive noise by exploiting a deep learning approach. This process can be regarded as an ill-posed inverse imaging problem, in which the solution candidates of a given problem can be extremely huge and undetermined. The proposed method utilizes the convolutional neural networks (CNN) and residual learning frameworks to solve the aforementioned problem. These frameworks effectively reduce the impulsive noise occurrence, and at the same time, it improves the quality of H-BTC decoded images. The experimental results show the effectiveness of the proposed method in terms of subjective and objective measurements.

关键词： block truncation coding convolutional neural networks deep learning halftoning residual learning image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Partial reversible AMBTC-based secret image sharing with steganography

引用

DIGITAL SIGNAL PROCESSING 2019年 93卷 22-33页

作者： Wu, Xiaotian Yang, Ching-Nung Jinan Univ Dept Comp Sci Guangzhou Guangdong Peoples R China Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Hualien Taiwan

Existing secret image sharing (SIS) schemes with steganography and authentication are designed for uncompressed images. They cannot be applied to compressed domain. When the cover image is of significance, these schemes cannot revert the distorted stego image into its original form. To solve these problems, a (k, n) threshold partial reversible absolute moment block truncation coding (AMBTC) based SIS scheme with steganography and authentication is proposed. A secret image is split into n noise like shares by employing the polynomial based SIS under GF(2(8)). To efficiently manage the shares, they are concealed into the AMBTC cover image with parity bits by the proposed embedding algorithms, and n meaningful stego images are constructed. Authentication is adopted so that the integrity of stego image can be verified. Sufficient stego images can perfectly reconstruct the secret. Meanwhile, the original AMBTC cover image can be partially recovered with high probability. Theoretical analysis and experimental results are demonstrated, showing the effectiveness and advantages of the proposed scheme. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Secret image sharing block truncation coding Partial reversible Steganography Authentication

来源：评论

学校读者我要写书评

暂无评论

A (k, n) threshold partial reversible AMBTC-based visual cryptography using one reference image

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2019年 59卷 550-562页

作者： Wu, Xiaotian Chen, Dong Yang, Ching-Nung Yang, Yi-Yun 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 Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Shoufeng Township Taiwan

Recently, Yang et al. introduced a (k;n) approach called Reversible Absolute moment block truncation coding Visual Cryptography Scheme (RAVCS) (Yang et al., 2017) to conceal a secret image into n AMBTC shares. However, a large number of reference images is used in their method. To reduce the number of reference images, a (k;n) PRAVCS using one AMBTC reference image is introduced. In encoding phase, a binary secret image is shared into n AMBTC shadow images according to the base matrices generated by two proposed constructions. In decoding phase, the secret image is recovered by stacking sufficient bitmaps, and the AMBTC reference image is partially recovered as well. When n AMBTC shares are used, losslessly reconstruction for the reference image is obtained. Theoretical analysis and experiments by the proposed method are demonstrated to show the effectiveness. Moreover, Construction 1 has larger contrast, while Construction 2 achieves higher reversibility for more thresholds. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Visual cryptography block truncation coding Partial reversible Meaningful share Contrast Reference image

来源：评论

学校读者我要写书评

暂无评论

VLSI implementation of an ultra-low-cost and low-power image compressor for wireless camera networks

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2018年第4期14卷 803-812页

作者： Chen, Shih-Lun Nie, Jing Lin, Ting-Lan Chung, Rih-Lung Hsia, Chih-Hsien Liu, Tse-Yen Lin, Szu-Yin Wu, Hai-Xia Chung Yuan Christian Univ Dept Elect Engn Taoyuan Taiwan Beijing Inst Technol Dept Elect & Informat Beijing Peoples R China Chinese Culture Univ Dept Elect Engn Taipei Taiwan Chung Yuan Christian Univ Dept Informat Management Taoyuan Taiwan

In this paper, a novel hardware-oriented color image compression algorithm based on digital halftoning and block truncation coding (BTC) techniques is proposed for very large-scale integration (VLSI) implementation. The proposed technique consists of a threshold generator, a bitmap generator, a BTC training module, a predictor, and a signed Golomb-Rice coding module. Because the wireless camera network is developed for perceiving, measuring, and collecting information from the environment, each camera sensing node should be designed to achieve low cost, small size, high compression rates, and low power consumption. Hence, a novel low-complexity, high-performance, transform-free, hardware-oriented color image compression algorithm based on digital halftoning and BTC is proposed. In order to achieve the performance of compressing images in real time, the proposed color image compression algorithm was realized by a VLSI technique. The VLSI architecture in this work contains only 8.1-k gate counts, and the core area is 81,000 mu m(2) synthesized using a TSMC 0.18-mu m CMOS process. The operating frequency of this work is 100 MHz and consumes 2.91 mW, which is efficient to develop wireless electronic systems with the demand of color image compression in real time. Compared with JPEG- and JPEG-LS-based designs, this work reduces gate counts by at least 71.1 % and power consumption by 53 % and only requires a one-line-buffer memory.

关键词： block truncation coding Digital halftoning Golomb-Rice coding Image compressor Wireless camera network VLSI

来源：评论

学校读者我要写书评

暂无评论

On the security of a BTC-based-compression image authentication scheme

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2018年第10期77卷 12979-12989页

作者： Chen, Tzung-Her Chang, Tzu-Ching Natl Chiayi Univ Dept Comp Sci & Informat Engn 300 Univ Rd Chiayi 60004 Taiwan

With image integrity in mind, the sensitivity-of-tamper property of a new image authentication scheme is always one of main concerns. However, to claim integrity guarantee of image authentication techniques is meaningful only when the false negative probability is taken into consideration. In this paper, the security of an image authentication scheme based on block-truncation-coding (BTC) compression proposed by Li et al. is analyzed. The false alarm of their scheme is shown unneglectable in this paper. Precisely, it is potentially problematic since their scheme only protects the quantization values of BTC codes, but ignores the bitmap part. The main weak design will be shown by means of conducting some counter experiments. Thanks to Li et al.'s well design to protect the two values of quantization levels of the compressed image, the improvement to remove the potential security concern is simple. The experimental results and the further analysis demonstrate that the simple and secure improvement does work.

关键词： Image authentication block truncation coding Tampered detection False alarm

来源：评论

学校读者我要写书评

暂无评论

Quick Response Code Binary Research Based on Basic Image Processing

引用

SENSORS AND MATERIALS 2019年第3期31卷 859-871页

作者： Wu, Yun Yu, Shaoyong Yang, Mei Xiamen Univ Technol Coll Comp & Informat Engn Xiamen 361024 Peoples R China Longyan Univ Sch Math & Informat Engn Longyan City 364012 Peoples R China

The goal of this paper is to binarize quick response (QR) codes with basic image processing methods, so that they can be well recognized in extreme cases. In this paper, we avoid the complex computation that comes from sophisticated algorithms, and employ block truncation coding (BTC) to simplify the computation to make processing fast. The final results show that complex algorithms are not required in QR code binarization, and the basic image processing algorithm can achieve faster and better processing results.

关键词： QR code binarization block truncation coding

来源：评论

学校读者我要写书评

暂无评论

Ratio-modified block truncation coding algorithms for reduced bitrates

引用

IMAGING SCIENCE JOURNAL 2011年第1期59卷 25-31页

作者： Natarajan, S. Rao, Y. V. Ramana Bannari Amman Inst Technol Dept Elect & Commun Engn Sathyamangalam 638401 Tamilnadu India Anna Univ Coll Engn Dept Elect & Commun Engn Madras 600025 Tamil Nadu India

block truncation coding (BTC) technique is a simple and fast image compression algorithm since complicated transforms are not used. The principle used in BTC algorithm is to use two-level quantiser that adapts to local properties of the image while preserving the first- or first- and second-order statistical moments. The parameters transmitter or stored in the BTC algorithm are statistical moments and bitplane yielding good quality images at a bitrate of 2 bits per pixel (bpp). In this paper, two algorithms for modified BTC (MBTC) are proposed for reducing the bitrate below 2 bpp. The principal used in the proposed algorithms is to use the ratio of moments which is a smaller value when compared to absolute moments. The ratio values are then entropy coded. The bitplane is also coded to remove the correlation among the bits. The proposed algorithms are compared with MBTC and the algorithms obtained by combining JPEG standard with MBTC in terms of bitrate, peak signal-to-noise ratio (PSNR) and subjective quality. It is found that the reconstructed images obtained using the proposed algorithms yield better results.

关键词： image coding block truncation coding JPEG arithmetic coding bitplane coding

来源：评论

学校读者我要写书评

暂无评论

A fast near-optimum block truncation coding method using a truncated K-means algorithm and inter-block correlation

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2011年第6期65卷 576-581页

作者： Yang, Yan Chen, Qiqiang Wan, Yi Lanzhou Univ Inst Signals & Informat Proc Lanzhou 730000 Peoples R China Lanzhou Jiaotong Univ Lanzhou 730070 Peoples R China

block truncation coding (BTC) is an efficient image compression method which finds application in diverse fields. The basic problem can be viewed as a two-level quantization process. However, efficient ways for optimal threshold determination have not been discovered so far. We propose a fast BTC algorithm based on a truncated K-means algorithm, utilizing the image inter-block correlation and the fact that K-means algorithm converges very fast in this case. This produces near-optimum solution with significantly improved speed over other methods. Simulation results confirm such advantages. (C) 2010 Elsevier GmbH. All rights reserved.

关键词： block truncation coding Quantization K-means algorithm Image content correlation

来源：评论

学校读者我要写书评

暂无评论

Improved block truncation coding Using Extreme Mean Value Scaling and block-Based High Speed Direct Binary Search

引用

IEEE SIGNAL PROCESSING LETTERS 2011年第11期18卷 694-697页

作者： Guo, Jing-Ming Su, Chang-Cheng Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei Taiwan

block truncation coding (BTC) has been considered as an efficient compression technique for decades. However, the annoying blocking effect and false contour caused by low bit rate configuration are key problems. To solve these problems, many former halftoning-based BTCs are proposed. However, these schemes also induce another impulse noise issue while the previous issues still have room for improvement. To cope with this, the iteration-based halftoning is combined with BTC, namely Direct-Binary-Search BTC (DBSBTC) to solve the aforementioned problems. Moreover, the high-speed DBS halftoning method along with the block-based strategy yield even faster processing speed than some of the former halftoning-based BTC schemes. As documented in the experimental results, the proposed DBSBTC is superior to the former halftoning-base BTC schemes in terms of image quality, and which makes the former schemes as potential candidates for surveillance and computer vision applications.

关键词： block truncation coding digital halftoning direct binary search error diffusion image compression dot diffusion ordered dithering

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：