• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.218-219
• /
• 2007

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.604-608
• /
• 2008

The TFT-LCD image allows non-uniform illumination variation and that is one of main difficulties of finding defect region. The SQI (self quotient image) has the HPF (high pass filter) shape and is used to reduce low frequency-lightness component. In this paper, we proposed the TFT-LCD defect-enhancement algorithm using characteristics of the SQI, that is the SQI has low-frequency flattening effect and maintains local variation. The proposed method has superior flattening effect and defect-enhancement effect compared with previous the TFT-LCD image preprocessing.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.134-144
• /
• 2003

Spatial relationships among objects are one of the important ingredients for expressing constraints of an image in image or multimedia retrieval systems. In this paper, we propose a unified image retrieval scheme using spatial relationships among objects and their features. The proposed scheme is especially effective in computing similarity between query image and images in the database. Also, objects and their spatial relationships are captured and annotated in XML. It could give better precision and flexibility in retrieving images from database. Finally, we have implemented a prototype system for retrieving images based on proposed technique and showed some of the experiment results.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.428-430
• /
• 1999

컴퓨터 단층촬영(Computed Tomography : CT)내의 위(stomach)에 대하여 연구하였다. 위는 모양이 변하면서 움직이는 정기이며 음식물로 채워진 부분과 공기로 채워진 부분으로 나뉘어져 있다. 위의 명암 값 정보와 위치 정보를 이용하여 자동적으로 추출을 한 다음, 음식물로 채워진 부분과 공기로 채워진 부분, 그리고 전체적인 위의 체적을 계산할 수 있는 알고리즘을 구현하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06a
• /
• pp.232-233
• /
• 2010

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.541-543
• /
• 2001

본 연구에서는 1비트 단위로 연속적으로 입력되는 수표의 영상데이터를 실시간으로 압축처리하고 또한 수표의 하단부에 기록된 인식하기 위한 알고리즘과 하드웨어 구현을 보여준다. 제안된 알고리즘에서는 실시간 처리를 위해 하드웨어에 적합한 알고리즘이 소개되며, 실제로 PLD로 설계 구현하여 그 타당성을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.508-510
• /
• 2000

본 논문은 의료 영상 중에서 복부 방사선 분야에서 보편적으로 사용되고 있는 CT 영상으로부터 간영역을 분할해내는 방법을 제시한다. 본 논문에서는 복부 CT영상에서 근육 부분과 척추, 늑골 부분을 제거하고, co-occurrence matrix를 이용한 국부 영상 이진화(local image thresholding) 방법을 통해 영상에서 간 영역을 분할한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.239-246
• /
• 2004

Image snapping for an image moves the cursor location to nearby features in the image, such as edges. In this paper, we propose geometric snapping for 3D triangular meshes, which is extended from image snapping. Similar to image snapping, geometric snapping also moves the cursor location naturally to a location which represents main geometric features in the 3D triangular meshes. Movement of cursor is based on the approximate curvatures which appear geometric features on the 3D triangular meshes. The proposed geometric snapping can be applied to extract main geometric features on 3D triangular meshes. Moreover, it can be applied to extract the geometric features of a tooth which are necessary for generating the occlusal surfaces in dental prostheses.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.472-476
• /
• 2008

In this paper, we propose a simple and user friendly visual secret sharing scheme based on binary image. The proposed scheme is a new information hiding method which uses only bit-wise exclusive-or (XOR) operation and NOT operation to share a secret binary image information in the user friendly binary images. The proposed scheme has the following merits: (1) It provides efficient embedding and reconstruction algorithms. (2) It provides lossless and perfect reconstruction of the secret binary image. (3) It provides the detection method of its own group by sharing the user friendly image. (4) It can share same sized secret image such as original cover image unlike previous methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.594-598
• /
• 2008

In this paper we propose a fast booting technique based on Improved snapshot boot in embedded Linux, widely adopted in personal devices such as PDA and mobile phones. The existing Snapshot boot technique tries to create a snapshot image at the time of suspend, and later load the entire snapshot image into the system memory at the predefined location with the help of a bootloader at the time of resume. Since a bootloader has to copy the entire snapshot image into the predefined memory to resume the previous suspended computing state, a little bit long time is required to resume. Improved snapshot boot does not create a snapshot image consisting of whole memory pages at the time of suspend, thus resulting in smaller snapshot image than the existing snapshot boot. The remaining pages are in the swap area. The resulting smaller sized snapshot image enables much faster booting latency. Through the experiment, we can see the booting latency is reduced almost 30% with suspend image of 2982 pages. This result depends on the amount of swap-out pages.