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

Lossless nibbled data embedding scheme based on difference expansion

IMAGE AND VISION COMPUTING 2008年第5期26卷 632-638页

作者： Lu, Tzu-Chuen Chang, Chin-Chen Chaoyang Univ Technol Dept Informat Management Taichung 41349 Taiwan Feng Chia Univ Dept Comp Sci & Informat Engn Taichung 40724 Taiwan

This paper proposes a lossless data embedding scheme of great payload capacity and good image quality, which is based on difference expansion. In this scheme, every pixel in a host image is divided into two nibbles and each nibble pair between two adjacent pixels can be used to hide a secret message. In order to completely recover the host image, the arithmetic coding is adopted based on prediction by partial matching (PPM) model to compress the restored information. This proposed scheme has been successfully applied to different images. According to the experimental results, embedded information can be extracted correctly and quickly from the embedded image. In addition, the proposed scheme can not only hide a large amount of information in a host image without making noticeable distortion, but can also completely restore the host image from the embedded image. (C) 2007 Elsevier B.V. All rights reserved.

关键词： lossless data embedding difference expansion nibble arithmetic coding prediction by partial matching

来源：评论

学校读者我要写书评

暂无评论

Hierarchical dictionary model and dictionary management policies for data compression

引用

SIGNAL PROCESSING 1998年第2期69卷 149-155页

作者： Yu, CL Wu, JL Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 106 Taiwan

In this paper, an adaptive multi-dictionary model for data compression is proposed. Dictionary techniques applied in lossless compression coding can be modeled from the dictionary management point of view which is similar to that of cache memory. The behavior of a compression technique can be described by nine parameters defined in the proposed model, which provides a unified framework to describe the behavior of lossless compression techniques including existing probability-based Huffman coding and arithmetic coding, and dictionary-based LZ-family coding and its variants. Those methods can be interpreted as special cases under the proposed model. New compression techniques can be developed by choosing proper management policies in order to meet special encoding/decoding software or hardware requirements, or to achieve better compression performance. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： Huffman coding arithmetic coding LZ coding dictionary management

来源：评论

学校读者我要写书评

暂无评论

An Efficient Adaptive Binary arithmetic Coder With Low Memory Requirement

引用

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING 2013年第6期7卷 1053-1061页

作者： Belyaev, Evgeny Turlikov, Andrey Egiazarian, Karen Gabbouj, Moncef Tampere Univ Technol Dept Signal Proc Tampere 33720 Finland St Petersburg State Univ Aerosp Instrumentat Dept Informat & Commun Syst St Petersburg 190000 Russia

In this paper we propose a novel efficient adaptive binary arithmetic coder which is multiplication-free and requires no look-up tables. To achieve this, we combine the probability estimation based on a virtual sliding window with the approximation of multiplication and the use of simple operations to calculate the next approximation after the encoding of each binary symbol. We show that in comparison with the M-coder the proposed algorithm provides comparable computational complexity, less memory footprint and bitrate savings from 0.5 to 2.3% on average for H.264/AVC standard and from 0.6 to 3.6% on average for HEVC standard.

关键词： arithmetic coding H.264/AVC HEVC M-coder

来源：评论

学校读者我要写书评

暂无评论

Lossless Wideband RF Compression via Lifting-Based IIR Subband Decomposition

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2020年第1期56卷 823-829页

作者： Cooper, Charles Marcellin, Michael Rincon Res Corp Tucson AZ 85711 USA Univ Arizona Dept Elect & Comp Engn Tucson AZ 85721 USA

This correspondence presents a scheme for the lossless compression of wideband spectrally and/or temporally sparse radio-frequency intercepts. It decomposes intercepts into time/frequency partitions using an adaptive invertible channelizer based on infinite impulse response orthogonal wavelet filter banks. The resulting subband decomposition is compressed via arithmetic coding.

关键词： Radio frequency Wideband Image coding Time-domain analysis Transform coding Binary trees Finite impulse response filters arithmetic coding channelizer infinite impulse response (IIR) filter lossless compression orthogonal wavelet sparse subband decomposition wideband

来源：评论

学校读者我要写书评

暂无评论

SAMC: A code compression algorithm for embedded processors

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1999年第12期18卷 1689-1701页

作者： Lekatsas, H Wolf, W Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

In this paper, me present a method for reducing the memory requirements of an embedded system by using code compression. We compress the instruction segment of the executable running on the embedded system, and we show how to design a run-time decompression unit to decompress code on the fly before execution. Our algorithm uses arithmetic coding in combination with a Markov model, which is adapted to the instruction set and the application, We provide experimental results on two architectures, Analog Devices Share and ARM's ARM and Thumb instruction sets, and show that programs can often be reduced more than 50%, Furthermore, we suggest a table-based design that allows multibit decoding to speed up decompression.

关键词： arithmetic coding code compression embedded systems Markov models

来源：评论

学校读者我要写书评

暂无评论

One-Time Pad as a nonlinear dynamical system

引用

COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION 2012年第11期17卷 4029-4036页

作者： Nagaraj, Nithin Amrita Vishwa Vidyapeetham Amrita Sch Engn Dept Elect & Commun Engn Kollam 690525 Kerala India

The One-Time Pad (OTP) is the only known unbreakable cipher, proved mathematically by Shannon in 1949. In spite of several practical drawbacks of using the OTP, it continues to be used in quantum cryptography. DNA cryptography and even in classical cryptography when the highest form of security is desired (other popular algorithms like RSA, ECC, AES are not even proven to be computationally secure). In this work, we prove that the OTP encryption and decryption is equivalent to finding the initial condition on a pair of binary maps (Bernoulli shift). The binary map belongs to a family of 1D nonlinear chaotic and ergodic dynamical systems known as Generalized Luroth Series (GLS). Having established these interesting connections, we construct other perfect secrecy systems on the GLS that are equivalent to the One-Time Pad, generalizing for larger alphabets. We further show that OTP encryption is related to Randomized arithmetic coding - a scheme for joint compression and encryption. (C) 2012 Elsevier B.V. All rights reserved.

关键词： One-Time Pad Perfect secrecy Binary map Bernoulli shift arithmetic coding Generalized Luroth Series

来源：评论

学校读者我要写书评

暂无评论

Two-Symbol FPGA Architecture for Fast arithmetic Encoding in JPEG 2000

引用

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY 2012年第2期69卷 213-224页

作者： Kumar, Nandini Ramesh Xiang, Wei Wang, Yafeng Univ So Queensland Fac Engn & Surveying Toowoomba Qld 4350 Australia

JPEG 2000 is one of the most popular image compression standards offering significant performance advantages over previous image standards. High computational complexity of the JPEG 2000 algorithms makes it necessary to employ methods that overcomes the bottlenecks of the system and hence an efficient solution is imperative. One such crucial algorithms in JPEG 2000 is arithmetic coding and is completely based on bit level operations. In this paper, an efficient hardware implementation of arithmetic coding is proposed which uses efficient pipelining and parallel processing for intermediate blocks. The idea is to provide a two-symbol coding engine, which is efficient in terms of performance, memory and hardware. This architecture is implemented in Verilog hardware definition language and synthesized using Altera field programmable gate array. The only memory unit used in this design is a FIFO (first in first out) of 256 bits to store the CX-D pairs at the input, which is negligible compared to the existing arithmetic coding hardware designs. The simulation and synthesis results show that the operating frequency of the proposed architecture is greater than 100 MHz and it achieves a throughput of 212 Msymbols/sec, which is double the throughput of conventional one-symbol implementation and enables at least 50% throughput increase compared to the existing two-symbol architectures.

关键词： JPEG 2000 arithmetic coding MQ-Coder FPGA Two-symbol architecture

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The Scalar Scheme for Reversible Information-Embedding in Gray-Scale Signals: Capacity Evaluation and Code Constructions

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2012年第4期7卷 1155-1167页

作者： Lin, Sian-Jheng Chung, Wei-Ho Acad Sinica Res Ctr Informat Technol Innovat Taipei 115 Taiwan

Reversible information-embedding (RIE) is a technique transforming host signals and the message into the stego-signals, and the stego-signals can be losslessly reversed to the host signals and the message. We consider the conditions: 1) the host signals are composed of gray-scale independent and identically distributed (i.i.d.) samples;2) the mean squared error is adopted as the measure of distortion;and 3) the procedure is a scalar approach, i.e., the encoder only reads a host signal and then outputs the corresponding stego-signal in each iteration. In this paper, we propose an iterative algorithm to calculate the signal transition probabilities approximating the optimal rate-distortion bound. Then we propose an explicit implementation to embed a message in an i.i.d. host sequence. The experiments show that the proposed method closely approaches the expected rate-distortions in i.i.d. gray-scale signals. By the image prediction model, the proposed method can be applied to gray-scale images.

关键词： arithmetic coding gray-scale signals rate-distortion function reversible information embedding steganography

来源：评论

学校读者我要写书评

暂无评论

Lossless progressive compression of LiDAR data using hierarchical grid level distribution

引用

REMOTE SENSING LETTERS 2015年第3期6卷 190-198页

作者： Lipus, Bogdan Zalik, Borut Univ Maribor Lab Geometr Modeling & Multimedia Algorithms Fac Elect Engn & Comp Sci SLO-2000 Maribor Slovenia

This letter considers a new approach for the lossless progressive compression of light detection and ranging (LiDAR) data stored within a LAS file (public file format for the interchange of three-dimensional point cloud data), which is used for storing the results of LiDAR scanning. The presented method builds a hierarchical data model for arranging LAS points into different levels in one pass. The higher levels are compressed using variable length and arithmetic coding, whilst the lower levels apply a prediction model of the non-progressive compression schema. The order of the points, as captured by the LiDAR scanner, has to be preserved within each level as better compression ratios are achieved in this way.

关键词： OPTICAL radar LOSSLESS data compression LIDAR (Optics) arithmetic coding RADAR -- Optical equipment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：