检索结果-南通市图书馆

Stable haptic interaction based on adaptive hierarchical shape matching

Computational Visual Media 2015年第3期1卷 253-265页

作者： Yuan Tian Yin Yang Xiaohu Guo Balakrishnan Prabhakaran University of Texas at Dallas University of New Mexico

In this paper, we present a framework allowing users to interact with geometrically complex3 D deformable objects using(multiple) haptic devices based on an extended shape matching approach. There are two major challenges for haptic-enabled interaction using the shape matching method. The first is how to obtain a rapid deformation propagation when a large number of shape matching clusters exist. The second is how to robustly handle the collision response when the haptic interaction point hits the particlesampled deformable volume. Our framework extends existing multi-resolution shape matching methods,providing an improved energy convergence rate. This is achieved by using adaptive integration strategies to avoid insignificant shape matching iterations during the simulation. Furthermore, we present a new mechanism called stable constraint particle coupling which ensures consistent deformable behavior during haptic interaction. As demonstrated in our experimental results, the proposed method provides natural and smooth haptic rendering as well as efficient yet stable deformable simulation of complex models in real time.

关键词： deformation haptic rendering shape matching multi-resolution

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An anisotropic Chebyshev descriptor and its optimization for deformable shape correspondence

引用

Computational Visual Media 2023年第3期9卷 461-477页

作者： Shengjun Liu Hongyan Liu Wang Chen Dong-Ming Yan Ling Hu Xinru Liu Qinsong Li School of Mathematics and Statistics Central South UniversityChangsha 410000China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China School of Artificial Intelligence University of Chinese Academy of SciencesBeijing 101408China School of Mathematics and Statistics Hunan First Normal UniversityChangsha 410000China Big Data Institute Central South UniversityChangsha 410000China

shape descriptors have recently gained popularity in shape matching,statistical shape modeling,etc.Their discriminative ability and efficiency play a decisive role in these tasks.In this paper,we first propose a novel handcrafted anisotropic spectral descriptor using Chebyshev polynomials,called the anisotropic Chebyshev descriptor(ACD);it can effectively capture shape features in multiple directions.The ACD inherits many good characteristics of spectral descriptors,such as being intrinsic,robust to changes in surface discretization,etc.Furthermore,due to the orthogonality of Chebyshev polynomials,the ACD is compact and can disambiguate intrinsic symmetry sinces everal directions are considered.To improve the ACD’s discrimination ability,we construct a Chebyshev spectral manifold convolutional neural network(CSMCNN)that optimizes the ACD and produces a learned ACD.Our experimental results show that the ACD outperforms existing state-of-the-art handcrafted descriptors.The combination of the ACD and the CSMCNN is better than other state-of-the-art learned descriptors in terms of discrimination,efficiency,and robustness to changes in shape resolution and discretization.

关键词： anisotropic descriptor spectral descriptor shape descriptor shape matching spectral convolution deep learning

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Approximating interior bounded box of 3D character mesh model based on its skeleton and symmetry

引用

International Journal of Intelligent Computing and Cybernetics 2017年第3期10卷 332-347页

作者： Hanxiang Xu Shihui Guo Junfeng Yao Nadia Magnenat Thalmann School of Software Xiamen UniversityXiamenChina Institute for Media Innovation Nanyang Technological UniversitySingapore

Purpose – In the process of robot shell design, it is necessary to match the shape of the input 3D originalcharacter mesh model and robot endoskeleton, in order to make the input model fit for robot and avoidcollision. So, the purpose of this paper is to find an object of reference, which can be used for the process ofshape matching.Design/methodology/approach – In this work, the authors propose an interior bounded box (IBB)approach that derives from oriented bounding box (OBB). This kind of box is inside the closed mesh model.At the same time, it has maximum volume which is aligned with the object axis but is enclosed by all the meshvertices. Based on the IBB of input mesh model and the OBB of robot endoskeleton, the authors can completethe process of shape matching. In this paper, the authors use an evolutionary algorithm, covariance matrixadaptation evolution strategy (CMA-ES), to approximate the IBB based on skeleton and symmetry of inputcharacter mesh model.Findings – Based on the evolutionary algorithm CMA-ES, the optimal position and scale informationof IBB can be found. The authors can obtain satisfactory IBB result after this optimization process.The output IBB has maximum volume and is enveloped by the input character mesh model as well.Originality/value – To the best knowledge of the authors, the IBB is first proposed and used in the field ofrobot shell design. Taking advantage of the IBB, people can quickly obtain a shell model that fit for robot.At the same time, it can avoid collision between shell model and the robot endoskeleton.

关键词： 3D original characters mesh model CMA-ES Interior bounded box shape matching

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Inexact graph matching using a hierarchy of matching processes

引用

Computational Visual Media 2015年第4期1卷 291-307页

作者： Paul Morrison Ju Jia Zou School of Computing Engineering and MathematicsWestern Sydney University

Inexact graph matching algorithms have proved to be useful in many applications,such as character recognition,shape analysis,and image analysis. Inexact graph matching is,however,inherently an NP-hard problem with exponential computational complexity. Much of the previous research has focused on solving this problem using heuristics or estimations. Unfortunately,many of these techniques do not guarantee that an optimal solution will be found. It is the aim of the proposed algorithm to reduce the complexity of the inexact graph matching process,while still producing an optimal solution for a known application. This is achieved by greatly simplifying each individual matching process,and compensating for lost robustness by producing a hierarchy of matching processes. The creation of each matching process in the hierarchy is driven by an application-specific criterion that operates at the subgraph scale. To our knowledge,this problem has never before been approached in this manner. Results show that the proposed algorithm is faster than two existing methods based on graph edit operations.The proposed algorithm produces accurate results in terms of matching graphs,and shows promise for the application of shape matching. The proposed algorithm can easily be extended to produce a sub-optimal solution if required.

关键词： graph matching inexact graph matching graph edit distance graph edit operations shape matching

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A facial reconstruction method based on new mesh deformation techniques

引用

Forensic Sciences Research 2018年第3期3卷 256-272页

作者： Maya de Buhan Chiara Nardoni Centre national de la recherche scientifique Unitémixte de recherche 8145Laboratoire de Mathematiques Appliquées de Paris DescartesUniversitéParis DescartesSorbonne Paris CitéParisFrance Sorbonne Universités UPMC Univ Paris 06Institut des Sciences du Calcul et des DonnéesParisFrance

This article presents a new numerical method for facial reconstruction.The problem is the following:given a dry skull,reconstruct a virtual face that would help in the identification of the subject.The approach combines classical features as the use of a skulls/faces database and more original aspects:(1)an original shape matching method is used to link the unknown skull to the database templates;(2)the final face is seen as an elastic 3D mask that is deformed and adapted onto the unknown skull.In this method,the skull is considered as a whole surface and not restricted to some anatomical landmarks,allowing a dense description of the skull/face relationship.Also,the approach is fully automated.Various results are presented to show its efficiency.

关键词： Forensic science facial reconstruction shape matching elasticity soft tissue deformation finite elements

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Automatic 3D shape Co-Segmentation Using Spectral Graph Method

引用

Journal of Computer Science & Technology 2013年第5期28卷 919-928,F0003页

作者：雷浩鹏罗笑南林淑金盛建强 School of Information Science & Technology Sun Yat-sen University National Engineering Research Center of Digital Life Research Institute of Sun Yat-sen University in Shenzhen School of Communication & Design Sun Yat-sen University

Co-analyzing a set of 3D shapes is a challenging task considering a large geometrical variability of the shapes. To address this challenge, this paper proposes a new automatic 3D shape co-segmentation algorithm by using spectral graph method. Our method firstly represents input shapes as a set of weighted graphs and extracts multiple geometric features to measure the similarities of faces in each individual shape. Secondly all graphs are embedded into the spectral domain to find meaningful correspondences across the set, After that we build a joint weighted matrix for the graph set and then apply normalized cut criterion to find optimal co-segmentation of the input shapes. Finally we evaluate our approach on different categories of 3D shapes, and the experimental results demonstrate that our method can accurately co-segment a wide variety of shapes, which may have different poses and significant topology changes.

关键词： shape co-segmentation shape matching spectral graph normalized cut

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：