• Title/Summary/Keyword: contour lines

Search Result 178, Processing Time 0.021 seconds

A THREE DIMENSIONAL LOCATION SYSTEM FOR HIKER WALKING SPEEDS BASED ON CONTOUR LINES

  • Wu, Mary;Ahn, Kyung-Hwan;Chen, Ni;Kim, Chong-Gun
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.3_4
    • /
    • pp.703-714
    • /
    • 2009
  • GPS is especially suitable for location systems in flat areas, but the availability of GPS is limited in highly urbanized and mountain areas, due to the nature of satellite communications. Dead reckoning is generally used to solve a location problem when a pedestrian is out of range of GPS coverage. To extend the apparent coverage of the GPS system for a hiker in mountain areas, we propose an integrated 3D location system that interpolates a 3D dead reckoning system based on information about contour lines. The speeds of hikers vary according to the inclination of the ground in sloped areas such as mountains. To reduce location measurement errors, we determine the angle of inclination based on the contour lines of the mountain, and use the speeds based on the inclination in the location system. The simulation results show that the proposed system is more accurate than the existing location system.

  • PDF

An Interpolation Method for Internal Points of a Single Closed Countour Line (닫혀진 단일 등고선 내부점의 보간법)

  • 고광현;구자영
    • Korean Journal of Remote Sensing
    • /
    • v.14 no.2
    • /
    • pp.129-136
    • /
    • 1998
  • This paper deals with a problem encountered in the course of constructing digital elevation model from a contour map. Deficiencies of widely used linear interpolation method is described, and an interpolation method for internal points of a single closed contour is proposed. Control points not on a plane are searched and interpolated. The method is applied to an artificial contour lines and real contour lines. The result shows natural and accurate reconstruction.

3D Simulation of Thin Film using Contour Analysis of Interference Fringe Image and Interpolation Method (간섭무늬 영상 등고선 해석과 보간법을 이용한 박막의 삼차원 정보 형상화)

  • Kim, Jin-Hyoung;Ko, Yun-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.2
    • /
    • pp.8-17
    • /
    • 2012
  • In this paper we proposes a new framework to obtain 3D shape information of thin film rapidly. The conventional equipments based on reflectometry are not suitable for obtaining 3D overall shape information of thin film rapidly since they require more than 30 minutes to measure the absolute thickness for 170 points. The proposed framework is based on an image analysis method that extracts contour lines from interference fringes images using Canny edge detector. The absolute thickness for contour lines are measured and then a height map from the contour lines is obtained by interpolation using Borgefors distance transformation. The extracted height map is visualized using the DirectX 3D terrain rendering method. The proposed framework can provide 3D overall shape information of thin film in about 5 minutes since relatively small number of real measurement for contour lines is required.

Semi-automatic Field Morphing : Polygon-based Vertex Selection and Adaptive Control Line Mapping

  • Kwak, No-Yoon
    • International Journal of Contents
    • /
    • v.3 no.4
    • /
    • pp.15-21
    • /
    • 2007
  • Image morphing deals with the metamorphosis of one image into another. The field morphing depends on the manual work for most of the process, where a user has to designate the control lines. It takes time and requires skills to have fine quality results. It is an object of this paper to propose a method capable of realizing the semi-automation of field morphing using adaptive vertex correspondence based on image segmentation. The adaptive vertex correspondence process efficiently generates a pair of control lines by adaptively selecting reference partial contours based on the number of vertices that are included in the partial contour of the source morphing object and in the partial contour of the destination morphing object, in the pair of the partial contour designated by external control points through user input. The proposed method generates visually fluid morphs and warps with an easy-to-use interface. According to the proposed method, a user can shorten the time to set control lines and even an unskilled user can obtain natural morphing results as he or she designates a small number of external control points.

Method of Shape Error Measurement for the Optimal Blank Design of Shapes with 3D Contour Lines (목표윤곽선이 3 차원 곡선인 형상의 최적블랭크 설계를 위한 형상오차 측정법)

  • Shim, H.B.
    • Transactions of Materials Processing
    • /
    • v.24 no.1
    • /
    • pp.28-36
    • /
    • 2015
  • After a short review of the iterative optimal blank method, a new method of measuring the shape error for stamped parts with 3D contour lines, which is an essential component of the optimal blank design, is proposed. When the contour line of the target shape does not exist in a plane, but exists in 3D space, especially when the shape of the target contour line is very complicated as in the real automotive parts, then the measurement of the shape error is critical. In the current study, a method of shape error measurement based on the minimum distance is suggested as an evolution of the radius vector method. With the proposed method, the optimal blank shapes of real automotive parts were found and compared to the results of the radius vector method. From the current investigation the new method is found to resolve the issues with the radius vector method.

Parallelization of Cell Contour Line Extraction Algorithm (세포 외곽선 추출 알고리즘의 병렬화)

  • Lee, Ho Seok;Yu, Suk Hyun;Kwon, Hee Yong
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.10
    • /
    • pp.1180-1188
    • /
    • 2015
  • In this paper, a parallel cell contour line extraction algorithm using CUDA, which has no inner contour lines, is proposed. The contour of a cell is very important in a cell image analysis. It could be obtained by a conventional serial contour tracing algorithm or parallel morphology operation. However, the cell image has various damages in acquisition or dyeing process. They could be turn into several inner contours, which make a cell image analysis difficult. The proposed algorithm introduces a min-max coordinates table into each CUDA thread block, and removes the inner contour in parallel. It is 4.1 to 7.6 times faster than a conventional serial contour tracing algorithm.

The implementation of the content-based image retrieval system using lines and bezier curves (직선과 bezier 곡선을 이용한 내용기반 화상 검색시스템의 구현)

  • 정원일;최기호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.8
    • /
    • pp.1861-1873
    • /
    • 1996
  • This paper describes the content-based image retrieval system that is implemented to retrieve images using constituent rate of lines and Bezier curves. We proposed the line and Bezier curve extraction algorithm which extracts lines and curve that are fitted on the contour information of images. For this extration, it was necessary to remove internal area of the proprocessed object within images and to approximate its contour to polygon, and proposed retrevial algorithm which gets the simularity using the consitituent rate of lines and curves and perform the simularity matching.

  • PDF

Sketch-based 3D modeling by aligning outlines of an image

  • Li, Chunxiao;Lee, Hyowon;Zhang, Dongliang;Jiang, Hao
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.3
    • /
    • pp.286-294
    • /
    • 2016
  • In this paper we present an efficient technique for sketch-based 3D modeling using automatically extracted image features. Creating a 3D model often requires a drawing of irregular shapes composed of curved lines as a starting point but it is difficult to hand-draw such lines without introducing awkward bumps and edges along the lines. We propose an automatic alignment of a user's hand-drawn sketch lines to the contour lines of an image, facilitating a considerable level of ease with which the user can carelessly continue sketching while the system intelligently snaps the sketch lines to a background image contour, no longer requiring the strenuous effort and stress of trying to make a perfect line during the modeling task. This interactive technique seamlessly combines the efficiency and perception of the human user with the accuracy of computational power, applied to the domain of 3D modeling where the utmost precision of on-screen drawing has been one of the hurdles of the task hitherto considered a job requiring a highly skilled and careful manipulation by the user. We provide several examples to demonstrate the accuracy and efficiency of the method with which complex shapes were achieved easily and quickly in the interactive outline drawing task.

A Study on the Improved Line Detection Method for Pipeline Recognition of P&ID (P&ID의 파이프라인 인식 향상을 위한 라인 검출 개선에 관한 연구)

  • Oh, Sangjin;Chae, Myeonghoon;Lee, Hyun;Lee, Younghwan;Jeong, Eunkyung;Lee, Hyunsik
    • Plant Journal
    • /
    • v.16 no.4
    • /
    • pp.33-39
    • /
    • 2020
  • For several decades, productivity in construction industry has been regressed and it is inevitable to improve productivity for major EPC players. One of challenges to achieve this goal is automatically extracting information from imaged drawings. Although computer vision technique has been advanced rapidly, it is still a problem to detect pipe lines in a drawing. Earlier works for line detection have problems that detected line elements be broken into small pieces and accuracy of detection is not enough for engineers. Thus, we adopted Contour and Hough Transform algorithm and reinforced these to improve detection results. First, Contour algorithm is used with Ramer Douglas Peucker algorithm(RDP). Weakness of contour algorithm is that some blank spaces are occasionally found in the middle of lines and RDP covers them around 17%. Second, HEC Hough Transform algorithm, we propose on this paper, is improved version of Hough Transform. It adopted iteration of Hough Transform and merged detected lines by conventional Hough Transform based on Euclidean Distance. As a result, performance of Our proposed method improved by 30% than previous.

Time-Efficient Trajectory Planning Algorithms for Multiple Mobile Robots in Nuclear/Chemical Reconnaissance System (화방 정찰 체계에서의 다수의 이동 로봇을 위한 시간 효율적인 경로 계획 알고리즘에 대한 연구)

  • Kim, Jae-Sung;Kim, Byung-Kook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.10
    • /
    • pp.1047-1055
    • /
    • 2009
  • Since nuclear and chemical materials could damage people and disturb battlefield missions in a wide region, nuclear/chemical reconnaissance systems utilizing multiple mobile robots are highly desirable for rapid and safe reconnaissance. In this paper, we design a nuclear/chemical reconnaissance system including mobile robots. Also we propose time-efficient trajectory planning algorithms using grid coverage and contour finding methods for reconnaissance operation. For grid coverage, we performed in analysis on time consumption for various trajectory patterns generated by straight lines and arcs. We proposed BCF (Bounded Contour Finding) and BCFEP (Bounded Contour Finding with Ellipse Prediction) algorithms for contour finding. With these grid coverage and contour finding algorithms, we suggest trajectory planning algorithms for single, two or four mobile robots. Various simulations reveal that the proposed algorithms improve time-efficiency in nuclear/chemical reconnaissance missions in the given area. Also we conduct basic experiments using a commercial mobile robot and verify the time efficiency of the proposed contour finding algorithms.