• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.337-342
• /
• 2002

This paper proposes a new adaptive image labeling algorithm fur object analysis of the binary images. The proposed labeling algorithm need not merge/order of complex equivalent labels like classical labeling algorithm and the processing is done during only 1 Pass. In addition, this algorithm can be extended for gray-level image easily. Experiment result with HIPR image library shows that the proposed algorithm process more than 2 times laster than compared algorithm.

• Smart Media Journal
• /
• v.2 no.4
• /
• pp.20-26
• /
• 2013

This paper presents an approach to Mongolian car plate recognition using artificial neural network. Our proposed method consists of two steps: detection and recognition. In detection step, we implement Flood fill algorithm. In recognition step we proceed to segment the plate for each Cyrillic character, and use an Artificial Neural Network (ANN) machine - learning algorithm to recognize the character. We have learned the theory of ANN and implemented it without using any library. A total of 150 vehicles images obtained from community entrance gates have been tested. The recognition algorithm shows an accuracy rate of 89.75%.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.188-191
• /
• 2011

Path finding and path planning is crucial in today's world where time is an extremely valuable element. It is easy to plan the optimum path to a destination if provided a map but the same cannot be said for an unknown and unexplored environment. It will surely be exhaustive to search and explore for paths to reach the destination, not to mention planning for the optimum path. This is very much similar to finding for an exit of a maze. A very popular competition designed to tackle the maze solving ability of autonomous called Micromouse will be used as a guideline for us to design our maze. There are numerous ways one can think of to solve a maze such as Dijkstra's algorithm, flood fill algorithm, modified flood fill algorithm, partition-central algorithm [1], and potential maze solving algorithm [2]. We will analyze these algorithms from various aspects such as maze solving ability, computational complexity, and also feasibility to be implemented.

• Journal of the Korea Convergence Society
• /
• v.10 no.6
• /
• pp.7-14
• /
• 2019

In this paper, we propose a Cascade Classifier face detection method using the Haar-like feature, which is complemented by the Flood Fill algorithm for lossy areas due to illumination and shadow in YCbCr color space extraction. The Cascade Classifier using Haar-like features can generate noise and loss regions due to lighting, shadow, etc. because skin color extraction using existing YCbCr color space in image only uses threshold value. In order to solve this problem, noise is removed by erosion and expansion calculation, and the loss region is estimated by using the Flood Fill algorithm to estimate the loss region. A threshold value of the YCbCr color space was further allowed for the estimated area. For the remaining loss area, the color was filled in as the average value of the additional allowed areas among the areas estimated above. We extracted faces using Haar-like Cascade Classifier. The accuracy of the proposed method is improved by about 4% and the detection rate of the proposed method is improved by about 2% than that of the Haar-like Cascade Classifier by using only the YCbCr color space.

• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.60-65
• /
• 2014

This paper describes an efficient framework for the extraction of a brain tumor from magnetic resonance (MR) images. Before the segmentation process, a median filter is used to filter the image. Then, the morphological gradient is computed and added to the filtered image for intensity enhancement. After the enhancement process, the thresholding value is calculated using the mean and the standard deviation of the image. This thresholding value is used to binarize the image followed by the morphological operations. Moreover, the combination of these morphological operations allows to compute the local thresholding image supported by a flood-fill algorithm and a pixel replacement process to extract the tumor from the brain. Thus, this framework provides a new source of evidence in the field of segmentation that the specialist can aggregate with the segmentation results in order to soften his/her own decision.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.2
• /
• pp.19-25
• /
• 2013

In this paper, we propose an approach to tracking road regions from video sequences. The proposed method segments and tracks road regions by utilizing the prior information from the result of the previous frame. For the efficiency of the system, we have a simple assumption that the road region is usually shown in the lower part of input images so that lower 60% of input images is set to the region of interest(ROI). After initial segmentation using flood-fill algorithm, we merge neighboring regions based on color similarity measure. The previous segmentation result, in which seed points for the successive frame are extracted, is used as prior information to segment the current frame. The similarity between the road region of the previous frame and that of the current frame is measured by the modified Jaccard coefficient. According to the similarity we refine and track the detected road regions. The experimental results reveal that the proposed method is effective to segment and track road regions in noisy and non-noisy environments.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2521-2524
• /
• 2002

In this paper, We propose an Image processing algorithm for a paper-cup inner defect inspection. First, we devide a cup image to four sections considering the characteristic of a cup and filter noises limit by using the flood-fill algorithm and median filter. Second, to obtain the clearer inspection result of the edge point inner cup, We apply the sharpening convolution filer to the objected inspect the edge points by using the LOG edge detector. Third, executing sub-pixel operation with the orignal image, we find the defect parts in the cup. Finally, denoting the inspected defect parts as rectangular, we recompose the images of the defected ones.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.9
• /
• pp.1-6
• /
• 2018

In this paper, we propose a method dividing effectively the hand and fingers using general webcam. The method executes 4 times empirically preprocessing one to erase noise. First, it erases the overall noise of the image using Gaussian smoothing. Second, it changes from RGB image to HSV color model and YCbCr color model, executes a global static binarization based on the statistical value for each color model, and erase the noise through bitwise-OR operation. Third, it executes outline approximation and inner region filling algorithm using RDP algorithm and Flood fill algorithm and erase noise. Lastly, it erases noise through morphological operation and determines the threshold propositional to the image size and selects the hand and fingers area. This paper compares to existing one color based hand area division method and focuses the noise deduction and can be used to a gesture recognition application.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1424-1436
• /
• 2020

Although huge progress has been made in current image segmentation work, there are still no efficient segmentation strategies for tree image which is taken from natural environment and contains complex background. To improve those problems, we propose a method for tree image segmentation combining adaptive mean shifting with image abstraction. Our approach perform better than others because it focuses mainly on the background of image and characteristics of the tree itself. First, we abstract the original tree image using bilateral filtering and image pyramid from multiple perspectives, which can reduce the influence of the background and tree canopy gaps on clustering. Spatial location and gray scale features are obtained by step detection and the insertion rule method, respectively. Bandwidths calculated by spatial location and gray scale features are then used to determine the size of the Gaussian kernel function and in the mean shift clustering. Furthermore, the flood fill method is employed to fill the results of clustering and highlight the region of interest. To prove the effectiveness of tree image abstractions on image clustering, we compared different abstraction levels and achieved the optimal clustering results. For our algorithm, the average segmentation accuracy (SA), over-segmentation rate (OR), and under-segmentation rate (UR) of the crown are 91.21%, 3.54%, and 9.85%, respectively. The average values of the trunk are 92.78%, 8.16%, and 7.93%, respectively. Comparing the results of our method experimentally with other popular tree image segmentation methods, our segmentation method get rid of human interaction and shows higher SA. Meanwhile, this work shows a promising application prospect on visual reconstruction and factors measurement of tree.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.818-822
• /
• 2008

The purpose of this study is to develop realistic painting simulation in real-time as well as to represent the thickness of the deposited paint on the surface. The Gaussian model is used for a painting deposition model to calculate the thickness of paints. For a painting simulation, rather than implementing particle systems, we propose a new heuristic algorithm for painting process based on a few number of rays. After we find the collision points of the rays with an environment, we compute the painted area using flood-fill searching method on the texture map and visualize paint effects. We analyzed time complexity of our method to verify that our system is suitable for real-time VR applications.