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

Accelerated Source-Sweep Analysis Using a Reduced-Order Model Approach

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION 2011年第11期59卷 4360-4363页

作者： Bradley, Patrick Brennan, Conor Condon, Marissa Mullen, Marie Dublin City Univ RINCE Inst RF Modelling & Simulat Grp Sch Elect Engn Dublin 9 Ireland

This communication is concerned with the development of a model-order reduction (MOR) approach for the acceleration of a source-sweep analysis using the volume electric field integral equation (EFIE) formulation. In particular, we address the prohibitive computational burden associated with the repeated solution of the two-dimensional electromagnetic wave scattering problem for source-sweep analysis. The method described within is a variant of the Krylov subspace approach to MOR, that captures at an early stage of the iteration the essential features of the original system. As such these approaches are capable of creating very accurate low-order models. Numerical examples are provided that demonstrate the speed-up achieved by utilizing these MOR approaches when compared against a method of moments (MoM) solution accelerated by use of the fast Fourier transform (FFT).

关键词： Electromagnetic propagation method of moments projection algorithms

来源：评论

学校读者我要写书评

暂无评论

Robust Adaptive Feedback Canceller Based on Modified Pseudo Affine projection Algorithm

Robust Adaptive Feedback Canceller Based on Modified Pseudo ...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society

作者： Keunsang Lee Yong-hyun Baik Youngcheol Park Dongwook Kim Junil Sohn Computer & Telecomm. Eng. Division Yonsei University Samsung Advanced Institute of Technology (SAIT)

ISBN: (纸本)9781424441211

This paper presents an adaptive feedback cancellation (AFC) algorithm with robust and stable performance. The proposed algorithm is based on the pseudo affine projection (PAP) algorithm which approximates the affine projection (AP) with a complexity comparable to the NLMS. Direct application of the PAP to AFC, however, often exhibits instability because of the delayed estimate of the linear prediction (LP) coefficients. This problem is solved in the proposed algorithm by utilizing an inverse gain filter (IGF) before the update of adaptive filter and by estimating the LP coefficients from the input signal without delay. Simulation results confirmed robustness and stability of the proposed algorithm.

关键词： input signal Affine In-law Automatic frequency control age at first kidding adaptive filters Pseudo projection algorithms Feedback Robustness Self tuning

来源：评论

学校读者我要写书评

暂无评论

A new algorithm for characters segmentation of license plate based on variance projection and mean filter

A new algorithm for characters segmentation of license plate...

引用

IEEE Conference on Cybernetics and Intelligent Systems

作者： Yawei Ma Jieru Chi Ran Hu Guowei Yang Qingdao University Qingdao Shandong China

According to the prior information of license plate, a new algorithm for characters segmentation of license plate based on variance projection and mean filter is proposed. Firstly, some preprocessing is performed toward the license plate images and image binarization is adopted after the processes. Then the horizontal boundaries and rivet are removed by using horizontal projection of license plate. Thus character separation of the license plate is implemented by using vertical projection which is processed based on mean filter, located the best segmentation points of adjacent characters. The experimental result shows that this algorithm has a good effect on the segmentation.

关键词： Licenses Image segmentation Character recognition Conferences projection algorithms Algorithm design and analysis Vectors

来源：评论

学校读者我要写书评

暂无评论

Multilinear projection for face recognition via canonical decomposition

Multilinear projection for face recognition via canonical de...

引用

International Conference on Automatic Face and Gesture Recognition

作者： M. Alex O. Vasilescu University of California Los Angeles USA

This paper introduces a new multilinear projection algorithm for appearance-based recognition in a tensor framework. The multilinear projection simultaneously maps an unlabeled image from the pixel space into multiple causal factors underlying image formation, including illumination, imaging, and scene structure. For facial recognition, the most relevant aspect of scene structure is the specific person whose face has been imaged. Our new multilinear projection algorithm, which is based on the canonical decomposition of tensors, is superior to our previously proposed multilinear projection algorithm that is based on an M-mode SVD. To develop our new algorithm, we extend and formalize the definition of the mode-m product, the modem identity tensor, and the mode-m pseudo-inverse tensor. We demonstrate our multilinear projection in the context of facial image recognition and compare its results in simultaneously inferring the identity, view, illumination, etc., coefficient vectors of an unlabeled test image against those obtained using multilinear projection based on the M-mode SVD, as well as against the results obtained using a set of multiple linear projections. Finally, we present a strategy for developing a practical biometric system that can enroll an uncooperative subject using a one or more images and then recognize that subject in unconstrained test images.

关键词： Tensile stress Lighting Image recognition projection algorithms Matrices Face recognition Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Gradient projection Based Algorithm for Large Scale Real Time Model Predictive Control

Gradient Projection Based Algorithm for Large Scale Real Tim...

引用

2011 Chinese Control and Decision Conference（CCDC）

作者： Ondej antin Vladimir Havlena Faculty of Electrical Engineering Department of Control EngineeringCzech Technical University in PraguePrague

In model predictive control (MPC),the quadratic program (QP) is solved at each sampling time,thus a fast and effective on-line solver must be used for short sampling *** multi-parametric quadratic programming (mp-QP) (explicit solution) is impossible to use for larger systems due to the memory *** objective of this paper is to present an effective on-line solver for large-scale simple constrained quadratic programming which arises in the MPC *** presented algorithm uses the combination of gradient and Newton projection method to obtain super-linear convergent algorithm which is very close to optimum in very few iterations when many constraints are active in optimum and it does not involve the exact computation of the Newton step at each iteration.

关键词： Mathematical programming Quadratic programming Newton methods Gradient methods projection algorithms Predictive control Real time systems

来源：评论

学校读者我要写书评

暂无评论

PRACTICAL REGULARIZATION OF THE AFFINE projection ALGORITHM

PRACTICAL REGULARIZATION OF THE AFFINE PROJECTION ALGORITHM

引用

European Signal Processing Conference

作者： Constantin Paleologu Jacob Benesty Silviu Ciochina Telecommunications Department University Politehnica of Bucharest INRS-EMT University of Quebec

It is well-known that a matrix inversion is required within the affine projection algorithm (APA). Depending on the character of the input signal, this matrix can be very ill-conditioned. Consequently, it needs to be regularized before inversion, i.e., a positive constant is added to the elements of its main diagonal. Also known as the regularization parameter, this constant plays a major role in practice;if it is not chosen properly, the APA may never converge, especially under low signal-to-noise ratio conditions. The contribution of this paper is twofold. First, we provide a formula for choosing an "optimal" regularization parameter, aiming at attenuating the effects of the noise in the adaptive filter estimate. Second, two practical ways for evaluating this parameter are proposed. Simulations performed in the context of acoustic echo cancellation (in different noisy environments) prove the validity of the proposed solutions.

关键词： Noise Speech Echo cancellers Noise measurement Vectors projection algorithms

来源：评论

学校读者我要写书评

暂无评论

A proportionate affine projection algorithm using dichotomous coordinate descent iterations

A proportionate affine projection algorithm using dichotomou...

引用

International Symposium on Signals, Circuits and Systems (ISSCS)

作者： Cristian Stanciu Cristian Anghel Constantin Paleologu Jacob Benesty Felix Albu Silviu Ciochină Telecommunications Department University Politehnica of Bucharest Romania INRS-EMT University of Quebec Montreal Canada

This paper proposes a low-complexity proportionate affine projection algorithm (PAPA) suitable for echo cancellation. It is known that proportionate-type algorithms exploit the sparseness character of the echo path in order to achieve faster convergence and tracking as compared to the conventional algorithms. The proposed algorithm results as a combination between a recently proposed “memory”-PAPA (MPAPA) and an iterative technique for solving the matrix inversion problem, i.e., the dichotomous coordinate descent (DCD) with a leading element. Simulations performed in the context of network echo cancellation indicate the good performance of the proposed algorithm.

关键词： Echo cancellers Speech projection algorithms Convergence History Complexity theory Context

来源：评论

学校读者我要写书评

暂无评论

An efficient variable step-size proportionate affine projection algorithm

An efficient variable step-size proportionate affine project...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Constantin Paleologu Jacob Benesty Felix Albu Silviu Ciochină University Politehnica of Bucharest Romania INRS-EMT University of Quebec Montreal Canada

Proportionate-type affine projection algorithms (PAPAs) are very at tractive choices for echo cancellation. These algorithms combine the good features (convergence and tracking) of the affine projection algorithm (APA) and the proportionate idea, which exploits the sparseness character of the echo path in order to further increase their convergence rate. In this paper, we develop a variable step-size (VSS) version of a recently proposed PAPA. The new algorithm achieves a good compromise between fast convergence rate and low misadjustment, but also has a low computational complexity as compared to its classical counterparts.

关键词： Echo cancellers Convergence projection algorithms Speech IP networks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Decomposition methods for large scale LP decoding

Decomposition methods for large scale LP decoding

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Siddharth Barman Xishuo Liu Stark Draper Benjamin Recht Department of Computer Sciences University of Wisconsin Madison USA Department of Electrical and Computer Engineering University of Wisconsin Madison USA

Feldman et al. (IEEE Trans. Inform. Theory, Mar. 2005) showed that linear programming (LP) can be used to decode linear error correcting codes. The bit-error-rate performance of LP decoding is comparable to state-of-the-art BP decoders, but has significantly stronger theoretical guarantees. However, LP decoding when implemented with standard LP solvers does not easily scale to the block lengths of modern error correcting codes. In this paper we draw on decomposition methods from optimization theory to develop efficient distributed algorithms for LP decoding. The key enabling technical result is a nearly linear time algorithm for two-norm projection onto the parity polytope. This allows us to use LP decoding, with all its theoretical guarantees, to decode large-scale error correcting codes efficiently.

关键词： Vectors Maximum likelihood decoding Iterative decoding projection algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Research on Role Correlation in WSCDL

Research on Role Correlation in WSCDL

引用

International Conference on Network Computing and Information Security (NCIS)

作者： Xu Donghong Qi Yong Jiang Shujuan School of Electronics and Information Engineering Xi''an Jiaotong University Xi'an China School of Computer Science and Technology China University of Mining and Technology Xuzhou China

Role correlation involves dynamic reassigning different choreography roles into new groups in WSCDL. It breaks the original logical structure of participants in WSCDL to form new groups for improve the projection efficiency. Reassigning roles in WSCDL can enhance the efficiency of mapping from WSCDL to WSBPEL, improve the projection granularity, and grantee the right design and implementation of SOA. The paper defines the role correlation problem and introduces partition algorithm and projection algorithm. By applying those algorithm in WSCDL can deduce the complexity of generated Orchestration, therefore, development, maintenance, and adaptability would be greatly improved.

关键词： Partitioning algorithms Correlation Algorithm design and analysis Business projection algorithms Web services Syntactics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：