• Journal of the Korea Society of Computer and Information
• /
• v.5 no.2
• /
• pp.81-89
• /
• 2000

In this thesis. we. present a Telemedicine System that uses the communication network as the 2s6kbps exclusive line or 10Mbps Ethernet LAN. This system can make it possible for remote hospital or doctor to search and retrieve medical images and information from the central hospitals the have advanced technologies, and to support Teleconsulting with medical experts. To solve the speed limits. JPEG compression method and Distributed system used.

• Journal of Digital Contents Society
• /
• v.7 no.3
• /
• pp.183-191
• /
• 2006

Currently, the preferred processing of a user-centered ROI(Region-of-Interest) or a specific region of image to transmission and decompression of a full image is needed in different applications, specifically mobile applications. Here, we have to study how different factors affect ROI coding methods. Therefore, an application can select an ROI coding method and several parameters suitable for the environments. The ROI coding methods used in the study are Maxshift and Implicit and the parameters are tile size, image size, code block size, ROI importance and the number of lowest resolution levels. This study shows the experimental results between the different parameters and the two ROI coding methods.

• Journal of the Semiconductor & Display Technology
• /
• v.6 no.2 s.19
• /
• pp.53-57
• /
• 2007

In this paper, a new content-based color image retrieval method is proposed, in which both the color content and the spatial relationship of image have been taken into account. In order to represent the spatial distribution information of image, a disorder matrix, which has the invariance to the rotation and translation of the image content, has been designed. This is based on multi-resolution color-spatial information. We present our algorithm in the following section, and then verified the search results with comparison to other methods, such as color histogram, wavelet histogram, correlogram and wavelet correlogram. Experimental results with various types of images show that the proposed method not only achieves a high image retrieval performance but also improve the retrieval precision.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1106-1111
• /
• 1999

Discrete cosine Transform (DCT) is most popular block transform coding in lossy mode. DCT is close to statistically optimal transform - the Karhunen Loeve transform. In this paper, a module for still image encoder is implemented with TMS320C80 based on JPEG, which are international standards for image compression. Th still image encoder consists of three parts- a transformer, a vector quantizer and an entropy encoder.

• ETRI Journal
• /
• v.28 no.2
• /
• pp.260-263
• /
• 2006

This letter proposes a new near-lossless image compression method with only one line buffer cost for a digital camera with Bayer format image. For such format data, it can provide a low average compression rate (4.24bits/pixel) with high-image quality (larger than 46.37dB where the error of every pixel is less than two). The experimental results show that the near-lossless compression method has better performance than JPEG-LS (lossless) with ${\delta}$ = 2 for a Bayer format image.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.65-72
• /
• 2004

In this paper, we propose a new blind image watermarking method in wavelet domain. It is necessary to find out watermark insertion location in blind watermark. To select the watermark embedding locations, we use the increment and decrement information of the successive approximation coefficients after discrete wavelet transformed. In order to evaluate the proposed algorithm we embed watermark into test images and detect the watermark after attacks like JPEG lossy compression and performing of various liters. Experimental results show that the proposed method is robust against various kinds of attacks and still remains transparency.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.447-448
• /
• 2007

얼굴인식은 카메라로부터 영상을 취득하여, 이미 등록되어 있는 영상 중에 가장 높은 유사성을 보이는 영상을 취득 영상의 대상자로 판단하는 것이다. 정확한 판단을 위해서 일반적으로 얼굴인식에 사용되는 영상은 취득 당시 영상의 정보를 모두 가지고 있는 영상, 즉 압축되지 않은 영상을 사용한다. 하지만 대용량 데이터 얼굴인식 시스템에서는 저장 공간의 이유로 영상에 압축을 해야 하는 상황이 발생할 수 있다. 본 논문에서는 영상압축이 얼굴인식에 미치는 영향에 대해서 고찰한다. 영상압축을 위해 사용되는 압축 형식은 JPEG, JPEG2K, SPIHT 이다. 동일은 형식의 얼굴인식의 알고리즘이라도 취득된 얼굴영상의 형식에 따라 인식률에 차이가 발생한다. 얼굴의 조명(illumination), 표정(expression), 자세(pose)는 인식률에 영향을 미치는 대표적인 요인이다. 따라서 얼굴인식이 압축에 미치는 영향을 설명하기 위해 영상별로 조명조건이 차이가 나는 데이터를 사용하여 실험하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1716-1725
• /
• 1996

In this paper, the huffman decoder which is a part of the decoder in JPEG standard format is designed by using a new Ternary CAM. First, the 256 word * 16 bit-size new bit-word all parallel Ternary CAM system is designed and verified using SPICE and CADENCE Verilog-XL, and then the verified novel Ternary CAM is applied to the new huffman decoder architecture of JPEG. So the performnce of the designed CAM cell and it's block is verified. The new Ternary CAM has various applications because it has search data mask and storing data mask function, which enable bit-wise search and don't care state storing. When the CAM is used for huffman look-up table in huffman decoder, the CAM is partitioned according to the decoding symbol frequency. The scheme of partitioning CAM for huffman table overcomes the drawbacks of all-parallel CAM with much power and load. So operation speed and power consumption are improved.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.429-438
• /
• 2012

This study presents two reversible data hiding schemes based on the coefficient shifting (CS) algorithm. The first scheme uses the CS algorithm with a mean predictor in the spatial domain to provide a large payload while minimizing distortion. To guard against manipulations, the second scheme uses a robust version of the CS algorithm with feature embedding implemented in the integer wavelet transform domain. Simulations demonstrate that both the payload and peak signal-to-noise ratio generated by the CS algorithm with a mean predictor are better than those generated by existing techniques. In addition, the marked images generated by the variant of the CS algorithm are robust to various manipulations created by JPEG2000 compression, JPEG compression, noise additions, (edge) sharpening, low-pass filtering, bit truncation, brightness, contrast, (color) quantization, winding, zigzag and poster edge distortion, and inversion.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.97-102
• /
• 1998

In this paper, 1 proposed methods of fractal image compression to get better orginal images in a high compression raitos with encoding image effectively. For given signal-to-noise raitos tolerances, show the proposed compression method are higher than Fisher's method for compression raitos at all thresholds. This is due to improve compression time in the local IFS structure that reduce PIFS information storage requirements from 48bits range blocks to the 40bits.