• Title/Summary/Keyword: Block-based Image Compression

Search Result 179, Processing Time 0.047 seconds

A Deblocking Algorithm Using Anisotropic Diffusion for Block DCT-based Compressed Images (이방성 확산을 이용한 블록 DCT 기반 압축 영상의 블록효과 제거)

  • Choi, Euncheol;Han, Youngseok;Park, Min Kyu;Kang, Moon Gi
    • Journal of Broadcast Engineering
    • /
    • v.10 no.3
    • /
    • pp.383-391
    • /
    • 2005
  • In this paper, a new anisotropic diffusion based on Alvarez, Lions, and Morel (ALM) diffusion model is proposed for the suppression of blocking artifact caused by discrete cosine transform (DCT) based image compression. The proposed diffusion model, which incorporates a 'rate control parameter' (RCP), makes it possible to reduce blocking artifacts while to preserve the edge. The RCP controls the rate between isotropic and anisotropic diffusion. Isotropic diffusion is encouraged to eliminate the blocking artifacts in a block boundary of a smooth region, while anisotropic diffusion is encouraged to keep the edge or texture sharp in edge and a block boundary within an edge region. Additionally, to avoid oversmoothness of the texture region, a 'speed control parameter' (SCP), which makes diffusion process slow in the texture region, is employed.

Image Retrieval using Variable Block Size DCT (가변 블록 DCT를 이용한 영상 검색 기법)

  • 김동우;서은주;윤태승;안재형
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.5
    • /
    • pp.423-429
    • /
    • 2001
  • In this paper, we propose the improved method for retrieving images with DC element of DCT that is used in image compression such as JPEG/MPEG. The existing method retrieves images with DC of fixed block size DCT. In this method, the increase in the block size results in faster retrieving speed, but it lessens the accuracy. The decrease in the block size improves the accuracy, however, it degrades the retrieving speed. In order to solve this problem, the proposed method utilizes the variable block size DCT. This method first determines the existence of object regions within each block, and then creates an image region table. Based on this table, it determines the size of each block, following a simple rule; decrease the block size in the object regions, and increase the block size in the background regions. The proposed method using variable block size DCT improves about 15% in terms of the accuracy. Additionally, when there rarely exist images of same pattern, it is able to retrieve faster only by comparing the image region patterns.

  • PDF

Multiresolution Watermarking Scheme on DC Image in DCT Compressed Domain (DCT 압축영역에서의 DC 영상 기반 다해상도 워터마킹 기법)

  • Kim, Jung-Youn;Nam, Je-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.4
    • /
    • pp.1-9
    • /
    • 2008
  • This paper presents a rapid watermarking algorithm based on DC image, which provides a resilience to geometric distortion. Our proposed scheme is based on $8{\times}8$ block DCT that is widely used in image/video compression techniques (e.g., JPEG and MPEG). In particular, a DC image is analyzed by DWT to embed a watermark. To overcome a quality degradation caused by a watermark insertion into DC components, we discern carefully the intensity and amount of watermark along the different subbands of DWT. Note that the proposed technique supports a high throughput for a real-time watermark insertion and extraction by relying on a partial decoding (i.e., DC components) on $8{\times}8$ block DCT domain. Experimental result shows that the proposed watermarking scheme significantly reduces computation time of 82% compared with existing DC component based algorithm and yet provides invariant properties against various attacks such as geometric distortion and JPEG compression, etc.

Advanced Image Coding based on spacial domain prediction (공간 영역 예측에 의한 정지 영상 부호화)

  • Cho, Sang-Gyu;Moon, Joon;Hwang, Jae-Jeong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.425-428
    • /
    • 2005
  • This paper is made up Advanced Image Coding(AIC) that combines algorithms from next generation image coding standard, H.264/MPEG-4 Part 10 advanced video coding(AVC) and still image compression standard, JPEG(Joint Photographic Experts Group). AIC combines intra frame block prediction from H.264 with a JPEG style discrete cosine transform and quantization, followed by Context-based Adaptive Binary Arithmetic Coding(CABAC) as used in H.264. In this paper, we analyzes the efficiency of the AIC algorithm and JPEG and JPEG-2000, and it presents of result.

  • PDF

The Study about the Differential compression based on the ROI(Region Of Interest) (ROI(Region Of Interest)기반의 차등적 이미지 압축에 관한 연구)

  • Yun, Chi-Hwan;Ko, Sun-Woo;Lee, Geun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.3
    • /
    • pp.679-686
    • /
    • 2014
  • Recently, users can get countless images and videos by network. So, the compression technology of image and video is researched more and more. However, the situation which is the interested range of the image is occurred. For instance, since the region of face is more important than background, the image compression technology bases on the region of interest (ROI) is necessary, in the ATM environment. In this research, given the human visual system, which are not sensitive to illumination variations at very dark and light regions of image, we calculate the standard deviation of block and use this value to define the ROI. In encoding process, the relatively high quality can be obtained at the ROI and the relatively low quality can be obtained at the non ROI. In proposed scheme, the feature which is the encoding process according to subjectively image quality can be demonstrated. Finally, this proposed scheme is applied to JPEG standard. The experimental results demonstrate that proposed scheme can achieve better image quality at the high compression ratio.

Security Improvement Methods for Computer-based Test Systems (컴퓨터 기반 평가 시스템의 보안성 강화 방안)

  • Kim, Sang Hyun;Cho, Sang-Young
    • Convergence Security Journal
    • /
    • v.18 no.2
    • /
    • pp.33-40
    • /
    • 2018
  • ICT technology has been applied to various educational fields, but applying to educational test field is limited. Computer-based test (CBT) can overcome temporal and spatial constraints of conventional paper-based test, but is vulnerable to fraud by test parties. In this paper, we propose real-time monitoring and process management methods to enhance the security of CBT. In the proposed methods, the test screens of students are periodically captured and transferred to the professor screen to enable real-time monitoring, and the possible processes used for cheating can be blocked before testing. In order to monitor the screen of many students in real time, effective compression of the captured original image is important. We applied three-step compression methods: initial image compression, resolution reduction, and re-compression. Through this, the original image of about 6MB was converted into the storage image of about 3.8KB. We use the process extraction and management functions of Windows API to block the processes that may be used for cheating. The CBT system of this paper with the new security enhancement methods shows the superiority through comparison of the security related functions with the existing CBT systems.

  • PDF

Performance Comparison of Frequency-Based Watermarking Methods (주파수 기반 워터마킹 기법의 성능 비교)

  • Yim, Kyoung-Jin;Choi, Tae-Young
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.38 no.5
    • /
    • pp.65-76
    • /
    • 2001
  • In this paper, performance of frequency-based watermarking methods is compared, which are used to protect copyright of image data. For performance comparison of each transform method, a test image is transformed into frequency domain by a full- and block-discrete cosine transforms and wavelet transform, and after general image processing, robustness of each transform is evaluated with using the same watermark signals. Simulation results show that the watermarking method based on DCTs are more robust than WT. Especially, $8{\times}8$ BDCT is most robust for JPEG lossy compression and sharpening, while $8{\times}8$ FDCT is best. for smoothing and scaling. In addition, watermarking based on BDCT shows decreasing robustness for a larger block size, compared with general image processing.

  • PDF

Image Adaptive Block DCT-Based Perceptual Digital Watermarking (영상 특성에 적응적인 블록 DCT 기반 지각적 디지털 워터마킹)

  • 최윤희;최태선
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.6
    • /
    • pp.221-229
    • /
    • 2004
  • We present new digital watermarking scheme that embeds a watermark according to the characteristics of the image or video. The scheme is compatible with established image compression standard. We define a weighting function using a parent-child structure of the DCT coefficients in a block to embed a maximum watermark. The spatio-frequency localization of the DCT coefficients can be achieved with this structure. In the detection stage, we present an optimum a posteriori threshold with a given false detection error probability based on the statistical analysis. Simulation results show that the proposed algorithm is efficient and robust against various signal processing techniques. Especially, they are robust against widely used coding standards, such as JPEG and MPEG.

Design of Sigma Filter in DCT Domain and its application (DCT영역에서의 시그마 필터설계와 응용)

  • Kim, Myoung-Ho;Eom, Min-Young;Choe, Yoon-Sik
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.178-180
    • /
    • 2004
  • In this work, we propose new method of sigma filtering for efficient filtering and preserving edge regions in DCT Domain. In block-based image compression technique, the image is first divided into non-overlapping $8{\times}8$ blocks. Then, the two-dimensional DCT is computed for each $8{\times}8$ block. Once the DCT coefficients are obtained, they are quantized using a specific quantization table. Quantization of the DCT coefficients is a lossy process, and in this step, noise is added. In this work, we combine IDCT matrix and filter matrix to a new matrix to simplify filtering process to remove noise after IDCT in spatial domain, for each $8{\times}8$ DCT coefficient block, we determine whether this block is edge or homogeneous region. If this block is edge region, we divide this $8{\times}8$ block into four $4{\times}4$ sub-blocks, and do filtering process for sub-blocks which is homogeneous region. By this process, we can remove blocking artifacts efficiently preserving edge regions at the same time.

  • PDF

The Research of Efficient Context Coding Method for compression of High-resolution image in JPEG 2000 (고해상도 정지영상 압축을 위한 효율적인 JPEG2000용 Context 추출부의 연산 방법 연구)

  • Lee, Sung-Mok;Song, Jin-Gun;Ha, Joo-Young;Lee, Min-Woo;Kang, Bong-Soon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.97-100
    • /
    • 2007
  • In order to overcome many defects in the current JPEG standard of still image compression, the new JPEG2000 standard has been development. The JPEG2000 standard is based on the principles of DWT and EBCOT Entropy Coding. EBCOT(Embedded block coding with optimized truncation) is the most important technology in the latest image-coding standard, JPEG2000. However, EBCOT occupies the highest computation time to operate bit-level processing. Therefore, many researches have achieved methods to minimize computation speed of EBCOT. Thus, this paper proposes the method of context-extraction that improves computational architecture. This paper proposes efficient context coding method. The proposed algorithm would apply to hard-wired JPEG2000 Encoder that is used for compression of high resolution image.

  • PDF