• Title/Summary/Keyword: motion map

Search Result 324, Processing Time 0.025 seconds

3D Map-Building using Histogramic In-Motion Mapping in the Eyebot (HIMM을 이용한 3차원 지도작성)

  • 정현룡;김영배
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.1127-1130
    • /
    • 2003
  • This paper introduces histogramic in-motion mapping for real-time map building with the Eyebot in motion. A histogram grid used in HIMM is updated through three PSD sensors. HIMM makes it possible to make fast map-building and avoid obstacles in real-time. Fast map-building allows the robot to immediately use the mapped information in real-time obstacle-avoidance algorithms. HIMM has been tested on the Eyebot. The Eyebot sends PSD data to computer and computer builds a 3D-Map based on PSD data.

  • PDF

Motion Planning for Legged Robots Using Locomotion Primitives in the 3D Workspace (3차원 작업공간에서 보행 프리미티브를 이용한 다리형 로봇의 운동 계획)

  • Kim, Yong-Tae;Kim, Han-Jung
    • The Journal of Korea Robotics Society
    • /
    • v.2 no.3
    • /
    • pp.275-281
    • /
    • 2007
  • This paper presents a motion planning strategy for legged robots using locomotion primitives in the complex 3D environments. First, we define configuration, motion primitives and locomotion primitives for legged robots. A hierarchical motion planning method based on a combination of 2.5 dimensional maps of the 3D workspace is proposed. A global navigation map is obtained using 2.5 dimensional maps such as an obstacle height map, a passage map, and a gradient map of obstacles to distinguish obstacles. A high-level path planner finds a global path from a 2D navigation map. A mid-level planner creates sub-goals that help the legged robot efficiently cope with various obstacles using only a small set of locomotion primitives that are useful for stable navigation of the robot. A local obstacle map that describes the edge or border of the obstacles is used to find the sub-goals along the global path. A low-level planner searches for a feasible sequence of locomotion primitives between sub-goals. We use heuristic algorithm in local motion planner. The proposed planning method is verified by both locomotion and soccer experiments on a small biped robot in a cluttered environment. Experiment results show an improvement in motion stability.

  • PDF

Hierarchical Fuzzy Motion Planning for Humanoid Robots Using Locomotion Primitives and a Global Navigation Path

  • Kim, Yong-Tae
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.10 no.3
    • /
    • pp.203-209
    • /
    • 2010
  • This paper presents a hierarchical fuzzy motion planner for humanoid robots in 3D uneven environments. First, we define both motion primitives and locomotion primitives of humanoid robots. A high-level planner finds a global path from a global navigation map that is generated based on a combination of 2.5 dimensional maps of the workspace. We use a passage map, an obstacle map and a gradient map of obstacles to distinguish obstacles. A mid-level planner creates subgoals that help the robot efficiently cope with various obstacles using only a small set of locomotion primitives that are useful for stable navigation of the robot. We use a local obstacle map to find the subgoals along the global path. A low-level planner searches for an optimal sequence of locomotion primitives between subgoals by using fuzzy motion planning. We verify our approach on a virtual humanoid robot in a simulated environment. Simulation results show a reduction in planning time and the feasibility of the proposed method.

Facial region Extraction using Skin-color reference map and Motion Information (칼라 참조 맵과 움직임 정보를 이용한 얼굴영역 추출)

  • 이병석;이동규;이두수
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.139-142
    • /
    • 2001
  • This paper presents a highly fast and accurate facial region extraction method by using the skin-color-reference map and motion information. First, we construct the robust skin-color-reference map and eliminate the background in image by this map. Additionally, we use the motion information for accurate and fast detection of facial region in image sequences. Then we further apply region growing in the remaining areas with the aid of proposed criteria. The simulation results show the improvement in execution time and accurate detection.

  • PDF

Motion Map Generation for Maintaining the Temporal Coherence of Brush Strokes in the Painterly Animation (회화적 애니메이션에서 브러시 스트로크의 시간적 일관성을 유지하기 위한 모션 맵 생성)

  • Park Youngs-Up;Yoon Kyung-Hyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.8
    • /
    • pp.536-546
    • /
    • 2006
  • Painterly animation is a method that expresses painterly images with a hand-painted appearance from a video, and the most crucial element for it is the temporal coherence of brush strokes between frames. A motion map is proposed in this paper as a solution to the issue of maintaining the temporal coherence in the brush strokes between the frames. A motion map is the region that frame-to-frame motions have occurred. Namely, this map refers to the region frame-to-frame edges move by the motion information with the motion occurred edges as a starting point. In this paper, we employ the optical flow method and block-based method to estimate the motion information. The method that yielded the biggest PSNR using the motion information (the directions and magnitudes) acquired by various methods of motion estimation has been chosen as the final motion information to form a motion map. The created motion map determine the part of the frame that should be re-painted. In order to express painterly images with a hand- painted appearance and maintain the temporal coherence of brush strokes, the motion information was applied to only the strong edges that determine the directions of the brush strokes. Also, this paper seek to reduce the flickering phenomenon between the frames by using the multiple exposure method and the difference map created by the difference between images of the source and the canvas. Maintenance of the coherence in the direction of the brush strokes was also attempted by a local gradient interpolation to maintain the structural coherence.

An Efficient Video Indexing Method using Object Motion Map in compresed Domain (압축영역에서 객체 움직임 맵에 의한 효율적인 비디오 인덱싱 방법에 관한 연구)

  • Kim, So-Yeon;No, Yong-Man
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5
    • /
    • pp.1570-1578
    • /
    • 2000
  • Object motion is an important feature of content in video sequences. By now, various methods to exact feature about the object motion have been reported[1,2]. However they are not suitable to index video using the motion, since a lot of bits and complex indexing parameters are needed for the indexing [3,4] In this paper, we propose object motion map which could provide efficient indexing method for object motion. The proposed object motion map has both global and local motion information during an object is moving. Furthermore, it requires small bit of memory for the indexing. to evaluate performance of proposed indexing technique, experiments are performed with video database consisting of MPEG-1 video sequence in MPEG-7 test set.

  • PDF

Fractal Depth Map Sequence Coding Algorithm with Motion-vector-field-based Motion Estimation

  • Zhu, Shiping;Zhao, Dongyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.242-259
    • /
    • 2015
  • Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

Motion Field Estimation Using U-Disparity Map in Vehicle Environment

  • Seo, Seung-Woo;Lee, Gyu-Cheol;Yoo, Ji-Sang
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.428-435
    • /
    • 2017
  • In this paper, we propose a novel motion field estimation algorithm for which a U-disparity map and forward-and-backward error removal are applied in a vehicular environment. Generally, a motion exists in an image obtained by a camera attached to a vehicle by vehicle movement; however, the obtained motion vector is inaccurate because of the surrounding environmental factors such as the illumination changes and vehicles shaking. It is, therefore, difficult to extract an accurate motion vector, especially on the road surface, due to the similarity of the adjacent-pixel values; therefore, the proposed algorithm first removes the road surface region in the obtained image by using a U-disparity map, and uses then the optical flow that represents the motion vector of the object in the remaining part of the image. The algorithm also uses a forward-backward error-removal technique to improve the motion-vector accuracy and a vehicle's movement is predicted through the application of the RANSAC (RANdom SAmple Consensus) to the previously obtained motion vectors, resulting in the generation of a motion field. Through experiment results, we show that the performance of the proposed algorithm is superior to that of an existing algorithm.

Motion-Blurred Shadows Utilizing a Depth-Time Ranges Shadow Map

  • Hong, MinhPhuoc;Oh, Kyoungsu
    • Journal of Information Processing Systems
    • /
    • v.14 no.4
    • /
    • pp.877-891
    • /
    • 2018
  • In this paper, we propose a novel algorithm for rendering motion-blurred shadows utilizing a depth-time ranges shadow map. First, we render a scene from a light source to generate a shadow map. For each pixel in the shadow map, we store a list of depth-time ranges. Each range has two points defining a period where a particular geometry was visible to the light source and two distances from the light. Next, we render the scene from the camera to perform shadow tests. With the depths and times of each range, we can easily sample the shadow map at a particular receiver and time. Our algorithm runs entirely on GPUs and solves various problems encountered by previous approaches.

Motion Field Estimation Using U-disparity Map and Forward-Backward Error Removal in Vehicle Environment (U-시차 지도와 정/역방향 에러 제거를 통한 자동차 환경에서의 모션 필드 예측)

  • Seo, Seungwoo;Lee, Gyucheol;Lee, Sangyong;Yoo, Jisang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2343-2352
    • /
    • 2015
  • In this paper, we propose novel motion field estimation method using U-disparity map and forward-backward error removal in vehicles environment. Generally, in an image obtained from a camera attached in a vehicle, a motion vector occurs according to the movement of the vehicle. but this motion vector is less accurate by effect of surrounding environment. In particular, it is difficult to extract an accurate motion vector because of adjacent pixels which are similar each other on the road surface. Therefore, proposed method removes road surface by using U-disparity map and performs optical flow about remaining portion. forward-backward error removal method is used to improve the accuracy of the motion vector. Finally, we predict motion of the vehicle by applying RANSAC(RANdom SAmple Consensus) from acquired motion vector and then generate motion field. Through experimental results, we show that the proposed algorithm performs better than old schemes.