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

6th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2000

作者： Zhao, Shuyan Shi, Pengfei Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai 200030 China

ISBN: (纸本)3540679251

Segmentation of connected handwritten Chinese characters is a very difficult task in document image analysis. In this paper, a novel algorithm based on stroke analysis and background thinning is proposed to segment connected handwritten Chinese characters. The feature points, viz. end points, fork points and corner points are detected in the thinned image. The segments between feature points are considered as substrokes and are extracted. Lengths of substrokes and the topological relations between them are employed to locate connected point. A new method based on background thinning is developed to decide a proper segmentation path. The experimental results show that satisfactory performance is achieved by the presented method for segmentation of connected handwritten Chinese characters. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

Grouping edge points into line segments by sequential hough transformation

Grouping edge points into line segments by sequential hough ...

引用

15th International Conference on pattern recognition, ICPR 2000

作者： Zhang, Xiaofeng Burkhardt, Hans Pattern Recognition and Image Processing Dept. of Computer Science University of Freiburg Freiburg79110 Germany

ISBN: (纸本)0769507506

An algorithm to group edge points into digital line segments with Hough transformation is described in this paper. The edge points are mapped onto the parameter domain dis-cretked at specific intervals, on which peaks appear to represent different line segments. By modeling each peak as a Gaussian function in the parameter domain, a region, to which the edge points are supposed to be mapped, is determined. Then the edge points are grouped and the parameters for a line segment are computed. For the edges including multiple line segments, a sequential Hough transformation, detecting peaks one by one in the parameter domain, is implemented and the points from the region around each peak are grouped, thus the line segments are described. Experiments show the robustness of the algorithm implemented on both generated edges disturbed by different noise levels and real images taken from indoor environment. © 2000 IEEE.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A limited lattice structure for incremental association mining 6th

A limited lattice structure for incremental association mini...

引用

6th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2000

作者： Zhao, Yi Shi, Jianliang Shi, Pengfei Institute of Image Processing and Pattern Recognition Shanghai Jiaotong University Shanghai200030 China Guoxin Lucent Teciinologies Network Teclmologies Co. Ltd Pudong Shanghai200122 China

ISBN: (纸本)3540679251

An association rule typically strives for discovering a dependency among attributes with respect to the externally defined parameters like support threshold and confidence threshold. As an important database discovery method, the kernel of association rule mining is the acquisition of large itemsets. It is an important field of data mining to represent the support and confidence of items that are purchased together in supermarket domain. In this paper, a novel limited concept lattice is first proposed for the transaction data itemsets modeling. Concept lattice is a form of a concept hierarchy in which each node represents a subset of objects (extent) with their common properties (intent). The Hasse diagram of the lattice represents a generalization/specialization relationship between the concepts. Therefore, the lattice and Hasse diagram corresponding to a set of objects described by some properties can be used as an effective tool for symbolic data analysis and knowledge acquisition. Based on this lattice structure, an algorithm, LCLL, is presented to incrementally generate large itemsets visually. The algorithm works by means of attaching frequency information to each lattice node, the corresponding support measure can be obtained with the limited lattice. Besides, the edges in the Hasse diagram of the new lattice must be modified: the generator of a new node is always its child, and original parent of the generator is updated. When a node is deleted till the frequency value turns to zero, the node and the edges between its parents and children are not deleted, but tagged. The key point lies in adding edges when searching for the new node’s parents, the large itemsets can be obtained by judging whether the cardinal and frequency value of the node exceeds the threshold or not. And accordingly, association rules can be identified. The approach is especially efficient when the database is dynamically updated (insertion, deletion or simultaneous insertion and deletion

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Invariant grey-scale features for 3D sensor-data

Invariant grey-scale features for 3D sensor-data

引用

International Conference on pattern recognition

作者： M. Schael S. Siggelkow Institute for Pattern Recognition and Image Processing Computer Science Department University of Freiburg Freiberg Germany

ISBN: (纸本)0769507506

A technique for the construction of invariant features of 3D sensor-data is proposed. Invariant grey-scale features are characteristics of grey-scale sensor-data which remain constant if the sensor-data is transformed according to the action of a transformation group. The proposed features are capable of recognizing 3D objects independent of their orientation and position, which can be used e.g. in medical image analysis. The computation of the proposed invariants needs no preprocessing like filtering, segmentation, or registration. After the introduction of the general theory for the construction of invariant features for 3D sensor-data, the paper focuses on the special case of 3D Euclidean motion which is typical for rigid 3D objects. Due to the fact that we use the function of local support the calculated invariants are also robust with respect to independent Euclidean motion, articulated objects, and even topological deformations. The complexity of the method is linear in the data-set size which may be too high for large 3D objects. Therefore approaches for the acceleration of the computation are given. First experimental results for artificial 3D objects are presented in the paper to demonstrate the invariant properties of the proposed features.

关键词： Geometry pattern recognition Biomedical imaging Robustness image processing Computer science image recognition image motion analysis Lubricating oils image segmentation

来源：评论

学校读者我要写书评

暂无评论

Gravel image Segmentation in Noisy Background Based on Partial Entropy Method

引用

中国地质大学学报(英文版) 2000年第1期11卷 92-94页

作者： Wang Guangjun Tian Jinwen Chen Zhenyu Liu Jian Wu Guoping 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

Because of wide variation in gray levels and particle dimensions and the presence of many small gravel objects in the background, as well as corrupting the image by noise, it is difficult o segment gravel objects. In this paper, we develop a partial entropy method and succeed to realize gravel objects segmentation. We give entropy principles and fur calculation methods. Moreover, we use minimum entropy error automaticly to select a threshold to segment image. We introduce the filter method using mathematical morphology. The segment experiments are performed by using different window dimensions for a group of gravel image and demonstrates that this method has high segmentation rate and low noise sensitivity.

关键词： partial entropy segmentation mathematical morphology gravel threshold filter

来源：评论

学校读者我要写书评

暂无评论

A Modified Dense Displacement Field Estimation Algorithm Combined with Block-matching Method

A Modified Dense Displacement Field Estimation Algorithm Com...

引用

2000年第16届世界计算机大会

作者： Guo Fengjun YangXin Wilfried Philips Shi Penfei Institute of Image Processing & Pattern Recognition Shanghai Jiao Tong University TELIN Department Ghent University

In this paper,we presented a displacement field estimation algorithm based on a relaxed smoothness constraint;this algorithmcan preserve discontinuities in the displacement field to some *** image data is irregular and the images are noisy,the method produces some big residual errors in the residual *** this paper we propose an improved displacement field estimation algorithm which uses the displacement information obtained using blockmatching to modify the matching *** results show,this leads to smaller residual error maps, without introducing block artefacts,as would happen in the case of simple block matching when there is much noise in the *** the displacement filed using this method is more consistent than using a method without additional block matching.

关键词： image matching displacement field discontinuity preservation elastic matching conjugate gradient method block-matching.

来源：评论

学校读者我要写书评

暂无评论

Grouping edge points into line segments by sequential Hough transformation

Grouping edge points into line segments by sequential Hough ...

引用

International Conference on pattern recognition

作者： Xiaofeng Zhang H. Burkhardt Chair of Pattern Recognition and Image Processing Department of Computer Science University of Freiburg Freiburg im Breisgau Germany

ISBN: (纸本)0769507506

An algorithm to group edge points into digital line segments with Hough transformation is described. The edge points are mapped onto the parameter domain discretized at specific intervals, on which peaks appear to represent different line segments. By modeling each peak as a Gaussian function in the parameter domain, a region to which the edge points are supposed to be mapped is determined. Then the edge points are grouped and the parameters for a line segment are computed. For the edges including multiple line segments, a sequential Hough transformation for detecting peaks one by one in the parameter domain is implemented, and the points from the region around each peak are grouped, thus the line segments are described. Experiments show the robustness of the algorithm implemented on both the generated edges disturbed by different noise levels and real images taken from an indoor environment.

关键词： image segmentation image edge detection Indoor environments Face detection pattern recognition image processing Computer science Noise robustness Noise level Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Polarization images: a geometric interpretation for shape analysis

Polarization images: a geometric interpretation for shape an...

引用

International Conference on pattern recognition

作者： S. Rahmann Institute for Pattern Recognition and Image Processing Computer Science Department University of Freiburg Freiburg im Breisgau Germany

ISBN: (纸本)0769507506

Presents a framework for the geometric interpretation of a single polarization image taken of specular reflecting objects. The task of recovering 3D shape information of specular objects from intensity images is a difficult if not impossible one, as no intensity based features are available. Polarization analysis provides additional features to overcome the problem. In particular the orientation of polarized light is measured, from which constraints on the object surface can be deduced. We show how to perform shape analysis from a single polarization image. The method is applied to local deformation measuring. Along with a discussion of polarization and related geometric issues, algorithms are presented and substantiated by experiments.

关键词： Shape image analysis Optical polarization Optical reflection Rough surfaces Surface roughness Surface reconstruction Performance analysis Lighting image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：