• 한국정보통신학회논문지
• /
• 제14권10호
• /
• pp.2254-2260
• /
• 2010

본 논문에서는 H.264/AVC 표준에서 사용되는 정수 변환을 변형하여 무손실 압축에 효율적인 변환 구현 방법을 제안한다. 기존의 가역(reversible) 변환용으로 제시된 정수 변환은 변환 계수의 값의 범위가 상당히 커서 무손실 압축에 효율적이지 못한 면이 있다. 이런 문제점을 해결하기 위해서 효율적인 정수 변환을 제시한다. 기존 정수 변환의 변형은 고속 연산 수행을 위해서 리프팅을 기반으로 설계되고 효율적인 구조를 도출한다. 본 논문의 결과로서 고속 연산 수행을 위한 신호 흐름도를 제시하고, 이에 관련된 실험 결과를 제공한다. 실험 결과는 제안된 변형 정수변환이 기존 구현 방법에 비하여 무손실 압축 성능에서 우수하단 것을 보여준다.

• 전기학회논문지
• /
• 제62권7호
• /
• pp.1003-1008
• /
• 2013

This paper proposes a compression scheme based on the modified reversible integer transform (MRIT) and forward adaptive prediction for lossless image compression. JPEG XR is the newest image coding standard with high compression ratio and that composed of the Photo Core Transform (PCT) and backward adaptive prediction. To improve the efficiency and quality of compression, we substitutes the PCT and backward adaptive prediction for the modified reversible integer transform (MRIT) and forward adaptive prediction, respectively. Experimental results indicate that the proposed method are superior to the previous method of JPEG XR in terms of lossless compression efficiency and computational complexity.

• 한국정보통신학회논문지
• /
• 제16권6호
• /
• pp.1273-1278
• /
• 2012

본 논문에서는 무손실 영상 압축에서 쓰이는 변형된 정수 변환들을 설명하고 이를 2차원으로 확장한 것에 대한 성능 분석을 제시한다. 변형된 정수 변환들은 2차원으로 확장하는 방법에 따라서 그 성능 및 복잡도가 다른 면이 있다. 따라서 본 논문에서는 분리 가능한 형태로 확장한 변형 H.264 정수 변환 및 리프팅 구조를 이용한 가역 정수 변환과 분리 가능하지 않은 형태로 확장한 JPEG XR의 PCT변환에 대한 성능 및 복잡도를 비교 분석하여 제시하고, 이에 관련된 실험 결과를 제공한다. 실험 결과는 리프팅 구조를 이용하여 변형된 가역 정수 변환을 분리 가능한 형태로 확장하는 방법이 압축 효율면에서 가장 우수함을 보여준다.

• 정보통신설비학회논문지
• /
• 제5권1호
• /
• pp.37-42
• /
• 2006

A reversible audio watermarking algorithm is presented in this paper. This algorithm transforms the audio signal with the integer wavelet transform first in order to enhance the correlation between neighbor audio samples. Audio signal has low correlation between neighbor samples, which makes it difficult to apply difference expansion scheme. Second, a novel difference expansion scheme is used to embed more data by reducing the size of location map. Therefore, the difference expansion scheme used in this paper theoretically secures high embedding capacity under low perceptual distortion. Experiments show that this scheme can hide large number of information bits and keeps high perceptual quality.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.473-476
• /
• 2003

We suggest 2 dimensional Fast Fourier Transform using Polynomial Transform and integer Fast Fourier Transform. Unlike conventional 2D-FFT using the direct quantization of twiddle factor, the suggested 2D-FFT adopts implemented by the lifting so that the suggested 2D-FFT is power adaptable and reversible. Since the suggested FFT performg integer-to-integer mapping, the transform can be implemented by only bit shifts and auditions without multiplications. In addition. polynomial transform severely reduces the multiplications of 2D-FFT. While preserving the reversibility, complexity of this algorithm is shown to be much lower than that of any other algorithms in terms of the numbers of additions and shifts.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2395-2398
• /
• 2003

This paper focuses on lossless medical image compression methods for medical images that operate on two-dimensional(2D) reversible integer wavelet transform. We offer an application of the Set Partitioning in Hierarchical Trees(SPIHT) algorithm [1][3][9] to medical images, using a 2D wavelet decomposition and a 2D spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method, where careful scaling and truncations keep the integer precision small and the transform unitary. We have tested our encoder on medical images using different integer filters. Results show that our algorithm with certain filters performs as well and sometimes better in lossless coding than previous coding systems using 2D integer wavelet transforms on medical images.

• ETRI Journal
• /
• 제34권3호
• /
• pp.429-438
• /
• 2012

This study presents two reversible data hiding schemes based on the coefficient shifting (CS) algorithm. The first scheme uses the CS algorithm with a mean predictor in the spatial domain to provide a large payload while minimizing distortion. To guard against manipulations, the second scheme uses a robust version of the CS algorithm with feature embedding implemented in the integer wavelet transform domain. Simulations demonstrate that both the payload and peak signal-to-noise ratio generated by the CS algorithm with a mean predictor are better than those generated by existing techniques. In addition, the marked images generated by the variant of the CS algorithm are robust to various manipulations created by JPEG2000 compression, JPEG compression, noise additions, (edge) sharpening, low-pass filtering, bit truncation, brightness, contrast, (color) quantization, winding, zigzag and poster edge distortion, and inversion.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4603-4624
• /
• 2016

In this paper, a new reversible watermarking algorithm with adaptive embedding threshold matrix is proposed. Firstly, to avoid the overflow and underflow, two flexible thresholds, TL and TR, are applied to preprocess the image histogram with least histogram shift cost. Secondly, for achieving an optimal or near optimal tradeoff between the embedding capacity and imperceptibility, the embedding threshold matrix, composed of the embedding thresholds of all blocks, is determined adaptively by the combination between the composite chaos and the average energy of Integer Wavelet Transform (IWT) block. As a non-liner system with good randomness, the composite chaos is suitable to search the optimal embedding thresholds. Meanwhile, the average energy of IWT block is calculated to adjust the block embedding capacity, and more data are embedded into those IWT blocks with larger average energy. The experimental results demonstrate that compared with the state-of-the-art reversible watermarking schemes, the proposed scheme has better performance for the tradeoff between the embedding capacity and imperceptibility.