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

Conference on computer vision and Pattern Recognition (CVPR)

作者： J.P. Williams J.K. Johnstone L.B. Wolff Computer Vision Laboratory Department of Computer Science Johns Hopkins University Baltimore MD USA Graphics and A.I. Laboratory Department of Computer and Information Sciences University of Alabama Birmingham Birmingham AL USA

Generalized cylinders (GCs) are a popular representational tool in computer vision. In medical imaging, the curved axis GC is particularly applicable to a number of elongated physical structures such as vasculature, bone and bronchi. In many of these instances, it is necessary to recover curved-axis GCs with arbitrary cross-sections. It is also vital that these structures, once recovered, can be analyzed and visualized with off-the-shelf algorithms and software packages. Such tools are usually designed to operate on the domain of polynomial or rational surfaces. Unfortunately most extant, suitably versatile GC representations do not admit rational parameterizations. We develop an entirely rational B-spline representation for generalized cylinders with curved axes and arbitrary cross-section functions. We demonstrate how our representation can be used as a deformable model by extracting a rational GC from pre-segmented spinal data using a discrete dynamic surface fit.

关键词： Application software computer vision Biomedical imaging Bones Respiratory system Algorithm design and analysis Visualization Software algorithms Software packages Polynomials

来源：评论

学校读者我要写书评

暂无评论

Convected activation profiles and the measurement of visual motion

Convected activation profiles and the measurement of visual ...

引用

Conference on computer vision and Pattern Recognition (CVPR)

作者： A.M. Waxman J. Wu F. Bergholm Laboratory for Sensory Robotics College of Engineering Boston University Boston MA USA Computer Vision and Graphics Laboratory Department of Numerical Analysis and Computing Science Royal Institute of Technology Stockholm Sweden

A method is developed for the measurement of short-range visual motion in image sequences, making use of the motion of image features such as edges and points. Each feature generates a Gaussian activation profile in a spatiotemporal neighborhood of specified scale around the feature itself; this profile is then convected with motion of the feature. The authors show that image velocity estimates can be obtained from such dynamic activation profiles using a modification of familiar gradient techniques. The resulting estimators can be formulated in terms of simple ratios of spatiotemporal filters (i.e. receptive fields) convolved with image feature maps. A family of activation profiles of varying scale must be utilized to cover a range of possible image velocities. They suggest a characteristic speed normalization of the estimate obtained from each filter in order to decide which estimate is to be accepted. They formulate the velocity estimators for dynamic edges in 1-D and 2-D image sequences, as well as that for dynamic feature points in 2-D image sequences.< >

关键词： Motion measurement Image sequences Motion analysis Filters Laboratories computer vision Robot sensing systems Educational institutions computer graphics Numerical analysis

来源：评论

学校读者我要写书评

暂无评论

DETECTION OF OSTEOGENESIS IMPERFECTA BY AUTOMATED TEXTURE ANALYSIS

COMPUTER GRAPHICS AND IMAGE PROCESSING

引用

computer graphics AND IMAGE PROCESSING 1982年第3期20卷 229-243页

作者： TERZOPOULOS, D ZUCKER, SW Computer Vision and Graphics Laboratory Department of Electrical Engineering McGill University Montreal Quebec Canada

An automated system for detecting Osteogenesis Imperfecta (OI), an inheritable disorder of human connective tissue, is described. The approach is one of texture analysis, founded on standard statistical recognition of co-occurrence-based texture descriptors. Our contribution is to show that texture descriptors derived from gray-level co-occurrence matrices can be used in conjunction with descriptors derived from generalized co-occurrence matrices of local image features to increase performance. In fact, for the OI problem, our system demonstrates a level of performance which is significantly better than that of medical specialists.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CELL TRACKING - A MODELING AND MINIMIZATION APPROACH

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1982年第3期4卷 277-291页

作者： FERRIE, FP LEVINE, MD ZUCKER, SW Computer Vision and Graphics Laboratory Department of Electrical Engineering McGill University Montreal P.Q. Canada SENIOR MEMBER IEEE Computer Vision and Graphics Laboratory Department of Electrical Engineering McGill University Montreal P.Q. Canada MEMBER IEEE Computer Vision and Graphics Laboratory Department of Electrical Engineering McGill University Montreal P.Q. Canada

This paper presents a model of motion suitable for cell tracking. It includes a representation for cell dynamics enabling it to maintain a correspondence between successive images of cells undergoing morphological changes. This model is based on a minimization problem whose computational solution is similar in form to a Newton-Rhapson iteration. The model is supported by experimental results from an actual tracking problem.

关键词： Tracking Morphology Image analysis Motion analysis Image motion analysis In vitro Biomedical imaging Councils Decision support systems Author Keywords proliferating cell cultures Cell dynamics cell morphology cell tracking dynamic scene analysis lymphocytes

来源：评论

学校读者我要写书评

暂无评论

Frame-to-frame Coherence and the Hidden Surface Computation: Constraints for a Convex World

引用

ACM Transactions on graphics (TOG) 1982年第2期1卷 129-162页

作者： Hubschman, H. Zucker, S.W. Computer Vision and Graphics Laboratory Department of Electrical Engineering McGill University Montreal Quebec Canada

来源：评论

学校读者我要写书评

暂无评论

Frame-to-frame coherence and the hidden surface computation: Constraints for a convex world

Frame-to-frame coherence and the hidden surface computation:...

引用

作者： Hubschman, Harold Zucker, Steven W. Computer Vision and Graphics Laboratory Department of Electrical Engineering McGill University MontrealQC Canada

Frame-to-frame coherence is the highly structured relationship that exists between successive frames of certain animation sequences. From the point of view of the hidden surface computation, this implies that parts of the scene will become visible or invisible in a predictable fashion. In this paper the frame-to-frame coherence constraints are identified and characterized for static scenes restricted to stationary, closed, convex, nonintersecting polyhedra. The animation derives from a continuous movement of the viewer. The mathematical analysis of the constraints is geometric and leads to a characterization of the self-occlusion or change of self-occlusion relationship over a single polyhedron, and to a characterization of the occlusion or change of occlusion relationship over two polyhedra. On the basis of these constraints, an algorithm which generates successive frames in an animation sequence is presented. © 1982 ACM.

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

CONTINUOUS RELAXATION AND LOCAL MAXIMA SELECTION - CONDITIONS FOR EQUIVALENCE

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1981年第2期3卷 117-127页

作者： ZUCKER, SW LECLERC, YG MOHAMMED, JL MEMBER IEEE Department of Electrical Engineering Computer Vision and Graphics Laboratory McGill University Montreal P.Q. Canada

Relaxation labeling processes are a class of iterative algorithms for using contextual information to reduce local ambiguities. This paper introduces a new perspective toward relaxation-that of considering it as a process for reordering labels attached to nodes in a graph. This new perspective is used to establish the formal equivalence between relaxation and another widely used algorithm, local maxima selection. The equivalence specifies conditions under which a family of cooperative relaxation algorithms, which generalize the well-known ones, decompose into purely local ones. Since these conditions are also sufficient for guaranteeing the convergence of relaxation processes, they serve as stopping criteria. We feel that equivalences such as these are necessary for the proper application of relaxation and maxima selection in complex speech and vision understanding systems.

关键词： computer vision Algorithm design and analysis Labeling Iterative algorithms Convergence Speech Machine vision Wide area networks Histograms computer graphics Author Keywords theory of algorithms computer vision histogram peak selection local computations relaxation

来源：评论

学校读者我要写书评

暂无评论

Frame-to-frame coherence and the hidden surface computation: Constraints for a convex world 81

Frame-to-frame coherence and the hidden surface computation:...

引用

8th Annual Conference on computer graphics and Interactive Techniques, SIGGRAPH 1981

作者： Hubschman, Harold Zucker, Steven W. Computer Vision and Graphics Laboratory Department of Electrical Engineering McGill University MontrealQC Canada

ISBN: (纸本)0897910451

Frame-to-frame coherence is the highly structured relationship that exists between successive frames of certain animation sequences. From the point of view of the hidden surface computation, this implies that parts of the scene will become visible or invisible in a predictable fashion. In this paper the frame-toframe coherence constraints are identified and characterized for static scenes restricted to stationary, closed, convex, nonintersecting polyhedra. The animation derives from a continuous movement of the viewer. The mathematical analysis of the constraints is geometric, and leads to a characterization of the self-occlusion relationship over a single polyhedron;and to a characterization of the occlusion or change of occlusion relationship over two polyhedra. Based on these constraints, an algorithm is presented which generates successive frames in an animation sequence. © 1981 ACM.

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

A Three-Dimensional Edge Operator

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 1981年第3期PAMI-3卷 324-331页

作者： Zucker, Steven W. Hummel, Robert A. Computer Vision and Graphics Laboratory Department of Electrical Engineering McGill University Montreal P.Q. Canada Courant Institute New York University New York NY 10003 United States

Modern scanning techniques, such as computed tomography, have begun to produce true three-dimensional imagery of internal structures. The first stage in finding structure in these images, like that for standard two-dimensional images, is to evaluate a local edge operator over the image. If an edge segment in two dimensions is modeled as an oriented unit line segment that separates unit squares (Le., pixels) of different intensities, then a three-dimensional edge segment is an oriented unit plane that separates unit volumes (i.e., voxels) of different intensities. In this correspondence we derive an operator that finds the best oriented plane at each point in the image. This operator, which is based directly on the 3-D problem, complements other approaches that are either interactive or heuristic extensions of 2-D techniques. Copyright © 1981 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： computerized tomography (CT) edge detection feature detection three-dimensional edge operators three-dimensional modeling

来源：评论

学校读者我要写书评

暂无评论

FINDING STRUCTURE IN CO-OCCURRENCE MATRICES FOR TEXTURE ANALYSIS

COMPUTER GRAPHICS AND IMAGE PROCESSING

引用

computer graphics AND IMAGE PROCESSING 1980年第3期12卷 286-308页

作者： ZUCKER, SW TERZOPOULOS, D Computer Vision and Graphics Laboratory Department of Electrical Engineering McGill University Montreal Quebec Canada

Co-occurrence matrices are a popular representation for the texture in images. They contain a count of the number of times that a given feature (e.g., a given gray level) occurs in a particular spatial relation to another given feature. However, because of the large number of spatial relations that are possible within an image, heuristic or interactive techniques have usually been employed to select the relation to use for each problem. In this paper we present a statistical approach to finding those spatial (or other) relations that best capture the structure of textures when the co-occurrence matrix representation is used. These matrices should thus be well suited for discriminations that are structurally based.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：