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

5th International Symposium on Signal processing and Its Applications, ISSPA 1999

作者： Eldeib, Ayman M. Yamany, Sameh M. Farag, Aly Computer Vision and Image Processing Laboratory University of Louisville Department of Electrical Engineering Louisville KY 40292 United States

ISBN: (纸本)1864354518

Presents a fast, six degrees of freedom, registration technique to accurately locate the position and orientation of medical volumes (e.g. CT, MRI) with respect to each other for the same patient. The technique uses surface registration and maximization of mutual information. We have developed a novel technique for surface registration which produces highly accurate results when registering two different volumes of the same individual generated from the same modality, such as preoperative MR and intraoperative MR volumes. In case surface registration is not able to accurately register the different volumes, the result is enhanced by multi-modal volume registration. The gain of this combination is to have an accurate alignment and to reduce time needed for registration. For the multi-modal volume registration, the maximization of mutual information (MI) as a matching criterion is used based on genetic algorithms (GA) as a search engine. Our results demonstrate that our registration technique allows for fast, accurate, robust and completely automatic registration of multimodality medical volumes. © 1999 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Analysis of stochastic gradient identification of Hermite polynomial systems with memory

Analysis of stochastic gradient identification of Hermite po...

引用

5th International Symposium on Signal processing and Its Applications, ISSPA 1999

作者： Celka, P. Bershad, N.J. Vesin, J.M. Department of Electrical Engineering Signal Processing Laboratory Swiss Federal Institute of Technology Lausanne 1015 Switzerland Department of Electrical and Computer Engineering School of Engineering University of California Imine CA 92697 United States

ISBN: (纸本)1864354518

This paper presents analytical and Monte Carlo results for a stochastic gradient adaptive scheme which identifies an orthogonal polynomial-type nonlinear system with memory. The analysis includes recursions for the mean and fluctuation behavior of the adaptive parameters as well computation of the mean-square error increase due to the adaptation process. © 1999 IEEE.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for singular value decomposition as applied to failure tolerant manipulators

A parallel algorithm for singular value decomposition as app...

引用

International Symposium on parallel processing

作者： T.D. Braun A.A. Maciejewski H.J. Siegel Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

The system of equations that govern kinematically redundant manipulators is commonly solved by finding the singular value decomposition (SVD) of the corresponding Jacobian matrix. This can require considerable amounts of time to compute, thus a parallel SVD algorithm minimizing execution time is sought. The approach employed here lends itself to parallelization by using Givens rotations and information from previous decompositions. The key contributions of this research include the presentation and implementation of a new variation of a parallel SVD algorithm to compute the SVD for a set of post-fault Jacobians. Results from implementation of the algorithm on a MasPar MP-1 and an IBM SP2 are provided. Specific issues considered for each implementation include how data is mapped to the processing elements, the effect that increasing the number of processing elements has on execution time, and the type of parallel architecture used.

关键词： parallel algorithms Singular value decomposition Jacobian matrices Concurrent computing Equations parallel machines Laboratories Matrix decomposition Manipulators Kinematics

来源：评论

学校读者我要写书评

暂无评论

Round-off error free fixed-point design of polynomial FIR predictors 33

Round-off error free fixed-point design of polynomial FIR pr...

引用

33rd Asilomar Conference on Signals, Systems, and computers, ACSSC 1999

作者： Tanskanen, J.M.A. Dimitrov, V.S. Institute of Intelligent Power Electronics Department of Electrical and Communications Engineering Helsinki University of Technology Espoo Finland Laboratory of Signal Processing and Computer Technology Department of Electrical and Communications Engineering Helsinki University of Technology Espoo Finland

ISBN: (纸本)0780357000

We present a novel method for designing polynomial FIR predictors for fixed-point environments. Our method yields filters that perform exact prediction of polynomial signals even with short coefficient word lengths. Under ordinary coefficient truncation or rounding, the prediction capability degrades, or may be totally lost. With the proposed method, the filters are designed so that the predictive properties are exactly preserved in fixed-point implementations. The proposed filter design method is based on integer programming (IP) and can be directly applied to any fixed-point FIR design specifications which can be formulated in a form of linear constraints on the filter coefficients. © 1999 IEEE.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

Design issues for a high-performance distributed shared memory on symmetrical multiprocessor clusters

引用

Cluster Computing 1999年第3期2卷 177-186页

作者： Roy, Sumit Chaudhary, Vipin Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit USA

Clusters of Symmetrical Multiprocessors (SMPs) have recently become the norm for high-performance economical computing solutions. Multiple nodes in a cluster can be used for parallel programming using a message passing library. An alternate approach is to use a software Distributed Shared Memory (DSM) to provide a view of shared memory to the application programmer. This paper describes Strings, a high performance distributed shared memory system designed for such SMP clusters. The distinguishing feature of this system is the use of a fully multi-threaded runtime system, using kernel level threads. Strings allows multiple application threads to be run on each node in a cluster. Since most modern UNIX systems can multiplex these threads on kernel level light weight processes, applications written using Strings can exploit multiple processors on a SMP machine. This paper describes some of the architectural details of the system and illustrates the performance improvements with benchmark programs from the SPLASH-2 suite, some computational kernels as well as a full fledged application. It is found that using multiple processes on SMP nodes provides good speedups only for a few of the programs. Multiple application threads can improve the performance in some cases, but other programs show a slowdown. If kernel threads are used additionally, the overall performance improves significantly in all programs tested. Other design decisions also have a beneficial impact, though to a lesser degree.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A 64-bit, shared disk file system for Linux

A 64-bit, shared disk file system for Linux

引用

IEEE Symposium on Mass Storage Systems

作者： K.W. Preslan A.P. Barry J.E. Brassow G.M. Erickson E. Nygaard C.J. Sabol S.R. Soltis D.C. Teigland M.T. O'Keefe Parallel Computer Systems Laboratory Department of Electrical and Computer Engineering University of Minnesota USA

In computer systems today, speed and responsiveness is often determined by network and storage subsystem performance. Faster, more scalable networking interfaces like Fibre Channel and Gigabit Ethernet provide the scaffolding from which higher performance implementations may be constructed, but new thinking is required about how machines interact with network-enabled storage devices. We have developed a Linux file system called GFS (the Global File System) that allows multiple Linux machines to access and share disk and tape devices on a Fibre Channel or SCSI storage network. We plan to extend GFS by transporting packetized SCSI commands over IP so that any GFS-enabled Linux machine can access shared network devices. GFS will perform well as a local file system, as a traditional network file system running over LP, and as a high-performance cluster file system running over storage networks like Fibre Channel. GFS device sharing provides a key cluster-enabling technology for Linux, helping to bring the availability, scalability, and load balancing benefits of clustering to Linux. Our goal is to develop a scalable, (in number of clients and devices, capacity, connectivity, and bandwidth) server-less file system that integrates IF-based network attached storage (NAS) and Fibre-Channel-based storage area networks (SAN). We call this new architecture Storage Area InterNetworking (SAINT). It exploits the speed and device scalability of SAN clusters, and provides the client scalability and network interoperability of NAS appliances. Our Linux port shows that the GFS architecture is portable across different platforms, and we are currently working on a port to NetBSD. The GFS code is open source (GPL) software freely available on the Internet at http://***.

关键词： File systems Linux Optical fiber devices Scalability Storage area networks computer networks Delay Ethernet networks Availability Load management

来源：评论

学校读者我要写书评

暂无评论

Underground imaging based on edge-preserving regularization

Underground imaging based on edge-preserving regularization

引用

1999 International Conference on Information Intelligence and Systems, ICIIS 1999

作者： Feng, Haihua Castanon, David A. Karl, W. Clem Multi-Dimensional Signal Processing Laboratory Department of Electrical and Computer Engineering Boston University 8 Saint Mary's Street BostonMA02215 United States

ISBN: (纸本)0769504469

Develops approaches for imaging weak-contrast buried objects using data from a ground penetrating radar array. An approximate physical model relating the collected data to the underground objects is developed. This model uses ray optics to represent the air/soil interface, and a Born approximation to model the weak contrast backscattering from buried objects. In order to address both modeling errors and ill-posedness, the proposed image reconstruction algorithms use regularization based on a total variation norm with orientation preference. The algorithms are tested on data generated by nonlinear finite difference time domain electromagnetic simulations. © 1999 IEEE.

关键词： Electromagnetic simulation

来源：评论

学校读者我要写书评

暂无评论

Creating applications in RCADE

Creating applications in RCADE

引用

IEEE Conference on Aerospace

作者： K. Hazelwood W.B. Ligon G. Monn N. Pothen R. Sass D. Stanzione K.D. Underwood Parallel Architecture Research Laboratory Department of Electrical and Computer Engineering Clemson University Clemson SC USA

As FPGA density increases, so does the potential for reconfigurable computing machines. Unfortunately, applications which take advantage of the higher densities require significant effort and involve prohibitively long design cycles when conventional methods are used. To combat this problem, we propose a design environment to manage this additional complexity. Our environment gives the end-user a mechanism for describing and managing algorithms at a higher level of abstraction than other extant methods such as writing VHDL or using schematic capture. This paper describes an experimental version of the environment. The core of our design tool is a general Algorithm Description Format (ADF) which represents an algorithm as an attributed graph, and a library of components, which are tailored to a particular FPGA device. In this paper we present a set of tools which operate on the ADF representation to provide a number of functions to aid in the creation of applications for configurable computing platforms. These tools include front-end tools for specifying a design, a suite of analysis tools to aid the user in refining and constraining the design, and a set of back-end tools which select components from the library based on the design constraints and place and route these components on the configurable computing platform. In this paper, particular emphasis is placed on the component model and the analysis tools.

关键词： Application software Field programmable gate arrays Algorithm design and analysis parallel architectures Environmental management Libraries Message-oriented middleware Writing Marine vehicles NASA

来源：评论

学校读者我要写书评

暂无评论

Sprite generation and coding of multiview image sequences

Sprite generation and coding of multiview image sequences

引用

International Conference on Image Analysis and processing

作者： N. Grammalidis D. Beletsiotis M.G. Strintzis Department of Electrical and Computer Engineering Information Processing Laboratory University of Thessaloniki Thessaloniki Greece

An algorithm to generate background sprite images from multiview image sequences is presented. A dynamic programming algorithm, using a multiview matching cost as well as pure geometrical constraints, is used to provide an estimate of the disparity field and to identify occluded areas. By combining motion, disparity and occlusion information, a sprite image corresponding to the first (main) view at the first time instant is generated. Image pixels from other views that are occluded in the main view are added to the sprite. The sprite coding method defined by MPEG-4 is extended for multiview image sequences, based on the generated sprite. Experimental results are presented, demonstrating the performance of the proposed technique and comparing it with methods using sprite generation from monoscopic sequences.

关键词： Sprites (computer) Image coding Image sequences electrical capacitance tomography Layout Read only memory Image segmentation Cameras MPEG 4 Standard Information processing

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal segmentation and tracking of objects in image sequences

Spatiotemporal segmentation and tracking of objects in image...

引用

IEEE International Conference on Image processing

作者： J. Kompatsiaris M.G. Strintzis Information Processing Laboratory Electrical and Computer Engineering Department Aristotle University of Thessaloniki Thessaloniki Greece

In this paper a procedure is described for the segmentation of image sequences. For this purpose, we propose the novel procedure of K-Means with connectivity constraint algorithm as a general segmentation algorithm combining several types of information including intensity, motion and compactness. The algorithm is extended so as to separate and track objects appearing in consequent frames of an image sequence. In this algorithm, the use of spatiotemporal regions is introduced since a number of frames is analyzed simultaneously and as a result the same region is present in consequent frames. Experimental results demonstrate the usage and performance of the algorithm.

关键词： Spatiotemporal phenomena Image segmentation Image sequences Clustering algorithms Standards development Layout Information processing Laboratories Video coding MPEG 4 Standard

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：