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

Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XV

作者： Wu, Chao-Cheng Chang, Chein-I Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering University of Maryland Baltimore County Baltimore MD 21250 United States

ISBN: (纸本)9780819476005

Pixel Purity Index (PPI) has been widely used in endmember extraction. While it is available in ENVI software there are several interesting issues arising in its implementation. This paper re-invents the wheel by re-visiting the design rationale of the PPI and re-designing algorithms to implement PPI. More specifically, it develops the so-called Causal PPI (CPPI) which implements the PPI in a causal manner in the sense that the information used for data processing is only up to the data sample currently being visited. If the time required for computer processing is negligible, the CPPI actually becomes a real time PPI. The proposed CPPI can be implemented automatically and resolves the main issue of requiring human intervention to determine parameters.©2009 SPIE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Novel registration technique for InISAR & InSAR

Novel registration technique for InISAR & InSAR

引用

2003 IEEE IGARSS: Learning From Earth's Shapes and Colours

作者： Zhang, Q. Yeo, T.S. Radar and Signal Processing Laboratory Department of Electrical and Computer Engineering National University of Singapore 10 Kent Ridge Crescent 119260 Singapore

In InISAR system, the pixels between two ISAR images derived from corresponding antennas usually do not register properly without prior compensation. A three-dimension motion compensation method, or 3D focusing, is put forward in this paper. With the multi-Antenna-pair configuration in radar system, the angular motion p arameters b oth in the a zimuth and p itching a re estimated accurately and the phase unwrapping processing can be avoided in the procedure of obtaining phase unambiguous. Simulation data is used to illustrate the accuracy of the proposed method. The method has also been extended to stripmap SAR for the interferometric 3D imaging of moving and/or man-made objects. © 2003 IEEE.

关键词： Motion compensation

来源：评论

学校读者我要写书评

暂无评论

Progressive dimensionality reduction for hyperspectral imagery

Progressive dimensionality reduction for hyperspectral image...

引用

Satellite Data Compression, Communication, and processing V

作者： Safavi, Haleh Liu, Keng-Hao Chang, Chein-I Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering University of Maryland Baltimore County Baltimore MD 21250 United States

ISBN: (纸本)9780819477453

This paper develops to a new concept, called Progressive Dimensionality Reduction (PDR) which can perform data dimensionality progressive in terms of information preservation. Two procedures can be designed to perform PDR in a forward or backward manner, referred to forward PDR (FPDR) or backward PDR (BPDR) respectively where FPDR starts with a minimum number of spectral-transformed dimensions and increases the spectral-transformed dimension progressively as opposed to BPDR begins with a maximum number of spectral-transformed dimensions and decreases the spectral-transformed dimension progressively. Both procedures are terminated when a stopping rule is satisfied. In order to carry out DR in a progressive manner, DR must be prioritized in accordance with significance of information so that the information after DR can be either increased progressively by FPDR or decreased progressively by BPDR. To accomplish this task, Projection Pursuit (PP)-based DR techniques are further developed where the Projection Index (PI) designed to find a direction of interestingness is used to prioritize directions of Projection Index Components (PICs) so that the DR can be performed by retaining PICs with high priorities via FPDR or BPDR. In the context of PDR, two well-known component analysis techniques, Principal Components Analysis (PCA) and Independent Component Analysis (ICA) can be considered as its special cases when they are used for DR. © 2009 SPIE.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

What can an image of a smooth Lambertian surface tell about camera nonlinearity?

What can an image of a smooth Lambertian surface tell about ...

引用

2012 9th Conference on computer and Robot Vision, CRV 2012

作者： El-Melegy, Moumen T. Farag, Aly A. Computer Vision and Image Processing Laboratory University of Louisville Louisville KY 40292 United States Electrical Engineering Department Assiut University Assiut 71516 Egypt

ISBN: (纸本)9780769546834

This paper investigates the use of a single image of a smooth Lambertian surface to calibrate and remove some image nonlinearities due to the imaging device. To the best of our knowledge, this has not been addressed before in the literature. We show that this is possible, both theoretically and practically, taking advantage of some local shading measures that vary nonlinearly as a function of luminance and geometric nonlinearities (e.g., gamma correction and lens distortion). This can work as a basis for developing a simple method to estimate these nonlinearities from a single image. Several experiments are reported to validate the proposed method. © 2012 IEEE.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Heat kernels for non-rigid shape retrieval: Sparse representation and efficient classification

Heat kernels for non-rigid shape retrieval: Sparse represent...

引用

2012 9th Conference on computer and Robot Vision, CRV 2012

作者： Abdelrahman, Mostafa El-Melegy, Moumen Farag, Aly Computer Vision and Image Processing Laboratory University of Louisville Louisville KY 40292 United States Electrical Engineering Department Assiut University Assiut 71516 Egypt

ISBN: (纸本)9780769546834

One of the major goals of computer vision and machine intelligence is the development of flexible and efficient methods for shape representation. This paper presents an approach for shape retrieval based on sparse representation of scale-invariant heat kernel. We use the Lap lace-Beltrami eigen functions to detect a small number of critical points on the shape surface. Then a shape descriptor is formed based on the heat kernels at the detected critical points for different scales, combined with the normalized eigen values of the Lap lace-Beltrami operator. Sparse representation is used to reduce the dimensionality of the calculated descriptor. The proposed descriptor is used for classification via the collaborative representation-based classification with regularized least square algorithm. We compare our approach to two well-known approaches on two different data sets: the nonrigid world data set and the SHREC 2011. The results have indeed confirmed the improved performance of the proposed approach, yet reducing the time and space complicity of the shape retrieval problem. © 2012 IEEE.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Modified full abundance-constrained spectral unmixing

Modified full abundance-constrained spectral unmixing

引用

High-Performance Computing in Remote Sensing II

作者： Wong, Englin Chang, Chein-I Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering University of Maryland Baltimore County Baltimore MD 21250 United States

ISBN: (纸本)9780819492791

Abundance fully constrained least squares (FLCS) method has been widely used for spectral unmixing. A modified FCLS (MFCLS) was previously proposed for the same purpose to derive two iterative equations for solving fully abundance-constrained spectral unmixing problems. Unfortunately, its advantages have not been recognized. This paper conducts a comparative study and analysis between FCLS and MFCLS via custom-designed synthetic images and real images to demonstrate that while both methods perform comparably in unmixing data, MFCLS edges out FCLS in less computing time. © 2012 SPIE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A Generalized Piecewise Quadratic Lyapunov Function Approach to Estimating the Domain of Attraction of a Saturated System

引用

IFAC-PapersOnLine 2015年第11 11期48卷 120-125页

作者： Li, Yuanlong Lin, Zongli Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing of Ministry of Education Shanghai200240 China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia CharlottesvilleVA22904-4743 United States

This paper revisits the problem of estimating the domain of attraction of a saturated system with an algebraic loop. A piecewise quadratic Lyapunov function of an augmented state vector composing of the system state and the saturated input has been proposed for use in estimating the domain of attraction for a saturated system. Considering the relationship between the system states and the saturation function, we propose in this paper a generalized piecewise quadratic Lyapunov function, which results from adding a term that characterizes the regional sector condition of the saturated input to the piecewise quadratic Lypunov function. The matrix associated with the generalized piecewise quadratic Lyapunov function is not required to be positive definite, and thus a set of less conservative stability conditions are established, from which a larger estimate of the domain of attraction can be obtained. Simulation results indicate that the effectiveness and superiority of the proposed method. © 2015

关键词： Lyapunov functions Domain of attraction Input saturation Piece wise quadratic Lyapunov function Positive definite Saturated systems Saturation function Sector condition Stability condition

来源：评论

学校读者我要写书评

暂无评论

2D-PCA shape models: Application to 3D reconstruction of the human teeth from a single image

2D-PCA shape models: Application to 3D reconstruction of the...

引用

3rd International MICCAI Workshop on Medical computer Vision, MCV 2013

作者： Abdelrehim, Aly S. Farag, Aly A. Shalaby, Ahmed M. El-Melegy, Moumen T. Computer Vision and Image Processing Laboratory University of Louisville Louisville KY 40292 United States Electrical Engineering Department Assiut University Assiut 71516 Egypt

ISBN: (纸本)9783319055299

Accurate modeling of human teeth is mandatory for many reasons. Some of them are (1) Providing comfort to patients during mold process, and (2) Enhancing the accuracy level for oral orthodontist and dental care personnel. Shape from Shading (SFS) proved to be of great help in this problem, considering the fact that human tooth surface is textureless. In this paper, we address the problem of 3D tooth reconstruction, and improve the current algorithms. The approached developed in this paper reconstructs the teeth from single image shading with 2D-PCA shape priors that have more sophisticated reflectance model. Oren-Nayar-Wolff model was used for modeling the surface reflectance. This formulation uses shape priors as got from a set of training CT scans of real human teeth. Our experiments show promising quantitative results, which builds the infrastructure for having an optical based approach that accounts for inexpensive and radiationless human tooth reconstruction. © 2014 Springer International Publishing Switzerland.

关键词： computerized tomography

来源：评论

学校读者我要写书评

暂无评论

An Improved Method for Approximating the Infinite-Horizon Value Function of the Discrete-Time Switched LQR Problem

引用

Journal of Systems Science & Complexity 2024年第1期37卷 22-39页

作者： HOU Tan LI Yuanlong LIN Zongli Department of Automation Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of System Control and Information Processing Ministry of Education of ChinaShanghai 200240China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai 200240China Charles L.Brown Department of Electrical and Computer Engineering University of VirginiaCharlottesvilleVA 22904-4743USA

This paper considers the problem of approximating the infinite-horizon value function of the discrete-time switched LQR *** particular,the authors propose a new value iteration method to generate a sequence of monotonically decreasing functions that converges exponentially to the value *** method facilitates us to use coarse approximations resulting from faster but less accurate algorithms for further value iteration,and thus,the proposed approach is capable of achieving a better approximation for a given computation time compared with the existing *** numerical examples are presented in this paper to illustrate the effectiveness of the proposed method.

关键词： Optimal control switched linear systems switched LQR problem.

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：