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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是151-160 订阅

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

详细简洁

排序：

Computing the cyclic edit distance for pattern classification by ranking edit paths

引用

Joint IAPR 10th international workshop on Structural and Syntactic pattern recognition, SSPR 2004 and 5th international workshop on Statistical Techniques in pattern recognition, SPR 2004

作者： Jiménez, Víctor M. Marzal, Andrés Palazón, Vicente Peris, Guillermo DLSI Universitat Jaume I Castellón12071 Spain

ISBN: (纸本)9783540225706

the cyclic edit distance between two strings A and B of lengths m and n is the minimum edit distance between A and every cyclic shift of B. this can be applied, for instance, in classification tasks where strings represent the contour of objects. Bunke and B¨uhler proposed an algorithm that approximates the cyclic edit distance in time O(mn). In this paper we show how to apply a technique for ranking the K shortest paths to an edit graph underlying the Bunke and B¨uhler algorithm to obtain the exact solution. this technique, combined with pruning rules, leads to an efficient and exact procedure for nearest-neighbour classification based on cyclic edit distances. Experimental results show that the proposed method can be used to classify handwritten digits using the exact cyclic edit distance with only a small increase in computing time with respect to the original Bunke and B¨uhler algorithm. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

5th international workshop on Multiple Classifier Systems, MCS 2004

5th International Workshop on Multiple Classifier Systems, M...

引用

5th international workshop on Multiple Classifier Systems, MCS 2004

ISBN: (纸本)3540221441

the proceedings contain 37 papers. the special focus in this conference is on Bagging and Boosting. the topics include: Classifier ensembles for changing environments;classification and function estimation;boosting for noisy data;bagging decision multi-trees;a new approach to incremental learning;recursive ECOC learning machines;exact bagging with k-nearest neighbour classifiers;a maximum entropy approach;combining one-class classifiers to classify missing data;combining kernel information for support vector classification;combining classifiers using dependency-based product approximation with bayes error rate;combining dissimilarity-based one-class classifiers;a modular system for the classification of time series data;a probabilistic model using information theoretic measures for cluster ensembles;classifier fusion using triangular norms;dynamic integration of regression models;dynamic classifier selection by adaptive k-nearest-neighbourhood rule;spectral measure for multi-class problems;the relationship between classifier factorisation and performance in stochastic vector quantisation;a method for designing cost-sensitive ECOC;building graph-based classifier ensembles by random node selection;a comparison of ensemble creation techniques;multiple classifiers system for reducing influences of atypical observations;sharing training patterns among multiple classifiers;first experiments on ensembles of radial basis functions;an empirical bias-variance analysis;building diverse classifier outputs to evaluate the behavior of combination methods;an empirical comparison of hierarchical vs. two-level approaches to multiclass problems;experiments on ensembles with missing and noisy data;induced decision fusion in automated sign language interpretation and ensembles of classifiers derived from multiple prototypes and their application to handwriting recognition.

关键词：

来源：评论

学校读者我要写书评

暂无评论

5th international workshop on graphics recognition, GREC 2003

5th International Workshop on Graphics Recognition, GREC 200...

引用

5th international workshop on graphics recognition, GREC 2003

ISBN: (纸本)9783540224785

the proceedings contain 34 papers. the special focus in this conference is on Platforms, Architectures, Document Knowledge Models, Technical Documents, Maps, Charts, Perceptual Organization, Indexing and graphical Signatures. the topics include: A cooperative platform for heterogeneous document interpretation according to user-defined scenarios;knowledge representation and acquisition for engineering document analysis;dealing with noise in DMOS, a generic method for structured document recognition;raster to vector conversion of color cartographic maps;text/graphics separation and recognition in raster-scanned color cartographic maps;resolving ambiguities in toponym recognition in cartographic maps;model-based chart image recognition;extracting system-level understanding from wiring diagram manuals;main wall recognition of architectural drawings using dimension extension line;interactive recognition of graphic objects in engineering drawings;skewed mirror symmetry for depth estimation in 3D line-drawings;vectorial signatures for symbol discrimination;syntactic models to represent perceptually regular repetitive patterns in graphic documents;indexing technical symbols using ridgelets transform;automatic measuring the local thickness of raster lines;adaptable vectorisation system based on strategic knowledge and XML representation use;image quality measure using sliced block distance as a graphical element;recognition of target graphs from images using a genetic algorithm with hill climbing searching;a recognition system for folding process of origami drill books;shape description for automatically structuring graphical data and recognition of on-line handwritten mathematical expressions using a minimum spanning tree construction and symbol dominance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dictionary-based syntactic pattern recognition using tries

引用

Joint IAPR 10th international workshop on Structural and Syntactic pattern recognition, SSPR 2004 and 5th international workshop on Statistical Techniques in pattern recognition, SPR 2004

作者： John Oommen, B. Badr, Ghada Carleton University School of Computer Science Carleton University OttawaK1S 5B6 Canada

ISBN: (纸本)9783540225706

this paper deals with the problem of estimating a transmitted string X ∗ by processing the corresponding string Y, which is a noisy version of X∗. We assume that Y contains substitution, insertion and deletion errors, and that X ∗ is an element of a finite (but possibly, large) dictionary, H. the best estimate X+ of X ∗, is defined as that element of H which minimizes the Generalized Levenshtein Distance D(X, Y) between X and Y, for all X ∈ H. All existing techniques for computing X+ requires a separate evaluation of the edit distances between Y and every X ∈ H. In this paper, we show how we can evaluate D(X, Y) for every X ∈ H simultaneously, without resorting to any parallel computations. this is achieved by resorting to the use of an additional data structure called the Linked List of Prefixes (LLP), which is built "on top of" the trie representation of the dictionary. the computational advantage (for a dictionary made from the set of 1023 most common words augmented by computer-related words) gained is at least 50% and 80% measured in terms of the time and the number of operations required respectively. the accuracy forfeited is negligible. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A competitivewinner-takes-all architecture for classification and pattern recognition of structures

A competitivewinner-takes-all architecture for classificatio...

引用

4th IAPR international workshop on graph based representations in pattern recognition, GbRPR 2003

作者： Jain, Brijnesh J. Wysotzki, Fritz Dept. of Electrical Engineering and Computer Science Technical University Berlin Germany

ISBN: (纸本)354040452X

We propose a winner-takes-all (WTA) classifier for structures represented by graphs. WTA classification follows the principle elimination of competition. the input structure is assigned to the class corresponding to the winner of the competition. In experiments we investigate the performance of the WTA classifier and compare it with the canonical maximum similarity (MS) classifier. © Springer-Verlag Berlin Heidelberg 2003.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

graph partition for matching

Graph partition for matching

引用

4th IAPR international workshop on graph based representations in pattern recognition, GbRPR 2003

作者： Qiu, Huaijun Hancock, Edwin R. Department of Computer Science University of York Heslington YorkYO10 5DD United Kingdom

ISBN: (纸本)354040452X

Although inexact graph-matching is a problem of potentially exponential complexity, the problem may be simplified by decomposing the graphs to be matched into smaller subgraphs. If this is done, then the process may cast into a hierarchical framework or cast in a way which is amenable to parallel computation. In this paper we demonstrate how the Fiedler-vector can be used to partition graphs for the purposes of decomposition. We show how the resulting subgraphs can be matched using a variety of algorithms. We demonstrate the utility of the resulting graph-matching method on both real work and synthetic data. Here it proves to provide results which are comparable with a number of stateof- the-art graph matching algorithms. © Springer-Verlag Berlin Heidelberg 2003.

关键词： pattern matching

来源：评论

学校读者我要写书评

暂无评论

4th international workshop on Energy Minimization Methods in Computer Vision and pattern recognition, EMMCVPR 2003

引用

4th international workshop on Energy Minimization Methods in Computer Vision and pattern recognition, EMMCVPR 2003

ISBN: (纸本)3540404988

the proceedings contain 39 papers. the special focus in this conference is on Unsupervised Learning, Matching, Probabilistic Modelling, Segmentation, Grouping, Shape Modelling and Reconstruction. the topics include: Stochastic search for optimal linear representations of images on spaces with orthogonality constraints;curve matching using the fast marching method;EM algorithm for clustering an ensemble of graphs with comb matching;information force clustering using directed trees;active sampling strategies for multihypothesis testing;likelihood based hierarchical clustering and network topology identification;learning mixtures of tree-unions by minimizing description length;hierarchical annealing for random image synthesis;semi-supervised image segmentation by parametric distributional clustering;path variation and image segmentation;a fast snake segmentation method applied to histopathological sections;a compositionality architecture for perceptual feature grouping;using prior shape and points in medical image segmentation;separating a texture from an arbitrary background using pair wise grey level cooccurrences;surface recovery from 3D point data using a combined parametric and geometric flow approach;curvature vector flow to assure convergent deformable models for shape modelling;a MAP estimation algorithm using IIR recursive filters;estimation of rank deficient matrices from partial observations;contextual and non-combinatorial approach to feature extraction;generalized multi-camera scene reconstruction using graph cuts and graph matching using spectral seriation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

graph matching using spectral seriation and string edit distance

Graph matching using spectral seriation and string edit dist...

引用

4th IAPR international workshop on graph based representations in pattern recognition, GbRPR 2003

作者： Robles-Kelly, Antonio Hancock, Edwin R. Department of Computer Science University of York YorkY01 5DD United Kingdom

ISBN: (纸本)354040452X

this paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the formality and rigour of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that string matching techniques can be used. To do this we use graph spectral seriation method to convert the adjacency matrix into a string or sequence order. We show how the serial ordering can be established using the leading eigenvector of the graph adjacency matrix. We pose the problem of graph-matching as maximum a posteriori probability alignment of the seriation sequences for pairs of graphs. this treatment leads to an expression in which for edit cost is the negative logarithm of the a posteriori sequence alignment probability. To compute the string alignment probability we provide models of the edge compatibility error and the probability of individual node correspondences. © Springer-Verlag Berlin Heidelberg 2003.

关键词： pattern matching

来源：评论

学校读者我要写书评

暂无评论

graph clustering using the weighted minimum common supergraph

Graph clustering using the weighted minimum common supergrap...

引用

4th IAPR international workshop on graph based representations in pattern recognition, GbRPR 2003

作者： Bunke, Horst Foggia, P. Guidobaldi, C. Vento, M. Institut für Informatik und angwandte Mathematik Universität Bern Neubrückstrasse 10 BernCH-3012 Switzerland Dipartimento di Informatica e Sistemistica Università di Napoli "Federico II" Via Claudio 21 NapoliI-80125 Italy Dipartimento di Ingegneria dell’Informazione ed Ingegneria Elettrica Università di Salerno via P.te Don Melillo FiscianoSAI-84084 Italy

ISBN: (纸本)354040452X

graphs are a powerful and versatile tool useful for representing patterns in various subfields of science and engineering. In many applications, for example, in pattern recognition and computer vision, it is required to measure the similarity of objects for clustering similar patterns. In this paper a new structural method, the Weighted Minimum Common Supergraph (WMCS), for representing a cluster of patterns is proposed. Using this method it becomes easy to extract the common information shared in the patterns of a cluster and separate this information from noise and distortions that usually affect graphs representing real objects. Moreover, experimental results show that WMCS is suitable for performing graph clustering. © Springer-Verlag Berlin Heidelberg 2003.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Construction of combinatorial pyramids

Construction of combinatorial pyramids

引用

4th IAPR international workshop on graph based representations in pattern recognition, GbRPR 2003

作者： Brun, Luc Kropatsch, Walter G. Université de Reims France Institute for Computer-aided Automation Pattern Recognition and Image Processing Group Vienna Univ. of Technology Austria

ISBN: (纸本)354040452X

Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Each vertex of a reduced graph corresponds to a connected set of vertices in the level below. One connected set of vertices reduced into a single vertex at the above level is called the reduction window of this vertex. In the same way, a connected set of vertices in the base level graph reduced to a single vertex at a given level is called the receptive field of this vertex. the graphs used in the pyramid may be region adjacency graphs, dual graphs or combinatorial maps. this last type of pyramids are called Combinatorial Pyramids. Compared to usual graph data structures, combinatorial maps encode one graph and its dual within a same formalism and offer an explicit encoding of the orientation of edges around vertices. this paper describes the construction scheme of a Combinatorial Pyramid. We also provide a constructive definition of the notions of reduction windows and receptive fields within the Combinatorial Pyramid framework. © Springer-Verlag Berlin Heidelberg 2003.

关键词： graphic methods

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共20页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：