找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: ;

[复制链接]
楼主: 无法生存
发表于 2025-3-30 09:35:01 | 显示全部楼层
发表于 2025-3-30 15:08:41 | 显示全部楼层
Graph-Based Registration of Partial Images of City Maps Using Geometric Hashingthod to avoid the need of special maps. It creates a graph representation of a given input image and robustly finds an optimal registration using a geometric hashing technique. Our approach is translation, scale and rotation invariant, map type independent and robust against noise and missing data.
发表于 2025-3-30 20:17:20 | 显示全部楼层
Graph Matching Based on Node Signaturestern recognition applications. Compared with four well-known methods, our algorithm gives good results for clustering and retrieving images. A sensitivity analysis reveals that the proposed method is also insensitive to weak structural changes.
发表于 2025-3-30 22:34:00 | 显示全部楼层
发表于 2025-3-31 03:12:03 | 显示全部楼层
发表于 2025-3-31 06:15:08 | 显示全部楼层
A Graph Based Data Model for Graphics Interpretationiscussed as well. An earlier version of the DG model has been applied for interpretation of Hungarian cadastral maps. Although this paper gives examples of map interpretation, our concept can be extended to other fields of graphics recognition.
发表于 2025-3-31 10:06:42 | 显示全部楼层
发表于 2025-3-31 15:28:31 | 显示全部楼层
A Recursive Embedding Approach to Median Graph Computationategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches.
发表于 2025-3-31 20:09:49 | 显示全部楼层
发表于 2025-3-31 22:04:37 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-24 10:46
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表