Craig Gotsman

Craig Gotsman

Auto-generated profile, based on publicly available information

Craig Gotsman

New Jersey Institute of Technology Newark New Jersey USA

Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2000
Verified
Conference Paper
Open access
PDF file
ZKZachi Karni
Zachi Karni
CGCraig Gotsman
Craig Gotsman

1 July 2008 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
LLLigang Liu
Ligang Liu
LZLei Zhang
Lei Zhang
YXYin Xu
Yin Xu
CGCraig Gotsman
Craig Gotsman
SGSteven J. Gortler
Steven J. Gortler

25 July 2011 in ACM Transactions on Graphics
Verified
Journal Article
Open access
TBThabo Beeler
Thabo Beeler
FHFabian Hahn
Fabian Hahn
DBDerek Bradley
Derek Bradley
BBBernd Bickel
Bernd Bickel
PBPaul Beardsley
Paul Beardsley
MGMarkus Gross
Markus Gross
We present a new technique for passive and markerless facial performance capture based on anchor frames . Our method starts with high resolution per-frame geometry acquisition using state-of-the-art stereo reconstruction, and proceeds to establish a single triangle mesh that is propagated through the entire performance. Leveraging the fact that facial performances often contain repetitive subsequences, we identify anchor frames as those which contain similar facial expressions to a manually chosen reference expression. Anchor frames are automatically computed over one or even multiple performances. We introduce a robust image-space tracking method that computes pixel matches directly from the reference frame to all anchor frames, and thereby to the remaining frames in the sequence via sequential matching. This allows us to propagate one reconstructed frame to an entire sequence in parallel, in contrast to previous sequential methods. Our anchored reconstruction approach also limits tracker drift and robustly handles occlusions and motion blur. The parallel tracking and mesh propagation offer low computation times. Our technique will even automatically match anchor frames across different sequences captured on different occasions, propagating a single mesh to all performances.

1 July 2005 in ACM Transactions on Graphics
Verified
Journal Article
Open access
RSRobert W. Sumner
Robert W. Sumner
MZMatthias Zwicker
Matthias Zwicker
CGCraig Gotsman
Craig Gotsman
JPJovan Popović
Jovan Popović
The ability to position a small subset of mesh vertices and produce a meaningful overall deformation of the entire mesh is a fundamental task in mesh editing and animation. However, the class of meaningful deformations varies from mesh to mesh and depends on mesh kinematics, which prescribes valid mesh configurations, and a selection mechanism for choosing among them. Drawing an analogy to the traditional use of skeleton-based inverse kinematics for posing skeletons. we define mesh-based inverse kinematics as the problem of finding meaningful mesh deformations that meet specified vertex constraints.Our solution relies on example meshes to indicate the class of meaningful deformations. Each example is represented with a feature vector of deformation gradients that capture the affine transformations which individual triangles undergo relative to a reference pose. To pose a mesh, our algorithm efficiently searches among all meshes with specified vertex positions to find the one that is closest to some pose in a nonlinear span of the example feature vectors. Since the search is not restricted to the span of example shapes, this produces compelling deformations even when the constraints require poses that are different from those observed in the examples. Furthermore, because the span is formed by a nonlinear blend of the example feature vectors, the blending component of our system may also be used independently to pose meshes by specifying blending weights or to compute multi-way morph sequences.

1 July 2003 in ACM Transactions on Graphics
Verified
Journal Article
Open access
PDF file
CGCraig Gotsman
Craig Gotsman
XGXianfeng Gu
Xianfeng Gu
ASAlla Sheffer
Alla Sheffer
Parameterization of 3D mesh data is important for many graphics applications, in particular for texture mapping, remeshing and morphing. Closed manifold genus-0 meshes are topologically equivalent to a sphere, hence this is the natural parameter domain for them. Parameterizing a triangle mesh onto the sphere means assigning a 3D position on the unit sphere to each of the mesh vertices, such that the spherical triangles induced by the mesh connectivity are not too distorted and do not overlap. Satisfying the non-overlapping requirement is the most difficult and critical component of this process. We describe a generalization of the method of barycentric coordinates for planar parameterization which solves the spherical parameterization problem, prove its correctness by establishing a connection to spectral graph theory and show how to compute these parameterizations.

1 February 2004 in Computers & Graphics
Verified
Journal Article
Closed access
ZKZachi Karni
Zachi Karni
CGCraig Gotsman
Craig Gotsman