刘利刚
博士 教授 博士生导师
中国科学技术大学 数学科学学院
1、计算机图形学；2、图像处理；3、3D打印
个性化签名
 姓名：刘利刚
 目前身份：在职研究人员
 担任导师情况：博士生导师
 学位：博士

学术头衔：
博士生导师
 职称：高级教授

学科领域：
计算机图象形学
 研究兴趣：1、计算机图形学；2、图像处理；3、3D打印
刘利刚，中国科学技术大学教授，曾获首届国家自然科学基金“优秀青年”项目资助。
于2001年在浙江大学获得应用数学博士学位，曾于微软亚洲研究院、浙江大学、美国哈佛大学工作或访问。
从事计算机图形学研究，已在该领域顶级(TOP)期刊ACM Transactions on Graphics上发表论文近三十篇。曾获得“微软青年教授”奖(2006)、陆增镛CAD&CG高科技奖一等奖(2010)、国家自然科学奖二等奖(2013)等奖项。曾任国际会议GMP 2017大会共同主席，SPM 2014, SGP 2015, CVM 2016, CAD/Graphics 2017, GMP 2018, SIAM GD 2019的论文共同主席。
现任国际学术期刊IEEE TVCG, IEEE CG&A, CGF, CAGD, C&G及The Visual Computer编委，中国计算机学会计算机辅助设计与图形学专委会副主任，中国工业与应用数学学会几何设计与计算专委会副主任及中国图像图形学学会智能图形专委会副主任。
研究方向：
1、计算机图形学；2、图像处理；3、3D打印

主页访问
47

关注数
1

成果阅读
160

成果数
12
【期刊论文】Noniterative approach for global mesh optimization
ComputerAided Design，2007，39（9）：772782
2007年09月01日
This paper presents a global optimization operator for arbitrary meshes. The global optimization operator is composed of two main terms, one part is the global Laplacian operator of the mesh which keeps the fairness and another is the constraint condition which reserves the fidelity to the mesh. The global optimization operator is formulated as a quadratic optimization problem, which is easily solved by solving a sparse linear system. Our global mesh optimization approach can be effectively used in at least three applications: smoothing the noisy mesh, improving the simplified mesh, and geometric modeling with subdivisionconnectivity. Many experimental results are presented to show the applicability and flexibility of the approach.
无
0

11浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】A Local/Global Approach to Mesh Parameterization
Computer Graphics Forum，2008，27（5）：14951504
2008年12月29日
We present a novel approach to parameterize a mesh with disk topology to the plane in a shape‐preserving manner. Our key contribution is a local/global algorithm, which combines a local mapping of each 3D triangle to the plane, using transformations taken from a restricted set, with a global “stitch” operation of all triangles, involving a sparse linear system. The local transformations can be taken from a variety of families, e.g. similarities or rotations, generating different types of parameterizations. In the first case, the parameterization tries to force each 2D triangle to be an as‐similar‐as‐possible version of its 3D counterpart. This is shown to yield results identical to those of the LSCM algorithm. In the second case, the parameterization tries to force each 2D triangle to be an as‐rigid‐as‐possible version of its 3D counterpart. This approach preserves shape as much as possible. It is simple, effective, and fast, due to pre‐factoring of the linear system involved in the global phase. Experimental results show that our approach provides almost isometric parameterizations and obtains more shape‐preserving results than other state‐of‐the‐art approaches. We present also a more general “hybrid” parameterization model which provides a continuous spectrum of possibilities, controlled by a single parameter. The two cases described above lie at the two ends of the spectrum. We generalize our local/global algorithm to compute these parameterizations. The local phase may also be accelerated by parallelizing the independent computations per triangle.
无
0

11浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】Featurealigned shape texturing
ACM Transactions on Graphics，2009，28（5）：
2009年12月01日
The essence of a 3D shape can often be well captured by its salient feature curves. In this paper, we explore the use of salient curves in synthesizing intuitive, shaperevealing textures on surfaces. Our texture synthesis is guided by two principles: matching the direction of the texture patterns to those of the salient curves, and aligning the prominent feature lines in the texture to the salient curves exactly. We have observed that textures synthesized by these principles not only fit naturally to the surface geometry, but also visually reveal, even reinforce, the shape's essential characteristics. We call these featurealigned shape texturing. Our technique is fully automatic, and introduces two novel technical components in vectorfieldguided texture synthesis: an algorithm that orients the salient curves on a surface for constrained vector field generation, and a featuretofeature texture optimization.
无
0

11浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】Fast approach for computing roots of polynomials using cubic clipping
Computer Aided Geometric Design，2009，26（5）：547559
2009年06月01日
This paper presents a new approach, called cubic clipping, for computing all the roots of a given polynomial within an interval. In every iterative computation step, two cubic polynomials are generated to enclose the graph of the polynomial within the interval of interest. A sequence of intervals is then obtained by intersecting the sequence of strips with the abscissa axis. The sequence of these intervals converges to the corresponding root with the convergence rate 4 for the single roots, 2 for the double roots and superlinear for the triple roots. Numerical examples show that cubic clipping has many expected advantages over Bézier clipping and quadratic clipping. We also extend our approach by enclosing the graph of the polynomial using two lower degree polynomials by degree reduction. The sequence of intervals converges to the corresponding root of multiplicity s with convergence rate .
Root finding， Polynomial， Quadratic clipping， Cubic clipping
0

9浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】A spectral characterization of the Delaunay triangulation
Computer Aided Geometric Design，2010，27（4）：
2010年05月01日
The Delaunay triangulation of a planar point set is a fundamental construct in computational geometry. A simple algorithm to generate it is based on flips of diagonal edges in convex quads. We characterize the effect of a single edge flip in a triangulation on the geometric Laplacian of the triangulation, which leads to a simpler and shorter proof of a theorem of Rippa that the Dirichlet energy of any piecewiselinear scalar function on a triangulation obtains its minimum on the Delaunay triangulation. Using Rippa's theorem, we provide a spectral characterization of the Delaunay triangulation, namely that the spectrum of the geometric Laplacian is minimized on this triangulation. This spectral theorem then leads to a simpler proof of a theorem of Musin that the harmonic index also obtains its minimum on the Delaunay triangulation.
无
0

17浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】An asrigidaspossible approach to sensor network localization
ACM Transactions on Sensor Networks，2010，6（4）：35
2010年07月01日
We present a novel approach to localization of sensors in a network given a subset of noisy intersensor distances. The algorithm is based on “stitching” together local structures by solving an optimization problem requiring the structures to fit together in an “AsRigidAsPossible” manner, hence the name ARAP. The local structures consist of reference “patches” and reference triangles, both obtained from intersensor distances. We elaborate on the relationship between the ARAP algorithm and other stateoftheart algorithms, and provide experimental results demonstrating that ARAP is significantly less sensitive to sparse connectivity and measurement noise. We also show how ARAP may be distributed.
无
0

10浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】Optimizing Photo Composition
Computer Graphics Forum，2010，29（2）：469478
2010年06月07日
Aesthetic images evoke an emotional response that transcends mere visual appreciation. In this work we develop a novel computational means for evaluating the composition aesthetics of a given image based on measuring several well‐grounded composition guidelines. A compound operator of crop‐and‐retarget is employed to change the relative position of salient regions in the image and thus to modify the composition aesthetics of the image. We propose an optimization method for automatically producing a maximally‐aesthetic version of the input image. We validate the performance of the method and show its effectiveness in a variety of experiments.
无
0

8浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】Parametric reshaping of human bodies in images
ACM Transactions on Graphics，2010，29（4）：
2010年07月01日
We present an easytouse image retouching technique for realistic reshaping of human bodies in a single image. A modelbased approach is taken by integrating a 3D wholebody morphable model into the reshaping process to achieve globally consistent editing effects. A novel bodyaware image warping approach is introduced to reliably transfer the reshaping effects from the model to the image, even under moderate fitting errors. Thanks to the parametric nature of the model, our technique parameterizes the degree of reshaping by a small set of semantic attributes, such as weight and height. It allows easy creation of desired reshaping effects by changing the fullbody attributes, while producing visually pleasing results even for looselydressed humans in casual photographs with a variety of poses and shapes.
无
0

17浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】Multiscale partial intrinsic symmetry detection
ACM Transactions on Graphics，2012，31（6）：
2012年11月01日
We present an algorithm for multiscale partial intrinsic symmetry detection over 2D and 3D shapes, where the scale of a symmetric region is defined by intrinsic distances between symmetric points over the region. To identify prominent symmetric regions which overlap and vary in form and scale, we decouple scale extraction and symmetry extraction by performing two levels of clustering. First, significant symmetry scales are identified by clustering sample point pairs from an input shape. Since different point pairs can share a common point, shape regions covered by points in different scale clusters can overlap. We introduce the symmetry scale matrix (SSM), where each entry estimates the likelihood two point pairs belong to symmetries at the same scale. The pairtopair symmetry affinity is computed based on a pair signature which encodes scales. We perform spectral clustering using the SSM to obtain the scale clusters. Then for all points belonging to the same scale cluster, we perform the secondlevel spectral clustering, based on a novel pointtopoint symmetry affinity measure, to extract partial symmetries at that scale. We demonstrate our algorithm on complex shapes possessing rich symmetries at multiple scales.
无
0

20浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】Semantic decomposition and reconstruction of residential scenes from LiDAR data
ACM Transactions on Graphics，2013，42（4）：
2013年07月01日
We present a complete system to semantically decompose and reconstruct 3D models from point clouds. Different than previous urban modeling approaches, our system is designed for residential scenes, which consist of mainly lowrise buildings that do not exhibit the regularity and repetitiveness as highrise buildings in downtown areas. Our system first automatically labels the input into distinctive categories using supervised learning techniques. Based on the semantic labels, objects in different categories are reconstructed with domainspecific knowledge. In particular, we present a novel building modeling scheme that aims to decompose and fit the building point cloud into basic blocks that are blockwise symmetric and convex. This building representation and its reconstruction algorithm are flexible, efficient, and robust to missing data. We demonstrate the effectiveness of our system on various datasets and compare our building modeling scheme with other stateoftheart reconstruction algorithms to show its advantage in terms of both quality and speed.
无
0

19浏览

0点赞

0收藏

0分享

0下载

0评论

引用