• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1748-1759
• /
• 2018

Weber Local Descriptor (WLD) is a stable and effective feature extraction algorithm, which is based on Weber's Law. It calculates the differential excitation information and direction information, and then integrates them to get the feature information of the image. However, WLD only considers the center pixel and its contrast with its surrounding pixels when calculating the differential excitation information. As a result, the illumination variation is relatively sensitive, and the selection of the neighbor area is rather small. This may make the whole information is divided into small pieces, thus, it is difficult to be recognized. In order to overcome this problem, this paper proposes Weber Symmetrical Local Graph Structure (WSLGS), which constructs the graph structure based on the $5{\times}5$ neighborhood. Then the information obtained is regarded as the differential excitation information. Finally, we demonstrate the effectiveness of our proposed method on the database of ORL, JAFFE and our own built database, high-definition infrared faces. The experimental results show that WSLGS provides higher recognition rate and shorter image processing time compared with traditional algorithms.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.1
• /
• pp.77-85
• /
• 1996

Using a series of medical tomograms, we can reconstruct internal organs or other objects of interest and generate 3-D images. It is generally accepted that the axial resolution determined by two sequential image slices is lower than the planar resolution in one image slices. Therefore, various methods of interpolation were developed for an accurate display of reconstructed images. In this paper, a new algorithm for 3-D reconstruction of the medical images such as MRI and X-ray CT is suggested. The algorithm is shape-based and utilizes parts of the gray-level information. We extend the conventional shape-based interpolation of the binary images to the gray-scale images using the shortest distance map. Using this new algorithm, We could reduce the execution time for interpolation while keeping similar high quality of the reconstructed images with reduced execution time and is applicable to the various medical tomograms.

• Journal of KIISE:Software and Applications
• /
• v.31 no.1
• /
• pp.8-19
• /
• 2004

In this paper, we propose an efficient method for locating destination address block on both of machine-Printed and handwritten Korean mail piece images. The proposed method extracts connected components from the binary mail piece image, generates text lines by merging them, and then groups the text fines into nine clusters. The destination address block is determined by selecting some clusters. Considering the geometric characteristics of address information on Korean mail piece, we split a mail piece image into nine areas with an equal size. The nine clusters are initialized with the center coordinate of each area. A modified Manhattan distance function is used to compute the distance between text lines and clusters. We modified the distance function on which the aspect ratio of mail piece could be reflected. The experiment done with live Korean mail piece images has demonstrated the superiority of the Proposed method. The success rate for 1, 988 testing images was about 93.56%.

• The Journal of the Korea Contents Association
• /
• v.11 no.6
• /
• pp.18-25
• /
• 2011

Salient object attracts more and more attention from researchers due to its important role in many fields of multimedia processing like tracking, segmentation, adaptive compression, and content-base image retrieval. Usually, a saliency map is binarized into black and white map, which is considered as the binary mask of the salient object in the image. Still, the threshold is heuristically chosen or parametrically controlled. This paper suggests using the global optimal threshold to perform saliency map thresholding. This work also considers the usage of multi-level optimal thresholds and the local adaptive thresholds in the experiments. These experimental results show that using global optimal threshold method is better than parametric controlled or local adaptive threshold method.

• Journal of the Korea Society for Simulation
• /
• v.27 no.2
• /
• pp.1-10
• /
• 2018

This paper presents an autonomous detection and aiming point computation of a battle tank by using RGB images. Maximally stable extremal regions algorithm was implemented to find features of the tank, which are matched with images extracted from streaming video to figure out the region of interest where the tank is present. The median filter was applied to remove noises in the region of interest and decrease camouflage effects of the tank. For the tank segmentation, k-mean clustering was used to autonomously distinguish the tank from its background. Also, both erosion and dilation algorithms of morphology techniques were applied to extract the tank shape without noises and generate the binary image with 1 for the tank and 0 for the background. After that, Sobel's edge detection was used to measure the outline of the tank by which the aiming point at the center of the tank was calculated. For performance measurement, accuracy, precision, recall, and F-measure were analyzed by confusion matrix, resulting in 91.6%, 90.4%, 85.8%, and 88.1%, respectively.

• Journal of the Korean Society for Precision Engineering
• /
• v.30 no.9
• /
• pp.901-908
• /
• 2013

The introduction of industrial intelligent robot using vision sensor has been interested in automated factory. 2D and 3D vision sensors have used to recognize object and to estimate object pose, which is for packaging parts onto a complete whole. But it is not trivial task due to illumination and various types of objects. Object image has distorted due to illumination that has caused low reliability in recognition. In this paper, recognition method of complex shape object has been proposed. An accurate object region has detected from combined binary image, which has achieved using DoG filter and local adaptive binarization. The object has recognized using neural network, which is trained with sub-divided object class according to object type and rotation angle. Predefined shape model of object and maximal slope have used to estimate the pose of object. The performance has evaluated on ETRI database and recognition rate of 96% has obtained.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.77-85
• /
• 2011

In this paper, we propose an region segmentation and texture based feature extraction method which split the pavement and roadway from the camera which equipped to the visually impaired person during a walk. We perform the hough transformation method for detect the boundary between pavement and roadway, and devide the segmented region into 3-level according to perspective. Next step, split into pavement and roadway according to the extracted texture feature of segmented regions. Our walking assistance system use rotation-invariant LBP and GLCM texture features for compare the characteristic of pavement block with various pattern and uniformity roadway. Our proposed method show that can segment two regions with illumination invariant in day and night image, and split there regions rotation and occlution invariant in complexed outdoor image.

• Journal of Korea Multimedia Society
• /
• v.12 no.3
• /
• pp.362-371
• /
• 2009

The key technology for developing high quality LCDs is about manufacturing BLUs with homogeneous dot distributions. Commonly, homogeneous dot distributions are obtained by the halftoning methods which convert a gray-scale image to a binary image. Among many halftoning algorithms, the error-diffusion technique based on the principle distance is known to show homogeneous dot distributions. However, this technique has a drawback; the extent of the principle distance at each pixel with respect to those of the neighboring pixels can be too small or big creating a gap or overlap. In this paper, we propose a new error diffusion algorithm based on the variable principle distance which improves the existing error diffusion technique based on the principle distance. The variable principle distance at a given pixel is calculated with gray-scale values of the pixel and its neighbors and thus the principle distance value is variable depending on the direction from that pixel. This variable principle distance technique helps BLUs obtain homogeneous dot distributions.

• Journal of Computing Science and Engineering
• /
• v.6 no.1
• /
• pp.1-11
• /
• 2012

Computed tomography (CT) images are widely used for the analysis of the temporal evaluation or monitoring of the progression of a disease. The follow-up examinations of CT scan images of the same patient require a 3D registration technique. In this paper, an automatic and robust registration is proposed for the rigid registration of 3D CT images. The proposed method involves two steps. Firstly, the two CT volumes are aligned based on their principal axes, and then, the alignment from the previous step is refined by the optimization of the similarity score of the image's voxel. Normalized cross correlation (NCC) is used as a similarity metric and a downhill simplex method is employed to find out the optimal score. The performance of the algorithm is evaluated on phantom images and knee synthetic CT images. By the extraction of the initial transformation parameters with principal axis of the binary volumes, the searching space to find out the parameters is reduced in the optimization step. Thus, the overall registration time is algorithmically decreased without the deterioration of the accuracy. The preliminary experimental results of the study demonstrate that the proposed method can be applied to rigid registration problems of real patient images.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.47-54
• /
• 2001

The main purpose of this study is to propose the algorithm about the extraction of the facial feature. To achieve the above goal, first of all, this study produces binary image for input color image. It calculates area after pixel labeling by variant block-units. Secondly, by contour following, circumference have been calculated. So the proper degree of resemblance about area, circumference, the proper degree of a circle and shape have been calculated using the value of area and circumference. And Third, the algorithm about the methods of extracting parameters which are about the feature of eyes, nose, and mouse using the proper degree of resemblance, general structures and characteristics(symmetrical distance) in face have been accomplished. And then the feature parameters of the front face have been extracted. In this study, twelve facial feature parameters have been extracted by 297 test images taken from 100 people, and 92.93 % of the extracting rate has been shown.