A High-performance Low Cost Inverse Integer Transform Architecture for AVS Video Standard

A high-performance, low cost inverse integer transform architecture for advanced video standard （AVS） video coding standard was presented. An 8 × 8 inverse integer transform is required in AVS video system which is compute-intensive. A hardware transform is inevitable to compute the transform for the real-time application. Compared with the 4 × 4 transform for H.264/AVC, the 8 × 8 integer transform is much more complex and the coefficient in the inverse transform matrix Ts is not inerratic as that in H.264/AVC. Dividing the Ts into matrix Ss and Rs, the proposed architecture is implemented with the adders and the specific CSA-trees instead of multipliers, which are area and time consuming. The architecture obtains the data processing rate up to 8 pixels per-cycle at a low cost of area. Synthesized to TSMC 0.18 μm COMS process, the architecture attains the operating frequency of 300 MHz at cost of 34 252 gates with a 2-stage pipeline scheme. A reusable scheme is also introduced for the area optimization, which results in the operating frequency of 143 MHz at cost of only 19 758 gates.

A new all-zero 4×4 block determination rule for integer transform and quantization in AVS-M encoder

A new all-zero block determination rule was used to reduce the complexity of the AVS-M encoder. It reuses the sum of absolute difference of 4x4 block obtained from motion estimation or intra prediction as parameters so that the determination threshold need to be computed only once when quantization parameter (QP) is invariable for given video sequence. This method avoids a lot of computation for transform, quantization, inverse transform, inverse quantization and block reconstruction. Simulation results showed that it can save about 20%～50% computation without any video quality degradation.

Low Complexity Integer Transform and Adaptive Quantization Optimization

In this paper, a new low complexity integer transform is proposed, which has been adopted by AVS1-PT. The proposed transform can enable AVS1-P7 to share the same quantization/dequantization table with AVS1-P2. As the bases of the proposed transform coefficients are very close, the transform normalization can be implemented only on the encoder side and the dequantization table size can be reduced compared with the transform used in H.264/MPEG-4 AVC. Along with the feature of the proposed transform, adaptive dead-zone quantization optimization for the proposed transform is studied. Experimental results show that the proposed integer transform has similar coding performance compared with the transform used in H.264/MPEG-4 AVC, and would gain near 0.1dB with the adaptive dead-zone quantization optimization.

Fragile Audio Watermarking with Perfect Restoration Capacity Based on an Adapted Integer Transform

We propose a novel audio watermarking scheme which can recover the original audio carrier perfectly if the watermarked audio is modified. Besides, we can adjust the maximum tampered rate allowed and the quality of watermarked audio flexibly as required. In the scheme, an efficient generalized integer transform is improved to embed watermark data which are composed of least significant bits（LSBs） of averages in each patch, reference-bits and check-bits. LSBs are needed in the inverse transform. Then, by comparing the extracted check-bits and calculated ones, the modified area can be localized. Finally, reliable reference-bits and samples data help us reconstruct the original audio without errors. The efficiency of the proposed method is theoretically and experimentally verified.

A secure image steganography algorithm based on least significant bit and integer wavelet transform

The rapid development of data communication in modern era demands secure exchange of information. Steganography is an established method for hiding secret data from an unauthorized access into a cover object in such a way that it is invisible to human eyes. The cover object can be image, text, audio,or video. This paper proposes a secure steganography algorithm that hides a bitstream of the secret text into the least significant bits（LSBs） of the approximation coefficients of the integer wavelet transform（IWT） of grayscale images as well as each component of color images to form stego-images. The embedding and extracting phases of the proposed steganography algorithms are performed using the MATLAB software. Invisibility, payload capacity, and security in terms of peak signal to noise ratio（PSNR） and robustness are the key challenges to steganography. The statistical distortion between the cover images and the stego-images is measured by using the mean square error（MSE） and the PSNR, while the degree of closeness between them is evaluated using the normalized cross correlation（NCC）. The experimental results show that, the proposed algorithms can hide the secret text with a large payload capacity with a high level of security and a higher invisibility. Furthermore, the proposed technique is computationally efficient and better results for both PSNR and NCC are achieved compared with the previous algorithms.

Seismic data compression based on integer wavelet transform

Due to the particularity of the seismic data, they must be treated by lossless compression algorithm in some cases. In the paper, based on the integer wavelet transform, the lossless compression algorithm is studied. Comparing with the traditional algorithm, it can better improve the compression rate. CDF (2, n) biorthogonal wavelet family can lead to better compression ratio than other CDF family, SWE and CRF, which is owe to its capability in can- celing data redundancies and focusing data characteristics. CDF (2, n) family is suitable as the wavelet function of the lossless compression seismic data.

An Approach to Integer Wavelet Transform for Medical Image Compression in PACS

We study an approach to integer wavelet transform for lossless compression of medical image in medical picture archiving and communication system (PACS). By lifting scheme a reversible integer wavelet transform is generated, which has the similar features with the corresponding biorthogonal wavelet transform. Experimental results of the method based on integer wavelet transform are given to show better performance and great applicable potentiality in medical image compression.

A Recursive High Payload Reversible Data Hiding Using Integer Wavelet and Arnold Transform

Reversible data hiding is an information hiding technique that requires the retrieval of the error free cover image after the extraction of the secret image.We suggested a technique in this research that uses a recursive embedding method to increase capacity substantially using the Integer wavelet transform and the Arnold transform.The notion of Integer wavelet transforms is to ensure that all coefficients of the cover images are used during embedding with an increase in payload.By scrambling the cover image,Arnold transform adds security to the information that gets embedded and also allows embedding more information in each iteration.The hybrid combination of Integer wavelet transform and Arnold transform results to build a more efficient and secure system.The proposed method employs a set of keys to ensure that information cannot be decoded by an attacker.The experimental results show that it aids in the development of a more secure storage system and withstand few tampering attacks The suggested technique is tested on many image formats,including medical images.Various performance metrics proves that the retrieved cover image and hidden image are both intact.This System is proven to withstand rotation attack as well.

High-performance multi-transform architecture for H.264/AVC

In order to increase the hardware utilization and minimize the chip area a multi-transform coding architecture which includes 4 ×4 forward integer transform 4 ×4 inverse integer transform 4 ×4 Hadamard transform and 2 ×2 Hadamard transform is proposed. By simplifying these transforms and exploring their similarities the proposed design merges the architectures processing individual transforms into a high-performance multi-transform coding architecture.Using a semiconductor manufacturing international corporation SMIC 0.18 μm complementary metal oxide semiconductor CMOS technology the proposed architecture achieves the maximum operating clock frequency of 200 MHz and the throughput rate of 800 ×106 pixel/s with the hardware cost of 3 704 gates.The results demonstrate that the data throughput rate per unit area DTUA of this design is at least 40.28%higher than that of the reference design.This design can meet the requirements of real-time decoding digital cinema video 4 096 ×2 048@30 Hz at 62.9 MHz which helps to reduce the power consumption.

ALL ZERO MACROBLOCK DECISION METHOD FOR H.26L

In order to reduce the computation in the part of motion search and transform in H.26L encoder, an all-zero macroblock decision method based on integer transform and motion search is proposed in this paper. According to the characteristics of integer transform and motion search in H.26L, all-zero macroblock decision is made in inter frame coding by comparing Sum of the Absolute Differences(SAD) with a value related with Quantization Parameter(QP)before integer transform. It avoids a large amount of computation in motion search, transform and quantization. This technology highly improves the efficiency of real time H.26L encoder by skipping all-zero macroblock before integer transform and shortening the code stream at the same time.

整数矩阵及其在解线性方程组方面的应用

讨论整系数方程组解的存在性与求解方法.

一种用于图像压缩的积分小波变换算法

提出了一种基于积分小波变换的图像压缩和重建的无损算法,并证明了这种算法所满足的条件.在不经过光滑处理的前提下,应用提升原理可将量化噪声降低到阈值以下.

A reversibility-gain model for integer Karhunen-Loève transform design in video coding

Karhunen-Loeve transform （KLT） is the optimal transform that minimizes distortion at a given bit allocation for Gaussian source. As a KLT matrix usually contains non-integers, integer-KLT design is a classical problem. In this paper, a joint reversibility-gain （R-G） model is proposed for integer-KLT design in video coding. Specifically, the ＇reversibility＇ is modeled according to distortion analysis in using forward and inverse integer transform without quantization. It not only measures how invcrtible a transform is, but also bounds the distortion introduced by the non-orthonormal integer transform process. The ＇gain＇ means transform coding gain （TCG）, which is a widely used criterion for transform design in video coding. Since KLT maximizes the TCG under some assumptions, here we define the TCG loss ratio （LR） to measure how much coding gain an integer-KLT loses when compared with the original KLT. Thus, the R-G model can be explained as follows： subject to a certain TCG LR, an integer- KLT with the best reversibility is the optimal integer transform for a given non-integer-KLT. Experimental results show that the R-G model can guide the design of integer-KLTs with good performance.

Quantization Skipping Method for H.264/AVC Video Coding

This paper presents a quantization skipping method for H. 264/AVC video coding standard. In order to reduce the conputational-cost of quantization process coming from integer discrete cosine transform of H. 264/AVC, a quantization skipping condition is derived by the analysis of integer transform and quantization procedures. The expeerimental results show that the proposed algorithm has the capability to reduce the computional cost about 10% -2.5%.

同余方程(组)的整数处理方法

将同余方程组n∑j=1aijxj≡bi(modmi)(i=1,…,k)化为整系数方程组n∑j=1aijxj-mxn+i=bi(i=1,…,k),利用文献[2]中提供的通过对整数矩阵的初等变换方法处理解的存在性与具体求解.另外,对同余方程组x≡ai(modmi),1≤i≤k,在有解时提出求解公式x≡(M1/d)b1a1+…+(Mk/d)bkak(mod[m1,…,mk])并利用文献[3]中的初等变换的方法,求出bi(1≤i≤k),从而得到同余方程组的解.

A LOSSLESS COMPRESSION ALGORITHM OF REMOTE SENSING IMAGE FOR SPACE APPLICATIONS

A simple and adaptive lossless compression algorithm is proposed for remote sensing image compression, which includes integer wavelet transform and the Rice entropy coder. By analyzing the probability distribution of integer wavelet transform coefficients and the characteristics of Rice entropy coder, the divide and rule method is used for high-frequency sub-bands and low-frequency one. High-frequency sub-bands are coded by the Rice entropy coder, and low-frequency coefficients are predicted before coding. The role of predictor is to map the low-frequency coefficients into symbols suitable for the entropy coding. Experimental results show that the average Comprcssion Ratio （CR） of our approach is about two, which is close to that of JPEG 2000. The algorithm is simple and easy to be implemented in hardware. Moreover, it has the merits of adaptability, and independent data packet. So the algorithm can adapt to space lossless compression applications.

An Image Fusion Algorithm Based on Lifting Scheme

Taking the advantage of the lifting scheme＇s characters that can build wavelet translorms tor transforming from integer to integer and the quality of the reconstructing image＇is independent of the topology way adopted by the boundary, an image fusion algorithm based on lifting scheme is proposed. This paper discusses the fundamental theory of lifting scheme firstly and then after taking transform analysis according to a kind of images that need to be confused.

Meaningful image encryption algorithm based on compressive sensing and integer wavelet transform

A new meaningful image encryption algorithm based on compressive sensing(CS)and integer wavelet transformation(IWT)is proposed in this study.First of all,the initial values of chaotic system are encrypted by RSA algorithm,and then they are open as public keys.To make the chaotic sequence more random,a mathematical model is constructed to improve the random performance.Then,the plain image is compressed and encrypted to obtain the secret image.Secondly,the secret image is inserted with numbers zero to extend its size same to the plain image.After applying IWT to the carrier image and discrete wavelet transformation(DWT)to the inserted image,the secret image is embedded into the carrier image.Finally,a meaningful carrier image embedded with secret plain image can be obtained by inverse IWT.Here,the measurement matrix is built by both chaotic system and Hadamard matrix,which not only retains the characteristics of Hadamard matrix,but also has the property of control and synchronization of chaotic system.Especially,information entropy of the plain image is employed to produce the initial conditions of chaotic system.As a result,the proposed algorithm can resist known-plaintext attack(KPA)and chosen-plaintext attack(CPA).By the help of asymmetric cipher algorithm RSA,no extra transmission is needed in the communication.Experimental simulations show that the normalized correlation(NC)values between the host image and the cipher image are high.That is to say,the proposed encryption algorithm is imperceptible and has good hiding effect.

Application of Zero-Watermarking for Medical Image in Intelligent Sensor Network Security

The field of healthcare is considered to be the most promising application of intelligent sensor networks.However,the security and privacy protection ofmedical images collected by intelligent sensor networks is a hot problem that has attracted more and more attention.Fortunately,digital watermarking provides an effective method to solve this problem.In order to improve the robustness of the medical image watermarking scheme,in this paper,we propose a novel zero-watermarking algorithm with the integer wavelet transform(IWT),Schur decomposition and image block energy.Specifically,we first use IWT to extract low-frequency information and divide them into non-overlapping blocks,then we decompose the sub-blocks by Schur decomposition.After that,the feature matrix is constructed according to the relationship between the image block energy and the whole image energy.At the same time,we encrypt watermarking with the logistic chaotic position scrambling.Finally,the zero-watermarking is obtained by XOR operation with the encrypted watermarking.Three indexes of peak signal-to-noise ratio,normalization coefficient(NC)and the bit error rate(BER)are used to evaluate the robustness of the algorithm.According to the experimental results,most of the NC values are around 0.9 under various attacks,while the BER values are very close to 0.These experimental results show that the proposed algorithm is more robust than the existing zero-watermarking methods,which indicates it is more suitable for medical image privacy and security protection.

关于高斯整环上DFT的一个问题

讨论了在Z[i]中已知N和α,如何确定M,使得N,α和M构成环I_(M_2)(i)上的DFT的问题,并给出了一个充分必要条件.