A New Approach Based on Order Reduction Using Sub Image Formation in Minimizing the Computation Time for Image Compression

보안공학연구지원센터(IJSIP) 보안공학연구지원센터 2015 International Journal of Signal Processing, Image Vol.8 No.3

Image compression is the process to remove the redundant information from the image so that only essential information can be stored to reduce the storage size and transmission time. Advancement in still image compression becomes essential for various applications like medical imaging and multimedia applications. The task of image compression generally refers to deriving a near approximated compressed image for the given input image. Methods for tackling this problem have to do a delicate balancing act of suppressing the unwanted effects in visualizing without losing features of interest. Different techniques were already proposed in this area which is not sufficient to maintain good quality of the compressed image without sacrificing the compression ratio. Thus, new image compression algorithm based on order reduction using sub-image formation is proposed for lossy compression scheme. Obviously, the tradeoff between compression ratio and picture quality is an important issue in image compression. The importance of running time of compression was further investigated as this process can be used in high speed data transmission applications. The simulation process is carried out determining the computation time using MATLAB. The algorithm tested for still images of different size too.

Denoising Diffusion Null-space Model and Colorization based Image Compression

Indra Imanuel,Dae-Ki Kang,Suk-Ho Lee The Institute of Internet 2024 International Journal of Internet, Broadcasting an Vol.16 No.2

Image compression-decompression methods have become increasingly crucial in modern times, facilitating the transfer of high-quality images while minimizing file size and internet traffic. Historically, early image compression relied on rudimentary codecs, aiming to compress and decompress data with minimal loss of image quality. Recently, a novel compression framework leveraging colorization techniques has emerged. These methods, originally developed for infusing grayscale images with color, have found application in image compression, leading to colorization-based coding. Within this framework, the encoder plays a crucial role in automatically extracting representative pixels-referred to as color seeds-and transmitting them to the decoder. The decoder, utilizing colorization methods, reconstructs color information for the remaining pixels based on the transmitted data. In this paper, we propose a novel approach to image compression, wherein we decompose the compression task into grayscale image compression and colorization tasks. Unlike conventional colorization-based coding, our method focuses on the colorization process rather than the extraction of color seeds. Moreover, we employ the Denoising Diffusion Null-Space Model (DDNM) for colorization, ensuring high-quality color restoration and contributing to superior compression rates. Experimental results demonstrate that our method achieves higher-quality decompressed images compared to standard JPEG and JPEG2000 compression schemes, particularly in high compression rate scenarios.

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

( Liping Wang ),( Xiao Zhou ),( Chengyou Wang ),( Weizhi Li ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.7

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.

Lossless Image Compression Using Differential Pulse Code Modulation and Its Application

Rime Raj Singh Tomar,Kapil Jain 보안공학연구지원센터 2016 International Journal of Signal Processing, Image Vol.9 No.1

Images include information about human body which is used for different purpose such as medical examination security and other plans Compression of images is used in some applications such as profiling information and transmission systems. Regard to importance of images information, lossless or loss compression is preferred. Lossless compressions are JPEG, JPEG-LS and JPEG2000 are few well-known methods for lossless compression. We will use differential pulse code modulation for image compression with Huffman encoder, which is one of the latest and provides good compression ratio, peak signal to noise ratio and minimum mean square error. In real time application which needs hardware implementation, low complex algorithm accelerate compression process. In this paper, we use differential pulse code modulation for image compression lossless and near-lossless compression method is introduced which is efficient due to its high compression ratio and simplicity. This method is consists of a new transformation method called Enhanced DPCM Transformation (EDT) which has a good energy compaction and a suitable Huffman encoding. After introducing this compression method it is applied on different images from Corel dataset for experimental results and analysis. Also we compare it with other existing methods with respect to parameter compression ratio, peak signal noise ratio and mean square error.

영상 적응형 무손실 영상 압축

원종우(Jong-woo Won),오현종(Hyun-jong Oh),장의선(Euee S. Jang) 한국방송·미디어공학회 2004 방송공학회논문지 Vol.9 No.3

In this paper, we proposed a new lossless image compression algorithm. Lossless image compression has been used in the field that requires the accuracy and precision. Thus, application areas using medical imaging, prepress imaging, image archival systems, precious artworks to be preserved, and remotely sensed images require lossless compression. The compression ratio from lossless image compression has not been saftisfactory, thus far. So, new method of lossless image compression has been investigated to get better compression efficiency. We have compared the compression results with the most typical comprssion methods such as CALIC and JPEG-LS. CALIC has shown the best compression-ratio among the existing lossless coding methods at the cost of the extensive complexity by three pass algorithm. On the other hand, JPEG-LS's compression-ratio is not higher than CALIC, but was adopted as an international standard of ISO because of the low complexity and fast coding process. In the proposed method, we adopted an adaptive predictor that can exploit the characteristics of individual images, and an adaptive arithmetic coding with multiple probability models. As a result, the proposed algorithm showed 5% improvement in compression efficiency in comparison with JPEG-LS and showed comparablel compression ratio with CALIC.

영역 성장 분할 기법을 이용한 무손실 영상 압축

박정선,김길중,전계록 한국융합신호처리학회 2002 융합신호처리학회 논문지 (JISPS) Vol.3 No.1

본 연구에서는 의료영상 저장 및 전송 시스템에 필수적인 무손실 의료영상 압축 기법을 제안하였다. 의료영상은 방사선 영상 중에서 유방영상(mammography)과 자기공명영상을 사용하였으며, 이들 영상을 무손실로 압축하기 위하여 영역성장에 의한 영상분할 알고리듬을 제안하였다. 제안된 알고리듬은 원 영상이 에러 영상과 불연속 계수 영상, 그리고 상위 비트 데이터 등 세 가지의 부 영역으로 분할되도록 하였다. 그리고 영역성장 과정 후 생성된 불연속 계수 영상 데이터와 에러 영상을 국제 이진영상압축 표준이며 그레이코드(graycode)화된 영상의 압축에 적합한 JBIG(Joint Bi-level Image expert Group) 알고리듬을 이용하여 압축시켰다. 제안한 알고리듬과 타 연구에서 사용된 기법들을 비교 검토 한 결과 제안한 무손실 압축 기법을 적용하여 얻어지는 압축율은 JBIG, JPEG, LZ 기법에 비해 평균적으로 각각 3.7%, 7.9%, 23.6% 정도 개선됨을 알 수 있었다. In this paper, we proposed a lossless compression algorithm of medical images which is essential technique in picture archive and communication system. Mammographic image and magnetic resonance image in among medical images used in this study, proposed a region growing segmentation algorithm for compression of these images. A proposed algorithm was partition by three sub region which error image, discontinuity index map, high order bit data from original image. And generated discontinuity index image data and error image which apply to a region growing algorithm are compressed using JBIG(Joint Bi-level Image experts Group) algorithm that is international hi-level image compression standard and proper image compression technique of gray code digital Images. The proposed lossless compression method resulted in, on the average, lossless compression to about 73.14% with a database of high-resolution digital mammography images. In comparison with direct coding by JBIG, JPEG, and Lempel-Ziv coding methods, the proposed method performed better by 3.7%, 7.9% and 23.6% on the database used.

Compression and Enhancement of Medical Images Using Opposition Based Harmony Search Algorithm

Haridoss, Rekha,Punniyakodi, Samundiswary Korea Information Processing Society 2019 Journal of information processing systems Vol.15 No.2

The growth of telemedicine-based wireless communication for images-magnetic resonance imaging (MRI) and computed tomography (CT)-leads to the necessity of learning the concept of image compression. Over the years, the transform based and spatial based compression techniques have attracted many types of researches and achieve better results at the cost of high computational complexity. In order to overcome this, the optimization techniques are considered with the existing image compression techniques. However, it fails to preserve the original content of the diagnostic information and cause artifacts at high compression ratio. In this paper, the concept of histogram based multilevel thresholding (HMT) using entropy is appended with the optimization algorithm to compress the medical images effectively. However, the method becomes time consuming during the measurement of the randomness from the image pixel group and not suitable for medical applications. Hence, an attempt has been made in this paper to develop an HMT based image compression by utilizing the opposition based improved harmony search algorithm (OIHSA) as an optimization technique along with the entropy. Further, the enhancement of the significant information present in the medical images are improved by the proper selection of entropy and the number of thresholds chosen to reconstruct the compressed image.

구내디지털방사선영상의 JPEG과 wavelet 압축방법 비교

김은경 대한구강악안면방사선학회 2004 Imaging Science in Dentistry Vol.34 No.3

Purpose : To determine the proper image compression method and ratio without image quality degradation in intraoral digital radiographic images, comparing the discrete cosine transform (DCT)-based JPEG with the waveletbased JPEG 2000 algorithm. Materials and Methods : Thirty extracted sound teeth and thirty extracted teeth with occlusal caries were used for this study. Twenty plaster blocks were made with three teeth each. They were radiographically exposed using CDR sensors (Schick Inc., Long Island, USA). Digital images were compressed to JPEG format, using Adobe Photoshop v.7.0 and JPEG 2000 format using Jasper program with compression ratios of 5 : 1, 9 : 1, 14 : 1, 28 : 1 each. To evaluate the lesion detectability, receiver operating characteristic (ROC) analysis was performed by the three oral and maxillofacial radiologists. To evaluate the image quality, all the compressed images were assessed subjectively using 5 grades, in comparison to the original uncompressed images. Results : Compressed images up to compression ratio of 14 : 1 in JPEG and 28 : 1 in JPEG 2000 showed nearly the same the lesion detectability as the original images. In the subjective assessment of image quality, images up to compression ratio of 9 : 1 in JPEG and 14 : 1 in JPEG 2000 showed minute mean paired differences from the original images. Conclusion : The results showed that the clinically acceptable compression ratios were up to 9 : 1 for JPEG and 14 : 1 for JPEG 2000. The wavelet-based JPEG 2000 is a better compression method, comparing to DCT-based JPEG for intraoral digital radiographic images.

Image compression using K-mean clustering algorithm

Munshi, Amani,Alshehri, Asma,Alharbi, Bayan,AlGhamdi, Eman,Banajjar, Esraa,Albogami, Meznah,Alshanbari, Hanan S. International Journal of Computer ScienceNetwork S 2021 International journal of computer science and netw Vol.21 No.9

With the development of communication networks, the processes of exchanging and transmitting information rapidly developed. As millions of images are sent via social media every day, also wireless sensor networks are now used in all applications to capture images such as those used in traffic lights, roads and malls. Therefore, there is a need to reduce the size of these images while maintaining an acceptable degree of quality. In this paper, we use Python software to apply K-mean Clustering algorithm to compress RGB images. The PSNR, MSE, and SSIM are utilized to measure the image quality after image compression. The results of compression reduced the image size to nearly half the size of the original images using k = 64. In the SSIM measure, the higher the K, the greater the similarity between the two images which is a good indicator to a significant reduction in image size. Our proposed compression technique powered by the K-Mean clustering algorithm is useful for compressing images and reducing the size of images.

데이터 은닉 기법을 이용한 BTC(Block Truncation Coding) 영상의 압축

최용수(YongSoo Choi),김형중(HyoungJoong Kim),박춘명(ChunMyung Park),최희진(HuiJin Choi) 大韓電子工學會 2010 電子工學會論文誌-CI (Computer and Information) Vol.47 No.1

이 논문에서는 데이터 은닉기법을 적용하여 BTC 영상을 압축하는 방법을 제안한다. BTC는 일반적인 디지털 영상을 2진 영상으로 압축하는 알고리즘이며 프린터와 같은 응용에서도 사용이 가능하다. BTC 알고리즘에서 이진영상과 함께 전송되는 부가정보의 크기가 이진영상의 크기와 같을 정도로 크므로 이 정보를 정보은닉 기법을 이용하여 줄임으로서 전체적인 전송량을 줄이고자 한다. 하지만 일반적인 BTC 영상에서 데이터 은닉을 위한 공간이 충분하지 않으므로 본 논문에서는 Adaptive AMBTC 알고리즘을 적용하여 생성된 이진영상에 가상 히스토그램을 구한 후 히스토그램 변형을 통하여 부가정보의 양을 줄이고자 한다. 논문에서 제공하는 알고리즘은 기존의 BTC 또는 Adaptive AMBTC 알고리즘에서 생성된 영상과 화질의 차이를 크게 보이지 않는 범위 내에서 파일 크기를 6-11%정도 줄일 수 있다. In this paper, It propose methods compressing BTC image utilizing data hiding technique. BTC is used to compress general digital image into binary image and applied into application such as printer. Additional information ,transferred with binary image, is as big as the size of binary image. therefore, we wish to reduce the total transmission bandwidth by decreasing the additional information with sustaining the small image degradation. Because typical BTC image doesn't have enough space for data hiding, we adopt Adaptive AMBTC (Absolute Moment BTC) algorithm to produce the binary image, and calculate virtual histogram from created binary image and modify this histogram for reducing the additional information. The proposed algorithm can reduce about 6-11 % of the image file size ,compared with the existing BTC algorithm, without making perceptible image degradation.