• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1957-1962
• /
• 2001

Image and video compression requires quantization error model of DCT coefficients for post processing, restoration or transcoding. Once DCT coefficients are quantized, it is impossible to recover the original distribution. We assume that the original probability density function (pdf) is the Laplacian function. We calculate the variance of the quantized variable, and estimate the variance of the DCT coefficients. We can confirm that the proposed method enhances the accuracy of the quantization error estimation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.113-123
• /
• 2007

In Ubiquitous communication environment, various conversions of images are essential, and most digital images are compressed by standard methods such as the Joint Photographic Expert Group (JPEG) and Motion Picture Expert Group (MPEG) which are based on the discrete cosine transform (DCT). In this paper, various image resizing algorithms in the DCT domain are analyzed, and a new image resizing algorithm, which shows superior performance compared with the conventional methods, is proposed. For arbitrary-ratio image resizing in the DCT domain, several blocks of $8{\times}8$ DCT coefficients are converted into one block using the conversion formula in the proposed algorithm, and the size of the inverse discrete cosine transform (IDCT) is decided optimally. The performance is analyzed by comparing the peak signal to noise ratio (PSNR) between original images and converted images. The performance of the proposed algorithm is better than that of the conventional algorithm, since the correlation of pixels in images is utilized more efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.5B
• /
• pp.669-676
• /
• 2001

본 논문은 DCT 기반의 블라인드 워터마킹 방법에 관한 연구 결과이다. 본 논문에서 사용한 4096비트의 워터마크는 512x512 영상이 수용할 수 있는 최대 용량의 절반에 해당한다. 각 워터마크 비트는 8x8 DCT 블록의 12개의 계수에 확산 패턴을 이용하여 삽입하였다. 워터마크 삽입 과정에서, 워터마크 이득 계수는 비가시성과 견고성을 고려하여 최적화되었다. 워터마크 검출 과정에서는, 상관검출을 통하여 워터마크에 대한 예비판정을 하며, 이진가설 검증의 검증 과정을 통해서 예비판정에서의 검출 오류를 수정하였다. 검증 과정에서는 복원된 DCT계수를 이용한 가중치가 사용되었으며, 대부분의 예비 판정의 오류는 검증 과정에서 수정이 되었다. 실험 결과, 영상에 공격이 가해지지 않은 경우는 최종 검증 후에 BER이 0.5% 미만으로 낮아졌으며, 20% JPEG의 고압축에서도 BER이 9% 미만으로 산출되었다. 기존의 방법들과의 비교에서, 제안한 방법은 워터마크 검출 성능 및 워터마크 용량 측면에서 우수하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.461-467
• /
• 2003

We propose an efficient method for separable symmetric linear filtering in the DCT domain. First, separable 2-D linear filtering is decomposed into the cascade of 1-D filtering in the DCT domain. We investigate special characteristics of DCT domain filtering matrices when the filter coefficients are symmetric. Then we present the DCT domain 2-D filtering method using these characteristics. The proposed method requires smaller number of multiplications including typical sparseness of DCT coefficients compared to previous DCT domain linear filtering methods. Also, the proposed method is composed of simple and regular operations, which would be appropriate for efficient VLSI implementation.

• Journal of the Korean Society of Radiology
• /
• v.6 no.3
• /
• pp.167-171
• /
• 2012

In this paper, we present an algorithm to extract features about disease region in digital stomach images. For feature extraction, DCT coefficients of gastrointestinal imaging matrix was obtained. DCT coefficent matrix is concentrated energy in low frequency region, we were extracted 128 feature parameters in low frequency region. Extracted feature parameters can using for differential compression of PACS and, can using for input parameter in CAD.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.28-38
• /
• 2000

This paper proposes a fractal compression method using the domain classification and local searching, which utilize DCT coefficient characteristic Generally, the fractal Image encoding method has a time consuming process to search a domain to be matched with range block In order to reduce computation complexity, the domain and range regions are respectively classified into 4 category by using the characteristics of DCT coefficients and each range region is encoded by a method suitable for the property of its category Since the bit amount of the compressed image depends on the number of range blocks, the matching of domain block and range block is induced on the large range block by using local search, so that compression ratio is increased by reducing the number of range block In the local search, the searching complexity is reduced by determining the direction and distance of searching using the characteristics of DCT coefficients The experimental results shows that the proposed algorithm have 1 dB higher PSNR and 0 806 higher compression ratio than previous algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.47-56
• /
• 1993

In this paper, pyramidal VQ image coding by DCT classifier based on HVS is studied. The proposed DCT classifier based on HVS is that the transform subblocks of the image are mlultiplied by MTF which is a sort of band pass filter and sorted by the magnitude of their ac energy levels and classifeid into three classes such as low, middle and high variance class by the threshold and then edges are detected in comparison of the energy sum of ac transform coefficients corresponding to the different edge directions.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.8
• /
• pp.86-95
• /
• 1998

Intra-frame video compression, which cannot make use of temporal predictions, requires much higher bit rates compared with inter-frame schemes. In order to reduce bit rates, intra-frame predictive coding methods in DCT domain have been studied especially within the framework of the MPEG-4 video coding standard currently being developed. In this paper, we propose novel intra-frame predictive coding methods in DCT domain with the marginal complexity increase over the conventional methods . The proposed methods consist of a DC coefficient prediction method and two AC coefficient prediction methods. The proposed methods consist of a DC coefficient prediction method and two AC coefficient prediction methods. The proposed DC coefficient prediction method makes it possible to adaptively select the prediction directions without overhead bits, by comparing gradients of DC coefficients from neighboring blocks. As the AC coefficient prediction methods, first, we present an effective method which can improve the prediction directions of the MPEG-4 scheme by considering the DC coefficient of the current block to be coded. And, we present another effective method that decision on the prediction is carried out for each AC coefficient. Simulation results show that substantial bit savings can be achieved by the proposed methods.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.506-509
• /
• 2001

본 논문에서는 디지털 영상의 변조를 확인함과 동시에 변조의 위치를 확인하는 DCT 기반의 fragile watermarking을 제안한다. 디지털 영상의 인증과 무결성을 위해 기존의 Wong이 사용한 해쉬 함수와 비대칭키 암호 알고리즘을 사용하며, 영상에 DCT 변환을 함으로서 영상의 모든 픽셀에 워터마크를 삽입하지 않고서도 변조의 유무를 확인하는 것이 가능하다. 본 논문에서는 DCT 계수 중 일부 저주파 계수의 하위 비트에 워터마크를 삽입하여 워터마크의 비가시성과 연성을 만족하며 변조의 유무와 위치를 확인한 수 있게 된다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.663-674
• /
• 1993

In this paper, a DCT image coding algorithm using the human visual property is proposed. Human visual is relatively sensitive to noise in the darker region, insensitive to noise in the brighter region. This property was proved by Weber's law through psycovisual experiment. Weber's law states that the just noticeable difference (j.n.d.) is proportional to intensity. Therefore, the implication of this observation for image processing is that reducing noise in the darker region is more important than reducing noise in the brighter region. In this proposed coding scheme AC coefficients in the darker region are more finely quantized than those in the brighter region. Results showed that, at low bit rate, the subjective quality of reconstructed images by proposed coding scheme is improved than that of coding scheme without considering human visual property.