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

International Conference on 3D Imaging, Modeling, processing, Visualization and Transmission (3DIMPVT)

作者： S. Tosovic R. Sablatnig Institute of Computer Aided Automation Pattern Recognition and Image Processing Group University of Technology Vienna Vienna Austria

ISBN: (纸本)0769509843

An algorithm for the automatic construction of a 3D model of archaeological vessels 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 shape of objects with handles in 3d 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. The object's silhouette is the only feature which is extracted from an input image. images are acquired by rotating the object on a turntable in front of a stationary camera. The algorithm uses an octree representation of the model, and builds this model incrementally, by performing limited processing of all input images for each level of the octree. Beginning from the root node at the level 0 a rough model of the object is obtained quickly and is refined as the processed level of the octree increases. Results of the algorithm developed are presented for both synthetic and real input images.

关键词： Shape Cameras Automation pattern recognition image processing Manufacturing image reconstruction Feature extraction Ceramics Distortion measurement

来源：评论

学校读者我要写书评

暂无评论

Illumination insensitive eigenspaces

Illumination insensitive eigenspaces

引用

International Conference on Computer Vision (ICCV)

作者： H. Bischof H. Wildenauer A. Leonardis Pattern Recognition and Image Processing Group University of Technology Vienna Vienna Austria Faculty of Computer and Information Science University of Ljubljana Ljubljana Slovenia

ISBN: (纸本)0769511430

Variations in illumination can have a dramatic effect on the appearance of an object in an image. In this paper we propose how to deal with illumination variations in eigenspace methods. We demonstrate that the eigenimages obtained by a training set under a single illumination condition (ambient light) can be used for recognition of objects taken under different illumination conditions. The major idea is to incorporate a set of gradient based filter banks into the eigenspace recognition framework. This can be achieved since the eigenimage coefficients are invariant for linearly filtered images (input and eigenimages). To achieve further illumination insensitivity we devised a robust procedure for coefficient recovery. The proposed approach has been extensively evaluated on a set of 2160 images and the results were compared to other approaches.

关键词： Lighting Nonlinear filters Principal component analysis image coding Object recognition Filtering Filter bank image recognition Information science image sampling

来源：评论

学校读者我要写书评

暂无评论

Terrain Simplification Research in Augmented Scene Modeling

引用

Journal of China university of Geosciences 2001年第4期12卷 351-355页

作者： Ming Delie You Kefei Tian Jinwen Liu Jian State Key Laboratory for image processing and Intelligent Control, Institute for pattern recognition and Artificial Intelligence , Huazhong university of Science and technology , Wuhan 430074 Wang Guangju State Key Laboratory for Image Processing and Intelligent Control Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 Faculty of Information Engineering China University of Geosciences Wuhan 430074

Augmented reality is the merging of synthetic sensory information into a user's perception of a real environment. As one of the most important tasks in augmented scene modeling, terrain simplification research has gained more and more attention. In this paper, we mainly focus on point selection problem in terrain simplification using triangulated irregular network. Based on the analysis and comparison of traditional importance measures for each input point, we put forward a new importance measure based on local entropy. The results demonstrate that the local entropy criterion has a better performance than any traditional methods. In addition, it can effectively conquer the 'short-sight' problem associated with the traditional methods.

关键词： augmented reality scene modeling terrain simplification triangulated irregular network importance measures local entropy.

来源：评论

学校读者我要写书评

暂无评论

A new approach of color quantization of image based on neural network

A new approach of color quantization of image based on neura...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Yingqian Wu Cuiping Yang Tianzhen Wang Institute of Image processing and Pattern recognition Shanghai Jiaotong University Shanghai China Institute of Image processing Wuhan University of Science and Technology Wuhan China

ISBN: (纸本)0780370449

In the paper, a new algorithm using a competitive Hopfield neural network for color quantization is proposed, and it completes two tasks of color palette design and pixels color mapping based on the pixel color value distribution. Results of the experiment show that the approach has the advantages of fast convergent speed and high quantization.

关键词： Neural networks Color Hopfield neural networks Quantization Pixel image processing image converters pattern recognition Paper technology Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Memory efficient fingerprint verification

Memory efficient fingerprint verification

引用

IEEE International Conference on image processing

作者： C. Beleznai H. Ramoser B. Wachmann J. Birchbauer H. Bischof W. Kropatsch Advanced Computer Vision Austrian Research Centre Seibersdorf Vienna Austria Programm-und Systementwicklung Siemens AG Österreich Graz Austria Pattern Recognition and Image Processing Group University of Technology Vienna Vienna Austria

Fingerprint recognition and verification are often based on local fingerprint features, usually ridge endings or terminations, also called minutiae. By exploiting the structural uniqueness of the image region around a minutia, the fingerprint recognition performance can be significantly enhanced. However, for most fingerprint images the number of minutia image regions (MIRs) becomes dramatically large, which imposes - especially for embedded systems - an enormous memory requirement. Therefore, we are investigating different algorithms for compression of minutia regions. The requirement for these algorithms is to achieve a high compression rate (about 20) with minimum loss in the matching performance of minutia image region matching. We investigate the matching performance for compression algorithms based on the principal component and the wavelet transformation. The matching results are presented in form of normalized ROC curves and interpreted in terms of compression rates and the MIR dimension.

关键词： Fingerprint recognition image coding Computer vision image recognition image processing image matching Embedded system Performance loss Biometrics Character recognition

来源：评论

学校读者我要写书评

暂无评论

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

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

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

来源：评论

学校读者我要写书评

暂无评论

Robust Parametric and Semi-parametric Spot Fitting for Spot Array images 8

Robust Parametric and Semi-parametric Spot Fitting for Spot ...

引用

8th International Conference on Intelligent Systems for Molecular Biology, ISMB 2000

作者： Brändle, Norbert Chen, Horng-Yang Bischof, Horst Lapp, Hilmar Vienna University of Technology Pattern Recognition and Image Processing Group Treitlstr. 3/1832 ViennaA-1040 Austria Novartis Research Institute Vienna Genetics Brunner Str. 59 ViennaA-1230 Austria

ISBN: (纸本)1577351150

In this paper we address the problem of reliably fitting parametric and semi-parametric models to spots in high density spot array images obtained in gene expression experiments. The goal is to measure the amount of label bound to an array element. A lot of spots can be modelled accurately by a Gaussian shape. In order to deal with highly overlapping spots we use robust M-estimators. When the parametric method fails (which can be detected automatically) we use a novel, robust semi-parametric method which can handle spots of different shapes accurately. The introduced techniques are evaluated experimentally. Copyright © 2000, American Association for Artificial Intelligence (***). All rights reserved.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Estimating the next sensor position based on surface characteristics

Estimating the next sensor position based on surface charact...

引用

International Conference on pattern recognition

作者： C. Liska R. Sablatnig Austrian Research Centre Seibersdorf Vienna Austria Pattern Recognition and Image Processing Group University of Technology Vienna Vienna Austria

ISBN: (纸本)0769507506

In order to reconstruct the viewable surface of an object completely, multiple views of the same object have to be used and integrated into a common coordinate system. One of the major problems of the 3D surface reconstruction using a turntable, is the varying resolution in the direction to the camera, due to the varying distance of object points to the rotational axis of the turntable. To guarantee a uniform object resolution, we calculate the next angle dynamically, depending on the entropy of the surface part actually acquired. To minimize the loss of information and to guarantee a uniform surface resolution, we derive a relation between the entropy and the next viewing angle, based on the profile sections acquired in the last two steps of the acquisition.

关键词： Sensor phenomena and characterization Surface reconstruction image reconstruction Cameras Entropy Position measurement Shape measurement Java pattern recognition image processing

来源：评论

学校读者我要写书评

暂无评论

A new approach to finite wordlength coefficient fir digital filter design using the branch and bound technique 10

A new approach to finite wordlength coefficient fir digital ...

引用

2000 10th European Signal processing Conference, EUSIPCO 2000

作者： Belbachir, A.N. Boulerial, B. Belbachir, M.F. Signal and System Laboratory Electronic Institute U.S.T.O. B.P. 1505 El Mnouer Oran Algeria Vienna University of Technology Pattern Recognition and Image Processing Group Favritenstr. 9/1832 ViennaA-1040 Austria

ISBN: (纸本)9789521504433

It has been shown that the branch and bound technique is effective for the design of finite wordlength optimal digital filters. This technique is however expensive in computing time. In this paper, we present a robust branch and bound branching strategy named Sequential and Progressive Search, improving the design of filters on a large wordlength processor in a reasonable computing cost. The details of the algorithm and many examples are given and compared to the other methods. © 2000 EUSIPCO.

关键词： Digital filters

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：