鲍虎军
计算机图形学、图形、图象和计算机视觉融合理论和算法的研究
个性化签名
 姓名：鲍虎军
 目前身份：
 担任导师情况：
 学位：

学术头衔：
博士生导师
 职称：

学科领域：
计算机软件
 研究兴趣：计算机图形学、图形、图象和计算机视觉融合理论和算法的研究
鲍虎军研究员是“十五”863信息领域信息获取与处理主题管理专家和国家自然科学基金计算机学科评审组成员，是国家重大基础研究与发展规划项目（973项目）“虚拟现实的基础理论、算法及其实现”的首席科学家。现任浙江大学CAD&CG国家重点实验室主任。主要从事计算机图形学、图形、图象和计算机视觉融合理论和算法的研究，研究内容涉及到真实感图形绘制技术、几何处理理论和算法、虚拟现实技术以及和谐人机环境等多个方面。近年来，他领导的研究小组已完成或正在承担10余项国家级研究项目，在国际、国内的核心学术期刊上发表论文80余篇，其中40余篇论文分别被SCI检索系统所收录。有关光照明模型、曲面辐射度、几何处理和实时图形绘制算法的研究成果被国内外学者广为引用，并在多本国际图形学专著、国际顶尖图形学会议的教程和现状报告中加以评述。他共培养了6名优秀的博士生，其中一人入选全国百篇优秀博士论文。鲍虎军研究员曾获1999年度国家杰出青年基金、首届国家创新群体科学基金、1999年度浙江省“151”人才工程第一层次人选、教育部科技进步二等奖 、国家优秀科技图书二等奖、2001年度浙江省青少年英才奖三等奖、政府特殊津贴获得者、新世纪百千万人才工程国家级人选等多项成果奖励及荣誉称号。

主页访问
3676

关注数
0

成果阅读
104

成果数
10
鲍虎军， Hujun Bao and Qunsheng Peng
，0001，（）：
1年11月30日
A new 3D morphing algorithm for polyhedral objects with the same genus is presented in the paper. Our main contribution is an efficient and general algorithm for setting up the vertex correspondence between the polyhedra. The proposed algorithm first interactively partitions the two original polyhedra into the same number of polygonal patches, the patch correspondence is also established during partitioning. Each pair of corresponding patches is then parametrized and resampled by using the harmonic maps. A feature polyhedron is finally constructed for each original polyhedron, and the vertex correspondence between each original polyhedron and its feature polyhedron is automatically established following a cluster scheme. The shape transition between the original polyhedral models is accomplished by composing three successive transformations using their feature polyhedra as the bridges. Experimental results demonstrate that our algorithm is very robust, and can deal with very general cases (nonzero genus polyhedral cases).

6浏览

0点赞

0收藏

0分享

211下载

0评论

引用
鲍虎军， Yigang Wang， Hujun Bao and Qunsheng Peng
EUROGRAPHICS'98/N. Ferreira and M. G，0001，（）：
1年11月30日
This paper proposes a new preprocessing method for interactive rendering of complex polygonal virtual environments. The approach divides the space that observer can reach into many rectangular viewpoint regions. For each region, an outer rectangular volume(ORV) is established to surround it. By adaptively partitioning the boundary of the ORV together with the viewpoint region, all the rays that originate from the viewpoint region are divided into the beams whose potentially visible polygon number is less than a preset threshold. If a resultant beam is the smallest and intersects many potentially visible polygons, the beam is simplified as a fixed number of rays and the averaged color of the hit polygons is recorded. For other beams, their potentially visible sets (PVS) of polygons are stored respectively. During an interactive walkthrough, the visual information related to the current viewpoint is retrieved from the storage. The view volume clipping, visibility culling and detail simplification are efficiently supported by these stored data. The rendering time is independent of the scene complexity.

6浏览

0点赞

0收藏

0分享

138下载

0评论

引用
【期刊论文】Constrained Fairing for Meshes
鲍虎军， Xinguo Liu， Hujun Bao， PhengAnn Heng， TienTsin Wong and Qunsheng Peng
Volume 20(2001), number 2 pp. 115123，0001，（）：
1年11月30日
In this paper, we present a novel fairing algorithm for the removal of noise from uniform triangular meshes without shrinkage and serious distortion. The key feature of this algorithm is to keep all triangle centers invariant at each smoothing step by including some constraints in the energy minimization functional. The constrained functional is then minimized efficiently using an iterative method. Further, we apply this smoothing technique to a multiresolution representation to remove arbitrary levels of detail. A volumepreserving decimation algorithm is presented to generate the multiresolution representation. The experimental results demonstrate the combined algorithm's stability and efficiency.
curves &， surfaces,， geometric modeling,， level of detail,， algorithms,， mesh generation

11浏览

0点赞

0收藏

0分享

131下载

0评论

引用
【期刊论文】Nonlinear View Interpolation
鲍虎军， By Hujun Bao， Li Chen *， Jianguo Ying and Qunsheng Peng
J. Visual. Comput. Animat. 10, 233241(1999)，0001，（）：
1年11月30日
A new nonlinear view interpolation algorithm is presented in this paper. Unlike the linear interpolation scheme, our method can exactly simulate the perspective viewing transformation during walkthrough. To accelerate the view interpolation, the algorithm employs a binary subdivision scheme to optimize the decomposition of the source image so that the number of resultant blocks is greatly reduced. Holes in the intermediate image are filled by two steps, namely enlarging the transferred blocks at the sides adjacent to holes and retrieving the local image within holes from the destination images by multidirectional interpolation. Experimental results demonstrate that our algorithm is much more accurate and efficient than the traditional one. Copyright.
view interpolation， environment map， binary subdivision， virtual reality

8浏览

0点赞

0收藏

0分享

191下载

0评论

引用
【期刊论文】Interactive texture mapping for polygonal models I
鲍虎军， Hanqiu Sun a;*， Hujun Bao b
Computational Geometry 15(2000)4149，0001，（）：
1年11月30日
Polygonal models have been widely applied in the community of CAD and computer graphics. Since a polygonal surface usually has no intrinsic parameterization, it is very difficult to map textures onto it with low distortion. In this paper, we present an efficient texture mapping algorithm for polygonal models. For each region to be mapped, the algorithm first constructs a Bspline patch with similar shape to surround the model. The mapped region is then projected onto the constructed Bspline patch to achieve a parameterization. By interactively controlling the Bspline patch, the user can conveniently decorate the surface of the model to meet his requirements. Both local and global texture mapping are discussed. The experimental results demonstrate that the algorithm has a great of potential applications in computer animation and virtual reality systems.
Texture mapping， Bspline patch， Polygonal models， Computer graphics

9浏览

0点赞

0收藏

0分享

252下载

0评论

引用
【期刊论文】Cubic algebraic curves based on geometric constraints✩
鲍虎军， Zhang Sanyuan a， *， Bao Hujun b， Wei Baogang a
Computer Aided Geometric Design 18(2001)299307，0001，（）：
1年11月30日
Methods for curve modeling with cubic algebraic curves based on geometric constraints are introduced in this paper. A 1parameter family of cubic curves with four given points as well as two tangent lines at the endpoints is constructed in the first part of the paper. A 1parameter family and 2parameter family of cubic curve constructions are presented for interpolating two given endpoints and two given tangent lines as well as two given curvatures at the endpoints in the last part of the paper. 2001 Elsevier Science B.V. All rights reserved.
Cubic algebraic curve， Cubic parametric curve， Geometric constraint， Interpolation， Curvature continuity

11浏览

0点赞

0收藏

0分享

105下载

0评论

引用
【期刊论文】A Novel Volume Constrained Smoothing Method for Meshes
鲍虎军， Xinguo Liu， Hujun Bao， HeungYeung Shum and Qunsheng Peng
Graphical Models 64, 169182(2002)，0001，（）：
1年11月30日
In general, mesh smoothing is performed by minimizing the discrete energy function for the surface. One of the major problems in mesh smoothing is to prevent the mesh from shrinking. In this paper, we propose a novel volume constraint to address the shrinking problem in mesh smoothing. Our key observation is that the mesh can be efficiently smoothed patch by patch in a signal processing manner, and then a local volume preserving constraint can be easily imposed to the energy minimization problem associated with the small patch, called the smoothing stencil, so as to effectively avoid the mesh shrinkage. In our implementation, the smoothing stencil is the 1ring neighboring region of an edge or a triangle. And the constrained minimization problem is solved by a 2step approximation method for efficiency. A series of examples demonstrate that the proposed smoothing method can be applied to remove noise from a mesh or remove rough detail from an original mesh to generate a smooth model in object reconstruction and geometry modeling. c 2002 Elsevier Science (USA)
curves and surfaces， geometry modeling， object reconstruction， mesh generation， surface fairing and smoothing.，

10浏览

0点赞

0收藏

0分享

68下载

0评论

引用
【期刊论文】RBFbased constrained texture mapping
鲍虎军， Ying Tang， Jin Wang， Hujun Bao *， Qunsheng Peng
Computers & Graphics 27(2003)415422，0001，（）：
1年11月30日
There are many methods based on optimization technique for resolving the problem of deformationminimization in texture mapping. Recently, a new optimizationbased method for parameterizing polygonal meshes with minimum deformation has been developed to specifically address the problem of feature matching in texture mapping. However, these optimizationbased methods achieve the result of high quality at the expense of long computation time. In this paper, we present a fast analytic texture mapping method based on radial basis function (RBF) interpolation to solve the problem of constrained texture mapping. The users control the mapping process by interactively defining and editing a set of constraints consisting of 3D points picked on the surface and the corresponding 2D points of the texture. RBF is invoked to interpolate the userdefined constraints to provide an analytic parameterization of the surface. The energyminimization characteristic of RBF also ensures that the mapping function smoothly interpolates the constraints with satisfying nondeformation properties. This method has been applied to several data sets and excellent results have been produced. Our method is much faster than the optimizationbased method for texture mapping with the same good effect achieved.
Texture mapping， Radial basis function， Optimization， Parameterization

15浏览

0点赞

0收藏

0分享

140下载

0评论

引用
【期刊论文】3D surface filtering using spherical harmonics
鲍虎军， Kun Zhou a， b， Hujun Bao a， *， Jiaoying Shi a
ComputerAided Design 36(2004)363375，0001，（）：
1年11月30日
This paper presents a novel approach for 3D surface filtering over twomanifold meshes. A robust spherical parameterization algorithm is proposed to transform the input surface into a spherical vector function/signal. This signal is then decomposed into frequency domain using spherical harmonic transforms. Finally, traditional filtering techniques are generalized to process such spherical signals in either the frequency or spatial domain. Our major contribution is the twophase spherical parameterization algorithm, which can handle meshes with complex shapes by incorporating local parameterization into the progressive mesh. A number of experimental examples demonstrate the potential of our algorithm.
Mesh， Spherical parameterization， Signal processing， Spherical harmonic transform

10浏览

0点赞

0收藏

0分享

145下载

0评论

引用
【期刊论文】∫2 Subdivision for quadrilateral meshes
鲍虎军， GuiqingLi， ， WeiyinMa， HujunBao
，0001，（）：
1年11月30日
This paper presents a √2subdivision scheme for quadrilateralmeshes that can be regarded as an extension of a 48 subdivision with new subdivision rules and improved capability and performance. The proposed scheme adopts a socalled √2split operator to refine a control mesh such that the face number of the refined mesh generally equals the edge number and is thus about twice the face number of the coarse mesh. Smooth rules are designed in reference to the 48 subdivision, while a new set of weights is developed to balance the flatness of surfaces at vertices of different valences. Compared to the 48 subdivision, the presented scheme can be naturally generalized for arbitrary control nets and is more efficient in both space and computing time management. Analysis shows that limit surfaces produced by the scheme are C4 continuous for regular control meshes and G1 continuous at extraordinary vertices.
Subdivision surface √2 subdivision， 48 subdivision Quadrilateral， mesh Surface modeling

18浏览

0点赞

0收藏

0分享

87下载

0评论

引用