• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.721-726
• /
• 2004

The image binarization is applied frequently as one part of the preprocessing phase for a variety of image processing techniques such as character recognition and image analysis, etc. The performance of binarization algorithms is determined by the selection of threshold value for binarization, and most of the previous binarization algorithms analyze the intensity distribution of the original images by using the histogram and determine the threshold value using the mean value of Intensity or the intensity value corresponding to the valley of the histogram. The previous algorithms could not get the proper threshold value in the case that doesn't show the bimodal characteristic in the intensity histogram or for the case that tries to separate the feature area from the original image. So, this paper proposed the novel algorithm for image binarization, which, first, segments the intensity range of grayscale images to several intervals and calculates mean value of intensity for each interval, and next, repeats the interval integration until getting the final threshold value. The interval integration of two neighborhood intervals calculates the ratio of the distances between mean value and adjacent boundary value of two intervals and determine as the threshold value of the new integrated interval the intensity value that divides the distance between mean values of two intervals according to the ratio. The experiment for performance evaluation of the proposed binarization algorithm showed that the proposed algorithm generates the more effective threshold value than the previous algorithms.

• Journal of Korea Multimedia Society
• /
• v.19 no.9
• /
• pp.1679-1689
• /
• 2016

Recently, due to the rapid development of multimedia technologies, as image data has been extensive and large-scaled, the problem of increasing the time needed to retrieve the desired image is gradually critical. Image retrieval system that allows users to quickly and accurately search for the desired image information has been researched for a long time. However, in the case of content-based image retrieval representative Color Histogram, Color Coherence Vectors (CCV), Scale Invariant Feature Transform (SIFT) used in sensitive to changes in brightness, rotation, there is a problem that can occur misrecognized division off the power. In this paper, in order to evaluate the video retrieval system proposed, no change in brightness, respectively 0°, 90°, 180°, 270° rotated brightness up based on the case of changing, when the brightness down the results were compared with the performance evaluation of the system is an average of about 2% to provide the difference in performance due to changes in brightness, color histogram is an average of about 12.5%, CCV is an average of about 12.25%, it appeared in the SIFT is an average of about 8.5%, Thus, the proposed system of the variation width of the smallest in average about 2%, was confirmed to be robust to changes in the brightness and rotation than the existing systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1742-1754
• /
• 1999

In this paper, we propose a rate control scheme, using histogram based rate-distortion (R-D) estimation, which produces a consistent picture quality between consecutive frames. The histogram based R-D estimation used in our rate control scheme offers a closed-form mathematical model that enable us to predict the bits and the distortion generated from an encoded frame at a given quantization parameter (QP) and vice versa. The most attractive feature of the R-D estimation is low complexity of computing the R-D data because its major operation is just to obtain a histogram or weighted histogram of DCT coefficients from an input picture. Furthermore, it is accurate enough to be applied to the practical video coding. Therefore, the proposed rate control scheme using this R-D estimation model is appropriate for the applications requiring low delay and low complexity, and controls the output bit-rate ad quality accurately. Our rate control scheme ensures that the video buffer do not underflow and overflow by satisfying the buffer constraint and, additionally, prevents quality difference between consecutive frames from exceeding certain level by adopting the distortion constraint. In addition, a consistent considering the maximum tolerance BER of the voice service. Also in Rician fading channel of K=6 and K=10, considering CLP=$10^{-3}$ as a criterion, it is observed that the performance improment of about 3.5 dB and 1.5 dB is obtained, respectively, in terms of $E_b$/$N_o$ by employing the concatenated FEC code with pilot symbols.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.401-408
• /
• 2006

In this paper, we propose a new class of segmentation technique for feature extraction based on the statistical and regional classification at each vertical or horizontal line of digital image data. Data is processed and clustered at each line, different from the point or space process. They are designed to segment gray-scale sectional images using a horizontal and vertical line process due to their statistical and property differences, and to extract the feature. The techniques presented here show efficient results in case of the gray level overlap and not having threshold image. Such images are also not easy to be segmented by the global or local threshold methods. Line pixels inform us the sectionable data, and can be set according to cluster quality due to the differences of histogram and statistical data. The total segmentation on line clusters can be obtained by adaptive extension onto the horizontal axis. Each processed region has its own pixel value, resulting in feature extraction. The advantage and effectiveness of the line-cluster approach are both shown theoretically and demonstrated through the region-segmental carotid artery medical image processing.

• Journal of Platform Technology
• /
• v.11 no.3
• /
• pp.24-31
• /
• 2023

Recently, interest in UAM (Urban Air Mobility, UAM), which can take off and land vertically in the operation of urban air transportation systems, has been increasing. Therefore, various start-up companies are developing related technologies as eco-friendly future transportation with advanced technology. However, studies on ways to increase safety in the operation of UAM are still insignificant. In particular, efforts are more urgent to improve the safety of risks generated in the process of attempting to land in the city center by UAM equipped with autonomous driving. Accordingly, this study proposes a plan to safely land by avoiding dangerous region that interfere when autonomous UAM attempts to land in the city center. To this end, first, the latitude and longitude coordinate values of dangerous objects observed by the sense of the UAM are calculated. Based on this, we proposed to convert the coordinates of the distorted planar image from the 3D image to latitude and longitude and then use the calculated latitude and longitude to compare the pre-learned feature descriptor with the HOG (Histogram of Oriented Gradients, HOG) feature descriptor to extract the dangerous Region. Although the dangerous region could not be completely extracted, generally satisfactory results were obtained. Accordingly, the proposed research method reduces the enormous cost of selecting a take-off and landing site for UAM equipped with autonomous driving technology and contribute to basic measures to reduce risk increase safety when attempting to land in complex environments such as urban areas.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1692-1700
• /
• 2009

This paper proposes the direction distribution of surface normal vectors as a feature descriptor of three-dimensional models. Proposed the feature descriptor handles rotation invariance using a principal component analysis(PCA) method, and performs mesh simplification to make it robust and nonsensitive against noise addition. Our method picks samples for the distribution of normal vectors to be proportional to the area of each polygon, applies weight to the normal vectors, and applies interpolation to enhance discrimination so that the information on the surface with less area may be less reflected on composing a feature descriptor. This research measures similarity between models with a L1-norm in the probability density histogram where the distances of feature descriptors are normalized. Experimental results have shown that the proposed method has improved the retrieval performance described in an average normalized modified retrieval rank(ANMRR) by about 17.2% and the retrieval performance described in a quantitative discrimination scale by 9.6%~17.5% as compared to the existing method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.8
• /
• pp.868-874
• /
• 2014

This paper proposes a novel mapping algorithm in Omni-directional Vision SLAM based on an obstacle's feature extraction using Lucas-Kanade Optical Flow motion detection and images obtained through fish-eye lenses mounted on robots. Omni-directional image sensors have distortion problems because they use a fish-eye lens or mirror, but it is possible in real time image processing for mobile robots because it measured all information around the robot at one time. In previous Omni-Directional Vision SLAM research, feature points in corrected fisheye images were used but the proposed algorithm corrected only the feature point of the obstacle. We obtained faster processing than previous systems through this process. The core of the proposed algorithm may be summarized as follows: First, we capture instantaneous $360^{\circ}$ panoramic images around a robot through fish-eye lenses which are mounted in the bottom direction. Second, we remove the feature points of the floor surface using a histogram filter, and label the candidates of the obstacle extracted. Third, we estimate the location of obstacles based on motion vectors using LKOF. Finally, it estimates the robot position using an Extended Kalman Filter based on the obstacle position obtained by LKOF and creates a map. We will confirm the reliability of the mapping algorithm using motion estimation based on fisheye images through the comparison between maps obtained using the proposed algorithm and real maps.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.7
• /
• pp.459-466
• /
• 2014

In this paper, we suggest an efficient image processing method for fast paper currency counting with pattern recognition. The patterns are consisted of feature data in each note object extracted from full reflection image of notes and a general contact image sensor(CIS) is used to aggregate the feature images. The proposed pattern recognition algorithm can endure image variation when the paper currency is scanned because it is not sensitive to changes of image resulting in successful note recognition. We tested 100 notes per denomination and currency of several countries including Korea, U.S., China, EU, Britain and Turkey. To ensure the reliability of the result, we tested a total of 10 times per each direction of notes. We can conclude that this algorithm will be applicable to commercial product because of its successful recognition rates. The 100% recognition rates are obtained in almost cases with exceptional case of 99.9% in Euro and 99.8% in Turkish Lira.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.8
• /
• pp.55-67
• /
• 1998

This paper presents an automatic facial feature point extraction algorithm in sequential color images. To extract facial region in the video sequence, a moving color detection technique is proposed that emphasize moving skin color region by applying motion detection algorithm on the skin-color transformed images. The threshold value for the pixel difference detection is also decided according to the transformed pixel value that represents the probability of the desired color information. Eye candidate regions are selected using both of the black/white color information inside the skin-color region and the valley information of the moving skin region detected using morphological operators. Eye region is finally decided by the geometrical relationship of the eyes and color histogram. To decide the exact feature points, the PCA(Principal Component Analysis) is used on each eye and mouth regions. Experimental results show that the feature points of eye and mouth can be obtained correctly irrespective of background, direction and size of face.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.8
• /
• pp.57-66
• /
• 2011

In this paper, it is proposed for algorithm to detect human efficiently using a edge symmetry and gradient directional characteristics in realtime by the feature extraction in a single input image. Proposed algorithm is composed of three stages, preprocessing, region partition of human candidates, verification of candidate regions. Here, preprocessing stage is strong the image regardless of the intensity and brightness of surrounding environment, also detects a contour with characteristics of human as considering the shape features size and the condition of human for characteristic of human. And stage for region partition of human candidates has separated the region with edge symmetry for human and size in the detected contour, also divided 1st candidates region with applying the adaboost algorithm. Finally, the candidate region verification stage makes excellent the performance for the false detection by verifying the candidate region using feature vector of a gradient for divided local area and classifier. The results of the simulations, which is applying the proposed algorithm, the processing speed of the proposed algorithms is improved approximately 1.7 times, also, the FNR(False Negative Rate) is confirmed to be better 3% than the conventional algorithm which is a single structure algorithm.