• Journal of KIISE:Computing Practices and Letters
• /
• 제14권6호
• /
• pp.619-623
• /
• 2008

A lane detection system is one of the major components of intelligent vehicle systems. Difficulties in lane detection mainly come from not only various weather conditions but also a variety of special environment. This paper describes a simple and stable method for the broken lane tracking in various environments. Probabilistic Hough Transform (PHT) and the Least-square method (LSM) are used to track and correct the lane orientation. For the efficiency of the proposed method, two regions of interest (ROIs) are placed in the lower part of each image, where lane marking areas usually appear with less intervention in our system view. By testing in both a set of static images and video sequences, the experiments showed that the proposed approach yielded robust and reliable results.

• Journal of KIISE:Software and Applications
• /
• 제29권11호
• /
• pp.803-808
• /
• 2002

This paper describes automatic methods for detection of kidney and kidney tumor on abdominal CT scans. The abdominal CT images were digitalized using a film digitizer and a gray-level threshold method was used to segment the kidney. Based on texture analysis results, which were perform on sample images of kidney tumors, SEED region of kidney tumor was selected as result of homogeneity test. The average and standard deviation, which are representative statistical moments, were used to as an acceptance criteria for homogeneous test. Region growing method was used to segment the kidney tumor from the center pixel of selected SEED region using a gray-level value as an acceptance criteria for homogeneity test. These method were applied to 113 images of 9 cases, which were scanned by GE Hispeed Advantage CT scanner and digitalized by Lumisvs LS-40 film digitizer. The sensitivity was 85% and there was no false-positive results.

• Journal of KIISE:Software and Applications
• /
• 제30권7_8호
• /
• pp.773-779
• /
• 2003

Locating exact position of facial components is a key preprocessing for realizing highly accurate and reliable face recognition schemes. In this paper, we propose a simple but powerful method for detecting isolated facial components such as eyebrows, eyes, and a mouth, which are horizontally oriented and have relatively dark gray levels. The method is based on the shape-resolving locally optimum thresholding that may guarantee isolated detection of each component. We show that pure facial regions can be determined by grouping facial features satisfying simple geometric constraints on unique facial structure. In the test for over 1000 images in the AR -face database, pure facial regions were detected correctly for each face image without wearing glasses. Very few errors occurred in the face images wearing glasses with a thick frame because of the occluded eyebrow -pairs. The proposed scheme may be best suited for the later stage of classification using either the mappings or a template matching, because of its capability of handling rotational and translational variations.

• Journal of Science and Technology Studies
• /
• 제11권2호
• /
• pp.67-96
• /
• 2011

Studies in scientific visualization have disclosed a visual chain among many scientific visualizations, which starts from the photographs that have many details to diagrams that enable scientists to make specific claims due to their abstract characters. Located at both ends of the visual chain, photographs and diagrams are regarded as being different kinds and having different characteristics. The photographs - or microphotographs to be precise - that this paper discusses, however, had been removed of unnecessary details and were prepared with carful attention to illustrative functions that diagrams usually perform. Following microphotographic changes in a Korean laboratory, this article shows that the knowledge of specimen preparation was transmitted from an American leading group to the Korean laboratory through a direct contact, and that with this, the technique of taking microphotographs of the laboratory was much improved. The specimen preparation method is, however, a tacit knowledge that is invisible in both group's papers. This article argues that the method of specimen preparation is the driving force that made the microphotographs act like carefully prepared diagrams and acquire objectivity.

• Journal of KIISE:Software and Applications
• /
• 제34권5호
• /
• pp.476-486
• /
• 2007

This paper proposes a resolution enhancement method which can reconstruct high-resolution facial images from single-frame, low-resolution facial images. The proposed method is derived from example-based reconstruction methods and the morphable face model. In order to improve the performance of the example-based reconstruction, we propose the region-based reconstruction method which can maintain the characteristics of local facial regions. Also, in order to use the capability of the morphable face model to face resolution enhancement problems, we define the extended morphable face model in which an extended face is composed of a low-resolution face, its interpolated high-resolution face, and the high-resolution equivalent, and then an extended face is separated by an extended shape vector and an extended texture vector. The encouraging results show that the proposed methods can be used to improve the performance of face recognition systems, particularly to enhance the resolution of facial images captured from visual surveillance systems.

• Journal of KIISE:Software and Applications
• /
• 제36권1호
• /
• pp.54-61
• /
• 2009

This paper proposes a skin segmentation method based on region histograms of the color quantization map. First, we make a quantization map of the image using the JSEG algorithm and detect the skin pixel. For the skin region detection, the similar neighboring regions are set by its similarity of the size and location between the previous frame and the present frame from the each region of the color quantization map. Then we compare the similarity of histogram between the color distributions of each quantized region and the skin color model using the histogram distance. We select the skin region by the threshold value calculated automatically. The skin model is updated by the skin color information from the selected result. The proposed algorithm was compared with previous algorithms on the ECHO database and the continuous images captured under time varying illumination for adaptation test. Our approach shows better performance than previous approaches on skin color segmentation and adaptation to varying illumination.

• Journal of KIISE:Computer Systems and Theory
• /
• 제35권7호
• /
• pp.340-353
• /
• 2008

A computational color palette extraction model is introduced to describe paint brush objectively and efficiently. In this model, a color palette is defined as a minimum set of colors in which a painting can be displayed within error allowance and extracted by the two step processing of color grouping and major color extraction. The color grouping controls the resolution of colors adaptively and produces a basic color set of given painting images. The final palette is obtained from the basic color set by applying weighted k-means clustering algorithm. The extracted palettes from several famous painters are displayed in a 3-D color space to show the distinctive palette styles using RGB and CIE LAB color models individually. And the two experiments of painter classification and color transform of photographic image has been done to check the performance of the proposed method. The results shows the possibility that the proposed palette model can be a computational color analysis metric to describe the paint brush, and can be a color transform tool for computer graphics.

• Journal of KIISE:Computing Practices and Letters
• /
• 제7권5호
• /
• pp.451-457
• /
• 2001

This paper describes automated methods for the detection of lung nodules and their volume calculation on CT scans. Gray-level threshold methods were used to segment the thorax from the background and then the lung parenchymes from the thoracic wall and mediastinum. A scanning-ball algorithm was applied to more accurately delineate the lung boundaries, thereby incorporating peripheral nodules contiguous to pleural surface within the segmented lung parenchymes. The lesions which have the high gray value were extracted from the segmented lung parenchymes. The selected lesions include nodules, blood vessels and partial volume effects. The discriminating features such as size, solid-shape, average, standard deviation and correlation coefficient of selected lesions were used to distinguish true nodules from pseudo-lesions. Volume and circularity calculation were performed for each identified nodules. The identified nodules were sorted in descending order of the volume. These method were applied to 621 image slices of 19 cases. The sensitivity was 95% and there was no false-positive result.

• KIISE Transactions on Computing Practices
• /
• 제24권2호
• /
• pp.59-66
• /
• 2018

In this paper, we propose a system to detect various damage automatically inflicted on road pavement by collecting and analyzing data from acceleration and camera sensors in real time. The proposed system sends the collected images, acceleration signals, and GPS coordinates to the road manager and the database in the remote server, shortly after detecting the damage to the road pavement. Our study makes three key contributions. The proposed system 1) enables road managers to maintain road conditions quickly, accurately, and conveniently; 2) allows road mangers to take care of various kinds of damage to the road pavement at the initial stage; and finally 3) even makes it possible to track the damage, which suggests that the integration of a high-level decision support function becomes affordable. We tested the sensitivity and precision of the proposed system against real-time data obtained from the vehicles driving on the highway at an average speed of 100 km/h. With ten iterations, the proposed system achieved an average sensitivity of 74% and an average precision of 84% in road pavement damage detection, which is comparable with the best competing schemes.

• Journal of KIISE:Computer Systems and Theory
• /
• 제30권3_4호
• /
• pp.205-212
• /
• 2003

In this paper, we propose a simple and efficient hardware-supported antialiasing algorithm and its rendering scheme. The proposed method can efficiently reduce the required memory bandwidth as well as memory size compared to a conventional supersampling when rendering 3D models. In addition, it can provide almost the same high quality scenes as supersampling does. In this paper, we have introduced the RUF (Recently Used Fragment) buffer that stores some or whole parts of a fragment or two more the merged results of fragments that recently used in color calculation. We have also proposed a color calculation algorithm to deteriorate the image quality as referencing the RUF buffer. Because of the efficiency presented in the proposed algorithm, the more number of sampling points increases the more memory saving ratio we can gain relative to the conventional supersampling. In our simulation, the proposed method can reduce the amount of memory size by 31% and the memory bandwidth by 11% with a moderate pixel color difference of 1.3% compared to supersampling for 8 sparse sampling points.