• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.169-172
• /
• 2005

Genetic algorithm based predictor for lossless image compression is propsed. We describe a genetic algorithm to learn predictive model for lossless image compression. The error image can be further compressed using entropy coding such as Huffman coding or arithmetic coding. We show that the proposed algorithm can be feasible to lossless image compression algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.520-525
• /
• 1992

This paper reports several mathematical properties of the filter vector developed for processing linearly-additive spatially-invariant image sequences. In this filtering of an image sequence into a single filtered image, the information about the image components originally distributed over the entire sequence is compressed into the one new image in a way that the desired component is enhanced and the undesired (interfering) components and noise are suppressed.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.223-227
• /
• 1996

In this paper we propose an adaptive fast image restoration filter, which is suitable for reducing the blocking artifacts in the compressed image in real-time. The proposed restoration filter is based on the observation that quantization operation in a series of coding process is a nonlinear and many-to-one mapping operator. And then we propose an approximated version of constrained optimization technique as a restoration process for removing the nonlinear and space varying degradation operator. We also propose a novel block classification method for adaptively choosing the direction of a highpass filter, which serves as a constraint in the optimization process. The proposed classification method adopts the bias-corrected maximized likelihood, which is used to determine the number of regions in the image for the unsupervised segmentation. The proposed restoration filter can be realized either in the discrete Fourier transform domain or in the spatial domain in the form of a truncated finite impulse response (FIR) filter structure for real-time processing. In order to demonstrate the validity of the proposed restoration filter experimental results will be shown.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.168-173
• /
• 2010

Error concealment techniques are significant due to the growing interest in imagery transmission over error-prone channels. This paper presents a spatial error concealment technique for losslessly compressed images using least significant bit (LSB)-based data hiding to reconstruct a close approximation after the loss of image blocks during image transmission. Before transmission, block description information (BDI) is generated by applying quantization following discrete wavelet transform. This is then embedded into the LSB plane of the original image itself at the encoder. At the decoder, this BDI is used to conceal blocks that may have been dropped during the transmission. Although the original image is modified slightly by the message embedding process, no perceptible artifacts are introduced and the visual quality is sufficient for analysis and diagnosis. In comparisons with previous methods at various loss rates, the proposed technique is shown to be promising due to its good performance in the case of a loss of isolated and continuous blocks.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.31-39
• /
• 2010

In some image processing system or the users who want to see a specific region of image simply, if a part of the image has higher quality than other regions, it would be a nice service. Specifically in mobile environments, preferential service was needed, as the screen size is small. So, JPEG2000 supplies this function. But this doesn't support the process to extract specific regions or service and does the functions to add some techniques. It is called by ROI(Region-of-Interest). In this paper, we use images including human faces, which are processed most preferentially and compressed with high quality. Before an image is served to the users, it is compressed and saved. Here, the face parts are compressed with higher quality than the background which are relatively with lower quality. This technique can offer better service with preferential transferring of the faces, too. Besides, whole regions of the image are compressed with same quality and after searching the faces, they can be preferentially transferred. In this paper, we use a face extraction approach based on neural network and the preferential processing with EBCOT of JPEG2000. For experimentation, we use images having several human faces and evaluate objectively and subjectively, and proved that this approach is a nice one.

• Journal of Biomedical Engineering Research
• /
• v.10 no.3
• /
• pp.243-252
• /
• 1989

In this study, medical images, which are X-ray image and CT image, are compressed by the adam live coding technique. The medical images may be treated as special ones, because they are different from general images in many respects. The statistical characteristics that medical images only have in transform domain are analyzed, and then the improved quantization method is proposed for medical images. For chest X-ray image and CT head image, the better results are obtained by the improved adaptive coding technique.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2704-2712
• /
• 1998

In this paper, a MRI image compression technique, which allocates bits effectively by using lossless coding for region having important infommtion to decide disease and lossy coding for the rest, is proposed. In the proposed method, for MHI images needed to rccognize disk disease, we recognizc region having important objects by using the characteristics of c1isease. As the recognized region is imrxlrtant to decide whether disease exists or not, it is compressed by lossless coding and the rest is compressed by lossy coding, Also for the region compressed by lossy coding, we can obtain fine reconstructed images without blocking effect by adopting fractal coding in wavelet transform domain.

• Imaging Science in Dentistry
• /
• v.30 no.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.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.28-33
• /
• 2003

This paper proposes a database index and retrieval method using the PCA(Principal Component Analysis). We perform a scene change detection and key frame extraction from the DC Image constructed by DCT DC coefficients in the compressed video stream that is video compression standard such as MPEG. In the extracted key frame, we use the PCA, then we can make codebook that has a statistical data as a codeword, which is saved as a database index. We also provide retrieval image that are similar to user's query image in a video database. As a result of experiments, we confirmed that the proposed method clearly showed superior performance in video retrieval and reduced computation time and memory space.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.585-588
• /
• 1999

This paper concentrates on an experimental results on visual only recognition tasks using an image transform approach and HMM based recognition system. There are two approaches for extracting features of lipreading, a lip contour based approach and an image transform based one. The latter obtains a compressed representation of the image pixel values that contain the speaker's mouth results in superior lipreading performance. In addition, PCA(Principal component analysis) is used for fast algorithm. Finally, HMM recognition tasks are compared with the another.