• Journal of the Korean Society of Hazard Mitigation
• /
• v.11 no.3
• /
• pp.157-163
• /
• 2011

In this study, after the target basin was divided into both overland and channel grids, the travel time from center of each grid cell to watershed's outlet was calculated based on the manning equation. Through this process, volumetric discharge was calculated according to the isochrones and finally, the direct runoff hydrograph was estimated considering watershed's hydrodynamic characteristics. Sanseong subwatershed located in main stream of Bocheong basin was selected as a target basin. The model parameters are only two: area threshold and channel velocity correction factor; the optimized values were estimated at 3,800 and 3.3, respectively. The developed model based on the tuned parameters led to well-matching results between observed and calculated hydrographs (mean of absolute error of peak discharge: 3.41%, mean of absolute error of peak time: 0.67 hr). Moreover, the analysis results regarding histogram of travel time-contribution area demonstrates that the proposed model characterizes relatively well hydrodynamic characteristics of the catchment due to effective rainfall.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.829-842
• /
• 2003

In this Paper, we propose the new face detection and tracking method based on template matching for real-time applications such as, teleconference, telecommunication, front stage of surveillance system using face recognition, and video-phone applications. Since the main purpose of paper is to track a face regardless of various environments, we use template-based face tracking method. To generate robust face templates, we apply wavelet transform to the average face image and extract three types of wavelet template from transformed low-resolution average face. However template matching is generally sensitive to the change of illumination conditions, we apply Min-max normalization with histogram equalization according to the variation of intensity. Tracking method is also applied to reduce the computation time and predict precise face candidate region. Finally, facial components are also detected and from the relative distance of two eyes, we estimate the size of facial ellipse.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.117-128
• /
• 2001

In order to achieve optimal retrieval, i.e., to find the best match to a query according to a certain similarity measure, the exhaustive search should be performed literally for all the images in a database. However, the straightforward exhaustive search algorithm is computationally expensive in large image databases. To reduce its heavy computational cost, this paper presents a fast exhaustive multi-resolution search algorithm based on image database clustering. Firstly, the proposed algorithm partitions the whole image data set into a pre-defined number of clusters having similar feature contents. Next, for a given query, it checks the lower bound of distances in each cluster, eliminating disqualified clusters. Then, it only examines the candidates in the remaining clusters. To alleviate unnecessary feature matching operations in the search procedure, the distance inequality property is employed based on a multi-resolution data structure. The proposed algorithm realizes a fast exhaustive multi-resolution search for either the best match or multiple best matches to the query. Using luminance histograms as a feature, we prove that the proposed algorithm guarantees optimal retrieval with high searching speed.

• Journal of Bio-Environment Control
• /
• v.24 no.3
• /
• pp.210-216
• /
• 2015

Purpose of this study was a development of an image processing algorithm to recognize paprika and acquire it's 3D coordinates from stereo images to precisely control an end-effector of a paprika auto harvester. First, H and S threshold was set using HSI histogram analyze for extracting ROI(region of interest) from raw paprika cultivation images. Next, fundamental matrix of a stereo camera system was calculated to process matching between extracted ROI of corresponding images. Epipolar lines were acquired using F matrix, and $11{\times}11$ mask was used to compare pixels on the line. Distance between extracted corresponding points were calibrated using 3D coordinates of a calibration board. Non linear regression analyze was used to prove relation between each pixel disparity of corresponding points and depth(Z). Finally, the program could calculate horizontal(X), vertical(Y) directional coordinates using stereo camera's geometry. Horizontal directional coordinate's average error was 5.3mm, vertical was 18.8mm, depth was 5.4mm. Most of the error was occurred at 400~450mm of depth and distorted regions of image.

• Journal of Information Technology Application
• /
• v.3 no.2
• /
• pp.133-147
• /
• 2001

This paper proposed a new algorithm for binarization and removal of noises in color images with characters and pictures. Binarization was performed by threshold which had computed with color-relationship relative to the number of pixel in background and character candidates and pre-threshold for dividing of background and character candidates in input images. The pre-threshold has been computed by the histogram of R, G, B In respect of the images, while background and character candidates of input images are divided by the above pre-threshold. As it is possible that threshold can be dynamically decided by the quantity of the noises, and the character images are maintained and the noises are removed to the maximum. And, in this study, we made the noise pattern table as a result of analysis in noise pattern included in the various color images aiming at removal of the noises from the Images. Noises included in the images can figure out Distribution by way of the noise pattern table and pattern matching itself. And then this Distribution classified difficulty of noises included in the images into the three categories. As removal of noises in the images is processed through different procedure according to the its classified difficulties, time required for process was reduced and efficiency of noise removal was improved. As a result of recognition experiments in respect of extracted characters in color images by way of the proposed algorithm, we conformed that the proposed algorithm is useful in a sense that it obtained the recognition rate in general documents without colors and pictures to the same level.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.5 s.311
• /
• pp.29-37
• /
• 2006

Thresholding is a fundamental approach to segmentation that utilizes a significant degree of pixel popularity or intensity. Otsu's thresholding employed the normalized histogram as a discrete probability density function. Also it utilized a criterion that minimizes the between-class variance of pixel intensity to choose a threshold value for segmentation. However, the Otsu's method has a disadvantage of repeatedly searching optimal thresholds for the entire range. In this paper, a simple but fast multi-level thresholding approach is proposed by means of extending the Otsu's method. Rather than invoke the Otsu's method for the entire gray range, we advocate that the gray-level range of an image be first divided into smaller sub-ranges, and that the multi-level thresholds be achieved by iteratively invoking this dividing process. Initially, in the proposed method, the gray range of the object image is divided into 2 classes with a threshold value. Here, the threshold value for segmentation is selected by invoking the Otsu's method for the entire range. Following this, the two classes are divided into 4 classes again by applying the Otsu's method to each of the divided sub-ranges. This process is repeatedly performed until the required number of thresholds is obtained. Our experimental results for three benchmark images and fifty faces show a possibility that the proposed method could be used efficiently for pattern matching and face recognition.

• The KIPS Transactions:PartB
• /
• v.13B no.7 s.110
• /
• pp.689-698
• /
• 2006

Pattern recognition is the study of how machines can observe the environment, learn to distinguish patterns of interest from their background, and make sound and reasonable decisions about the categories of the patterns. Color image consists of various color patterns. And most pattern recognition methods use the information of color which has been trained and extract the feature of the color. This thesis extracts adaptively specific color feature from images with several limited colors. Because the number of the color patterns is limited, the distribution of the color in the image is similar. But, when there are some noises and distortions in the image, its distribution can be various. Therefore we cannot extract specific color regions in the standard image that is well expressed in special color patterns to extract, and special color regions of the image to test. We suggest new method to reduce the error of recognition by extracting the specific color feature adaptively for images with the low distortion, and six test images with some degree of noises and distortion. We consequently found that proposed method shouws more accurate results than those of statistical pattern recognition.

• Journal of Korea Water Resources Association
• /
• v.51 no.12
• /
• pp.1181-1194
• /
• 2018

This study suggests a novel approach of estimating stream flow discharge using the Synthetic Aperture Radar (SAR) images taken from 2015 to 2017 by European Space Agency Sentinel-1 satellite. Fifteen small to medium sized rivers in the Han River basin were selected as study area, and the SAR satellite images and flow data from water level and flow observation system operated by the Korea Institute of Hydrological Survey were used for model construction. First, we apply the histogram matching technique to 12 SAR images that have undergone various preprocessing processes for error correction to make the brightness distribution of the images the same. Then, the flow estimation model was constructed by deriving the relationship between the area of the stream water body extracted using the threshold classification method and the in-situ flow data. As a result, we could construct a power function type flow estimation model at the fourteen study areas except for one station. The minimum, the mean, and the maximum coefficient of determination ($R^2$) of the models of at fourteen study areas were 0.30, 0.80, and 0.99, respectively.