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

Proceedings - International Conference on pattern recognition 2002年第1期16卷 57-60页

作者： Kampel, Martin Sablatnig, Robert Vienna University of Technology Institute of Computer Aided Automation Pattern Recognition and Image Processing Group Favoritenstr.9/183-2 A-1040 Vienna Austria

Classification and reconstruction of archaeological fragments is based on the profile, which is the cross-section of the fragment in the direction of the rotational axis of symmetry. In order to segment the profile into primitives like rim, wall, and base, rules based on expert knowledge are created. The input data for the estimation of the profile is a set of points produced by the acquisition system. A function fitting this set is constructed and later on processed to find the characteristic points necessary to classify the original fragment. The one we propose is based on B-splines or bell-shaped splines. © 2002 IEEE.

关键词： image segmentation

来源：评论

学校读者我要写书评

暂无评论

Combining shape from silhouette and shape from structured light for volume estimation of archaeological vessels

Proceedings - International Conference on Pattern Recognitio...

引用

Proceedings - International Conference on pattern recognition 2002年第1期16卷 364-367页

作者： Sablatnig, Robert Tosovic, Srdan Kampel, Martin Vienna University of Technology Institute of Computer Aided Automation Pattern Recognition and Image Processing Group Favoritenstr. 9 183-2 A-1040 Vienna Austria

An algorithm for the automatic construction of a 3d model of archaeological vessels using two different 3d algorithms is presented. In archeology the determination of the exact volume of arbitrary vessels is of importance since this provides information about the manufacturer and the usage of the vessel. To acquire the 3d shape of objects with handles is complicated, since occlusions of the object's surface are introduced by the handle and can only be resolved by taking multiple views. Therefore, the 3d reconstruction is based on a sequence of images of the object taken from different viewpoints with two different algorithms;shape from silhouette and shape from structured light. The output of both algorithms are then used to construct a single 3d model. Results of the algorithm developed are presented for both synthetic and real input images. © 2002 IEEE.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Logarithmic tapering graph pyramid

Logarithmic tapering graph pyramid

引用

24th German Association for pattern recognition Symposium, DAGM 2002

作者： Haxhimusa, Yll Glantz, Roland Saib, Maamar Langs, Georg Kropatsch, Walter G. Pattern Recognition and Image Processing Group 183/2 Institute for Computer Aided Automation Vienna University of Technology Favoritenstrasse 9 ViennaA-1040 Austria Dipartimento di Informatica Università di Ca’ Foscari di Venezia Via Torino 155 MestreVE30172 Italy

ISBN: (纸本)354044209X

We present a new method to determine contraction kernels for the construction of graph pyramids. The new method works with undirected graphs and yields a reduction factor of at least 2.0. This means that with our method the number of vertices in the subgraph induced by any set of contractible edges is reduced to half or less by a single parallel contraction. Our method yields better reduction factors than the stochastic decimation algorithm, in all tests. The lower bound of the reduction factor becomes crucial with large images. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Mobile robot localization under varying illumination

Mobile robot localization under varying illumination

引用

作者： Jogan, Matjaž Leonardis, Aleš Wildenauer, Horst Bischof, Horst Faculty of Computer and Information Science University of Ljubljana Tržaška 25 1001 Ljubljana Slovenia Pattern Recognition and Image Processing Group Institute for Computer Aided Automation Vienna University of Technology Favoritenstrasse 9/1832 A-1040 Vienna Austria Institute for Computer Graphics and Vision Graz University of Technology Inffeldgasse 16 2. OG A-8010 Graz Austria

Methods for mobile robot localization that use eigenspaces of panoramic snapshots of the environment are in general sensitive to changes in the illumination of the environment. Therefore, we propose an approach which achieves a reliable localization under severe illumination conditions. The method uses gradient filtering of the eigenspace. After testing the approach on images obtained by a mobile robot, we show that it outperforms the standard eigenspace-based recognition method. © 2002 IEEE.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Mobile robot localization under varying illumination

Mobile robot localization under varying illumination

引用

16th International Conference on pattern recognition, ICPR 2002

作者： Jogan, Matjaž Leonardis, Aleš Wildenauer, Horst Bischof, Horst Faculty of Computer and Information Science University of Ljubljana Tržaška 25 Ljubljana1001 Slovenia Pattern Recognition and Image Processing Group Institute for Computer Aided Automation Vienna University of Technology Favoritenstrasse 9/1832 ViennaA-1040 Austria Institute for Computer Graphics and Vision Graz University of Technology Inffeldgasse 16 2. OG GrazA-8010 Austria

ISBN: (纸本)0769516963

Methods for mobile robot localization that use eigen spaces of panoramic snapshots of the environment are in general sensitive to changes in the illumination of the environment. Therefore, we propose an approach which achieves a reliable localization under severe illumination conditions. The method uses gradient filtering of the eigen space. After testing the approach on images obtained by a mobile robot, we show that it outperforms the standard eigen space-based recognition method. © 2002 IEEE.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Skeletons in the framework of graph pyramids 4th

引用

4th International Workshop on Visual Form, IWVF4 2001

作者： Glantz, Roland Kropatsch, Walter G. Pattern Recognition and Image Processing Group 183/2 Institute for Computer Aided Automation Vienna University of Technology Favoritenstr. 9 ViennaA-1040 Austria

ISBN: (纸本)3540421203

Graph pyramids allow to combine pruning of skeletons with a concept known from the representation of line images, i.e. generalization of paths without branchings by single edges. Pruning will enable further generalization of paths and the latter speeds up the former. Within the unified framework of graph pyramids a new hierarchical representation of shape is proposed that comprises the skeleton pyramid, as proposed by Ogniewicz. In particular, the skeleton pyramid can be computed in parallel from any distance map. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Musculoskeletal system

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2001年 2130卷 v页

作者： Dorffner, Georg Bischof, Horst Hornik, Kurt University of Vienna Dept. of Mecidal Cybernetics and Artificial Intelligence Freyung 6/2 Vienna Austria Technical University of Vienna Institute for Computer Aided Automation Pattern Recognition and Image Processing Group Favoritenstr. 9/1832 Vienna Austria Wirtschaftsuniversität Wien Institut für Statistik Augasse 2-6 Wien Austria

来源：评论

学校读者我要写书评

暂无评论

Plane embedding of dually contracted graphs

Plane embedding of dually contracted graphs

引用

9th International Conference on Discrete Geometry for Computer imagery, DGCI 2000

ISBN: (纸本)3540413960

The use of plane graphs for the description of image structure and shape representation poses two problems : (1) how to obtain the set of vertices, the set of edges and the incidence relation of the graph, and (2) how to embed the graph into the plane image. Initially, the image is represented by an embedded graph G in a straight forward manner, i.e. the edges of G represent the 4-connectivity of the pixels. Let G¯ denote a (planar) abstract dual of G. Dual graph contraction is used to reduce the pair (G¯,G) to a pair (H¯,H) of planar abstract duals. Dual graph contraction is unsymmetric due to an extra condition on the choice of the contraction kernels in G. This condition is shown to be necessary and sufficient for H to be embedded onto G. The embedding is applied to the description of image structure and to shape representation. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Nearness in digital images and proximity spaces

Nearness in digital images and proximity spaces

引用

9th International Conference on Discrete Geometry for Computer imagery, DGCI 2000

作者： Pták, Pavel Kropatsch, Walter G. CMP – Czech Technical University Center for Machine Perception Karlovo nám. 13 Praha 2121 35 Czech Republic Institute of Computer Aided Automation 183/2 Vienna University of Technology Pattern Recognition and Image Processing Group Favoritenstr.9 WienA-1040 Austria

ISBN: (纸本)3540413960

The concept of "nearness", which has been dealt with as soon as one started studying digital images, finds one of its rigorous forms in the notion of proximity space. It is this notion, together with "nearness preserving mappings", that we investigate in this paper. We first review basic examples as they naturally occur in digital topologies, making also brief comparison studies with other concepts in digital geometry. After this we characterize proximally continuous mappings in metric spaces. Finally, we show by example that the "proximite complexity" of a finite covering in a digital picture may be too high to be adequately depicted in a finite topological space. This combinatorial result may indicate another conceptual advantage of proximities over topologies. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

On estimating the position of fragments on rotational symmetric pottery 2

On estimating the position of fragments on rotational symmet...

引用

2nd International Conference on 3-D Digital Imaging and Modeling, 3DIM 1999

作者： Sablatnig, Robert Menard, Christian Vienna University of Technology Institute of Computer Aided Automation Pattern Recognition and Image Processing Group Treitlstr. 3 183-2 WienA-1040 Austria

ISBN: (纸本)0769500625

The activation of ancient vessel-fragments is a time consuming but important task for archaeologists. The basis for classification and reconstruction is the profile which is the cross-section of the fragment in the direction of the rotational axis of symmetry. Hence the position of a fragment (orientation) on a vessel is important. In this work the estimation of the axis of rotation out of range data by using a Hough inspired method is proposed. In order to avoid outliers a robust method for estimation of the axis is used. Classification and reconstruction are performed in a bottom-up manner using a description language, which holds all features of the fragment as primitives and all properties among features as relations. Classification of newly found fragments of unknown type is performed by comparing the description of the new fragment with the description of already classified fragments by completing graph similarity. The sub-graph with the highest similarity is then used to reconstruct the complete vessel out of the fragment. © 1999 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：