检索结果-南通市图书馆

partial Shape matching Without Point-Wise Correspondence

Numerical Mathematics(Theory,Methods and Applications) 2013年第1期6卷 223-244页

作者： Jonathan Pokrass Alexander M.Bronstein Michael M.Bronstein School of Electrical Engineering Tel Aviv UniversityIsrael Institute of Computational Science Faculty of InformaticsUniversitàdella Svizzera Italiana(USI)LuganoSwitzerland

partial similarity of shapes is a challenging problem arising in many important applications in computer vision,shape analysis,and graphics,*** one has to deal with partial information and acquisition *** problem is especially hard when the underlying shapes are non-rigid and are given up to a *** matching is usually approached by computing local descriptors on a pair of shapes and then establishing a point-wise non-bijective correspondence between the two,taking into account possibly different *** this paper,we introduce an alternative correspondence-less approach to matching fragments to an entire shape undergoing a non-rigid *** use region-wise local descriptors and optimize over the integration domains on which the integral descriptors of the two parts *** problem is regularized using the Mumford-Shah *** show an efficient discretization based on the Ambrosio-Tortorelli approximation generalized to triangular point clouds and meshes,and present experiments demonstrating the success of the proposed method.

关键词： Deformable shapes partial matching partial correspondence partial similarity diffusion geometry Laplace-Beltrami operator shape descriptors heat kernel signature Mumford-Shah regularization

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Content-Based Publish/Subscribe System for Web Syndication

引用

Journal of Computer Science & Technology 2016年第2期31卷 359-380页

作者： Zeinab Hmedeh Harry Kourdounakis Vassilis Christophides Cedric du Mouza Michel Scholl Nicolas Travers CEDRIC Laboratory Conservatoire National des Arts et Metiers Paris 75141 France FORTH//ICS University of Crete Heraklion GR-70013 Greece

Content syndication has become a popular way for timely delivery of frequently updated information on the Web. Today, web syndication technologies such as RSS or Atom are used in a wide variety of applications spreading from large-scale news broadcasting to medium-scale information sharing in scientific and professional communities. However, they exhibit serious limitations for dealing with information overload in Web 2.0. There is a vital need for efficient real- time filtering methods across feeds, to allow users to effectively follow personally interesting information. We investigate in this paper three indexing techniques for users＇ subscriptions based on inverted lists or on an ordered trie for exact and partial matching. We present analytical models for memory requirements and matching time and we conduct a thorough experimental evaluation to exhibit the impact of critical parameters of realistic web syndication workloads.

关键词： pub/sub subscription indexing web syndication partial matching scalability

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：