Filters








16,035 Hits in 5.9 sec

Construction and optimal search of interpolated motion graphs

Alla Safonova, Jessica K. Hodgins
2007 ACM Transactions on Graphics  
The graph is constructed to support interpolation and pruned for efficient search.  ...  Our approach retains the natural transitions of motion graphs and the ability to synthesize physically realistic variations provided by interpolation.  ...  Acknowledgments The authors would like to thank Moshe Mahler for his help in modeling and rendering and Justin Macey for his assistance in collecting and cleaning the motion capture data.  ... 
doi:10.1145/1239451.1239557 fatcat:k25xz4mca5htdivycwh2blora4

Construction and optimal search of interpolated motion graphs

Alla Safonova, Jessica K. Hodgins
2007 ACM Transactions on Graphics  
The graph is constructed to support interpolation and pruned for efficient search.  ...  Our approach retains the natural transitions of motion graphs and the ability to synthesize physically realistic variations provided by interpolation.  ...  Acknowledgments The authors would like to thank Moshe Mahler for his help in modeling and rendering and Justin Macey for his assistance in collecting and cleaning the motion capture data.  ... 
doi:10.1145/1276377.1276510 fatcat:megyz6xgivedbgndl5atdw7ida

Construction and optimal search of interpolated motion graphs

Alla Safonova, Jessica K. Hodgins
2007 ACM SIGGRAPH 2007 papers on - SIGGRAPH '07  
Figure 1: Optimal and sub-optimal solutions for walking a given distance (left) and for picking up an object (right).  ...  Acknowledgments The authors would like to thank Moshe Mahler for his help in modeling and rendering and Justin Macey for his assistance in collecting and cleaning the motion capture data.  ...  The authors would like to thank Autodesk for their donation of Maya software. This material is based upon work supported by the National Science Foundation under Grant No. IIS-0326322.  ... 
doi:10.1145/1275808.1276510 fatcat:uxpwvxbeovaevk72xuvycsa3yi

Synthesizing Human Motion from Intuitive Constraints [chapter]

Alla Safonova, Jessica K. Hodgins
2009 Studies in Computational Intelligence  
We achieve this goal for large motion graphs by performing a lossless compression of the motion graph and implementing a heuristic function that significantly accelerates the search for the domain of human  ...  We show how to use the well-known A* search to find solutions that are optimal or of bounded sub-optimality.  ...  In this work we show how to search standard motion graphs and interpolated motion graphs for near-optimal solutions. We give an overview of the graph construction process for these graphs next.  ... 
doi:10.1007/978-3-540-85128-8_2 fatcat:dw6dsfyjindwpdegpijp4f5cvu

An improved approach to the efficient construction of and search operations in motion graphs

Yan Gao, ZhiHua Chen, MinGang Chen, Yang Shen
2012 Science China Information Sciences  
The experimental results indicate that our approach could lower the computation time in construction and searching, while simultaneously providing a richer variety of motion styles.  ...  Motion graphs have been widely used as an effective technique in the synthesis of human motions. To synthesize well-formed motions, motion graphs require smooth transitions and good connectivity.  ...  Motion graph construction In this section, we first introduce a structure table and then illustrate how it facilitates the procedure of constructing a motion graph with multiple styles and optimizations  ... 
doi:10.1007/s11432-012-4559-x fatcat:lubnwlijxrcqlbuh7zawx5ircq

A Hybrid Method for Constructing Optimal Motion Path for Robot Manipulators While Avoiding Obstacles

Sergei Evgenievich Ivanov, Andrei Algirdo Mikalauskas, Lubov Nikolaevna Ivanova
2020 Zenodo  
The method combines a finite element mesh approach, a graph model construction method, A * method for finding the minimum path for a graph, a B-spline interpolation method, polynomial approximation, and  ...  The practical construction of the optimal trajectory of the grip of the manipulator is taking into account the avoidance of obstacles.  ...  The method uses the finite element mesh approach, the method of constructing a graph model, method A * of finding the minimum path for the graph, and the B-spline interpolation method.  ... 
doi:10.5281/zenodo.4007411 fatcat:4johgi6ylrbevmvs6fjhrvayae

Video Based Animation Synthesis with the Essential Graph

Adnane Boukhayma, Edmond Boyer
2015 2015 International Conference on 3D Vision  
Graph search in the essential graph allows then to generate realistic motions that are optimal with respect to various user-defined constraints.  ...  New motions that satisfy high-level user-specified constraints are built by recombining and interpolating the frames in the observed mesh sequences.  ...  [20] constructs an optimization-based graph combining constrained optimization and motion graphs.  ... 
doi:10.1109/3dv.2015.60 dblp:conf/3dim/BoukhaymaB15 fatcat:aezkb7zcy5c4vjjzgfhmcbgoee

State of the Art in Example-Based Motion Synthesis for Virtual Characters in Interactive Applications

T. Pejsa, I.S. Pandzic
2010 Computer graphics forum (Print)  
We present methods for automated creation of supporting data structures for motion synthesis and describe how they can be employed at run-time to generate motion that accurately accomplishes tasks specified  ...  Though procedural and physics-based animation provide a great amount of control over motion, they still look too unnatural to be of use in all but a few specific scenarios, which is why interactive applications  ...  Motion graph construction and use are discussed in Section 3.  ... 
doi:10.1111/j.1467-8659.2009.01591.x fatcat:y2jrtjzv5jhhtlfqld7b2caapu

Surface Motion Capture Animation Synthesis

Adnane Boukhayma, Edmond Boyer
2018 IEEE Transactions on Visualization and Computer Graphics  
First, we propose an animation synthesis structure for the shape geometry, the Essential graph, that outperforms standard Motion graphs in optimality with respect to quantitative criteria, and we extend  ...  optimized interpolated transition algorithms to mesh data.  ...  To this end, we construct an Essential graph and a Motion graph, and compute the costs of optimal paths joining every pair of frames in the dataset.  ... 
doi:10.1109/tvcg.2018.2831233 pmid:29993745 fatcat:hy24iwv74ndfjoqzd2sbicq3ny

Achieving good connectivity in motion graphs

Liming Zhao, Alla Safonova
2009 Graphical Models  
Using this set, the method then constructs a motion graph and reduces its size by minimizing the number of interpolated poses present in the graph.  ...  The method then constructs a well-connected motion graph (wcMG), by using as little of the interpolated motion clip frames as necessary to provide good connectivity and only smooth transitions.  ...  The method first builds a set of interpolated motion clips, then constructs a motion graph, and reduces its size by minimizing the number of interpolated poses present in the graph.  ... 
doi:10.1016/j.gmod.2009.04.001 fatcat:umy6mllkkfbcnjwsz2znat5yiu

Achieving Good Connectivity in Motion Graphs [article]

Liming Zhao, Alla Safonova
2008 Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation - SCA '04  
Using this set, the method then constructs a motion graph and reduces its size by minimizing the number of interpolated poses present in the graph.  ...  The outcome of the algorithm is a motion graph called a well-connected motion graph with very good connectivity and only smooth transitions.  ...  The method first builds a set of interpolated motion clips, then constructs a motion graph, and reduces its size by minimizing the number of interpolated poses present in the graph.  ... 
doi:10.2312/sca/sca08/127-136 fatcat:zg55dr2mbbajfepnvdlrakgx6a

Efficient navigation for anyshape holonomic mobile robots in dynamic environments

Marija Dakulovic, Christoph Sprunk, Luciano Spinello, Ivan Petrovic, Wolfram Burgard
2013 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems  
Our technique introduces an efficient navigation method based on a strategy that makes use of discrete and continuous techniques.  ...  Based on these, we provide a continuous motion generation approach to generate smooth motions that are fast to compute.  ...  When applied to G OI , the D* graph search computes the optimal paths and path costs for every node p to the goal node g.  ... 
doi:10.1109/iros.2013.6696729 dblp:conf/iros/DakulovicSSPB13 fatcat:jbyqdb4bvvdurlo745un3vvmxi

Bidirectional Search for Interactive Motion Synthesis

Wan-Yen Lo, Matthias Zwicker
2010 Computer graphics forum (Print)  
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs.  ...  An optimal or near-optimal path through a motion graph often leads to the most intuitive result. However, finding such a path can be computationally expensive.  ...  Acknowledgments We are grateful to Liming Zhao and Alla Safonova for generously providing their motion capture data. We also thank Kuei-Chun Hsu for help with motion capture and character rigging.  ... 
doi:10.1111/j.1467-8659.2009.01626.x fatcat:hvklg3see5cjje2fy2le7k5zai

Path planning directed motion control of virtual humans in complex environments

Song Song, Weibin Liu, Ruxiang Wei, Weiwei Xing, Cheng Ren
2014 Journal of Visual Languages and Computing  
Experimental results have proven that our framework is capable of synthesizing motions of virtual humans naturally adapted to the complex dynamic environments which guarantee both the optimal path and  ...  In our framework, SIPP (Safe Interval Path Planning) search is implemented to plan a globally optimal path in complex dynamic environments.  ...  [15, 16] searched motion graph to extract a minimum size sub-graph and build interpolated segments of motion with same contact pattern to keep best transition.  ... 
doi:10.1016/j.jvlc.2014.10.011 fatcat:3p7hoqlzmfhqpe3zw4fucuxdxu

Hybrid Motion Graphs for Character Animation

Kalouache Saida, Cherif Foudil
2016 International Journal of Advanced Computer Science and Applications  
This fact motivates this approach which is the proposition of an hybrid motion graphs taking advantages of motion graphs to synthesis a natural locomotion and overcoming their limitations in synthesis  ...  Addressing exact position of end-effectors is the main disadvantage of motion graphs which cause less importance expended to the search for motions with no collision in complex environments or manipulating  ...  for a minimum size subgraph and using an Iterative Sub-graph Algorithm, to find a good approximation to the optimal solution [18] , optimizing the search operations in motion graphs [28, 29] .  ... 
doi:10.14569/ijacsa.2016.070107 fatcat:5npgeh26ubhndhcuv6y3aysxre
« Previous Showing results 1 — 15 out of 16,035 results