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

IEEE Workshop on Applications of computer vision (WACV)

作者： R. Singh M.C. Wade N.P. Papanikolopoulos Artificial Intelligence Robotics and Vision Laboratory Department of Computer Science and Engineering University of Minnesota Minneapolis MN USA

We present a method for determining the skeletal shape description for letters in texts faded due to ageing and/or poor ink quality. The proposed algorithm is interesting in that it neither involves assumptions about demarcation of object regions from the background, nor does it require pixel connectivity in the text regions. Consequently, it may be applied for obtaining the shape descriptions of "sparse" regions, which are characteristic of letters in faded documents. Given the pixel distribution for a letter or a word from a faded document, the method involves an iterative evolution of a piecewise-linear approximation of the principal curve of this pixel distribution. By constraining the principal curve to lie on the edges of the Delaunay triangulation of the shape distribution, the adjacency relationships between regions in the shape can be detected and used in evolving the skeleton. The approximation of the principal curve, on convergence, gives the final skeletal shape. The skeletonization is invariant to Euclidean transformations and is adaptive in terms of the topology of the underlying shape distribution as well as in the number of units needed for the piece-wise approximation of the principal curve.

关键词： Shape Skeleton Text analysis Degradation Aging Artificial intelligence Intelligent robots Robot vision systems Laboratories Ink

来源：评论

学校读者我要写书评

暂无评论

Multiscale compression of planar curves using constant curvature segments

Multiscale compression of planar curves using constant curva...

引用

International Conference on Pattern Recognition

作者： M. Mokhtari R. Bergevin Computer Vision and Systems Laboratory Department of Electrical and Computer Engineering Laval University Sainte-Foy QUE Canada

Proposes an approach to finding minimal descriptions of planar curves (open or closed) as sets of constant curvature segments (primitives such as straight line segments and/or circular arcs). The algorithm proceeds according to a multiscale segmentation and approximation of curves, and an intra- and inter-scale classification of this overall process. Its ultimate goal is to find a set of adequate pairs composed of one scale and one or several set(s) of constant curvature segments to best describe the shape of a curve.

关键词： Shape computer vision Laboratories Testing Databases Approximation algorithms Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Decentralized Predictive Control of Large Scale Systems Using Neuro-Fuzzy Identifiers for their Interconnections

引用

IFAC Proceedings Volumes 1998年第12期31卷 35-40页

作者： Spyros Tzafestas Efthimios Kyriannakis George Apostolikas Intelligent Robotics and Automation Laboratory Department of Electrical and Computer Engineering National Technical University of Athens Zographou 15773 Athens Greece.

This paper proposes an approach for the design of discrete-time decentralized control systems covering not only the case of m-step delay sharing information pattern, but also any general nonclassical information pattern where the non-local information is not spread among the subsystems. It employs the model-based predictive control (MBPC) scheme combined with fuzzy prediction for the interconnections among the subsystems. A state space model is used at each control station to predict the corresponding subsystem output over a long-range time period. The interaction trajectories are considered to be non-linear functions of the states of the subsystems. In all cases, the interconnections and the necessary predictions for them are estimated by an appropriate neuro-fuzzy identifier trained on-line using the back-propagation training algorithm. Representative computer simulation results are provided and compared for nontrivial example systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Fuzzy Adaptive - Predictive Scheme for the Decentralized Control of a Class of Interconnected Systems

引用

IFAC Proceedings Volumes 1998年第20期31卷 1097-1102页

This paper proposes an approach for the design of discrete-time decentralized control systems with m-step delay sharing information pattern, employing the modelbased predictive control (MBPC) scheme combined with fuzzy prediction for the interconnections among the subsystems. A state-space model is used at each control station to predict the corresponding subsystem output over a long-range time period. The interaction trajectories are considered to be non-linear functions of the states of the subsystems. For all cases the interconnections and the necessary predictions for them are estimated by an appropriate adaptive fuzzy identifier based on the generation of linguistic IF-THEN rules and the on-line construction of a common fuzzy rule base. Representative computer simulation results are provided and compared for nontrivial example systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Novel surface registration using the grid closest point (GCP) transform

引用

IEEE International Conference on Image Processing

作者： S.M. Yamany M.N. Ahmed E.E. Hemayed A.A. Farag Computer Vision and Image Processing Laboratory Electrical Engineering Department University of Louisville Louisville KY USA

ISBN: (纸本)0818688211

A novel approach has been developed for fast registration of two sets of 3-D curves or surfaces. The technique is an extension of Besl and Mackay's (1992) iterative closest point (ICP) algorithm. This technique solves the computational complexity associated with the ICP algorithm by applying a novel grid closest point (GCP) transform and a genetic algorithm to minimize the cost function. A detailed description of the algorithm is presented along with a comparison of its performance versus several registration techniques. Two applications are presented in this paper. In the first, the algorithm is used to register 2-D head contours extracted from CT/MRI data to correct for possible mis-alignment caused by motion artifacts during scanning. In the second, the algorithm is used to register 3-D segments of the human jaw obtained using the shape from shading technique. Registration using the GCP/GA technique is found to be significantly faster and of comparable accuracy than two popular techniques in the computer vision and medical imaging literature.

关键词： Iterative algorithms Iterative closest point algorithm Computational complexity Genetic algorithms Cost function Head Data mining Computed tomography Magnetic resonance imaging Registers

来源：评论

学校读者我要写书评

暂无评论

A system for human jaw modeling using intra-oral images

A system for human jaw modeling using intra-oral images

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society (EMBC)

作者： S.M. Yamany A.A. Farag Computer Vision and Image Processing Laboratory Department of Electrical Engineering University of Louisville Louisville KY USA

A novel integrated system is developed to obtain a record of the patient's occlusion using computer vision. Data acquisition is obtained using intra-oral video camera. A modified Shape from Shading (SFS) technique using perspective projection and camera calibration is then used to extract accurate 3D information from a sequence of 2D images of the jaw. A novel technique for 3D data registration using Grid Closest Point (GCP) transform and genetic algorithms (GA) is used to register the output of the SFS stage. Triangulization is then performed, and a solid 3D model is obtained via a rapid prototype machine. The overall purpose of this research is to develop a model-based vision system for orthodontics that will replace traditional approaches and can be used in diagnosis, treatment planning, surgical simulation and implant purposes.

关键词： Humans Cameras computer vision Data acquisition Shape Calibration Data mining Genetic algorithms Solid modeling Prototypes

来源：评论

学校读者我要写书评

暂无评论

Generically sufficient conditions for exact multichannel blind image restoration

Generically sufficient conditions for exact multichannel bli...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Hung-Ta Pai J.W. Havlicek A.C. Bovik Laboratory for Vision Systems Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

We have previously developed an algorithm and sufficient conditions for exact multichannel blind image restoration. In this paper, we use the resultant matrix theorem and techniques of algebraic geometry to prove that the sufficient conditions hold generically given three blurred versions of the same image and some restrictions on the size of the original image. Moreover, the extension to multichannel blind n-dimensional signal restoration is described.

关键词： Sufficient conditions Image restoration Signal restoration Geometry Polynomials Laboratories Machine vision Noise figure

来源：评论

学校读者我要写书评

暂无评论

Generalized Hermite polynomials for image reconstruction from zero crossing contours

引用

IEEE International Conference on Image Processing

作者： Y.V. Venkatesh Computer Vision and Artificial Intelligence Laboratory Department of Electrical Engineering Indian Institute of Science Bangalore India

ISBN: (纸本)0818688211

Generalized Hermite polynomials in two variables are employed for the reconstruction of images from a knowledge of their zero crossing contours. The problem of reconstruction of signals as functions of two variables is not a mere extension of that of a single variable. This is a consequence of the fact that the spatial and spectral characteristics of two-variable functions are quite distinct from what one can expect from their separate projections on to the coordinate axes. One of the results of the paper is that we cannot guarantee uniqueness in reconstruction unless we impose certain constraints on, for instance, space-bandwidth products/ratios in the x/spl omega//sub x/, y/spl omega//sub y/ directions, of the unknown image. Further, a distinguishing feature of the proposed approach is that the standard assumption of bandlimitedness is not invoked. The proposed framework is believed to provide a more unified procedure for signal reconstruction (of uni- and multi-dimensional signals) from partial information than most of the results of the literature. For lack of space, only the main analytical and computational results are presented.

关键词： Polynomials Image reconstruction Filtering theory Image analysis Signal processing algorithms Geometry computer vision Artificial intelligence Laboratories Signal reconstruction

来源：评论

学校读者我要写书评

暂无评论

Modeling of growth via active contour models

Modeling of growth via active contour models

引用

IEEE Southwest Symposium on Image Analysis and Interpretation

作者： K.C. Suriamoorthy A.C. Bovik Laboratory for Vision Systems Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

The authors analyze the growth of biological specimens with the help of Active Contour Models known as Snakes. Conventional shape-change models like optical flow, deformable templates, etc., primarily address rigid and non-rigid deformations which are not in the form of growth. Moreover the above models assume the shape-change between successive frames in an image sequence to be small which is not true in many real-world biomedical image sequences. The Active Contour Model presented here tracks the boundary of an object as it changes shape and can also predict how the object might change shape. The algorithm is an energy minimization technique which tracks the growth of a specimen by attracting a closed piecewise cubic curve to the boundary of the specimen in every image of a sequence. This method computes shape-change especially when it is in the form of growth-better than techniques like optical flow, deformable templates, etc. Unlike conventional shape-change algorithms, the authors' algorithm can be applied iteratively to compute drastic shape-changes also. The authors also propose a parallel framework to facilitate real-time implementation.

关键词： Active contours Biological system modeling Biomedical optical imaging Image motion analysis Active shape model Iterative algorithms Deformable models Image sequences Predictive models Minimization methods

来源：评论

学校读者我要写书评

暂无评论

Range data merging for probabilistic octree modeling of 3D workspaces

Range data merging for probabilistic octree modeling of 3D w...

引用

IEEE International Conference on robotics and Automation (ICRA)

作者： P. Payeur D. Laurendeau C.M. Gosselin Computer Vision and Digital Systems Laboratory Department of Electrical and Computer Engineering Laval University Sainte Foy QUE Canada Computer Vision and Digital Systems Laboratory Department of Mechanical Engineering Laval University Sainte Foy QUE Canada

In a previous paper by Payeur et al. (1997), probabilistic occupancy modeling has been successfully extended to 3D environments by means of a closed-form approximation of the probability distribution. In this paper, the closed-form approximation is revisited in order to provide more reliable and meaningful models. A merging strategy of local probabilistic occupancy grids originating from each sensor viewpoint is introduced. The merging process takes advantage of the multiresolution characteristics of octrees to minimize the computational complexity and enhance performances. An experimental testbed is used to validate the approach and models computed from real range images are presented.

关键词： Merging computer vision Testing Layout Computational complexity Power system modeling Data structures Bayesian methods Digital systems Distributed computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：