• 대한전자공학회논문지
• /
• 제26권9호
• /
• pp.1410-1419
• /
• 1989

In this paper, we present a new synthetic high coding method which gives high image compression ratio. Given an image, only its low-pass component is transmitted by DCT coding` the high-pass component is not transmitted but synthesized using edge sharpening on the reconstructed low-pass image at the receiver. For the DCT coding which is used to encode the low-pass image, we used an improved version of Cox's variance estimator. Also, introduced are new image quality measures called GSNR and EPR which emphasize perceptual aspects of image quality. Experimental results show that the performance of the proposed synthetic high coding is better in various quality measures than that of Cox's adaptive transform coding. Also, it yields acceptable image quality with neither apparent block effect nor visible granular noise even at high compression ratio of about 30:1.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1790-1806
• /
• 2016

Digital image encryption is widely used for image data security. JPEG standard compresses image with great performance on reducing file size. Thus, to encrypt an image in JPEG format we should keep the quality of original image and reduced size. This paper proposes a JPEG image encryption scheme based on quantized DC and non-zero AC coefficients inner category scrambling. Instead of coefficient value encryption, the address of coefficient is encrypted to get the address of cipher text. Then 8*8 blocks are shuffled. Chaotic iteration is employed to generate chaotic sequences for address scrambling and block shuffling. Analysis of simulation shows the proposed scheme is resistant to common attacks. Moreover, the proposed method keeps the file size of the encrypted image in an acceptable range compared with the plain text. To enlarge the cipher text possible space and improve the resistance to sophisticated attacks, several additional procedures are further developed. Contrast experiments verify these procedures can refine the proposed scheme and achieve significant improvements.

• 한국통신학회논문지
• /
• 제26권6B호
• /
• pp.784-793
• /
• 2001

본 논문에서는 이산 여현변환에 기반으로 한 고압축의 복원된 영상으로 발생하는 블록화 현상을 제거하기 위한 개선된 후처리 기법을 제안한다. 먼저 압축으로부터 복원된 영상에 대하여, 변환 블록단위로 계산된 블록 경계 불연속값을 이용하여 블록화현상 블록과 에지블록을 구별한다. 블록화현상 블록은 다시 블록 경계면의 격차 정도에 따라 적응적으로 블록경계에서 필터링되는 화소 범위를 다르게 하여 필터링하며, 에지 블록은 다시 화소단위로 에지화소 여부를 조사하여, 에지가 아닌 화소만 필터링을 취하여 좀 더 세밀하게 블록화 현상을 제거하는 새로운 방법을 제안한다. 실험 결과를 통하여 제안한 방법이 기존 방법에 비해 시각적으로 향상된 영상을 얻을 수 있음을 입증하였다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 춘계학술대회 학술발표 논문집
• /
• pp.191-194
• /
• 1997

본 논문에서는 2D-DCT 변환된 동영상 프레임 사이의 오차 블록들의 활성 레벨(atcivity level)과 에지의 특성을 분류하여 동영상의 적응적인 양자화를 제안한다. 각 블록에서는 활성 레벨이 각기 다르고, 같은 활성 레벨이라 할지라도 에지의 특성도 각기 다르게 나타난다. 적응적인 양자화를 위해서, 2D-DCT 변환된 영상 오차의 각 블록의 활성레벨 뿐만 아니라 AC 계수들의 분포에 따른 에지 특성을 분류하면, 블록의 활성 레벨만을 일률적으로 적용한 Sorting 방법의 경우보다 향상된 영상을 복원할 수 있다. 블록의 활성 레벨은 AC energy에 의해서 측정하고, 에지 특성은 AC 계수들의 분포에 의해 결정하게 된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2941-2956
• /
• 2013

In this paper, we propose an effective fragile image watermarking scheme for tampering detection and content recovery. Cover image is divided into a series of non-overlapping blocks and a block mapping relationship is constructed by the secret key. Several DCT coefficients with direct current and lower frequencies of the MSBs for each block are used to generate the reference bits, and different coefficients are assigned with different bit numbers for representation according to their importance. To enhance recovery performance, authentication bits are generated by the MSBs and the reference bits, respectively. After LSB substitution hiding, the embedded watermark bits in each block consist of the information of itself and its mapping blocks. On the receiver side, all blocks with tampered MSBs can be detected and recovered using the valid extracted reference bits. Experimental results demonstrate the effectiveness of the proposed scheme.

• 한국정보처리학회논문지
• /
• 제7권7호
• /
• pp.2254-2263
• /
• 2000

This paper proposes an efficient predictive image-compression technique based on vector quantization of blocks of pels. In the proposed method edge contents of blocks control the selection of predictors and block shapes as well. The maximum number of bits assigned to quantizers has been in creased to 3bits/pel from 1/5bits/pel, the setting employed by forerunners in predictive vector quantization of images. This increase prevents the saturation in SNR observed in their results in high bit rates. The variable block shape is instrumental in eh reconstruction of edges. The adaptive procedure is controlled by means of he standard deviation ofp rediction errors generated by a default predictor; the standard deviation address a decision table which can be set up beforehand. eh proposed method is characterized by overall improvements in image quality over A-VQ-PE and A-DCT VQ, both of which are known for their efficient use of vector quantizers.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.577-580
• /
• 1999

Padding is a technique that enables applying conventional discrete cosine transform to encode boundary blocks of arbitrarily shaped objects by assigning imaginary values to the pixels that are not included in the object. Padding prevents the increase of high frequency DCT coefficients. However, in some boundary blocks, too many padded pixels are coded due to a small portion of object pixels. To reduce the number of padded pixels and to improve coding efficiency, we propose a block merging method for texture coding. The proposed mothed searches the shape information of boundary blocks and excludes the 4$\times$4 pixels of 8$\times$8 blocks if all the 4$\times$4 pixels are in the background region, and merges the remained 4$\times$4 pixels into new 8$\times$8 blocks. Experimental results show that our proposed method yields a rate-distortion gain about 0.5~1.6㏈ compared to conventional padding method, LPE

• 전자공학회논문지B
• /
• 제32B권12호
• /
• pp.1614-1623
• /
• 1995

In this paper we propose a region-adaptive CELP image coder for still images at low bit rates below 0.5 bpp. The proposed method partitions the image into stochastically similar regions by the minimum spanning tree method and finds prediction coefficients for each region using a 2- dimensional linear prediction model. Coding is carried out on 8$\times$8 blocks and when there are several regions included in a block, an image is synthesized using the prediction coefficients of each region. Computer simulation results show that the proposed method allows improved synthesized image over conventional block-adaptive CELP methods, especially at edges. In addition, performance comparison with the JPEG DCT method shows that while the JPEG method shows block distortion and staircase effects (ragged edges) at bit rates below 0.5 bpp, the proposed CELP method shows improved synthesized images with such effects reduced.

• Journal of Electrical Engineering and information Science
• /
• 제2권6호
• /
• pp.138-145
• /
• 1997

This paper proposes an adaptive algorithm for the quantization step size control of MPEG-2, using the information obtained from the previously encoded picture. Before quantizing the DCT coefficients, the properties of reconstruction error of each macro block (MB) is predicted from the previous frame. For the prediction of the error of current MB, a block with the size of MB in the previous frame are chosen by use of the motion vector. Since the original and reconstructed images of the previous frame are available in the encoder, we can calculate the reconstruction error of this block. This error is considered as the expected error of the current MB if it is quantized with the same step size and bit rate. Comparing the error of the MB with the average of overall MBs, if it is larger than the average, small step size is given for this MB, and vice versa. As a result, the error distribution of the MB is more concentrated to the average, giving low variance and improved image quality. Especially for the low bit application, the proposed algorithm gives much smaller error variance and higher PSNR compared to TM5 (test model 5).

• 한국통신학회논문지
• /
• 제21권4호
• /
• pp.822-833
• /
• 1996

The video coding for very low bit rate has recently received considerable attention, but conventional block based transform coding schemes suffer from the blocking effect for the constraints of bit rates. In this paper, we present a video coding sysem suing multi-resolution motion estimation/compensation with variable size block(VMRME/C) and multi-resolution vector quantization(MRVQ) in wavelet transform domain for very low bit rate coding. It is shown that the presented scheme has better performance in the peak signal-to-nose ratio(RSNR) by 0.2-0.6 dB as well as subjective quality than that of conventional block based transform video coding techniques(especially, H. 263 which is DCT based video coding).