• Title/Summary/Keyword: spline curve line

Search Result 25, Processing Time 0.032 seconds

A Study on the detection of curve lane using Cubic Spline (Cubic Spline 곡선을 이용한 곡선 차선 인식에 관한 연구)

  • Kang, Sung-Hak;Cheong, Cha-Keon
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.169-171
    • /
    • 2004
  • This paper propose a new detection method of curve lane using Catmull-Rom spline for recognition various shape of the curve lane. To improve the accracy of lane detection, binarization and thinning process are firstly performed on the input image. Next, features on the curve lane such as curvature and orientation are extracted, and the control points of Catmull-Rom spline are detected to recognize the curve lane. Finally, Computer simulation results are given using a natural test image to show the efficiency of the proposed scheme.

  • PDF

3-Dimensional Free Form Design Using an ASMOD (ASMOD를 이용한 3차원 자유 형상 설계)

  • 김현철;김수영;이창호
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.5
    • /
    • pp.45-50
    • /
    • 1998
  • This paper presents the process generating the 3-dimensional free f o r m hull form by using an ASMOD(Adaptive Spline Modeling of Observation Data) and a hybrid curve approximation. For example, we apply an ASMOD to the generation of a SAC(Sectiona1 Area Curve) in an initial hull form design. That is, we define SACS of real ships as B-spline curves by a hybrid curve approximation (which is the combination method of a B-spline fitting method and a genetic algorithm) and accumulate a database of control points. Then we let ASMOD learn from the correlation of principal dimensions with control points and make the ASMOD model for SAC generation. Identically, we apply an ASMOD to the generation of other hull form characteristic curves - design waterline curve, bottom tangent line, center profile line. Conclus~onally we can generate a design hull form from these hull form characteristic curves.

  • PDF

Depth Measurement Method Robust against Scattering of Line Lasers (라인 레이저의 산란에 강인한 심도 측정 방법)

  • Ko, Kwangjin;Yeon, Sungho;Kim, Jaemin
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.2
    • /
    • pp.181-187
    • /
    • 2018
  • Line-laser beams are used for depth measurement of welding beads along the circumference of a pipe. For this, first we project a line-laser beam on an rotating pipe and take a sequence of images of the beam projected on the pipe using a CCD camera. Second, the projected line laser beam in each image is detected, converted into a thin curve. Finally measure the distance between the thinned curve and an imaginary line. When a line-laser beam is projected to a rough metal surface such as arc welding beads, the beam is severely scattered. This severe scattering makes the thinned curve perturbed. In this paper, we propose a thinning method robust against scattering of line lasers. First, we extract a projected line laser beam region using an adaptive threshold. Second, we model a thinned curve with a spline curve with control points. Next, we adjust the control points to fit the curve to the projected line-laser beam. Finally, we take a weighted mean of thin curves on a sequence of image frames. Experiments shows that the proposed thinning method results in a thinning curve, which is smooth and fit to the projected line-laser beam with small error.

A graph-based method for fitting planar B-spline curves with intersections

  • Bon, Pengbo;Luo, Gongning;Wang, Kuanquan
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.1
    • /
    • pp.14-23
    • /
    • 2016
  • The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.

A Study on Cutting Pattern Generation of Membrane Structures Using Spline Curves (스플라인 곡선을 이용한 막구조물의 재단도 작성에 관한 연구)

  • Shon, Su-Deok;Lee, Seung-Jae
    • Journal of Korean Association for Spatial Structures
    • /
    • v.12 no.1
    • /
    • pp.109-119
    • /
    • 2012
  • For membrane structure, there are three main steps in design and construction, which are form finding, statistical load analysis, and cutting patterning. Unlike the first two stages, the step of cutting pattern involves the translation of a double-curved surface in 3D space into a 2D plane with minimal error. For economic reasons, the seam lines of generated cutting patterns rely greatly on the geodesic line. Generally, as searching regions of the seam line are plane elements in the step of shape analysis, the seam line is not a smooth curve, but an irregularly divided straight line. So, it is how we make an irregularly divided straight line a smooth curve that defines the quality of the pattern. Accordingly, in this paper, we analyzed interpolation schemes using spline, and apply these methods to cutting pattern generation on the curved surface. To generate the pattern, three types of spline functions were used, i.e., cubic spline function, B-spline, and least-square spline approximation, and simple model and the catenary-shaped membrane was adopted to examine the result of generation. The result of comparing the approximation curves by the number of elements and the number of extracted nodes of simple model revealed that the seam line for less number of extracted nodes with large number of elements were more efficient, and the least-square spline approximation provided smoother seam line than other methods.

Hypothesis Tests For Performances of a New Spline Interpolation Technique (신 스플라인보간법의 퍼포먼스 가설점정)

  • Yu, Ki-Yun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.7 no.1 s.13
    • /
    • pp.29-40
    • /
    • 1999
  • In vector GIS, natural linear entities (called linear entitles) are usually represented by a set of line segments. As an alternative of the line segments, curve segments can be used to represent the linear entities. The curve segments, as one-dimensional spatial objects, we generated by spline interpolation technique such as Bezier technique. In an effort to improve its accuracy in resembling the linear entities, the Bezier technique was modified generating a new technique (called New technique) (Kiyun, 1998). In this paper, validity of the New technique was tested. Test focused on answering two questions: (1) whether or not the curve segments from the New technique replace line segments so as to enhance the accuracy of representations of linear entities, and (2) whether or not the curve segments from the New technique represent the linear entities more accurately than curve segments from the Bezier technique. Answering these two questions entailed two hypothesis tests. For test data, a series of hydrologic lines on 7.5-minute USGS map series were selected. Test were done using t-test method and statistical inferences were made from the results. Test results indicated that curve segments from both the Bezier and New techniques represent the linear entities more accurately than the line segments do. In addition, curve segments from the New technique represent the linear entities more accurately than the line segments from the Bezier technique do at probability level 69% or higher.

  • PDF

3D-Contour Machining for Die Manufacturing in a Motor Industry (자동차 산업의 금형제작을 위한 3차원 윤곽가공)

  • Ju, Sang-Yoon;Nam, Jang-Hyun
    • IE interfaces
    • /
    • v.9 no.2
    • /
    • pp.119-128
    • /
    • 1996
  • A procedure is presented for a 3D-contour machining without cutter interferences. The 3D-contouring machining along a spatial curve is often required for manufacturing trimming and flange dies in motor industries. Input data for the machining contour is a spline curve with polynomial vector equation provided by CATIA system. Points are sampled on the contour curve and line segments and helical curves are approximated from the point data. Cutter interference is checked on the approximated spline and all of interference curves are substituted with interference-free helical curves for a tool path generation. The non-machined curve areas are locally machined by tools with smaller diameters. A tool radius offset is considered for generating NC data to be free with tool size.

  • PDF

Machining of 2D Parametric Spline Using Cutter Radius Compensation (공구경 보정을 이용한 2차원 자유곡선의 가공)

  • Shin, Ha-Yong;Jeong, Hoi-Min;Kwak, Young-Su
    • IE interfaces
    • /
    • v.8 no.3
    • /
    • pp.133-139
    • /
    • 1995
  • Free from curves and surfaces are frequently used in designing engineering products such as car, ship, airplane, and hosing of electronic households. In many aspect, it is very nice to use the cutter radius compensation function of CNC controller when contour machining a 2-dimensional curve. However, if the 2D curve is a parametric spline, it is not easy to apply the cutter radius compensation function of CNC controller to the NC data obtained from many commercial CAM system. This is mainly due to the error magnification effect when offsetting line segments with inevitable round-off error at their vertices. Proposed in this paper is an approach to contour machining a 2D parametric spline while using cutter radius compensation. Some implementation results are included.

  • PDF

Lane Spline Generation Using Edge Detection Robust to Environmental Changes (외부 환경 변화에 강인한 에지 검출을 통한 차선의 스플라인 생성)

  • Kwon, Bo-Chul;Shin, Dongwon
    • Journal of Broadcast Engineering
    • /
    • v.17 no.6
    • /
    • pp.1069-1079
    • /
    • 2012
  • Lane detection with the use of a camera is an essential task required for the development of advanced driving assistance system. In this paper, edges of the lane are generated by applying Canny's method. The edge detection usually makes different results for several environmental conditions depending on the clearness of lane quality, so that it sometimes causes wrong lane detection. Therefore, we propose robust algorithm to environmental changes that automatically adjusts parameter for edge detection and generates edges more stably. Based on the acquired edges, we finally generate the spline curve of lane by using Catmull Rom spline.

Splines via Computer Programming

  • 김경태
    • Communications of the Korean Institute of Information Scientists and Engineers
    • /
    • v.1 no.1
    • /
    • pp.72-74
    • /
    • 1983
  • Traditionally, polynomials have been used to approximte functions with prescribed values at a number of points(called the knots) on a given interal on the real line. The method of splines recently developed is more flexible. It approximates a function in a piece-wise fashion, by means of a different polynomial in each subinterval. The cubic spline gas ets origins in beam theory. It possessed continuous first and second deriatives at the knots and is characterised by a minimum curvature property which es rdlated to the physical feature of minimum potential energy of the supported beam. Translated into mathematical terms, this means that between successive knots the approximation yields a third-order polynomial sith its first derivatives continuous at the knots. The minimum curvature property holds good for each subinterval as well as for the whole region of approximation This means that the integral of the square of the second derivative over the entire interval, and also over each subinterval, es to be minimized. Thus, the task of determining the spline lffers itself as a textbook problem in discrete computer programming, since the integral of ghe square of the second derivative can be obviously recognized as the criterion function whicg gas to be minimized. Starting with the initial value of the function and assuming an initial solpe of the curve, the minimum norm property of the curvature makes sequential decision of the slope at successive knots (points) feasible. It is the aim of this paper to derive the cubic spline by the methods of computer programming and show that the results which is computed the all the alues in each subinterval of the spline approximations.