• Title/Summary/Keyword: Cardinal Spline

Search Result 8, Processing Time 0.023 seconds

Smooth Path Planning Method for Autonomous Mobile Robots Using Cardinal Spline (카디널스플라인을 이용한 자율이동로봇의 곡선경로 생성방법)

  • Yoon, Hee-Sang;Park, Tae-Hyoung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.4
    • /
    • pp.803-808
    • /
    • 2010
  • We propose a smooth path planning method for autonomous mobile robots. Due to nonholonomic constraints by obstacle avoidance, the smooth path planning is a complicated one. We generate smooth path that is considered orientation of robot under nonholonomic constraints. The proposed smooth planning method consists of two steps. Firstly, the initial path composed of straight lines is obtained from V-graph by Dijkstra's algorithm. Then the initial path is transformed by changing the curve. We apply the cardinal spline into the stage of curve generation. Simulation results show a performance of proposed smooth path planning method.

A Curve Lane Detection Method using Lane Variation Vector and Cardinal Spline (차선 변화벡터와 카디널 스플라인을 이용한 곡선 차선 검출방법)

  • Heo, Hwan;Han, Gi-Tae
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.7
    • /
    • pp.277-284
    • /
    • 2014
  • The detection method of curves for the lanes which is powerful for the variation by utilizing the lane variation vector and cardinal spline on the inverse perspective transformation screen images which do not required the camera parameters are suggested in this paper. This method detects the lane area by setting the expected lane area in the s frame and next s+1 frame where the inverse perspective transformation and entire process of the lane filter are adapted, and expects the points of lane location in the next frames with the lane variation vector calculation from the detected lane areas. The scan area is set from the nextly expected lane position and new lane positions are detected within these areas, and the lane variation vectors are renewed with the detected lane position and the lanes are detected with application of cardinal spline for the control points inside the lane areas. The suggested method is a powerful method for curved lane detection, but it was adopted to the linear lanes too. It showed an excellent lane detection speed of about 20ms in processing a frame.

Image Zooming Algorithm using Edge-Preserving Quadratic Spline Interpolation Filter (윤곽보존형 Quadratic Spline Interpolation filter를 이용한 고해상도 영상 확대 알고리즘 구현)

  • 김효주;정창성
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.659-662
    • /
    • 2000
  • 다양한 보간 기법을 정리해 보고 이를 통해서 기존의 보간 기법의 한계를 고찰해 본다. 보간의 효율성과 보간 결과 영상의 화질과는 Trade off 관계가 있으며, 이를 적절한 수준에서 결정하는 것은 중요한 문제이다. 본 논문에서는 Quadratic B-spline을 기저 함수로 하는 윤곽보존형 보간 필터를 사용한 영상확대 알고리즘을 제안한다. Unser의 Cardinal Cubic spline함수에 비해 적은 하드웨어만으로도 이상적인 저역 통과 필터의 특성을 가지며, 입력영상의 윤곽의 방향성을 고려한 적응적인 보간 기법의 적용으로 화질이 우수한 영상확대 알고리즘을 제안한다.

  • PDF

Efficient High Quality Volume Visualization Using Cardinal Interpolation (카디널 보간을 이용한 효율적인 고화질 볼륨 가시화)

  • Kye, Hee-Won
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.3
    • /
    • pp.339-347
    • /
    • 2011
  • As the volume visualization has been applied to render medical datasets, there has been a requirement to produce high quality images. Even though nice images can be generated by using previous linear filter, high order filter is required for better images. However, it takes much time for high order resampling, so that, overall rendering time is increased. In this paper, we perform high quality volume visualization using the cardinal interpolation. By enabling the empty space leaping which reduces the number of resampling, we achieve the efficient visualization. In detail, we divide the volume data into small blocks and leap empty blocks by referring the upper and lower bound value for each block. We propose a new method to estimate upper and lower bound value of for each block. As the result, we noticeably accelerated high quality volume visualization.

Interactive G$^1$ Splines with Tangent Specification Method (접선 지정법을 이용한 대화형 G$^1$스플라인)

  • Ju, U-Seok;Park, Gyeong-Hui;Lee, Hui-Seung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.4
    • /
    • pp.531-540
    • /
    • 1994
  • Spline curve scheme is the most valuable tool for the CAD of industrial products. Hence, the development of a new, effective curve scheme can have immediate impact on the current design industries. This paper develops and implements a new methodology for the implementation of the visually continuous class of splines which can produce a more flexible and diverse curve shapes. This class of splines has advantaged over existing splines in that it can accommodate wider range of shapes while maintaining the interpolators property of the ordinary cardinal splines. Most importantly, we avoid using the previous method of implementing G$^1$ curves, where users must specify scalar values for the control of curve shapes. We derive and implement an easy-to -use transformation between the user-specified graphical tangent vectors and the actual parameters for the resulting curve. Since the resulting curve shape reflects original tangential direction faithfully, CAD users can simply represent approximate curve shapes with proper tangents. Consequently, a simple user interface device such as a mouse can effectively produce a various spline curves using the proposed spline tool.

  • PDF

Path Planning for Autonomous Mobile Robots by Modified Global DWA (수정된 전역 DWA에 의한 자율이동로봇의 경로계획)

  • Yoon, Hee-Sang;Park, Tae-Hyoung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.2
    • /
    • pp.389-397
    • /
    • 2011
  • The global dynamic window approach (DWA) is widely used to generate the shortest path of mobile robots considering obstacles and kinematic constraints. However, the dynamic constraints of robots should be considered to generate the minimum-time path. We propose a modified global DWA considering the dynamic constraints of robots. The reference path is generated using A* algorithm and smoothed by cardinal spline function. The trajectory is then generated to follows the reference path in the minimum time considering the robot dynamics. Finally, the local path is generated using the dynamic window which includes additional terms of speed and orientation. Simulation and experimental results are presented to verify the performance of the proposed method.

Design of an Automatic Titration System for Caustic Soda Treatment System Using the Equivalent Point Estimation Algorithm (당량점 예측 알고리듬에 의한 가성소다 처리 섬유감량 시스템용 자동적정 장치 설계)

  • Cho, Jin-Ho;Jin, Kyoung-Chan;You, Byoung-Heui;Koo, Sung-Mo;Kim, Myoung-Nam;Lee, Jong-Hyun;Lee, Heung-Lark
    • Journal of Sensor Science and Technology
    • /
    • v.3 no.3
    • /
    • pp.28-35
    • /
    • 1994
  • Caustic Soda Treatment Systems need a concentration measurement device in order to monitor the weight reduction amount of polyester fabrics. Since the reduction process requires several concentration measurements, we have to do the unit titration fast and exactly. Therefore, a proposition of estimation algorithm for finding the equivalent point in the titration process is needed. In this paper, we used the cardinal spline algorithm, to estimate the proper curve with the measured pH-values after each injection of titration sdution, to predict the equivalent point. While the processing time is elapsed, several equivalent points are estimated and drawed the line graph of fabrics weight reduction automatically. Finally, we designed the hardware and the software of an automatic titration system that can generate the reduction ending signal of Caustic Soda Treatment System.

  • PDF