• Title/Summary/Keyword: Thinning Algorithm

Search Result 149, Processing Time 0.027 seconds

A Numerical Analysis of Streamwise Vortices in Turbulent Boundary Layers (주유동방향 와동과 난류경계층과의 상호작용에 관한 수치적 연구)

  • 김정한;양장식;김봉환;이기백
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.24 no.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.

  • PDF

GEOLOGICAL LINEAMENTS ANALYSIS BY IFSAR IMAGES

  • Wu Tzong-Dar;Chang Li Chi
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • 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.

  • PDF

A study on the Recognition of Hand-written Characters and Arabic numbers by Neural Networks (신경회로망을 이용한 필기체 한글 자모음 및 숫자인식에 관한 연구)

  • Oh, Dong-Su;Lee, Eun-Un;Yoo, Jae-Guen;Nam, Moon-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • 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.

  • PDF

The Effective Parallel Processing Method for the Skeleton Improvement of Character Patterns (문자 패턴의 골격화 향상을 위한 효과적인 병렬 처리 방법)

  • Shin Choong Ho
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.1
    • /
    • pp.27-33
    • /
    • 2005
  • In this paper, an effective skeleton method is proposed in order to obtain an enhanced digital image of skeleton line. The binary image using the threshold values is applied in the preprocessing stage and then The proposed method is applied to obtain the improved image of skeleton line. We used the existing skeleton methods and SPTA(Shin's Parallel Thinning Algorithm) method for the comparison. The demerits of the existing skeleton methods have a result of noise branch, expansion and contraction. and then we are proposed a SPTA method.

  • PDF

A Graph Search Method for Shortest Path-Planning of Mobile Robots (자율주행로봇의 최소경로계획을 위한 그래프 탐색 방법)

  • You, Jin-O;Chae, Ho-Byung;Park, Tae-Hyoung
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • 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.

  • PDF

A Modified Thinning Algorithm Using Parallel Processing Method (개선된 병렬적 처리 방식의 세선화 알고리즘)

  • Lee, Keon-Ik;Cha, Sung-Yoon;Kim, Sung-Nak
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11a
    • /
    • pp.519-522
    • /
    • 2003
  • 이 논문에서는 특징점 정보를 이용하여 기존의 병렬 세선화 알고리즘을 개선하는 방법을 제안하였다. 자동 지문 인식 시스템에서 특징점을 정확히 검출하기 위해서 지문영상의 세선화는 매우 중요한 부분을 차지한다. 이 논문에서는 기존 병렬 세선화 알고리즘에 픽셀의 연결성을 이용한 알고리즘을 추가하여 세선화를 수행하였다. 제안 방법의 성능평가를 위하여 이진 지문 영상을 사용하여 기존 방법과 비교하였으며 실험결과 세선화 정도가 우수함을 알 수 있었다.

  • PDF

Recognition of hand written hangeul based on the stroke order of the elementary segment

  • Song, Jeong-Young;Akizuki, Kageo;Lee, Hee-Hyol;Choi, Won-Kyu
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • 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.

  • PDF

Map building for path planning of an autonomous mobile robot using an ultrasonic sensor (초음파센서를 이용한 자율 주행 로봇의 경로 계획용 지도작성)

  • 이신제;오영선;김학일;김춘우
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • 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.

  • PDF

Optimal Path Planning Using Critical Points

  • Lee, Jin-Sun;Choi, Chang-Hyuk;Song, Jae-Bok;Chung, Woo-Jin;Kim, Mun-Sang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • 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.

  • PDF

License Plate Recognition System Using Artificial Neural Networks

  • Turkyilmaz, Ibrahim;Kacan, Kirami
    • ETRI Journal
    • /
    • v.39 no.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.