检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

164 篇 会议
16 篇 期刊文献
14 册 图书

馆藏范围

194 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

118 篇 工学
- 110 篇 计算机科学与技术...
- 52 篇 软件工程
- 25 篇 电气工程
- 15 篇 信息与通信工程
- 9 篇 控制科学与工程
- 9 篇 生物工程
- 7 篇 生物医学工程（可授...
- 5 篇 仪器科学与技术
- 4 篇 机械工程
- 4 篇 光学工程
- 3 篇 动力工程及工程热...
- 3 篇 建筑学
- 3 篇 土木工程
- 2 篇 电子科学与技术（可...
- 2 篇 测绘科学与技术
- 2 篇 化学工程与技术
- 1 篇 冶金工程
- 1 篇 纺织科学与工程
60 篇 理学
- 43 篇 数学
- 17 篇 物理学
- 10 篇 生物学
- 7 篇 统计学（可授理学、...
- 2 篇 化学
- 2 篇 系统科学
22 篇 医学
- 21 篇 临床医学
- 2 篇 基础医学(可授医学...
11 篇 管理学
- 10 篇 图书情报与档案管...
2 篇 教育学
- 2 篇 教育学
2 篇 农学
- 2 篇 作物学
1 篇 文学
- 1 篇 外国语言文学
1 篇 艺术学

主题

54 篇 pattern recognit...
10 篇 pattern matching
7 篇 image segmentati...
7 篇 graph theory
6 篇 computer graphic...
6 篇 discrete mathema...
6 篇 artificial intel...
6 篇 image processing...
4 篇 machine learning
4 篇 data structures
4 篇 computer imaging...
3 篇 deep learning
3 篇 computational ef...
3 篇 graphic methods
3 篇 pattern recognit...
3 篇 semantics
3 篇 image processing
3 篇 algorithm analys...
2 篇 possibilistic cl...
2 篇 computer science

机构

3 篇 vienna universit...
2 篇 univ appl sci & ...
2 篇 medical universi...
2 篇 univ bern inst c...
2 篇 school of comput...
2 篇 osaka univ osaka
2 篇 aichi institute ...
2 篇 university of to...
2 篇 ensicaen cnrs um...
2 篇 human language t...
2 篇 vienna universit...
2 篇 cnr infm lamia i...
2 篇 univ lausanne ip...
2 篇 department of co...
2 篇 univ pisa dipart...
2 篇 pattern recognit...
1 篇 centre for patte...
1 篇 cnrs umr 6072 im...
1 篇 nanyang technolo...
1 篇 computer science...

作者

18 篇 kropatsch walter...
9 篇 haxhimusa yll
7 篇 bunke horst
6 篇 riesen kaspar
5 篇 ion adrian
4 篇 hancock edwin r.
4 篇 brun luc
3 篇 jiang xiaoyi
3 篇 yachida m
3 篇 de sousa samuel
3 篇 fischer andreas
3 篇 vento mario
3 篇 pasquale foggia
3 篇 mario vento
2 篇 foggia pasquale
2 篇 masulli f
2 篇 schnörr c
2 篇 massone am
2 篇 stauffer michael
2 篇 bunke h

语言

192 篇 英文
2 篇 中文

检索条件"任意字段=5th International Workshop on Graph-Based Representations in Pattern Recognition"

共 194 条记录，以下是61-70 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Proceedings of the 5th international workshop on pattern recognition in Information Systems, PRIS 2005, in Conjunction with ICEIS 2005

Proceedings of the 5th International Workshop on Pattern Rec...

引用

5th international workshop on pattern recognition in Information Systems, PRIS 2005, in Conjunction with ICEIS 2005

ISBN: (纸本)9728865287

the proceedings contain 26 papers. the topics discussed include: picture ID authentication using invisible watermark and facial recognition features;a new REF classifier for buried tag recognition;novel circular-shift invariant clustering;inductive string template-based learning of spoken language;a multi-resolution learning approach to tracking concept drift and recurrent concepts;automatic recognition of pollutants in packaged foods from x-ray imaging;car license plate extraction from video stream in complex environment;dynamic feature selection and coarse-to-fine search for content-based image retrieval;automated annotation of multimedia audio data with affective labels for information management;fast algorithm for optimal polygonal approximation of shape boundaries;activity identification and visualization;evaluating pattern recognition techniques in intrusion detection systems;and a comparison of methods for web document classification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

graph-based representations in pattern recognition 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Donatello Conte Jean-Yves Ramel Pasquale Foggia

ISBN: (数字)9783030200817

ISBN: (纸本)9783030200800

this book constitutes the refereed proceedings of the 12th IAPR-TC-15 international workshop on graph-based Representation in pattern recognition, GbRPR 2019, held in Tours, France, in June 2019.;the 22 full papers included in this volume together with an invited talk were carefully reviewed and selected from 28 submissions. the papers discuss research results and applications at the intersection of pattern recognition, image analysis, and graph theory. they cover topics such as graph edit distance, graph matching, machine learning for graph problems, network and graph embedding, spectral graph problems, and parallel algorithms for graph problems.

关键词： pattern recognition Discrete Mathematics in Computer Science Computer graphics Algorithm Analysis and Problem Complexity Data Structures Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

Computing homology group generators of images using irregular graph pyramids

Computing homology group generators of images using irregula...

引用

6th international workshop on graph-based representations in pattern recognition

作者： Peltier, S. Ion, A. Haxhimusa, Y. Kropatsch, W. G. Damiand, G. Vienna Univ Technol Fac Informat Pattern Recognit & Image Proc Grp A-1040 Vienna Austria Univ Poitiers SIC FRE 2731 CNRS Poitiers France

ISBN: (纸本)9783540729020

We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hierarchy of the image is built, by two operations that preserve homology of each region. Instead of computing homology generators in the base where the number of entities (cells) is large, we first reduce the number of cells by a graph pyramid. then homology generators are computed efficiently on the top level of the pyramid, since the number of cells is small, and a top down process is then used to deduce homology generators in any level of the pyramid, including the base level i.e. the initial image. We show that the new method produces valid homology generators and present some experimental results.

关键词： Image analysis

来源：评论

学校读者我要写书评

暂无评论

Approximating TSP solution by MST based graph pyramid

Approximating TSP solution by MST based graph pyramid

引用

6th international workshop on graph-based representations in pattern recognition

作者： Haxhimusa, Yll Kropatsch, Walter G. Pizlo, Zygmunt Ion, Adrian Lehrbaum, Andreas Vienna Univ Technol Fac Informat Inst Comp Aided Automat Pattern Recognit & Image Proc Grp A-1040 Vienna Austria Purdue Univ Dept Physiol Sci W Lafayette IN 47907 USA

ISBN: (纸本)9783540729020

the traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of cities, the problem is approximated into a simpler form containing smaller number of cities, which is then solved optimally. graph pyramid solution strategies, in a bottom-up manner using Boruvka's minimum spanning tree, convert a 2D Euclidean TSP problem with a large number of cities into successively smaller problems (graphs) with similar layout and solution, until the number of cities is small enough to seek the optimal solution. Expanding this tour solution in a top-down manner to the lower levels of the pyramid approximates the solution. the new model has an adaptive spatial structure and it simulates visual acuity and visual attention. the model solves the TSP problem sequentially, by moving attention from city to city with the same quality as humans. graph pyramid data structures and processing strategies are a plausible model for finding near-optimal solutions for computationally hard pattern recognition problems.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

Generalized vs set median strings for histogram-based distances: Algorithms and classification results in the image domain

Generalized vs set median strings for histogram-based distan...

引用

6th international workshop on graph-based representations in pattern recognition

作者： Solnon, Christine Jolion, Jean-Michel Univ Lyon 1 CNRS INSA Lyon Nautibus LIRISUMR 5205 43 Bd 11 Novembre F-69622 Villeurbanne France

ISBN: (纸本)9783540729020

We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by its generalized median, i.e., the string -over the set of all possible strings- that minimizes the sum of distances to every string of the set, or by its set median, i.e., the string of the set that minimizes the sum of distances to every other string of the set. For the first two histogram-based distances, we show that the generalized median string can be computed efficiently;for the third one, which biased histograms with individual substitution costs, we conjecture that this is a NP-hard problem, and we introduce two different heuristic algorithms for approximating it. We experimentally compare the relevance of the three histogram-based distances, and the different statistical characterizations of sets of strings, for classifying images that are represented by strings.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Reverse-convex programming for sparse image codes

引用

5th international workshop on Energy Minimization Methods in Computer Vision and pattern recognition

作者： Heiler, M Schnörr, C Univ Mannheim Dept Math & Comp Sci Comp Vis Graph & Pattern Recognit Grp D-68131 Mannheim Germany

ISBN: (纸本)3540302875

Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse non-negative matrix factorization (NMF) belongs to this class. based on this result, we design two algorithms for sparse NMF that solve sequences of convex secondorder cone programs (SOCP). We work out some well-defined modifications of NMF that leave the original model invariant from the optimization viewpoint. they considerably generalize the sparse NMF setting to account for uncertainty in sparseness, for supervised learning, and, by dropping the non-negativity constraint, for sparsity-controlled PCA.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

An algorithm for maximum common subgraph of planar triangulation graphs

An algorithm for maximum common subgraph of planar triangula...

引用

9th IAPR-TC-15 international workshop on graph-based representations in pattern recognition, GbRPR 2013

作者： Lu, Yao Bunke, Horst Liu, Cheng-Lin National Lab. of Pattern Recognition Institute of Automation Chinese Academy of Sciences China University of Bern Switzerland

ISBN: (纸本)9783642382208

We propose a new fast algorithm for solving the Maximum Common Subgraph (MCS) problem. MCS is an NP-complete problem. In this paper, we focus on a special class of graphs, i.e. Planar Triangulation graphs, which are commonly used in computer vision, pattern recognition and graphics. By exploiting the properties of Planar Triangulation graphs and restricting the problem to connected MCS, for two such graphs of size n and m and their maximum common subgraph of size k, our algorithm solves the MCS problem approximately with time complexity O(nmk). © 2013 Springer-Verlag.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

graph-based representations in pattern recognition 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Pasquale Foggia Mario Vento Cheng-Lin Liu

ISBN: (数字)9783319589619

ISBN: (纸本)9783319589602

this book constitutes the refereed proceedings of the 11th IAPR-TC-15 international workshop on graph-based Representation in pattern recognition, GbRPR 2017, held in Anacapri, Italy, in May 2017. the 25 full papers and 2 abstracts of invited papers presented in this volume were carefully reviewed and selected from 31 submissions. the papers discuss research results and applications in the intersection of pattern recognition, image analysis, graph theory, and also the application of graphs to pattern recognition problems in other fields like computational topology, graphic recognition systems and bioinformatics.

关键词： pattern recognition Image Processing and Computer Vision Computer graphics Discrete Mathematics in Computer Science Data Structures Algorithm Analysis and Problem Complexity

来源：评论

学校读者我要写书评

暂无评论

Cross-Evaluation of graph-based Keyword Spotting in Handwritten Historical Documents 1

引用

12th IAPR-TC15 workshop on graph-based representations in pattern recognition (GbRPR)

作者： Stauffer, Michael Maergner, Paul Fischer, Andreas Riesen, Kaspar Univ Appl Sci & Arts Northwestern Switzerland Inst Informat Syst Riggenbachstr 16 CH-4600 Olten Switzerland Univ Fribourg Dept Informat Blvd Perolles 90 CH-1700 Fribourg Switzerland Univ Appl Sci & Arts Western Switzerland Inst Complex Syst Blvd Perolles 80 CH-1700 Fribourg Switzerland

ISBN: (数字)9783030200817

ISBN: (纸本)9783030200817;9783030200800

In contrast to statistical representations, graphs offer some inherent advantages when it comes to handwriting representation. that is, graphs are able to adapt their size and structure to the individual handwriting and represent binary relationships that might exist within the handwriting. We observe an increasing number of graph-based keyword spotting frameworks in the last years. In general, keyword spotting allows to retrieve instances of an arbitrary query in documents. It is common practice to optimise keyword spotting frameworks for each document individually, and thus, the overall generalisability remains somehow questionable. In this paper, we focus on this question by conducting a cross-evaluation experiment on four handwritten historical documents. We observe a direct relationship between parameter settings and the actual handwriting. We also propose different ensemble strategies that allow to keep up with individually optimised systems without a priori knowledge of a certain manuscript. Such a system can potentially be applied to new documents without prior optimisation.

关键词： Keyword spotting Handwritten historical documents graph-based representations Hausdorff Edit Distance Ensemble methods

来源：评论

学校读者我要写书评

暂无评论

Stepwise segmentation and interpretation of section representations in vectorized drawings 5

Stepwise segmentation and interpretation of section represen...

引用

5th international Conference on Document Analysis and recognition, ICDAR 1999

作者： Grabowski, Hans Liu, Chenguang Michelis, Arno Karlsruhe Germany

ISBN: (纸本)0769503187

this paper describes a procedure for data extraction and interpretation of section representations in vectorized line drawings. Vectorized drawings are considered as a graph representation. the hatch areas are analysed and extracted in regard to their geometric and topologic characteristics with the help of context analysis. With the semantic interpretation, the referred view representations of half- and local sections, sections in the same view direction are completed in the viewpoint of orthogonal projection and are then available for 3D geometric reconstruction with known algorithms. © 1999 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共20页 << < 3 4 5 6 7 8 9 10 11 12 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：