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

3rd International Conference on Inventive Computation Technologies (ICICT)

作者： Babu, S. Anantha Perumal, Eswaran VV Coll Engn Dept Comp Sci & Engn Tirunelveli India Alagappa Univ Dept Comp Applicat Karaikkudi Tamil Nadu India

ISBN: (纸本)9781538649855

An efficient way of run length coding uses improved run length coding with different grayscale images. The proposed method divides the image into different block size and applies the improved and efficient run length coding to get the high quality of reconstructed images. The performance of the proposed E-RLC algorithm works better than other lossless image compression methods. The proposed E-RLC produces high-quality of encoding results is achieved at a compression ratio in Lena and Cameraman image between 1.79 and 160.

关键词： Lossless Compression run length coding MSE PSNR and CR

来源：评论

学校读者我要写书评

暂无评论

Application of run length coding for defect image recognizing of steel ball surface

引用

11th Joint International Computer Conference (JICC 2005)

作者： Wang, P Liu, XF Wu, CY Harbin Univ Sci & Technol Mech & Power Engn Coll Harbin Peoples R China

ISBN: (纸本)9812565329

Aiming at the problem of defect image character recognizing on steel ball, the improved method of run length coding was used in registering bug area of steel ball surface to disjoin defect region and irrelevant region after image was segmented. As a result, steel ball was detected by area character parameter. The program of image processing, segmentation, recognizing was developed in LabVIEW platform. This means has already been tested and it shows the algorithm has practicability, reliability and precision.

关键词： surface defect run length coding image segmentation image recognition

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Steganography Method for Web Images with Average run- length-coding

引用

Journal of Computer Science Research 2021年第1期3卷 28-32页

作者： Jin Liu Yiwen Zhang College of Computer Science and Technology National Huaqiao UniversityXiamen361000China

Web page has many redundancies,especially the dynamic html multimedia *** paper proposes a novel method to employ the commonly used image elements on web *** to the various types of image format and complexity of image contents and their position information,secret message bits could be coded to embed in these complex *** with a specific covering code called average run-length-coding,the embedding efficiency could be reduced to a low level and the resulting capacity outperforms traditional content-based image steganography,which modifies the image data itself and causes a real image quality *** experiment result demonstrates that the proposed method has limited processing latency and high embedding ***’s more,this method has a low algorithm complexity and less image quality distortion compared with existing steganography methods.

关键词： Steganography Web image Covering codes run length coding

来源：评论

学校读者我要写书评

暂无评论

A New Compression Scheme for Secure Transmission

引用

International Journal of Automation and computing 2013年第6期10卷 578-586页

作者： M.Baritha Begum Y.Venkataramani Saranathan College of Engineering

Encryption techniques ensure security of data during transmission. However, in most cases, this increases the length of the data, thus it increases the cost. When it is desired to transmit data over an insecure and bandwidth-constrained channel, it is customary to compress the data first and then encrypt it. In this paper, a novel algorithm, the new compression with encryption and compression （CEC）, is proposed to secure and compress the data. This algorithm compresses the data to reduce its length. The compressed data is encrypted and then further compressed using a new encryption algorithm without compromising the compression efficiency and the information security. This CEC algorithm provides a higher compression ratio and enhanced data security. The CEC provides more confidentiality and authentication between two communication systems.

关键词： Data compression encryption algorithm compression with encryption and compression (CEC) algorithm Huffmancoding run length coding bits per character (BPC).

来源：评论

学校读者我要写书评

暂无评论

Context-Based Adaptive Arithmetic Encoding of EAVQ Indices

引用

IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING 2012年第5期20卷 1473-1481页

作者： Lakhdhar, Khaled Lefebvre, Roch Univ Sherbrooke Dept Genie Elect & Genie Informat Sherbrooke PQ J1K 2R1 Canada

This paper presents a lossless compression algorithm for the binary indices of the embedded algebraic vector quantizer (EAVQ) used by the AMR-WB+ (Extendend Adaptive Multi-Rate Wide Band) codec. We present a statical study of the EAVQ indices for diverse audio types (speech, music, etc.) and we discuss the design of the lossless algorithm including the choice of different strategies. The proposed algorithm combines run length encoding (RLE) and context-based arithmetic encoding to reduce the bitrate of the EAVQ indices by about 10% at the expense of 1% rise in complexity of the codec. The proposed algorithm can increase the segmental signal to noise ratio of about 9% at low rates for speech signals and improve the subjective scores in noisy channels by about 0.5 on a five-point scale if combined with an additional protection layer.

关键词： Arithmetic coding compression context-based compression embedded algebraic vector quantizer (EAVQ) extendend adaptive multi-rate wide band (AMR-WB plus ) run length coding

来源：评论

学校读者我要写书评

暂无评论

Hexagonal run-length Zero Capacity Region-Part II: Automated Proofs

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2022年第1期68卷 153-177页

作者： Congero, Spencer Zeger, Kenneth Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

The zero capacity region for hexagonal (d, k) runlength constraints is known for many, but not all, d and k. The pairs (d, k) for which it has been unproven whether the capacity is zero or positive consist of: (i) k = d + 2 when d >= 2;(ii) k = d+ 3 when d >= 1;(iii) k = d+ 4 when either d = 4 or d is odd and d >= 3;and (iv) k = d + 5 when d = 4. Here, we prove the capacity is zero in case (i) when 2 <= d <= 9, in case ( ii) when 3 <= d <= 11, and in case (iii) when d is an element of {4, 5, 7, 9}. We also prove the capacity is positive in case (ii) when d is an element of {1, 2}, in case (iii) when d = 3, and in case (iv). The zero capacities for k = d + 4 are the first and only known cases equal to zero when k - d > 3. All of our results are obtained by developing three algorithms that automatically and rigorously assist in proving either the zero or positive capacity results by efficiently searching large numbers of configurations. The proofs involve either upper bounding the number of paths through certain large directed graphs, finding forbidden strings, or building distinct tileable square labelings. Some of the proofs examine over 20 billion cases using a supercomputer. In Part I of this two-part series, it is proven that the capacity is zero for all of case (i), and for case (ii) whenever d >= 7. Thus, the only remaining unknown cases are now when k = d + 4, for any odd d >= 11.`

关键词： Channel capacity run length coding hexagonal constraint

来源：评论

学校读者我要写书评

暂无评论

Hexagonal run-length Zero Capacity Region-Part I: Analytical Proofs

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2022年第1期68卷 130-152页

作者： Congero, Spencer Zeger, Kenneth Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

The zero capacity region for hexagonal (d, k) runlength constraints is known for many, but not all, d and k. The pairs (d, k) for which it has been unproven whether the capacity is zero or positive consist of: (i) k = d + 2 when d >= 2;(ii) k = d + 3 when d >= 1;(iii) k = d + 4 when either d = 4 or d is odd and d >= 3;and (iv) k = d + 5 when d = 4. Here, we prove that the capacity is zero for all of case (i), and for case (ii) whenever d >= 7. The method used in this paper is to reduce an infinite search space of valid labelings to a finite set of configurations that we exhaustively examine using backtracking. In Part II of this two-part series, we use automated procedures to prove that the capacity is zero in case (i) when 2 <= d <= 9, in case (ii) when 3 <= d <= 11, and in case (iii) when d is an element of {4, 5, 7, 9}, and that the capacity is positive in case (ii) when d is an element of {1, 2}, in case (iii) when d = 3, and in case (iv). Thus, the only remaining unknown cases are now when k = d + 4, for any odd d >= 11.

关键词： Channel capacity run length coding hexagonal constraint

来源：评论

学校读者我要写书评

暂无评论

6-BAND SUBBAND CODER ON ECG WAVE-FORMS

引用

MEDICAL & BIOLOGICAL ENGINEERING & COMPUTING 1992年第2期30卷 187-192页

作者： TAI, SC Institute of Electrical Engineering National Cheng-Kung University Tainan Taiwan Republic of China

An ECG sampled at a rate of 500 samples s-1 or more produces a large amount of redundant data that are difficult to store and transmit. A process is therefore required to represent the signals with clinically acceptable fidelity and with the least code bits possible. In the paper, an efficient sub-band coding method for encoding ECG waveforms is presented. Although sub-band coding has been successfully applied to speech signals, it is the first time that this technique has been applied to the encoding of ECG waveforms. A frequency band decomposition of an ECG waveform is carried out by means of quadrature mirror filters (QMF), which split the ECG spectrum into six bands of unequal width. In the lower frequency bands, which contain most of the ECG spectrum energy, a larger number of bits per sample is used, whereas in upper frequency bands, which contain noise-like signals, fewer bits per sample and the run length coding method are used. The simulation results are presented in terms of bit rates and the quality of the reconstructed waveforms. The results show that a reproduction with an average signal-to-noise ratio (SNR) of 29.97 dB can be achieved even at an average bit rate of 0.81 bits per sample.

关键词： DATA COMPRESSION HUFFMAN CODE QUADRATURE MIRROR FILTER run length coding SUBBAND coding

来源：评论

学校读者我要写书评

暂无评论

Lossy Image Compression Using Multiwavelet Transform for Wireless Transmission

引用

WIRELESS PERSONAL COMMUNICATIONS 2016年第2期87卷 315-333页

作者： Rajakumar, K. Arivoli, T. Kalasalingam Acad Res & Educ Dept Elect & Commun Engn Krishnankoil 626126 Tamil Nadu India Vickram Coll Engn Dept Elect & Commun Engn Enathi 630561 Tamil Nadu India

The performance of the wavelets within the field of image process is standard. Multiwavelets is the next step in riffle theory and it takes the performance of wavelets to the next level. In this work the performance of the Integer Multiwavelet transform (IMWT) for lossy compression has been studied. The Proposed IMWT shows sensible performance in lossy reconstruction of the images than that of Existing lossy reconstruction. This work utilizes the performance of the Proposed IMWT for lossy compression of images with encoding techniques like Magnitude set coding and run length Encoding. The transform coefficients are unit coded by means of Magnitude set coding and run length coding techniques which in turn results with low bits. The transform coefficient matrix is coded on not taking under consideration of the sign values using the Magnitude Set-Variable length Integer illustration. The sign data of the coefficients is coded as bit plane with zero thresholds. This Bit plane may be used as it is or coded to scale back the bits per pixels. The Simulation was exhausted using Matlab.

关键词： Image compression run length coding Bit plane coding Image transform

来源：评论

学校读者我要写书评

暂无评论

Rotation Based Reversible Data Hiding for JPEG Images

引用

IETE TECHNICAL REVIEW 2016年第6期33卷 607-614页

作者： Long, Jing Yin, Zhaoxia Lv, Jinpeng Zhang, Xinpeng Shanghai Univ Sch Commun & Informat Engn Shanghai Peoples R China Anhui Univ Key Lab Intelligent Comp & Signal Proc Minist Educ Hefei Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp & Software Nanjing Jiangsu Peoples R China

A reversible data hiding method for JPEG images by rotating the run length coding (RLC) pairs is proposed in this paper. There are two properties of quantized AC coefficients: large magnitude and short run of zero for low frequency subband, and small magnitude and long run of zero for high frequency subband. In the data embedding stage, the original RLC pairs sequence in each block is rotated to different states with a step, which represents the data to be embedded. In data extraction stage, the original RLC sequence can be figured out based on the two properties, and the mapping relationship between the original and rotated RLC pair sequences can be utilized to extract the embedded data. Experimental results show that the proposed method achieves good image quality while preserve the JPEG file size.

关键词： File size preservation JPEG reversible data hiding run length coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：