A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Automatic construction of a minimum size motion graph

2009
*
Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation - SCA '09
*

We cast the

doi:10.1145/1599470.1599474
dblp:conf/sca/ZhaoNKS09
fatcat:pbtwahowbffknaan7skx2yj6cy
*motion*selection problem as*a*search for*a**minimum**size*subgraph from*a*large*motion**graph*representing the*motion*capture database and propose an efficient algorithm, called the Iterative ... The performance*of**motion**graph*based approaches, however, relies heavily on selecting*a*good set*of**motions*used to build the*graph*. ... The goal*of*our algorithm is to*automatically*select*a*subset*of**motions*from*a*large*motion*capture database which results in*a**minimum**size**motion**graph*that satisfies user requirements. ...##
###
Achieving good connectivity in motion graphs

2009
*
Graphical Models
*

Using this set, the method then

doi:10.1016/j.gmod.2009.04.001
fatcat:umy6mllkkfbcnjwsz2znat5yiu
*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. ... In conclusion,*graph*wcMG offers*a*fully*automatic*way to*construct**a**motion**graph*from*a*set*of*representative*motion*capture data with good connectivity and responsiveness. ...##
###
Achieving Good Connectivity in Motion Graphs
[article]

2008
*
Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation - SCA '04
*

Using this set, the method then

doi:10.2312/sca/sca08/127-136
fatcat:zg55dr2mbbajfepnvdlrakgx6a
*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. ... In conclusion,*graph*wcMG offers*a*fully*automatic*way to*construct**a**motion**graph*from*a*set*of*representative*motion*capture data with good connectivity and responsiveness. ...##
###
Synchronized partial-body motion graphs

2010
*
ACM SIGGRAPH ASIA 2010 Sketches on - SA '10
*

In this paper, we present an

doi:10.1145/1899950.1899978
dblp:conf/siggrapha/NgCLC10
fatcat:6zuymbvp3beyxpclcix72ui4j4
*automatic*method to*construct**a*new data structure that specifies transitions and correlations between partial-body*motions*, called Synchronized Partial-body*Motion**Graphs*...*Motion**graphs*are regarded as*a*promising technique for interactive applications. ... Thus, one*of*the potential future works is to remove the redundant*motion*data to*construct**a**minimum**size**motion**graph*[Zhao et al. 2009 ]. Figure 2 : 2 Overview*of*generating SPbMG. ...##
###
Construction and optimal search of interpolated motion graphs

2007
*
ACM SIGGRAPH 2007 papers on - SIGGRAPH '07
*

Figure 1: Optimal and sub-optimal solutions for walking

doi:10.1145/1275808.1276510
fatcat:uxpwvxbeovaevk72xuvycsa3yi
*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. ...##
###
Interactive 3D Animation Creation and Viewing System based on Motion Graph and Pose Estimation Method

2014
*
Proceedings of the ACM International Conference on Multimedia - MM '14
*

The data

doi:10.1145/2647868.2655055
dblp:conf/mm/FurukawaAKK14
fatcat:vniolzcbtraxbfgkqgkblfmk6q
*of*skeleton models*of*human*motion*estimated by Kinect is processed to generate*Motion**Graph*and finally restructure the data*automatically*for 3D character models. ... To evaluate the effectiveness*of*the method, we implemented*a*prototype system and created several 3D animations. ... Zhao et al. proposed*a*method which minimizes the*size**of**Motion**Graph*[8] . This method is useful to create*a*digest animation from*a*long-term*motion*data. ...##
###
Construction and optimal search of interpolated motion graphs

2007
*
ACM Transactions on Graphics
*

We approach this problem by representing the desired

doi:10.1145/1276377.1276510
fatcat:megyz6xgivedbgndl5atdw7ida
*motion*as an interpolation*of*two time-scaled paths through*a**motion**graph*. ... The*graph*is*constructed*to support interpolation and pruned for efficient search. ... 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. ...##
###
Construction and optimal search of interpolated motion graphs

2007
*
ACM Transactions on Graphics
*

We approach this problem by representing the desired

doi:10.1145/1239451.1239557
fatcat:k25xz4mca5htdivycwh2blora4
*motion*as an interpolation*of*two time-scaled paths through*a**motion**graph*. ... The*graph*is*constructed*to support interpolation and pruned for efficient search. ... 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. ...##
###
Synthesizing Human Motion from Intuitive Constraints
[chapter]

2009
*
Studies in Computational Intelligence
*

*Motion*

*graphs*are simple to implement, and the synthesis can be fully

*automatic*. When unrolled into the environment,

*motion*

*graphs*, however, grow drastically in

*size*. ... 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 ...

*a*

*motion*

*graph*

*of*sufficient

*size*to produce natural

*motion*. ...

##
###
Efficient Unsupervised Behavioral Segmentation of Human Motion Capture Data

2016
*
Proceedings of the 22nd International Conference on Distributed Multimedia Systems
*

For the N-Frame

doi:10.18293/dms2016-016
dblp:conf/dms/LiuXY16
fatcat:hij4cctvrnaltecu6h5ytoazxq
*motion*capture data sequence, we*construct*an undirected, weighted*graph*G=G(V,E), where the node set V represent frames*of**motion*sequence and the weight*of*the edge set E describes similarity ... In this paper, we introduce an efficient unsupervised method based on*graph*partition for*automatically*segmenting*motion*capture data. ...*A*. Building*Graph*for*Motion*Capture Data For the N-frame*motion*capture data sequence, we*construct*G(V,E) as an undirected*graph*with vertex set V = {f1, f2, f3, . . . , fN }. ...##
###
Fast Path Finding System with GPGPU Computing for Replacement Tasks in Plant Maintenance

2014
*
Procedia CIRP
*

The system realizes interactive planning operations for

doi:10.1016/j.procir.2014.07.120
fatcat:myqpp2p7frd4bofc4o2h6miwwq
*a*large*size**of*plant 3D-CAD model data. ... That is, the algorithm finds optimal carry-out/carry-in paths for the replacement tasks*automatically*, by*a*collision configuration posture map*of*the replacement component at each point in*a*carry-out ... While the goal*of*normal shortest path problem is to find*a*single path with the*minimum*cost or distance, finding K-paths with*minimum*cost or distance is required in Kshortest path problem. ...##
###
Human motion database with a binary tree and node transition graphs

2009
*
Robotics: Science and Systems V
*

We also identify the valid transitions among the nodes and

doi:10.15607/rss.2009.v.004
dblp:conf/rss/YamaneYN09
fatcat:52mup6jhlffwfd5tinvwqkyny4
*construct*node transition*graphs*. ... Each node*of*the tree represents*a*statistical distribution*of**a*set*of*human figure states extracted from the*motion*clips. ... ACKNOWLEDGEMENTS Part*of*this work was conducted while the first author was at University*of*Tokyo. ...##
###
Human motion database with a binary tree and node transition graphs

2010
*
Autonomous Robots
*

We also identify the valid transitions among the nodes and

doi:10.1007/s10514-010-9206-z
fatcat:itbvolrxgrg33ebbzss357dt4u
*construct*node transition*graphs*. ... Each node*of*the tree represents*a*statistical distribution*of**a*set*of*human figure states extracted from the*motion*clips. ... ACKNOWLEDGEMENTS Part*of*this work was conducted while the first author was at University*of*Tokyo. ...##
###
Human motion synthesis from 3D video

2009
*
2009 IEEE Conference on Computer Vision and Pattern Recognition
*

Multiple 3D video sequences

doi:10.1109/cvprw.2009.5206626
fatcat:tmv2mhtdlba65pybq3eu5smxbi
*of*an actor performing different movements are*automatically**constructed*into*a*surface*motion**graph*which represents the possible transitions with similar shape and*motion*... Novel 3D video sequences are synthesized by finding the optimal path in the surface*motion**graph*between user specified key-frames for control*of*movement, location and timing. ...*Automatic**Graph**Construction**A*surface*motion**graph*is*a*two-level directed*graph*. In the higher-level, each node represents*a**motion*and each edge*a*transition with direction. ...##
###
Human motion synthesis from 3D video

2009
*
2009 IEEE Conference on Computer Vision and Pattern Recognition
*

Multiple 3D video sequences

doi:10.1109/cvpr.2009.5206626
dblp:conf/cvpr/HuangHS09
fatcat:olr4qbso5jfivnbnqfjdi6kbcu
*of*an actor performing different movements are*automatically**constructed*into*a*surface*motion**graph*which represents the possible transitions with similar shape and*motion*... Novel 3D video sequences are synthesized by finding the optimal path in the surface*motion**graph*between user specified key-frames for control*of*movement, location and timing. ...*Automatic**Graph**Construction**A*surface*motion**graph*is*a*two-level directed*graph*. In the higher-level, each node represents*a**motion*and each edge*a*transition with direction. ...
« Previous

*Showing results 1 — 15 out of 41,803 results*