• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.218-218
• /
• 2015

Urbanization and waterworks construction in natural watershed have been causing higher flood risks in lowland areas. Detention basins have become one of the most efficient fundamental instruments for storm water and environmental management at watershed scale. Nowadays, there are many studies coupled numerical methods of flood routing with optimization algorithms to investigate factors that impact on the efficiency of detention basins in flood reduction in a watershed, such as detention basin location, size, and cost and watershed characteristics. Although these couplings have been become more widespread but cumbersome computation and hydraulic data requirement still are their limitations. To tackle the procedure efforts due to numerical integration and data collection, simple approach is proposed to primarily estimate effects of detention basins. The approach basis is the linear system theory applied to the solution of hydrologic flood routing. The paper introduces an analytical method for estimating detention effects deriving by recent studies and innovatively analyses this equation on fractal perspective. Then, an optimization technique is performed by applying harmony search algorithms (HSA) to optimize efficiency of detention basins at watershed scale. The location and size of upstream detention basin are simultaneously obtained. Finally, the proposed methodology, practically applied for a real watershed in Kan river, Iran.

• Computers and Concrete
• /
• v.5 no.1
• /
• pp.61-74
• /
• 2008

Digital image processing algorithms for the analysis and characterization of grains and voids in cemented materials were developed using toolbox functions of a mathematical software package. Utilization of grayscale, color and watershed segmentation algorithms and their performances were demonstrated on artificially prepared self-compacting concrete (SCC) samples. It has been found that color segmentation was more advantageous over the gray scale segmentation for the detection of voids whereas the latter method provided satisfying results for the aggregate grains due to the sharp contrast between their colors and the cohesive matrix. The watershed segmentation method, on the other hand, appeared to be very efficient while separating touching objects in digital images.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2000.10a
• /
• pp.384-389
• /
• 2000

A artificial neural network model was developed to analyze and forecast the flow fluctuation at small streams in the Balan watershed. Backpropagation neural networks were found to perform very well in forecasting daily streamflows. In order to deal with slow convergence and an appropriate structure, two algorithms were proposed for speeding up the convergence of the backpropagation method, and the Bayesian Information Criterion(BIC) was proposed for obtaining the optimal number of hidden nodes. From simulations using daily flows at the HS#3 watershed of the Balan Watershed Project, which is 412,5 ㏊ in size and relatively steep in landscape, it was found that those algorithms perform satisfactorily.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.48 no.4
• /
• pp.3-12
• /
• 2006

Watershed is the land area that contributes runoff to an outlet point. To delineate an watershed, watershed delineation using GIS that contains grid data structure is the most general method. Some researchers have studied to implement algorithms that revise the TIN topography since it is difficult to delineate watershed boundary more accurately. In this study kruskal's greedy algorithm and triangulated irregular network (TIN) were used to delineate a watershed. This method does not require a conversion from to DEM in grid and automatically obtain(generates) the oulet points. Delineation algorithm was tested in Geosan-gun, Chung-cheongbuk-do and get small watershed areas. Finally, kruskal's algorithm could operate more precisely with revision algorithm.

• Journal of Biomedical Engineering Research
• /
• v.42 no.4
• /
• pp.159-166
• /
• 2021

In order to analyze cell images, accurate segmentation of each cell is indispensable. However, the reality is that accurate cell image segmentation is not easy due to various noises, dense cells, and inconsistent shape of cells. Therefore, in this paper, we propose an algorithm that combines marker-based watershed segmentation and ellipse fitting method for glioblastoma cell segmentation. In the proposed algorithm, in order to solve the over-segmentation problem of the existing watershed method, the marker-based watershed technique is primarily performed through "seeding using local minima". In addition, as a second process, the concave point search using ellipse fitting for final segmentation based on the connection line between the concave points has been performed. To evaluate the performance of the proposed algorithm, we compared three algorithms with other algorithms along with the calculation of segmentation accuracy, and we applied the algorithm to other cell image data to check the generalization and propose a solution.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.3
• /
• pp.245-256
• /
• 1999

Watershed delineation is the process of tracing surface water flow across a landscape to identify hydrologic basins. Manual and automated techniques have been developed to trace surface waters and locate watersheds on a variety of landscape. Low topographic relief landscapes, however, are particulary problematic for automated watershed delineation techniques. Therefore, this study aims at focusing the watershed delineation algorithm of low topographic relief landscape. By using topogrid, which manages enforcement drainage algorithms and incorporates topographic data into stream data, this study delineates watershed boundary in low relief landscape. Based on this research, in a low topographic relief landscape, enforcement drainage algorithms using topogrid generate better source grid to delineate watershed boundary than using only TIN. Also, comparing automated watershed delineation which incorporates contours and elevations into stream data with manual watershed delineation, we can know that the incorporation of both elevation and stream data generate more effective results.

• Journal of Forest and Environmental Science
• /
• v.34 no.2
• /
• pp.142-144
• /
• 2018

This paper discusses the development of semi-automatic search program for crown delineation in stand level. The crown of an individual tree was delineated by applying the Watershed (WS) and Valley Following (VF) algorithms. Unmanned Aerial Vehicle (UAV) images were used in the semi-automatic search program to delineate the crown area. The overall accuracy and Khat were used in accuracy assessment. WS algorithm's model showed the overall accuracy and Khat index of 0.80 and 0.59, respectively, in Plot 1. However, the overall accuracy and Khat of VF algorithm's model were 0.78 and 0.51, respectively, in Plot 2.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.35-41
• /
• 2012

We propose a new marker driven Watershed algorithm for automated segmentation of clustered cell from microscopy image with less over segmentation. The Watershed Transform is able to segment extremely complex objects which are highly touched and overlapped each other. The success of the Watershed Transform depends essentially on the finding markers for each of the objects of interest. For extracting of markers positioning around center of each cell we used radial symmetry and iterative voting algorithms. With synthetic and real images, we quantitatively demonstrate the performance of our method and achieved better results than the other compared methods.

• Journal of Korea Water Resources Association
• /
• v.41 no.12
• /
• pp.1211-1218
• /
• 2008

This study is for design of the detention system distributed in a watershed by the Multi-Objective Genetic Algorithms(MOGAs). A new model is developed to determine optimal size and location of detention. The developed model has two primary interfaced components such as a rainfall runoff model to simulate water surface elevation(or flowrate) and MOGAs to get the optimal solution. The objective functions used in this model depend on the peak flow and storage of detention. With various constraints such as structural limitations, capacities of storage and operational targets. The developed model is applied at Gwanyang basin within Anyang watershed. The simulation results show the maximum outlet reduction is occurred at detention facilities located in upper reach of watershed in the peak discharge rates. It is also reviewed the simultaneous construction of an off-line detention and an on-line detention. The methodologies obtained from this study will be used to control the flood discharges and to reduce flood damage in urbanized watershed.

• International Journal of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.39-46
• /
• 2019

This paper proposes an adaptive threshold watershed algorithm, which is the method used for image segmentation and boundary detection, which extends the region on the basis of regional minimum point. First, apply adaptive thresholds to determine regional minimum points. Second, it extends the region by applying adaptive thresholds based on determined regional minimum points. Traditional watershed algorithms create over-segmentation, resulting in the disadvantages of breaking boundaries between regions. These segmentation results mainly from the boundary of the object, creating an inaccurate region. To solve these problems, this paper applies an improved watershed algorithm applied with adaptive threshold in regional minimum point search and region expansion in order to reduce over-segmentation and breaking the boundary of region. This resulted in over-segmentation suppression and the result of having the boundary of precisely divided regions. The experimental results show that the proposed algorithm can apply adaptive thresholds to reduce the number of segmented regions and see that the segmented boundary parts are correct.