• Imaging Science in Dentistry
• /
• v.35 no.3
• /
• pp.157-165
• /
• 2005

Purpose : To find out the proper compression ratios without degrading image quality and affecting lesion detectability on diagnostic images used in dentistry compressed with JPEG 2000 algorithm. Materials and Methods : Sixty Digora periapical images, sixty panoramic computed radiographic (CR) images, sixty computed tomographic (CT) images, and sixty magnetic resonance (MR) images were compressed into JPEG 2000 with ratios of 10 levels from 5:1 to 50:1. To evaluate the lesion detectability, the images were graded with 5 levels (1 : definitely absent; 2: probably absent; 3: equivocal; 4: probably present; 5: definitely present), and then receiver operating characteristic analysis was performed using the original image as a gold standard. Also to evaluate subjectively the image quality, the images were graded with 5 levels (1 definitely unacceptable; 2: probably unacceptable; 3: equivocal, 4: probably acceptable; 5· definitely acceptable), and then paired t-test was performed. Results : In Digora, CR panoramic and CT images, compressed images up to ratios of 15 : 1 showed nearly the same lesion detectability as original images, and in MR images, compressed images did up to ratios of 25 : 1. In Digora and CR panoramic Images, compressed images up to ratios of 5 : 1 showed little difference between the original and reconstructed images in subjective assessment of image quality In CT images, compressed images did up to ratios of 10: 1 and in MR images up to ratios of 15 : 1 Conclusion : We considered compression ratios up to 5 : 1 in Digora and CR panoramic images, up to 10 : 1 in CT images, up to 15 : 1 in MR images as clinically applicable compression ratios.

• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.411-420
• /
• 2004

We propose a novel still image compression system, which is superior in its function than the JPEG2000 system developed by David Taubman. The system shows 40 : 1 high compression ratio using $2\times2$ bitmatrix subblock coding. The $2\times2$ bitmatrix subblock is constructed in the bitplanes by organizing the bits into subblocks composing of $2\times2$matrices. The arithmetic coding performs the high compression by the bitmatrices in the subblock. The input of the system consists of a segmentation mode and a ROI(Region Of Interest) mode. In segmentation mode, the input image is segmented into a foreground consisting of letters and a background consisting of the remaining region. In ROI mode, the input image is represented by the region of interest window. The high compression ratio shows that the proposed system is competent among the JPEG2000 products currently in the market. This system also uses gray coding to improve the compression ratio.

• Journal of Digital Contents Society
• /
• v.9 no.4
• /
• pp.687-695
• /
• 2008

One of the most significant characteristics of remote real time lecture, the emerging still image standard, is the OOI (Object of Interest) coding. The functionality of OOI is important in applications where certain parts of the image are more important than others. In such cases, these objects need to be encoded at higher quality than the background. JPEG2000 provides a number of OOI coding mechanisms. Many researchers have actively studied the preferred processing from the OOI coding methods to the new methods complementing them. But, there do not exist OOI coding methods suitable for all applications. Therefore, this study shows a criterion to select according to the application requirements for applying the best OOI coding method in JPEG2000 applications, and also shows the experimental results deciding the best parameters in the selected methods.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.11-21
• /
• 2011

This paper introduces an SIMD(Single Instruction Multiple Data) based parallel processor that efficiently processes massive data inherent in multimedia. In addition, this paper implements MMX(MultiMedia eXtension)-type instructions on the data parallel processor and evaluates and analyzes the performance of the MMX-type instructions. The reference data parallel processor consists of 16 processors each of which has a 32-bit datapath. Experimental results for a JPEG compression application with a 1280x1024 pixel image indicate that MMX-type instructions achieves a 50% performance improvement over the baseline instructions on the same data parallel architecture. In addition, MMX-type instructions achieves 100% and 51% improvements over the baseline instructions in energy efficiency and area efficiency, respectively. These results demonstrate that multimedia specific instructions including MMX-type have potentials for widely used many-core GPU(Graphics Processing Unit) and any types of parallel processors.

• 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.

• Journal of Broadcast Engineering
• /
• v.25 no.4
• /
• pp.587-597
• /
• 2020

In this paper, we analyze the normalization that occurs when processing digital hologram and propose an optimized quantization method. In JPEG Pleno, which standardizes the compression of holograms, full complex holograms are defined as complex numbers with 32-bit or 64-bit precision, and the range of values varies greatly depending on the method of hologram generation and object type. Such data with high precision and wide dynamic range are converted to fixed-point or integer numbers with lower precision for signal processing and compression. In addition, in order to reconstruct the hologram to the SLM (spatial light modulator), it is approximated with a precision of a value that can be expressed by the pixels of the SLM. This process can be refereed as a normalization process using quantization. In this paper, we introduce a method for normalizing high precision and wide range hologram using quantization technique and propose an optimized method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1C
• /
• pp.64-71
• /
• 2003

In this paper, we proposed an algorithm that shorten coding time maintaining image quality in JPEG2000, which is the standard, of still image compression. This method encodes only the bit plane selected as appropriate truncation point for output bitstream, obtained from estimation of frequency distribution for whole image. Wavelet characterized by multi-resolution has vertical, horizontal, and diagonal frequency components for each resolution. The frequency interrelation addressed above is maintained thorough whole level of resolution and represents the unique frequency characteristics for input image. Thus, using the frequency relation at highest level, we can pick the truncation point for the compression time decrease by estimating code bits at encoding each code block. Also, we reduced the encoding time using simply down sampling instead of low-pass filtering at low-levels which are not encoded in color component of lower energy than luminance component. From the proposed algorithm, we can reduce about 15~36% of encoding time maintaining PSNR 30$\pm$0.5㏈.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.33-41
• /
• 2008

Due to the advantage of wavelet transform such as the compatibility with JPEG2000, multi-resolution decomposition, and application of HVS(Human Visual System), watermarking algorithm based on wavelet transform (DWT) is recently mast interesting research subject. However, mast of researches are focused on theoretical aspects for the robustness rather than practical usage, and. may be not suitable too much complicated to use in practice. In this paper, robust logo watermarking algorithm based on DWT is proposed for large and huge data processing. The proposed method embeds the logo watermark by mapping of $8{\times}8$ blocks in order of the number of '1' of the original image and the randomized watermark image with LFSR. The original image is transformed by 2 level wavelet. The experimental results shows that the watermark is embedded successfully, and the proposed algorithm has the valuable robustness from the image processing like JPEG compression, low pass filter, high pass filter and changes in brightness and contrast.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.4
• /
• pp.37-47
• /
• 2003

In this paper. we propose a new digital watermarking technique which uses the self-similarity of OCT(Discrete Cosine Transform) coefficients for the ownership protection of an image, similar coefficients are classified by SOM(Self-Organizing Map) out of Neural Network. The watermark is inserted into the selected cluster among clusters which consist of coefficients. Generally, the inserted watermark in high frequency regions of an image is eliminated by the compression process such as JPEG compressions, and the inserted watermark in low frequency regions of an image causes the distortion of an image quality. Therefore, the watermark is inserted into the cluster that has many coefficients in the middle frequency regions. This algorithm reduces the distortion of an image quality because of inserting the watermark into an image according to the number of coefficients in selected cluster. To extract watermarks from the watermarked image, the selected cluster is used without an original image. In the experiment, the new proposed algorithm have a good quality and endure attacks(JPEG compressions, filtering. zoom in, zoom out, cropping, noises) very well.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.598-601
• /
• 2002

In this research, robustness of image watermarking mixed Key and Logo scheme was evaluated. A personal ID of a copyrighter was key and watermark was logo image. The standard images of Baboon, Cameraman and Lena were used for experimental images, binary image‘Park’of 32$\times$32 and 64$\times$64 size were used for the watermark image, respectively. for robustness evaluation of the watermark, reconstructive rates of the watermark were obtained from images inserted watermark with image transformation or JPEG lossy compression. The experimental results show that the reconstructive rates of the case of 32$\times$32 watermark was better than the case of the 64$\times$64 watermark; average 5.9%, 13.9%, 6.5%, and 4.2% in the case of scale-down rates, rotational rates, impulse noise power density, and JPEG lossy compression rates, respectively.