• 제목/요약/키워드: Terms Image compression

검색결과 87건 처리시간 0.03초

JPEG-based Variable Block-Size Image Compression using CIE La*b* Color Space

  • Kahu, Samruddhi Y.;Bhurchandi, Kishor M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권10호
    • /
    • pp.5056-5078
    • /
    • 2018
  • In this work we propose a compression technique that makes use of linear and perceptually uniform CIE $La^*b^*$ color space in the JPEG image compression framework to improve its performance at lower bitrates. To generate quantization matrices suitable for the linear and perceptually uniform CIE $La^*b^*$ color space, a novel linear Contrast Sensitivity Function (CSF) is used. The compression performance in terms of Compression Ratio (CR) and Peak Signal to Noise Ratio (PSNR), is further improved by utilizing image dependent, variable and non-uniform image sub-blocks generated using a proposed histogram-based merging technique. Experimental results indicate that the proposed linear CSF based quantization technique yields, on an average, 8% increase in CR for the same reconstructed image quality in terms of PSNR as compared to the conventional YCbCr color space. The proposed scheme also outperforms JPEG in terms of CR by an average of 45.01% for the same reconstructed image quality.

The Effects of Image Dehazing Methods Using Dehazing Contrast-Enhancement Filters on Image Compression

  • Wang, Liping;Zhou, Xiao;Wang, Chengyou;Li, Weizhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권7호
    • /
    • pp.3245-3271
    • /
    • 2016
  • To obtain well-dehazed images at the receiver while sustaining low bit rates in the transmission pipeline, this paper investigates the effects of image dehazing methods using dehazing contrast-enhancement filters on image compression for surveillance systems. At first, this paper proposes a novel image dehazing method by using a new method of calculating the transmission function—namely, the direct denoising method. Next, we deduce the dehazing effects of the direct denoising method and image dehazing method based on dark channel prior (DCP) on image compression in terms of ringing artifacts and blocking artifacts. It can be concluded that the direct denoising method performs better than the DCP method for decompressed (reconstructed) images. We also improve the direct denoising method to obtain more desirable dehazed images with higher contrast, using the saliency map as the guidance image to modify the transmission function. Finally, we adjust the parameters of dehazing contrast-enhancement filters to obtain a corresponding composite peak signal-to-noise ratio (CPSNR) and blind image quality assessment (BIQA) of the decompressed images. Experimental results show that different filters have different effects on image compression. Moreover, our proposed dehazing method can strike a balance between image dehazing and image compression.

잡음제거 합성곱 신경망을 이용한 이미지 복원방법 (Image Restoration Method using Denoising CNN)

  • 김선재;이정호;이석환;전동산
    • 한국멀티미디어학회논문지
    • /
    • 제25권1호
    • /
    • pp.29-38
    • /
    • 2022
  • Although image compression is one of the essential technologies to transmit image data on a variety of surveillance and mobile healthcare applications, it causes unnecessary compression artifacts such as blocking and ringing artifacts by the lossy compression in the limited network bandwidth. Recently, image restoration methods using convolutional neural network (CNN) show the significant improvement of image quality from the compressed images. In this paper, we propose Image Denoising Convolutional Neural Networks (IDCNN) to reduce the compression artifacts for the purpose of improving the performance of object classification. In order to evaluate the classification accuracy, we used the ImageNet test dataset consisting of 50,000 natural images and measured the classification performance in terms of Top-1 and Top-5 accuracy. Experimental results show that the proposed IDCNN can improve Top-1 and Top-5 accuracy as high as 2.46% and 2.42%, respectively.

2차원 참조 기법을 이용한 3D 컬러 집적 영상의 압축 (Compression of 3D color integral images using 2D referencing technique)

  • 김종호;유훈
    • 한국정보통신학회논문지
    • /
    • 제13권12호
    • /
    • pp.2693-2700
    • /
    • 2009
  • 본 논문에서는 렌즈 배열에 의한 대용량의 3차원 집적 영상을 활용하기 위한 효율적인 압축 방법을 제안한다. 기존의 정지영상 압축 기법은 각 요소 영상간의 상관도를 적절하게 제거하지 못하여 압축 효율 및 화질 측면에서 낮은 성능을 보인다. 또한, 각 요소 영상을 1차원 스캔방법에 의해 분리하여 동영상 압축기법을 이용할 경우 요소 영상간 상관도를 효과적으로 제거하는 데 한계가 있다. 제안하는 방식에서는 2차원 참조기법에 의해 각 요소 영상을 분리하고, 이를 H.264/AVC의 다중 프레임 참조 기법을 이용하여 효과적으로 압축한다. 제안하는 2차원 참조 기법은 요소 영상의 수직, 수평 및 대각 방향의 상관도에 따라 최적의 참조 영상을 선택할 수 있어 가장 좋은 압축성능을 나타낸다. 실험 결과는 정지 영상 압축 방법에 비해 요소 영상을 분리하는 방법이 압축 성능을 향상시킴을 보이고, 제안하는 2차원 참조 기법이 1차원 스캔 방식에 비해 주관적 화질 및 객관적 성능에 있어 뛰어남을 보인다.

무손실 영상 압축을 위한 변형된 정수 변환 계수에 대한 순방향 적응 예측 기법 (Forward Adaptive Prediction on Modified Integer Transform Coefficients for Lossless Image Compression)

  • 김희경;유훈
    • 전기학회논문지
    • /
    • 제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.

Adaptive Importance Channel Selection for Perceptual Image Compression

  • He, Yifan;Li, Feng;Bai, Huihui;Zhao, Yao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권9호
    • /
    • pp.3823-3840
    • /
    • 2020
  • Recently, auto-encoder has emerged as the most popular method in convolutional neural network (CNN) based image compression and has achieved impressive performance. In the traditional auto-encoder based image compression model, the encoder simply sends the features of last layer to the decoder, which cannot allocate bits over different spatial regions in an efficient way. Besides, these methods do not fully exploit the contextual information under different receptive fields for better reconstruction performance. In this paper, to solve these issues, a novel auto-encoder model is designed for image compression, which can effectively transmit the hierarchical features of the encoder to the decoder. Specifically, we first propose an adaptive bit-allocation strategy, which can adaptively select an importance channel. Then, we conduct the multiply operation on the generated importance mask and the features of the last layer in our proposed encoder to achieve efficient bit allocation. Moreover, we present an additional novel perceptual loss function for more accurate image details. Extensive experiments demonstrated that the proposed model can achieve significant superiority compared with JPEG and JPEG2000 both in both subjective and objective quality. Besides, our model shows better performance than the state-of-the-art convolutional neural network (CNN)-based image compression methods in terms of PSNR.

A New Hybrid Coder for High Quality Image Compression

  • Lee, Hang-Chan
    • Journal of Electrical Engineering and information Science
    • /
    • 제2권6호
    • /
    • pp.36-42
    • /
    • 1997
  • This paper presents a new design technique for performing high quality low bit rate image compression. A hybrid coder(HC) which combines Mean Removed Important Coefficient Selection based JPEG(MR-ICS-JPEG) and Adaptive Vector Quantization (AVQ) is proposed. A new quantization table is developed using the Important Coefficient Selection(ICS) method; the importance of each coefficient is determined using the orthonormal property of the DCT. This quantization table is applied to standard JPEG with mean removal(MR) strategy before processing. This scheme, called MR-ICS-JPEG, produces more than 2 dB enhanced performance in terms of PSNR over standard JPEG. A set of homogeneous codebooks is generated by homogeneous training vectors. Before compression, an image is uniformly divided into 8${\times}$8 blocks. Low detail regions such as backgrounds are roughly coded by AVQ while high detail regions such as edges or curves are finely coded by the proposed MR-ICS-JPEG. This hybrid coder procuces consistently about 3 dB improved performance in terms of PSNR over standard JPEG.

  • PDF

Optimum Image Compression Rate Maintaining Diagnostic Image Quality of Digital Intraoral Radiographs

  • Song Ju-Seop;Koh Kwang-Joon
    • Imaging Science in Dentistry
    • /
    • 제30권4호
    • /
    • pp.265-274
    • /
    • 2000
  • Purpose: The aims of the present study are to determine the optimum compression rate in terms of file size reduction and diagnostic quality of the images after compression and evaluate the transmission speed of original or each compressed image. Materials and Methods: The material consisted of 24 extracted human premolars and molars. The occlusal surfaces and proximal surfaces of the teeth had a clinical disease spectrum that ranged from sound to varying degrees of fissure discoloration and cavitation. The images from Digora system were exported in TIFF and the images from conventional intraoral film were scanned and digitalized in TIFF by Nikon SF-200 scanner (Nikon, Japan). And six compression factors were chosen and applied on the basis of the results from a pilot study. The total number of images to be assessed were 336. Three radiologists assessed the occlusal and proximal surfaces of the teeth with 5-rank scale. Finally diagnosed as either sound or carious lesion by one expert oral pathologist. And sensitivity, specificity and k value for diagnostic agreement was calculated. Also the area (Az) values under the ROC curve were calculated and paired t-test and oneway ANOVA test was performed. Thereafter, transmission time of the image files of the each compression level was compared with that of the original image files. Results: No significant difference was found between original and the corresponding images up to 7% (1 : 14) compression ratio for both the occlusal and proximal caries (p<0.05). JPEG3 (1 : 14) image files are transmitted fast more than 10 times, maintained diagnostic information in image, compared with original image files. Conclusion: 1 : 14 compressed image file may be used instead of the original image and reduce storage needs and transmission time.

  • PDF

JPEG2000 영상압축을 위한 리프팅 설계 알고리즘을 이용한 2차원 이산 웨이블릿 변환 프로세서의 FPGA 구현에 대한 연구 (A study on a FPGA based implementation of the 2 dimensional discrete wavelet transform using a fast lifting scheme algorithm for the JPEG2000 image compression)

  • 송영규;고광철;정제명
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • pp.2315-2318
    • /
    • 2003
  • The Wavelet Transform has been applied in mathematics and computer sciences. Numerous studies have proven its advantages in image processing and data compression, and have made it a basic encoding technique in data compression standards like JPEG2000 and MPEG-4. Software implementations of the Discrete Wavelet Transform (DWT) appears to be the performance bottleneck in real-time systems in terms of performance. And hardware implementations are not flexible. Therefore, FPGA implementations of the DWT has been a topic of recent research. The goal of this thesis is to investigate of FPGA implementations of the DWT Processor for image compression applications. The DWT processor design is based on the Lifting Based Wavelet Transform Scheme, which is a fast implementation of the DWT The design uses various techniques. The DWT Processor was simulated and implemented in a FLEX FPGA platform of Altera

  • PDF

QR 알고리즘을 이용한 프렉탈 영상압축 (Fractal Image Compression Using QR Algorithm)

  • 한군희;김태호;전병민
    • 한국산업융합학회 논문집
    • /
    • 제3권4호
    • /
    • pp.369-378
    • /
    • 2000
  • Conventional fractal image compression methods have many problems in searching time for matching domain block. Proposed method is an improved method of Fisher's Quadtree Decomposition in terms of time, compression ratio, and PSNR. This method determines range block in advance using QR algorithm. First, input image is partitioned to $4{\times}4$ range block and then recomposition is performed from bottom level to specified level. As a result, this proposed method achieves high encoding and decoding speed, high compression ratio, and high PSNR than Fisher's Quadtree Decomposition method.

  • PDF