共查询到20条相似文献,搜索用时 156 毫秒
1.
Loop细分曲面的优化拟合算法 总被引:1,自引:0,他引:1
提出一种用于构造给定三维模型的拟合Loop细分曲面的迭代优化算法,使得拟合曲面与原始模型之间的逼近误差最小.算法中的逼近误差定义为原始模型各面元到拟合曲面最小距离的积分.与Loop细分小波分解算法的比较表明,该算法以适度的运行时间代价得到了更优的结果.此外,该算法还可以加以推广,作为一类从输入模型生成其近似表示的优化算法的基础. 相似文献
2.
唐逸之罗闪冉清康鋆鹏冯结青 《计算机辅助设计与图形学学报》2017,(12):2153-2161
为解决多视角配准中带有低频非刚性形变的深度数据容易产生累积误差、重叠区域未对齐等问题,提出一种基于多薄板样条的多视角非刚性配准算法.首先通过局部迭代最近点刚性配准算法得到重叠视角深度数据之间的对应点;然后基于多薄板样条的全局优化能量公式为每个视角求解一个薄板样条变换,使所有对应点之间距离的平方和最小;最后将优化后的薄板样条变换应用于每个视角的深度数据.通过在优化模型中引入初始点位置约束,该算法能使配准后的数据尽可能保持初始形状.为了加快求解速度,迭代地求解每个薄板样条变换,并且在优化过程中增量式地引入径向基函数.实验室结果表明,文中算法有较高的精度和效率,能够有效地减少累积误差并且提升重叠区域的对齐效果. 相似文献
3.
《计算机辅助设计与图形学学报》2017,(12)
为解决多视角配准中带有低频非刚性形变的深度数据容易产生累积误差、重叠区域未对齐等问题,提出一种基于多薄板样条的多视角非刚性配准算法.首先通过局部迭代最近点刚性配准算法得到重叠视角深度数据之间的对应点;然后基于多薄板样条的全局优化能量公式为每个视角求解一个薄板样条变换,使所有对应点之间距离的平方和最小;最后将优化后的薄板样条变换应用于每个视角的深度数据.通过在优化模型中引入初始点位置约束,该算法能使配准后的数据尽可能保持初始形状.为了加快求解速度,迭代地求解每个薄板样条变换,并且在优化过程中增量式地引入径向基函数.实验室结果表明,文中算法有较高的精度和效率,能够有效地减少累积误差并且提升重叠区域的对齐效果. 相似文献
4.
针对参数曲线/曲面重要细节特征处理的问题,提出带多个权值的、局部插值的几何迭代算法.首先将初始控制顶点分为插值点和非插值点2组,在调整不同的插值点时对调整向量赋予不同的权值,非插值点则不进行调整;然后给出算法的迭代矩阵并分析了收敛性;最后将文中算法推广到三维曲面情形.数值实例结果表明,通过适当地选取权值,该算法不仅可以灵活地处理曲线/曲面的局部细节特征,而且迭代产生的误差相对较小. 相似文献
5.
针对非均匀B样条的节点设置问题,提出一种利用非均匀B样条曲面拟合离散数据的迭代算法,通过优化节点分布来改进拟合曲面的质量.该算法以带参数化的三角网格曲面为输入,在首次迭代中根据输入曲面的几何特征将其对应的参数域划分成若干个子区域,并使得每个子区域上累积的几何特征信息量近似相等,子区域的重心坐标将取为首次迭代的节点;在随后的迭代中,保证前次迭代生成的重心位置固定不变,并根据前次迭代得到的曲面拟合误差再次将区域划分成累积误差接近相等的子区域,新增加的子区域重心的坐标选为拟加入的节点.文中算法自适应地在曲面形状复杂或拟合误差大的区域引入更多的控制顶点,使得拟合曲面的质量得以逐步改进.实验结果表明,该算法快速有效,在拟合具有明显几何特征的输入数据时具有优势. 相似文献
6.
为了获得光滑自然的点模型渐变效果,基于球面参数化,提出了一种鲁棒的渐变算法。该算法首先对源和目标模型进行球面参数化,使得参数化后的模型嵌入到单位球面上;然后在球面上自适应地对齐模型间的相应特征点,并将球面映射到矩形参数域上,基于该域建立模型间各采样点的对应关系;接着在渐变过程中,采用拉普拉斯算子计算出中间点模型的几何位置,以保持模型的细节;最后利用移动最小二乘曲面进行动态上采样,以消除中间模型的裂缝。实验结果表明,该算法具有良好匹配的采样点对应和光滑的渐变过程。 相似文献
7.
8.
9.
10.
陈素根 《计算机工程与应用》2014,(19):152-155
渐进迭代逼近在散乱点数据的拟合及逆向工程中有重要应用,研究了一类T-Bézier三角曲面的渐进迭代算法;提出了T-Bézier三角曲面渐进迭代算法,并分析了算法的收敛性;基于2-范数给出了渐进迭代算法的逼近误差。最后,举例说明了该算法的有效性及应用。 相似文献
11.
There are increasing demands for image interpolation in various fields such as virtual reality, computer animation, and video transmission. The critical-point filters (CPF) we have proposed previously enable completely automatic matching of two images. In our previous method, however, it has taken a long time to compute the optimal parameter values by iterative searches. This paper proposes an improved algorithm called the enhanced critical-point filters (ECPF) where the parameters are stably computed using together the inverse mapping from the destination to the source. It takes only a second to match images whose size is 64 × 64. The algorithm is also improved in its precision by directly handling color images while the previous algorithm has taken only the intensity value into account. We apply ECPF to keyframe interpolation of video sequences. We also apply ECPF to interpolating two different views of an object to generate any intermediate views. In this case, there are many constraints that can be used to determine the mapping between the images. We propose a method to use such constraints to improve the accuracy of the mappings. As the results, image-based pseudo-3D models are easily created from a set of views without any special devices. 相似文献
12.
H. Zhong Author Vitae W.S. Lau Author Vitae Author Vitae Y.S. Hung Author Vitae 《Pattern recognition》2008,41(11):3295-3301
This paper makes use of both feature points and silhouettes to deliver fast 3D shape recovery. The algorithm exploits object silhouettes in two views to establish a 3D rim curve, which is defined with respect to the two frontier points arising from two views. The images of this 3D rim curve in the two views are matched using cross-correlation technique. A 3D planar rim curve is then reconstructed using point-based reconstruction method. A set of 3D rim curves enclosing the object can be obtained from an image sequence captured under circular motion. Silhouettes are further utilized to check for mismatched rim points. The proposed method solves the problem of reconstruction of concave object surface, which is usually left unresolved in general silhouette-based reconstruction methods. In addition, the property of the reconstructed 3D rim curves allows fast surface extraction. Experimental results with real data are presented. 相似文献
13.
This paper presents a new algorithm for generating 3D images of B-reps objects with trimmed surface boundaries.The 3D image is a discrete voxel-map representation within a Cubic Frame Buffer (CFB).The definition of 3D images for curve,surface and solid object are introduced which imply the connectivity and fidelity requirements.Adaptive Forward Differencing matrix (AFD-matrix) for 1D-3D manifolds in 3D space is developed.By setting rules to update the AFD-matrix,the forward difference direction and stepwise can be adjusted.Finally,an efficient algorithm is presented based on the AFD-matrix concept for converting the object in 3D space to 3D image in 3D discrete space. 相似文献
14.
An algorithm for the visualization of stereo images simultaneously captured with different exposures
The visualization of stereo images obtained from two eyepiece cameras of a stereo microscope with different exposures is studied. This problem is solved to improve the quality of resulting images in the case when one image is not sufficient for capturing an object with the desired color reproduction accuracy and high level of detail both in dark and light regions. An approach to solving this problem in which differently exposed images are split between two views is considered. This approach allows us to significantly reduce the capturing time and to enhance the quality of capturing moving objects. The algorithm described in [1] is used as the basic algorithm; the main steps of this algorithm are the stereo matching of two input images and the construction of high dynamic range images. Modifications of the basic algorithm that use different stereo matching techniques are proposed. The application of the algorithm described in [2] for the visualization of stereo images without constructing high dynamic range images is discussed. A database of images captured with different exposures by a stereo microscope is created. The quality of algorithms applied to the images from this database is evaluated in the HDR-VDP-2.2 metric [3]. 相似文献
15.
16.
A Variational Framework for Structure from Motion in Omnidirectional Image Sequences 总被引:1,自引:0,他引:1
Luigi Bagnato Pascal Frossard Pierre Vandergheynst 《Journal of Mathematical Imaging and Vision》2011,41(3):182-193
We address the problem of depth and ego-motion estimation from omnidirectional images. We propose a correspondence-free structure-from-motion
problem for sequences of images mapped on the 2-sphere. A novel graph-based variational framework is first proposed for depth
estimation between pairs of images. The estimation is cast as a TV-L1 optimization problem that is solved by a fast graph-based
algorithm. The ego-motion is then estimated directly from the depth information without explicit computation of the optical
flow. Both problems are finally addressed together in an iterative algorithm that alternates between depth and ego-motion
estimation for fast computation of 3D information from motion in image sequences. Experimental results demonstrate the effective
performance of the proposed algorithm for 3D reconstruction from synthetic and natural omnidirectional images. 相似文献
17.
Three-dimensional model-based object recognition and segmentation in cluttered scenes 总被引:1,自引:0,他引:1
Mian AS Bennamoun M Owens R 《IEEE transactions on pattern analysis and machine intelligence》2006,28(10):1584-1601
Viewpoint independent recognition of free-form objects and their segmentation in the presence of clutter and occlusions is a challenging task. We present a novel 3D model-based algorithm which performs this task automatically and efficiently. A 3D model of an object is automatically constructed offline from its multiple unordered range images (views). These views are converted into multidimensional table representations (which we refer to as tensors). Correspondences are automatically established between these views by simultaneously matching the tensors of a view with those of the remaining views using a hash table-based voting scheme. This results in a graph of relative transformations used to register the views before they are integrated into a seamless 3D model. These models and their tensor representations constitute the model library. During online recognition, a tensor from the scene is simultaneously matched with those in the library by casting votes. Similarity measures are calculated for the model tensors which receive the most votes. The model with the highest similarity is transformed to the scene and, if it aligns accurately with an object in the scene, that object is declared as recognized and is segmented. This process is repeated until the scene is completely segmented. Experiments were performed on real and synthetic data comprised of 55 models and 610 scenes and an overall recognition rate of 95 percent was achieved. Comparison with the spin images revealed that our algorithm is superior in terms of recognition rate and efficiency. 相似文献
18.
A spherical representation for recognition of free-form surfaces 总被引:3,自引:0,他引:3
Hebert M. Ikeuchi K. Delingette H. 《IEEE transactions on pattern analysis and machine intelligence》1995,17(7):681-690
Introduces a new surface representation for recognizing curved objects. The authors approach begins by representing an object by a discrete mesh of points built from range data or from a geometric model of the object. The mesh is computed from the data by deforming a standard shaped mesh, for example, an ellipsoid, until it fits the surface of the object. The authors define local regularity constraints that the mesh must satisfy. The authors then define a canonical mapping between the mesh describing the object and a standard spherical mesh. A surface curvature index that is pose-invariant is stored at every node of the mesh. The authors use this object representation for recognition by comparing the spherical model of a reference object with the model extracted from a new observed scene. The authors show how the similarity between reference model and observed data can be evaluated and they show how the pose of the reference object in the observed scene can be easily computed using this representation. The authors present results on real range images which show that this approach to modelling and recognizing 3D objects has three main advantages: (1) it is applicable to complex curved surfaces that cannot be handled by conventional techniques; (2) it reduces the recognition problem to the computation of similarity between spherical distributions; in particular, the recognition algorithm does not require any combinatorial search; and (3) even though it is based on a spherical mapping, the approach can handle occlusions and partial views 相似文献
19.
Chi Kin Chow Author Vitae Hung Tat Tsui Author Vitae Author Vitae 《Pattern recognition》2004,37(1):105-117
Robust and fast free-form surface registration is a useful technique in various areas such as object recognition and 3D model reconstruction for animation. Notably, an object model can be constructed, in principle, by surface registration and integration of range images of the target object from different views. In this paper, we propose to formulate the surface registration problem as a high dimensional optimization problem, which can be solved by a genetic algorithm (GA) (Genetic Algorithms in Search Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989). The performance of the GA for surface registration is highly dependent on its speed in evaluating the fitness function. A novel GA with a new fitness function and a new genetic operator is proposed. It can compute an optimal registration 1000 times faster than a conventional GA. The accuracy, speed and the robustness of the proposed method are verified by a number of real experiments. 相似文献
20.
In the last decades, extensive efforts have been dedicated to develop better 3D object retrieval methods. View-based methods have attracted a significant amount of attention, not only because of their state-of-the-art performance, but also they merely require some of a 3D object’s 2D view images. However, most recent approaches only deal with the images’ content difference without the discrepancy of view relative positions. In this paper, we propose a normal method for view segmentation, based on Markov random field (MRF) model, which consider not only the difference between the content of views but also the relative locations. Each view is obtained by projecting at certain viewpoints and angels, therefore, these locations can be applied to depict each view, with content of views. We use the MRF to implement view segmentation and choose the representative views. Finally, we present a framework based on the proposed view segmentation method for 3D object retrieval and the experimental results demonstrate that the proposed method can achieve better retrieval effectiveness than state-of-the-art methods under several standard evaluation measures. 相似文献