• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2015년도 학술발표회
• /
• 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
• /
• 제5권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.

• 한국농공학회:학술대회논문집
• /
• 한국농공학회 2000년도 학술발표회 발표논문집
• /
• 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.

• 한국농공학회논문집
• /
• 제48권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.

• 대한의용생체공학회:의공학회지
• /
• 제42권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.

• 한국측량학회지
• /
• 제17권3호
• /
• pp.245-256
• /
• 1999

유역추출은 수문학적 유역을 인식하기 위해 지표면을 흘러가는 물의 흐름을 추적하는 과정이다. 지표면의 물 흐름과 유역을 수작업 및 자동으로 추적하는 기법들이 개발되어 왔다. 그러나, 준평야지는 지형 특성상 유역추출에 많은 어려움을 내포하고 있기 때문에 본 연구에서는 준평야지의 유역추출알고리즘을 개발하는데 그 목적을 두고 있다. 본 연루에서는 topogrid를 이용한 강제배수 알고리즘과 하천자료에 지형자료를 연계함으로서 준평야지의 유역을 추출하였다. 본 연구를 수행한 결과 준평야지에서는 단순히 TIN을 구성하여 유역추출을 위한 Source Grid를 생성하는 것 보다 Topogrid를 이용한 강제배수 알고리즘이 유역추출을 위한 좋은 Source Grid를 생성해 줌을 알 수 있었다. 또한 준평야지에서 표고와 하천자료를 연계하여 유역을 자동추출하여 수작업에 의한 유역과 비교한 결과 상당히 좋은 결과를 나타냄을 알 수 있었다.

• Journal of Forest and Environmental Science
• /
• 제34권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.

• 한국컴퓨터정보학회논문지
• /
• 제17권10호
• /
• pp.35-41
• /
• 2012

본 논문에서는 과분할 방지와 복잡한 현미경 세포영상의 자동 분할을 위한 새로운 마커 기반의 워터쉐드 알고리즘을 제안한다. 워터쉐드 방식은 접촉 또는 겹침으로 인한 복잡한 대상들을 분할하기 위해 효과적이며 보다 성공적인 적용을 위해 정확한 마커 추출이 선행되어야 한다. 세포 영상의 정확한 마커 추출을 위해 본 논문에서는 방사형 대칭성을 이용한 반복 보팅 알고리즘을 이용하였다. 합성 영상과 실제 영상에서도 기존의 다른 방식들에 비해 양호한 분할 결과를 보였다.

• 한국수자원학회논문집
• /
• 제41권12호
• /
• pp.1211-1218
• /
• 2008

본 연구의 목적은 다목적 유전자 알고리즘을 이용하여 우수유출 저류지를 소유역에 분담하여 설치 계획하는데있다. 이를 위해 우수유출 저류지의 위치 및 규모를 최적화하기 위한 모형을 개발하였다. 이 모형은 크게 2가지로 나뉘어 지는데, 유역유출모형과 최적해를 구하기 위하여 도입한 다목적 유전자 알고리즘(MOGAs)이다. 이러한 최적화 모형을 모의하기 위하여 목적함수는 첨두유출량과 저류지 저류용량의 함수로 설정하고, 제한조건은 기본적으로 구조적 제한과 저류용량 및 운영목적에 따라 설정하였다. 본 연구를 위해 만들어진 최적화 모형은 안양시 관양유역에 실제 적용해 보았으며, 그 결과 주어진 제약조건내에서 상류지역에 저류지가 설치되는 경우가 최적값으로 나타난 것을 통해 적절하게 잘 모의된 것으로 보인다. 그밖에 On-line 및 Off-line 저류지가 동시에 건설되는 경우에도 함께 최적화 모의가 가능한지도 살펴보았다. 본 연구를 통해 제시한 방법론은 향후 도시유역내의 홍수피해 저감계획시 활용될 수 있을 것이다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제11권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.