• Journal of Advanced Marine Engineering and Technology
• /
• 제24권1호
• /
• pp.31-40
• /
• 2000

This paper describes the numerical computations of the interaction between the streamwise vortex and a flat plate 3-D turbulent boundary layer. In the present study, the main interest is in the behavior of the streamwise vortices introduced in turbulent boundary layers. The flow behind a vortex generator is modeled by the information that is avilable from studies on the dalta winglet. An algorithm of the solution of the incompressible Navier-Stokes equations for three-dimensional turbulent flows, together with a two layer turbulent model to resolve the near-wall flow, is based on the method of artificial compressibility. The present results show boundary layer distortion due to vortices, such as strong spanwise flow divergence and boundary thinning, and have a good agreement with the experimental data.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.169-172
• /
• 2005

Modem SAR interferometry (IFSAR) sensors delivering intensity images and corresponding digital terrain model (DTM) allow for a thorough surface lineament interpretation with the all-weather day-night applicability. In this paper, an automatic linear-feature detection algorithm for high-resolution SAR images acquired in Taiwan is proposed. Methodologies to extract linear features consist of several stages. First, the image denoising techniques are used to remove the speckle noise on the raw image. In this stage, the Lee filter has been chosen because of its superior performance. After denoising, the Coefficient of Variation Detector is performed on the result images for edge enhancements and detection. Dilation and erosion techniques are used to reconnect the fragmented lines. The Hough transform, which is a special case of a more general transform known as Radon transform, is a suitable method for line detection in our analysis. Finally, linear features are extracted from the binary edge image. The last stage contains many substeps such as edge thinning and curve pruning.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1991년도 하계학술대회 논문집
• /
• pp.900-904
• /
• 1991

In this paper, our study for the recognition of Hand-written Korean characters, Arabic numbers and alphabets by neural netwoks. This System extracts feature of character by using the MESH feature point of handwritten character, Arabic numbers and alphabets. To reduce the input image data, features are extracted from each input images. A MLP(multi-layer perceptron) with one hidden layer was trained with a modified BEP(back error propagation) algorithm. This method extracts feature sets of the characters directly from the scanner and can enhance computation speed without using the special preprocesses such as size normalization, smoothing, and thinning.

• 한국멀티미디어학회논문지
• /
• 제8권1호
• /
• pp.27-33
• /
• 2005

골격선 추출에 대한 향상된 디지털 이미지를 획득하기 위해서 효과적인 골격화 방법을 제안한다. 제안한 방법은 임계값을 이용한 이진화를 거친 후에 본 방법 을 적용하여 영상 골격화 효율을 높이고자 한다. 골격선의 비교분석을 위해서 기존의 골격화 방법들과 SPTA방법을 사용하였다. 기존방법들의 단점은 확장과 수축이 심하고 잡영가지로 인해서 원형의 영상을 유지하기 어렵다. 이러한 단점을 보안한 새로운 방법인 SPTA방법 을 제안한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.184-186
• /
• 2006

We propose a new method for shortest path planning of mobile robots. The topological information of the graph is obtained by thinning method to generate the collision-free path of robot. And the travelling path is determined through hierarchical planning stages. The first stage generates an initial path by use of Dijkstra's algorithm. The second stage then generates the final path by use of dynamic programming (DP). The DP adjusts the intial path to reduce the total travelling distance of robot. Simulation results are presented to verify the performance of the proposed method.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2003년도 추계학술발표논문집 (상)
• /
• pp.519-522
• /
• 2003

이 논문에서는 특징점 정보를 이용하여 기존의 병렬 세선화 알고리즘을 개선하는 방법을 제안하였다. 자동 지문 인식 시스템에서 특징점을 정확히 검출하기 위해서 지문영상의 세선화는 매우 중요한 부분을 차지한다. 이 논문에서는 기존 병렬 세선화 알고리즘에 픽셀의 연결성을 이용한 알고리즘을 추가하여 세선화를 수행하였다. 제안 방법의 성능평가를 위하여 이진 지문 영상을 사용하여 기존 방법과 비교하였으며 실험결과 세선화 정도가 우수함을 알 수 있었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
• /
• pp.302-306
• /
• 1994

This paper describes how to recognize hand written Hangeul character using the stroke order of the elementary segment. The recognition system is constructed of parts : character input part, segment disassembling part, character element extraction part and character recognition part. The character input part reads the character and performs thinning algorithm. In the segment disassembling part, the input character is disassembled into elementary segments using the direction codes and the feature parameters. In the character element extraction part, we extract the character element using the stroke order and the knowledge rule. Finally, we able to recognize the hand written Hangeul characters by assembling the character elements, in the character recognition part.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.900-903
• /
• 1996

The objective of this paper is to make the weighted graph map for path planning using the ultrasonic sensor measurements that are acquired when an A.M.R (autonomous mobile robot) explores the unknown circumstance. First, The A.M.R navigates on unknown space with wall-following and gathers the sensor data from the environments. After this, we constructs the occupancy grid map by interpreting the gathered sensor data to occupancy probability. For the path planning of roadmap method, the weighted graph map is extracted from the occupancy grid map using morphological image processing and thinning algorithm. This methods is implemented on an A.M.R having a ultrasonic sensor.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.131.4-131
• /
• 2001

A lot of path planning algorithms have been developed to find the collision-free path with minimum cost. But most of them require complicated computations. In this paper, a thinning method, which is one of the image processing schemes, was adopted to simplify the path planning procedure. In addition, critical points are used to find the shortest-distance path among all possible paths from the start to the goal point. Since the critical points contain the information on the neighboring paths, a new path can be quickly obtained on the map even when the start and goal points change. To investigate the validity of the proposed algorithm, various simulations have been performed for the environment where the obstacles with arbitrary shapes exist. It is shown that the optimal paths can be found with relative easiness.

• ETRI Journal
• /
• 제39권2호
• /
• pp.163-172
• /
• 2017

A high performance license plate recognition system (LPRS) is proposed in this work. The proposed LPRS is composed of the following three main stages: (i) plate region determination, (ii) character segmentation, and (iii) character recognition. During the plate region determination stage, the image is enhanced by image processing algorithms to increase system performance. The rectangular license plate region is obtained using edge-based image processing methods on the binarized image. With the help of skew correction, the plate region is prepared for the character segmentation stage. Characters are separated from each other using vertical projections on the plate region. Segmented characters are prepared for the character recognition stage by a thinning process. At the character recognition stage, a three-layer feedforward artificial neural network using a backpropagation learning algorithm is constructed and the characters are determined.