Motion Graphs
By Lucas Kovar, Michael Gleicher, Frédéric H. Pighin. ACM Transactions on Graphics, 2002
338 citations recorded by the source corpus.
Subfields: Computer Vision and Pattern Recognition, Control and Systems Engineering
View Paper: https://www.semanticscholar.org/paper/9e24e178c608536db3fdcbd41984de33532b7c04
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Vision and Pattern Recognition
- Pieter Abbeel
- Sergey Levine
- Luc Van Gool
- Trevor Darrell
- Kristen Grauman
- Jitendra Malik
- Dacheng Tao
- Abhinav Kumar Gupta
In Control and Systems Engineering
- Pieter Abbeel
- Sergey Levine
- Jessica K. Hodgins
- Vikash Kumar
- Igor Mordatch
- D.A. Forsyth
- Bobby Bodenheimer
- Jing Wang
Citations in the corpus
- Incremental learning of full body motion primitives and their sequencing through human motion observation (2012, methodology): “The size of the motion primitive graph highlights a key difference between the proposed method and previous approaches (Kovar et al. 2002; Yamane et al. 2009).”
- Combining model-based policy search with online model learning for control of physical humanoids (2016, methodology): “Unlike non-parametric methods like motion graphs [12] or Gaussian processes [4], we do not need to keep any trajectory data at policy execution time.”
- Construction and optimal search of interpolated motion graphs (2007, methodology): “This result is comparable to the databases used in motion graph papers: [Lee et al. 2002] used 5- 1 0minutes, [Arikan et al. 2003] used 7 minutes, [Kovar et al. 2002] used 3-4 minutes.”
- Synthesizing object receiving motions of humanoid robots with human motion database (2013, methodology): “Previous work on motion graphs involved an optimization process that maps intuitive user inputs, such as walk paths [2] and start and goal configurations [3], to the character motion that best matches the input.”
- Generalizing motion edits with Gaussian processes (2009, methodology): “Motion graphs encode valid rearrangements [Kovar et al. 2002; Arikan and Forsyth 2002; Lee et al. 2002].”
- Synthesis and evaluation of linear motion transitions (2008, methodology): “searchers [Rose et al. 1996; 1998; Mizuguchi et al. 2001; Kovar et al. 2002] specify transitions using a start and end frame and generate a transition of some length between these marker points.”