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

IEEE International Conference on Systems, Man and Cybernetics

作者： H.P. Gadagkar M.M. Trivedi Computer Vision and Robotics Research Laboratory Electrical and Computer Engineering Department University of Tennessee Knoxville TN USA

A description is given of research efforts directed towards the development of an active exploration system performing acquisition, processing, and integration of sensory inputs from vision, point laser range, tactile, and force/torque sensors. An attempt is made to bring out the rationale that robotic workcell exploration can benefit by utilizing noncontact (e.g., vision, range, and proximity) as well as contact (e.g., tactile and force/torque) sensors while accomplishing tasks such as object identification, object localization, object grasping and object manipulation. The experimental results presented indicate that the rationale utilized in the design of the multisensory robotic active exploration scheme can work successfully.< >

关键词： Robot sensing systems Sensor phenomena and characterization Robot vision systems Force sensors Torque Tactile sensors Humans Capacitive sensors computer vision Laboratories

来源：评论

学校读者我要写书评

暂无评论

Asymptotics of predictive stochastic complexity

Asymptotics of predictive stochastic complexity

引用

Data Compression Conference (DCC)

作者： L. Gerencser Computer Vision and Robotics Laboratory McGill Research Centre for Intelligent Machines McGill University Montreal QUE Canada

This paper presents the basic ideas of the theory of stochastic complexity with rigorous asymptotic results in the field of time-series analysis and system identification, which demonstrate the applicability of stocha... 详细信息

关键词： Stochastic processes robotics and automation Stochastic systems Density functional theory computer vision Intelligent robots Robot vision systems Laboratories Telephony Time series analysis

来源：评论

学校读者我要写书评

暂无评论

On the complexity of computing equilibria for nonsymmetric analog networks

On the complexity of computing equilibria for nonsymmetric a...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： D.A. Miller S.W. Sucker Computer Vision and Robotics Laboratory Research Center of Intelligent Machines McGill University Montreal Canada Comput. Vision & Robotics Lab. McGill Univ. Montreal Que. Canada

The authors ask what is the complexity of computing equilibria for physically realizable analog networks like those of J.J. Hopfield (1984) and T.J. Sejnowski (1981) with arbitrary connectivity. It is shown that, if the amplifiers are piecewise-linear, then such networks are instances of a game-theoretic model known as polymatrix games. Equilibria for the latter may be computed by vertex pivoting algorithms similar to the simplex method for linear programming, which are in practice of low order polynomial complexity. These algorithms appear to be the only ones both guaranteed to work and which are polynomial in practice. These results suggest that networks with few nonstable equilibria would be computationally attractive.< >

关键词： Analog computers computer networks Polynomials Biology computing NP-hard problem computer vision Physics computing Piecewise linear techniques Intelligent robots Robot vision systems

来源：评论

学校读者我要写书评

暂无评论

Curvature consistency improves local shading analysis

Curvature consistency improves local shading analysis

引用

International Conference on Pattern Recognition

作者： F.P. Ferrie J. Lagarde Computer Vision and Robotics Laboratory McGill Research Center for Intelligent Machines McGill University Montreal QUE Canada

The authors describe how a surface reconstruction algorithm based on minimizing the variation of surface curvature can be used to stabilize and correct the results of local shading analysis. The approach is viewpoint independent and applicable to any process that can provide estimates of local surface orientation. The assumptions used in formulating the minimization are derived from standard differential geometry. When applied as a second stage of processing after local shading analysis, the algorithm can recover a close approximation of the true surface orientation under realistic assumptions about image noise. Results are presented that show the performance of the algorithm on synthetic and real data. In particular, they demonstrate how this form of reconstruction can compensate for some of the shape distortion incurred in local shading analysis.< >

关键词： Surface reconstruction Shape Geometry Intelligent robots Image reconstruction Image analysis Noise shaping Minimization methods Robustness computer vision

来源：评论

学校读者我要写书评

暂无评论

From uncertainty to visual exploration

From uncertainty to visual exploration

引用

International Conference on computer vision (ICCV)

作者： P. Whaite F.P. Ferrie Computer Vision and Robotics Laboratory McGill Research Center for Intelligent Machines McGill University Montreal QUE Canada

The question posed is what can be inferred from ambiguity in processes of visual interpretation? Much emphasis is naturally placed on the form of constraints used to minimize ambiguity, particularly as they pertain to such issues as perceptual acceptability. The authors feel that it is perhaps more instructive to consider what can be learned from situations where different interpretations of data are possible, i.e., the ambiguity of perception. This immediately raises a number of issues regarding the characterization of ambiguity, communicating it to other visual processes, and using ambiguity to further refine visual interpretation. The context in which the authors discuss these problems is the interpretation of scene geometry in the form of volumetric models. They describe a representation for ambiguity in terms of an ellipsoid of confidence in which there is a finite probability that the true parameters of the model can be found.< >

关键词： Uncertainty Layout Ellipsoids Intelligent robots Solid modeling Measurement errors computer vision Robot vision systems Laboratories Machine intelligence

来源：评论

学校读者我要写书评

暂无评论

Extraction of line drawing features for object recognition

Extraction of line drawing features for object recognition

引用

International Conference on Pattern Recognition

作者： R. Bergevin M.D. Levine Computer Vision and Robotics Laboratory McGill Research Center for Intelligent Machines McGill University Montreal QUE Canada

The authors describe the geometrical criteria which define viewpoint-invariant features to be extracted from 2-D line drawings of 3-D objects. They also discuss the extraction of these features, which forms the initial stage of a generic object recognition system, the Primal Access Recognition of Visual Objects (PARVO) system. In this system, part-based qualitative descriptions are built and matched to coarse 3-D object models for recognition. The segmentation and labeling of the constituent parts of an object rely on the 3-D properties inferred from the presence of its 2-D features. The original motivation for PARVO its recognition by components, a theory of human image understanding from the field of psychology. Definitions of the geometrical criteria defining the viewpoint-invariant features are introduced. Examples of results obtained by applying these criteria to a typical line drawing are shown.< >

关键词： Object recognition computer vision Humans Feature extraction Intelligent robots Image segmentation Labeling Psychology Robot vision systems Laboratories

来源：评论

学校读者我要写书评

暂无评论

A DATABASE DESIGN FOR THE RUNTIME ENVIRONMENT OF A ROBOTIC WORKCELL

引用

robotics AND computer-INTEGRATED MANUFACTURING 1989年第1期5卷 21-31页

作者： FREEDMAN, P MICHAUD, C CARAYANNIS, G MALOWANY, A Computer Vision and Robotics Laboratory McGill Research Centre for Intelligent Machines McGill University Montréal Québec Canada

Intelligent robotic workcell activities have come to require a database framework for arranging, storing and accessing information in real-time about the workcell environment in a standard way. After a brief introduction to the theory of databases (DB), we examine the general topic of robotic workcells, identify characteristics typical of robotic applications, and then present a survey of DB-related work in the robotics domain. We then construct a set of design constraints based on our analysis of robotic applications, and describe a suitable software architecture. The paper concludes with a discussion of experience gained with two generations of DB implementations.

关键词： Database Systems

来源：评论

学校读者我要写书评

暂无评论

AN INTEGRATED PROGRAMMING ENVIRONMENT FOR A GENERIC ROBOTIC WORKCELL

引用

JOURNAL OF ROBOTIC SYSTEMS 1989年第2期6卷 149-173页

作者： CARAYANNIS, G FREEDMAN, P MALOWANY, A Computer Vision and Robotics Laboratory McGill Research Centre for Intelligent Machines McGill University Montreal Quebec Canada

AbstractThe complexity of modern robotic workcells, consisting of many cooperating elements (e.g., robots, sensing systems) makes programming applications enormously difficult. Even when the application can be easily decomposed into workcelll operations, the tight coupling among these operations due to constraints on precedence and resource sharing makes it difficult to identify and take advantage of possible concurrency. Since robotic workcells are typically configured to repetitively perform an application, we seek to minimize the ‘cycle’ time required, by optimizing the order in which operations take place. Eventually, a sequential program must be written for each workcell element, and they must then execute concurrently. Commercial robot languages and systems provide neither the necessary tools for programming such a distributed collection of elements nor a mechanism for inter‐element communication. In this article the authors propose a two‐part solution to this workcell programming problem: SAGE/WRAP. A graphics interface is provided to the user in order to define the application. Then, from the user's input, SAGE builds a Petri Net description of the workcell application; this is used to obtain a time‐optimal sequence of operations for each workcell element. The time‐optimal sequence then becomes the basis of the runtime program that performs the application. This program is interpreted and executed by the hierarchical workcell runtime environment called WRAP. An example is provided to illustrate t

关键词：

来源：评论

学校读者我要写书评

暂无评论

Aggregation of boundary points into solid models

Aggregation of boundary points into solid models

引用

Sensor Fusion: Spatial Reasoning and Scene Interpretation

作者： Aubry, Stéphane Hayward, Vincent Computer Vision and Robotics Laboratory McGill Research Center for Intelligent Machines McGill University MontréalQC Canada

ISBN: (纸本)9780819400383

We consider the problem of aggregating the information provided by sensors such as range finders and its applications to scene modelling. This information consists of collections of three-dimensional points which form a discrete subspace of the objects-to-free-space boundaries within the world to be modelled. The ultimate goal is to obtain a valid surface model which can in turn be transformed into an efficient volumetric representation for solid interference detection algorithms. We first relate our work to that of other researchers, and we then show that surface connectivity is a non-trivial but essential element of a valid representation. To that end, we introduce a formal definition for model validity which we use to guide the process of aggregating the different views and we provide a proof of its correctness under stated assumptions. We eventually suggest heuristic methods for extending our approach when the strict validity conditions do not suffice to construct a perceptually consistent model. Finally, we quickly introduce the topological problems posed by objects non-homeomorphic to spheres, such as multi-holed tori. The methods we develop do not depend on the physical nature of the sensing technique. For example, our results can also be used from data obtained by stereo analysis and to some extent by haptic sensing.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Darboux frames, snakes, and super-quadrics: geometry from the bottom-up

Darboux frames, snakes, and super-quadrics: geometry from th...

引用

Workshop on Interpretation of 3D Scenes

作者： F.P. Ferrie J. Lagarde P. Whaite Computer Vision and Robotics Laboratory Department of Electrical Engineering McGill University Montreal QUE Canada

A representation and a computational model for deriving three-dimensional articulated volumetric descriptions of objects from laser range-finder data are described. What differentiates this work from other approaches is that it is purely bottom up, relying on general assumptions cast in terms of differential geometry. Darboux frames, snakes, and superquadrics form the basis of this representation, and curvature consistency provides the computational framework. The organization is hierarchical. Darboux frames are used to describe the local surface, while snakes are used to interpolate between features, particularly those that serve to partition a surface into its constituent parts. Superquadrics are subsequently used to characterize the 3-D shape of each surface partition. The result is a set of connected volumetric primitives which serve to describe the overall shape of an object. A set of examples showing how the approach performs on data acquired with a laser range finder is included.< >

关键词： Geometrical optics Surface fitting Computational geometry computer vision Shape Surface reconstruction Robot vision systems Laboratories Laser modes Orbital robotics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：