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

Image Communications and Workstations

作者： Roos, Mark S. Univ of California Berkeley United States

ISBN: (纸本)0819403059

An approach to integration of software and hardware for image production closely coupled with real-time control of an instrument is described. Image production includes reconstruction, processing, display, archiving and export. Feedback of information from images to instrument control is an essential feature, often with a human operator in the loop. Real-time control requires guaranteed response to external events, support for multiple processors and a variety of interfaces to instrumentation. Image production involves implementation of reconstruction and processing algorithms, a windows system, and network support. Both functions need a consistent user interface and an adaptable programming environment. The UNIX operating system running on a network of workstations meets the needs of image production and is very well suited to user interface and software development for both imaging and control. However, high performance real-time control is not possible under most available UNIX systems, but can be accomplished using a real-time kernel running on separate hardware. This suggests a multi-processor approach based on inter-process communication between the workstation and control environments. The architecture consists of three hardware layers (UNIX workstations, board-level microcomputers, and digital signal processors) and four software layers. The real-time software layers are DSP microcode and the microprocessor code. The lower layer of workstation software is a multi-tasked command-driven program tailored for instrument control and image production. The top layer of workstation software consists of an icon or menu driven user interface. A research instrument for nuclear magnetic resonance imaging will serve as an example of this approach.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

General methodology for achieving high accuracy in image comparison, with application to the analysis of two-dimensional electrophoretic gels

General methodology for achieving high accuracy in image com...

引用

Applications of Artificial Intelligence viII

作者： Skolnick, Michael M. Rensselaer Polytechnic Inst Troy United States

ISBN: (纸本)081940344X

A cross-correlation algorithm for determining image correspondence is described. As is typical for such algorithms, correct determination of correspondence at a fairly high level of accuracy is relatively easy to achieve. The problem addressed in the algorithm is the development of consistency checking mechanisms that enable the detection and correction of the remaining relatively small number of incorrect match and non-match determinations. The image matching algorithm and its proposed consistency checking mechanism differ from more traditional relaxation-based methods in two ways: 1. the algorithm takes a more 'committed' approach in terms of actively making discrete inferences about match and non-match hypotheses based on relatively local support, even at the earliest stages of the algorithm, and 2. the consistency checking mechanisms permit the detection and isolation of sets of match and non-match hypotheses that are inconsistent with neighboring hypotheses. Within the context of graph matching - with nodes being detected image features and edges the spatial relationship between features - the algorithm 'commits' itself by crating 'virtual' nodes, which function as hypotheses about where missing features should appear. The criterion for consistency embodies the notion that the result of the comparison process should consist of match information which represents the construction of the union out of the initial two graphs being compared - in contrast to the continuity criterion embodied in relaxation methods. The comparison algorithm should be of interest in areas of application where image differences are reconcilable, e.g., when missing features on one image may not have been detected correctly initially, but might be found via more focused processing. Model-based matching may be a candidate application. Preliminary results are presented on the application of this consistency methodology to the comparison of biological images of two-dimensional electrophoretic

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

MuSIP-multisensor image processor (a system for the automated fusion and analysis of multisource images)

MuSIP-multisensor image processor (a system for the automate...

引用

IEE Colloquium on Recent Developments in Image processing: Applications in Remote Sensing

作者： A.L. Wielogorski M.C. Barr A.J. Rye D.J. Johnson M.J. Bishop A. de Salabert D. Mason S. Bell J.-Y. Catros S.B. Serpico G. Vernazza N. Hindley Hunting Technical Services Limited UK GEC-Marconi Hirst Research Centre UK Marconi Space Systems Limited UK Messerschmitt-Bolkow-Blohm NERC Unit for Thematic Information Systems NUTIS LER Thomson CSF France DIBE University of Genoa Italy Marconi Command and Control Systems Limited UK

As the volume of data collected by an increasing number of satellites escalates, it has become of paramount importance that methods of coping with and making best use of this information are developed. Current trends are moving towards automatic and knowledge-based analysis systems particularly for monitoring applications where the same kinds of interpretation task must be repeated many times. The MuSIP project, part funded by the European ESPRIT programme for research information, aims to develop a software demonstrator for the automatic fusion and analysis of multisource data. The project recognises this need across all computer vision applications and so will test the demonstrator on two dissimilar applications, one in the field of remote sensing and one in the field of medical image analysis. The target remote sensing application is the monitoring of forestry using a dataset of radar and optical imagery, map and ground data. This paper introduces the modules that comprise the demonstrator that is: a supervisor with its associated knowledge bases, algorithms and the databases. Attention is focussed in particular on the role of knowledge bases and the methods of data fusion.< >

关键词： Image processing Forestry Knowledge based systems Remote sensing

来源：评论

学校读者我要写书评

暂无评论

Statistical analysis of inherent ambiguities in recovering 3-D motion from a noisy flow field

Statistical analysis of inherent ambiguities in recovering 3...

引用

International Conference on Pattern Recognition

作者： G.-S. Young R. Chellappa Signal and Image Processing Institute Department of EE-Systems University of Southern California USA

The inherent ambiguities in recovering 3-D motion information from a single optical flow field are studied using a statistical model. These ambiguities are quantified using the Cramer-Rao lower bound, which is a lower bound for the error variances of motion parameter estimates. This performance bound is independent of the motion estimation algorithms, and can always be computed for any arbitrary 3-D motion of a rigid surface by inverting a 5*5 matrix. For the general motion of an arbitrary surface, it turns out that not every pixel gives information regarding 3-D motion estimation. It is shown that the aperture problem in computing the optical flow restricts the nontrivial information about the 3-D motion to a sparse set of pixels at which both components of the flow velocity are observable. Computer simulations are used to study the dependence of the inherent ambiguities on the underlying motion, the field of view, and the number of feature points for the motion in front of a nonplanar environment. It is shown that introducing a smoothness constraint by fitting local patches gives even lower bounds and thus is a justified technique for stabilizing the ill-posed motion estimation problem.< >

关键词： Statistical analysis Motion analysis Image motion analysis optical noise Motion estimation optical sensors optical computing Pollution measurement Apertures optical devices

来源：评论

学校读者我要写书评

暂无评论

optical COMPUTING USING optical FLIP-FLOPS IN FOURIER PROCESSORS - USE IN MATRIX MULTIPLICATION AND DISCRETE LINEAR TRANSFORMS

引用

APPLIED OPTICS 1989年第24期28卷 5363-5373页

作者： ANDO, S SEKINE, S MITA, M KATSUO, S NIIGATA UNIV GRAD SCH SCINIIGATA 95021JAPAN

An architecture and the algorithms for matrix multiplication using opticalflip-flops (OFFs) in optical processors are proposed based on residuearithmetic. The proposed system is capable of processing all elements ofmatrices in parallel utilizing the information retrieving ability of opticalFourier processors. The employment of OFFs enables bidirectional data flowleading to a simpler architecture and the burden of residue-to-decimal (orresidue-to-binary) conversion to operation time can be largely reduced byprocessing all elements in parallel. The calculated characteristics of operationtime suggest a promising use of the system in a real time 2-D lineartransform.

关键词： Algebraic optical processing Fourier transforms optical computing optical processing devices optical systems Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Device development for optical computing

Device development for optical computing

引用

Summaries of Papers Presented at the Conference on Lasers and Electro-Optics

作者： Tanguay Jr., Armand R. Univ of Southern California Los Angeles CA USA

ISBN: (纸本)1557520860

A wide range of modern information processing applications that are not easily amenable to solution by conventional sequential processing algorithms and machines or even by parallel multiprocessor architectures with a limited degree of interconnection capability are identified. The potential of optical information processing and computing systems for these applications is discussed, focusing on the need to develop the necessary components. A number of recent advances in advanced integrated optical signal processors, photorefractive volume holographic optical elements, and optical disks used as reconfigurable spatial light modulators are examined.

关键词： optical Data processing

来源：评论

学校读者我要写书评

暂无评论

Scheduling linearly indexed assignment codes

Scheduling linearly indexed assignment codes

引用

High Speed Computing II 1989

作者： Kailath, T. Roychowdhury, V.P. Information Systems Laboratory Stanford University United States

It has been recently shown that linearly indexed Assignment Codes can be efficiently used for coding several problems especially in signal processing and matrix algebra. In fact, mathematical expressions for many algorithms are directly in the form of linearly indexed codes, and examples include the formulas for matrix multiplication, any m-dimensional convolution/correlation, matrix transposition, and solving matrix Lyapunov's equation. Systematic procedures for converting linearly indexed Assignment Codes to localized algorithms that are closely related to Regular Iterative algorithms (RIAs) have also been developed. These localized algorithms can be often efficiently scheduled by modeling them as RIAs;however, it is not always efficient to do so. In this paper we shall analyze and develop systematic procedures for determining efficient schedules directly for the linearly indexed ACs and the localized algorithms. We shall also illustrate our procedures by determining schedules for examples such as matrix transposition and Gauss-Jordan elimination algorithm. © 1989 SPIE. All rights reserved.

关键词： Signal processing

来源：评论

学校读者我要写书评

暂无评论

Multichannel fast transversal filter algorithms for adaptive broadband beamforming

Multichannel fast transversal filter algorithms for adaptive...

引用

Advanced algorithms and Architectures for Signal processing IV 1989

作者： Slock, Dirk T.M. Kailath, Thomas Philips Research Lab. Belgium Av. Van Becelaere 2 Brussels1170 Belgium Information Systems Laboratory Stanford University StanfordCA94305 United States

Adaptive filters for broadband beamforming are two-dimensional filters with one dimension being space and the other dimension being time. The filtering in the time dimension is a simple convolution, hence fast algorithms can exploit computational redundancy in this dimension. The filtering in the space dimension is an arbitrary linear combiner, and for reasons arising from various implementation considerations, it is desirable to use factorized estimation techniques in this dimension. In this paper, we present scalar implementations of multichannel fast Recursive Least-Squares algorithms in transversal filter form (so-called FTF algorithms). The point is that by processing the different channels sequentially, i.e. one at a time, the processing of any channel reduces to that of the single-channel algorithm. This sequential processing decomposes the multichannel algorithm into a set of intertwined single-channel algorithms. Geometrically, this corresponds to a modified Gram-Schmidt orthogonalization of multichannel error vectors. Algebraically, this technique corresponds to matrix triangularization of multichannel error covariance matrices and converts matrix operations into a regular set of scalar operations. Algorithm structures that are amenable to VLSI implementation on arrays of parallel processors naturally follow from our approach. Numerically, the resulting algorithm benefits from the advantages of triangularization techniques in block-processing, which are a well-known part of Kalman filtering expertise. Furthermore, recently introduced stabilization techniques for proper control of the propagation of numerical errors in the update recursions are also incorporated. © 1989 SPIE. All rights reserved.

关键词： Adaptive filters

来源：评论

学校读者我要写书评

暂无评论

Wide-band array signal processing via spectral smoothing

Wide-band array signal processing via spectral smoothing

引用

Advanced algorithms and Architectures for Signal processing IV 1989

作者： Xu, Guanghan Kailath, Thomas Information Systems Laboratory Stanford University StanfordCA94303 United States

Many efficient signal subspace algorithms have been published on direction finding of narrow-band sources, e.g. MUSIC, ESPRIT. The difficulty of extending these methods to the wide-band cases lies in the fact that the signal vectors from each source doesn't span an one-dimensional subspace. Therefore, all the signal-subspace based algorithms will fail in case of wide-band sources. Recently, several approaches [2-4], [6-7] have been suggested to resolve this problem, e.g., the spectral-spatial approach [2], the coherent signal-subspace (CSS) method [3], the modal decomposition algorithm [4]. Each of these algorithms has one or several of the following shortcomings: high computational cost, impractical signal model assumption, requirement of initial DOA estimate, complete knowledge of array manifold, etc. In this paper, we present a new and more efficient method for estimating DOA's of multiple wide-band sources via spectral smoothing. The proposed algorithm requires much less computational cost than the existing approaches and doesn't need initial DOA estimate, or specific signal model (ARMA, identical spectrum). If the array of sensors satisfies invariant displacement condition, ESPRIT can be used to eliminate the need of complete knowledge of array manifold and to reduce computational load and memory requirement. Under certain scenarios, the analytical analysis and computer simulation show the better performance of the proposed algorithm than that of the existing approaches mentioned above. © 1989 SPIE. All rights reserved.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

ESPRIT and uniform linear arrays

ESPRIT and uniform linear arrays

引用

Advanced algorithms and Architectures for Signal processing IV 1989

作者： Roy, R. Goldburg, M. Ottersten, B. Swindlehurst, A.L. viberg, M. Kailath, T. Information Systems Laboratory Stanford University StanfordCA94305 United States

ESPRIT is a recently developed and patented technique for high-resolution estimation of signal parameters. It exploits an invariance structure designed into the sensor array to achieve a reduction in computational requirements of many orders of magnitude over previous techniques such as MUSIC, Burg's MEM, and Capon's ML, and in addition achieves performance improvement as measured by parameter estimate error variance. It is also manifestly more robust with respect to sensor errors (e.g. gain, phase, and location errors) than other methods as well. Whereas ESPRIT only requires that the sensor array possess a single invariance best visualized by considering two identical but otherwise arbitrary arrays of sensors displaced (but not rotated) with respect to each other, many arrays currently in use in various applications are uniform linear arrays of identical sensor elements. Phased array radars are commonplace in high-resolution direction finding systems, and uniform tapped delay lines (i.e., constant rate A/D converters) are the rule rather than the exception in digital signal processing systems. Such arrays possess many invariances, and are amenable to other types of analysis, which is one of the main reasons such structures are so prevalent. Recent developments in high-resolution algorithms of the signal/noise subspace genre including total least squares (TLS) ESPRIT applied to uniform linear arrays are summarized. ESPRIT is also shown to be a generalization of the root-MUSIC algorithm (applicable only to the case of uniform linear arrays of omni-directional sensors and unimodular cisoids). Comparisons with various estimator bounds, including Cramer-Rao bounds, are presented. © 1989 SPIE. All rights reserved.

关键词： Signal analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：