检索结果-南通市图书馆

Reversible Natural Language Watermarking Using Synonym Substitution and arithmetic coding

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2018年第6期55卷 541-559页

作者： Lingyun Xiang Yan Li Wei Hao Peng Yang Xiaobo Shen Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and TechnologyChangsha 410114HunanChina School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha 410114HunanChina School of Traffic&Transportation Engineering Changsha University of Science&TechnologyChangsha 410114HunanChina Hunan Branch of CNCERT/CC Changsha 410004HunanChina School of Computer Science and Engineering Nanyang Technological University639798Singapore

For protecting the copyright of a text and recovering its original content harmlessly,this paper proposes a novel reversible natural language watermarking method that combines arithmetic coding and synonym substitution *** analyzing relative frequencies of synonymous words,synonyms employed for carrying payload are quantized into an unbalanced and redundant binary *** quantized binary sequence is compressed by adaptive binary arithmetic coding losslessly to provide a spare for accommodating additional ***,the compressed data appended with the watermark are embedded into the cover text via synonym substitutions in an invertible *** the receiver side,the watermark and compressed data can be extracted by decoding the values of synonyms in the watermarked text,as a result of which the original context can be perfectly recovered by decompressing the extracted compressed data and substituting the replaced synonyms with their original *** results demonstrate that the proposed method can extract the watermark successfully and achieve a lossless recovery of the original ***,it achieves a high embedding capacity.

关键词： arithmetic coding synonym substitution lossless compression reversible watermarking.

Medical Image Compression Using Wrapping Based Fast Discrete Curvelet Transform and arithmetic coding

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Circuits and Systems 2016年第8期7卷 2059-2069页

作者： P. Anandan R. S. Sabeenian Department of Electronics and Communication Engineering R.M.D. Engineering College Kavaraipettai India Department of Electronics and Communication Engineering SONA College of Technology Salem India

Due to the development of CT (Computed Tomography), MRI (Magnetic Resonance Imaging), PET (Positron Emission Tomography), EBCT (Electron Beam Computed Tomography), SMRI (Stereotactic Magnetic Resonance Imaging), etc. has enhanced the distinguishing rate and scanning rate of the imaging equipments. The diagnosis and the process of getting useful information from the image are got by processing the medical images using the wavelet technique. Wavelet transform has increased the compression rate. Increasing the compression performance by minimizing the amount of image data in the medical images is a critical task. Crucial medical information like diagnosing diseases and their treatments is obtained by modern radiology techniques. Medical Imaging (MI) process is used to acquire that information. For lossy and lossless image compression, several techniques were developed. Image edges have limitations in capturing them if we make use of the extension of 1-D wavelet transform. This is because wavelet transform cannot effectively transform straight line discontinuities, as well geographic lines in natural images cannot be reconstructed in a proper manner if 1-D transform is used. Differently oriented image textures are coded well using Curvelet Transform. The Curvelet Transform is suitable for compressing medical images, which has more curvy portions. This paper describes a method for compression of various medical images using Fast Discrete Curvelet Transform based on wrapping technique. After transformation, the coefficients are quantized using vector quantization and coded using arithmetic encoding technique. The proposed method is tested on various medical images and the result demonstrates significant improvement in performance parameters like Peak Signal to Noise Ratio (PSNR) and Compression Ratio (CR).

关键词： Medical Image Compression Discrete Curvelet Transform Fast Discrete Curvelet Transform arithmetic coding Peak Signal to Noise Ratio Compression Ratio

An Improved arithmetic coding Algorithm

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Shanghai University(English Edition) 2004年第4期8卷 455-458页

作者：海梅张建军倪兴芳 Department of Mathematics College of Sciences Shanghai University Shanghai 200436 P.R.China Department of Electronic Engineering College of Technology Shanghai Jiaotong University Shanghai 200030 P.R.China

arithmetic coding is the most powerful technique for statiscal lossless encoding that has attracted much attention in recent years. In this paper, we presents a new implementation of bit-level arithmetic coding by use of integer additions and shifts. The new algorithm has less computation complexity and is more flexible to use, and thus is very suitable for software and hardware design. We also discuss the application of the algorithm to the data encryption.

关键词： arithmetic coding data encryption.

Quantitative Comparative Study of the Performance of Lossless Compression Methods Based on a Text Data Model

在线全文

学校读者我要写书评

暂无评论

Open Journal of Applied Sciences 2024年第7期14卷 1944-1962页

作者： Namogo Silué Sié Ouattara Mouhamadou Dosso Alain Clément Laboratoire des Sciences et Technologies de la Communication et de lInformation (LSTCI) Institut National Polytechnique Houphout Boigny (INPHB) Yamoussoukro Cte dIvoire Institut National Polytechnique Houphout Boigny (INPHB) Yamoussoukro Cte dIvoire UFR Mathmatique-Informatique Ecole Doctorale Sciences-Technologie et Agriculture Durable (ED STAD) Universit Felix Houphout-Boigny (UFHB) Abidjan Cte dIvoire Ecole de Gomatique et du Territoire (EGT) Abidjan Cte dIvoire LARIS SFR MATHSTIC Universit dAngers Angers France

Data compression plays a key role in optimizing the use of memory storage space and also reducing latency in data transmission. In this paper, we are interested in lossless compression techniques because their performance is exploited with lossy compression techniques for images and videos generally using a mixed approach. To achieve our intended objective, which is to study the performance of lossless compression methods, we first carried out a literature review, a summary of which enabled us to select the most relevant, namely the following: arithmetic coding, LZW, Tunstall’s algorithm, RLE, BWT, Huffman coding and Shannon-Fano. Secondly, we designed a purposive text dataset with a repeating pattern in order to test the behavior and effectiveness of the selected compression techniques. Thirdly, we designed the compression algorithms and developed the programs (scripts) in Matlab in order to test their performance. Finally, following the tests conducted on relevant data that we constructed according to a deliberate model, the results show that these methods presented in order of performance are very satisfactory:- LZW- arithmetic coding- Tunstall algorithm- BWT + RLELikewise, it appears that on the one hand, the performance of certain techniques relative to others is strongly linked to the sequencing and/or recurrence of symbols that make up the message, and on the other hand, to the cumulative time of encoding and decoding.

关键词： arithmetic coding BWT Compression Ratio Comparative Study Compression Techniques Shannon-Fano Huffman Lossless Compression LZW Performance Redundancy RLE Text Data Tunstall

Embedding adaptive arithmetic coder in chaos-based cryptography

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics B 2010年第5期19卷 121-129页

作者：李恒建张家树 Sichuan Province Key Lab of Signal & Information Processing Southwest Jiaotong University

In this study an adaptive arithmetic coder is embedded in the Baptista-type chaotic cryptosystem for implementing secure data compression. To build the multiple lookup tables of secure data compression, the phase space of chaos map with a uniform distribution in the search mode is divided non-uniformly according to the dynamic probability estimation of plaintext symbols. As a result, more probable symbols are selected according to the local statistical characters of plaintext and the required number of iterations is small since the more probable symbols have a higher chance to be visited by the chaotic search trajectory. By exploiting non-uniformity in the probabilities under which a number of iteration to be coded takes on its possible values, the compression capability is achieved by adaptive arithmetic code. Therefore, the system offers both compression and security. Compared with original arithmetic coding, simulation results on Calgary Corpus files show that the proposed scheme suffers from a reduction in compression performance less than 12% and is not susceptible to previously carried out attacks on arithmetic coding algorithms.

关键词： chaos cryptography compression arithmetic coding

Cryptanalysis of a chaos-based cryptosystem with an embedded adaptive arithmetic coder

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2011年第8期20卷 97-105页

作者：王兴元谢旖欣 School of Electronic & Information Engineering Dalian University of Technology

In this paper, we analyse a new chaos-based cryptosystem with an embedded adaptive arithmetic coder, which was proposed by Li Heng-Jian and Zhang J S （Li H J and Zhang J S 2010 Chin. Phys. B 19 050508）. Although this new method has a better compression performance than its original version, it is found that there are some problems with its security and decryption processes. In this paper, it is shown how to obtain a great deal of plain text from the cipher text without prior knowledge of the secret key. After discussing the security and decryption problems of the Li Heng-Jian et al. algorithm, we propose an improved chaos-based cryptosystem with an embedded adaptive arithmetic coder that is more secure.

关键词： chaos cryptography compression arithmetic coding

Design of new format for mass data compression

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2011年第1期18卷 121-128页

作者： QIN Jian-cheng BAI Zhong-ying School of Computer Science Beijing University of Posts and Telecommunications Beijing 100876 China

In the field of lossless compression, most kinds of traditional software have some shortages when they face the mass data. Their compressing abilities are limited by the data window size and the compressing format design. This paper presents a new design of compressing format named ＇CZ format＇ which supports the data window size up to 4 GB and has some advantages in the mass data compression. Using this format, a compressing shareware named ＇ComZip＇ is designed. The experiment results support that ComZip has better compression ratio than WinZip, Bzip2 and are compressed. And ComZip has the potential to beat 7-zip in WinRAR in most cases, especially when GBs or TBs of mass data future as the data window size exceeds 128 MB.

关键词： mass data coding tossless compression LZ77/LZSS algorithm arithmetic coding

An Optimal Lempel Ziv Markov Based Microarray Image Compression Algorithm

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2021年第11期69卷 2245-2260页

作者： R.Sowmyalakshmi Mohamed Ibrahim Waly Mohamed Yacin Sikkandar T.Jayasankar Sayed Sayeed Ahmad Rashmi Rani Suresh Chavhan Department of Electronics and Communication Engineering University College of EngineeringBIT CampusAnna UniversityTiruchirappalli620024India Department of Medical Equipment Technology College of Applied Medical SciencesMajmaah UniversityAl Majmaah11952Saudi Arabia Department of Computer Engineering College of Engineering and ComputingAl Ghurair UniversityDubai37374United Arab Emirates Automotive Research Center Vellore Institute of TechnologyVellore632014India Federal University of Piauí Teresina64049-550PIBrazil

In the recent years,microarray technology gained attention for concurrent monitoring of numerous microarray *** remains a major challenge to process,store and transmit such huge volumes of microarray ***,image compression techniques are used in the reduction of number of bits so that it can be stored and the images can be shared *** techniques have been proposed in the past with applications in different *** current research paper presents a novel image compression technique i.e.,optimized Linde–Buzo–Gray(OLBG)with Lempel Ziv Markov Algorithm(LZMA)coding technique called OLBG-LZMA for compressing microarray images without any loss of *** model is generally used in designing a local optimal codebook for image *** construction is treated as an optimizationissue and can be resolved with the help of Grey Wolf Optimization(GWO)*** the codebook is constructed by LBGGWO algorithm,LZMA is employed for the compression of index table and raise its compression efficiency *** were performed on high resolution Tissue Microarray(TMA)image dataset of 50 prostate tissue samples collected from prostate cancer *** compression performance of the proposed coding esd compared with recently proposed *** simulation results infer that OLBG-LZMA coding achieved a significant compression performance compared to other techniques.

关键词： arithmetic coding dictionary based coding Lempel-Ziv Markov chain algorithm Lempel-Ziv-Welch coding tissue microarray

Spatio-Temporal Context-Guided Algorithm for Lossless Point Cloud Geometry Compression

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

ZTE Communications 2023年第4期21卷 17-28页

作者： ZHANG Huiran DONG Zhen WANG Mingsheng Guangzhou Urban Planning and Design Survey Research Institute Guangzhou 510060China Guangdong Enterprise Key Laboratory for Urban Sensing Monitoring and Early WarningGuangzhou 510060China State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan UniversityWuhan 430079China

Point cloud compression is critical to deploy 3D representation of the physical world such as 3D immersive telepresence,autonomous driving,and cultural heritage ***,point cloud data are distributed irregularly and discontinuously in spatial and temporal domains,where redundant unoccupied voxels and weak correlations in 3D space make achieving efficient compression a challenging *** this paper,we propose a spatio-temporal context-guided algorithm for lossless point cloud geometry *** proposed scheme starts with dividing the point cloud into sliced layers of unit thickness along the longest ***,it introduces a prediction method where both intraframe and inter-frame point clouds are available,by determining correspondences between adjacent layers and estimating the shortest path using the travelling salesman ***,the few prediction residual is efficiently compressed with optimal context-guided and adaptive fastmode arithmetic coding *** prove that the proposed method can effectively achieve low bit rate lossless compression of point cloud geometric information,and is suitable for 3D point cloud compression applicable to various types of scenes.

关键词： point cloud geometry compression single-frame point clouds multi-frame point clouds predictive coding arithmetic coding