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

A Fast algorithm for Matching Remote Scene Images

Geo-Spatial Information Science 2008年第3期11卷 197-200页

作者： LIU Jin YAN Li School of Geodesy and Geomatics Wuhan University 129 Luoyu Road Wuhan 430079 China State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University 129 Luoyu Road Wuhan 430079 China.

An iterative algorithm to calculate mutual correlation using hierarchical key points and the search space mark principle is proposed. An effective algorithm is designed to improve the matching speed. By hi-erarchical key point algorithm and mutual correlation coefficients of the matching images, the important points can be iteratively calculated in the images hierarchically, and the correlation coefficient can be ob-tained with satisfactory precision. Massive spots in the parameter space which are impossible to match can be removed by the search space mark principle. Two approximate continuities in the correlation image matching process, the image gray level distribution continuity and the correlation coefficient value in the parameter space continuity, are considered in the method. The experiments show that the new algorithm can greatly enhance matching speed and achieve accurate matching results.

关键词： image correlation matching fast algorithm iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

Goos-Hänchen-like shifts in atom optics

引用

Physical Review A 2008年第6期77卷 063608-063608页

作者： Jianhua Huang Zhenglu Duan Hong Y. Ling Weiping Zhang State Key Laboratory of Precision Spectroscopy Department of Physics East China Normal University Shanghai 200062 People’s Republic of China Department of Physics and Astronomy Rowan University Glassboro New Jersey 08028-1700 USA

We consider the propagation of a matter wave packet of two-level atoms through a square potential created by a super-Gaussian laser beam. We explore the matter wave analog of Goos-Hänchen shift within the framework of atom optics where the roles of atom and light are exchanged with respect to conventional optics. Using a vector theory, where atoms are treated as particles possessing two internal spin components, we show that not only large negative but also large positive Goos-Hänchen shifts can occur in the reflected atomic beam.

关键词： ABSORBING MEDIA LATERAL SHIFT LIGHT-BEAM iterative algorithm TOTAL REFLECTION DIELECTRIC SLAB LASER-BEAM DISPLACEMENT METAMATERIALS CONFIGURATION

来源：评论

学校读者我要写书评

暂无评论

An iterative procedure to solve HJBI equations in nonlinear H ∞ control

引用

IFAC Proceedings Volumes 2008年第2期41卷 200-205页

作者： Yantao Feng Michael Rotkowitz Brian D.O. Anderson Department of Information Engineering Research School of Information Sciences and Engineering the Australian National University Canberra ACT 0200 Australia National ICT Australia 7 London Circuit Canberra ACT 0200 Australia Department of Electrical and Electronic Engineering The University of Melbourne Parkville VIC 3010 Australia

In this paper, an iterative algorithm to solve a special class of Hamilton-Jacobi-Bellman-Isaacs (HJBI) equations is proposed. By constructing two series of nonnegative functions, we replace the problem of solving an HJBI equation by the problem of solving a sequence of Hamilton-Jacobi-Bellman (HJB) equations whose solutions can be approximated recursively by existing methods. The local convergence of the algorithm is guaranteed. A numerical example is provided to demonstrate the accuracy of the proposed algorithm.

关键词： HJBI iterative algorithm locally exponentially stable

来源：评论

学校读者我要写书评

暂无评论

A New System of Variational Inclusions with （H,η）-accretive Operators in Banach Spaces

引用

Chinese Quarterly Journal of Mathematics 2008年第4期23卷 565-573页

作者： LIU Ying CHEN Yong-li HE Zhen College of Mathematics and Computer Hebei University Baoding 071002 China College of Tech-nology North China Electric Power University Baoding 071051 China

In this paper, we first introduce a new class of generalized accretive operators named （H,η）-accretive in Banach space. By studying the properties of （H,η）-accretive, we extend the concept of resolvent operators associated with m-accretive operators to the new （H,η）-accretive operators. In terms of the new resolvent operator technique, we prove the existence and uniqueness of solutions for this new system of variational inclusions. We also construct a new algorithm for approximating the solution of this system and discuss the convergence of the sequence of iterates generated by the algorithm.

关键词： q-uniformly smooth Banach space （H, η）-accretive operator resolvent operator technique system of variational inclusion iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

The solvability of a class of general nonlinear implicit variational inequalities based on perturbed three-step iterative processes with errors

引用

FIXED POINT THEORY AND APPLICATIONS 2008年第1期2008卷 634921-634921页

作者： Liu, Zeqing Kang, Shin Min Ume, Jeong Sheok Gyeongsang Natl Univ Dept Math Jinju 660701 South Korea Gyeongsang Natl Univ Res Inst Nat Sci Jinju 660701 South Korea Liaoning Normal Univ Dept Math Dalian 116029 Liaoning Peoples R China Changwon Natl Univ Dept Appl Math Chang Won 641733 South Korea

We introduce and study a new class of general nonlinear implicit variational inequalities, which includes several classes of variational inequalities and variational inclusions as special cases. By applying the resolvent operator technique and fixed point theorem, we suggest a new perturbed three-step iterative algorithm with errors for solving the class of variational inequalities. Several existence and uniqueness results of solutions for the general nonlinear implicit variational inequalities, and convergence and stability results of the sequence generated by the algorithm are obtained. The results presented in this paper extend, improve, and unify a host of results in recent literatures. Copyright (c) 2008.

关键词： .special cases VARIATIONAL INEQUALITIES iterative processes iterative algorithm convergence and stability variational inclusions Nonlinear Implicit perturbed three-step Class of General

来源：评论

学校读者我要写书评

暂无评论

Analysis of iterative ICI cancellation algorithm for uplink OFDMA systems with carrier-frequency offset

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2007年第7期E90B卷 1734-1745页

作者： Huang, Min Chen, Xiang Zhou, Shidong Wang, Jing Tsinghua Univ Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

In orthogonal frequency-division multiplex access (OFDMA) uplink, the carrier-frequency offsets (CFOs) between the multiple transmitters and the receiver introduce inter-carrier interference (ICI) and severely degrade the performance. In this paper, based on the perfect estimation of each user's CFO, we propose two low-complexity iterative algorithms to cancel ICI due to CFOs, which are denoted as the basic algorithm and the improved algorithm with decision-feedback equalization (DFE), respectively. For the basic one, two theorems are proposed that yield a sufficient condition for the convergence of iterations. Moreover, the interference-power-evolution (IPE) charts are proposed to evaluate the convergence behavior of this interference cancellation algorithm. Motivated by the IPE chart, the procedure of DFE is introduced into the iterations, which is the basic idea of the improved algorithm. For this improved algorithm, the error-propagation effect are analyzed and suppressed by an efficient stopping criterion. From IPE charts and simulation results, it can be easily observed that the basic algorithm has the same capability of ICI cancellation as the linear optimal minimum mean square error (MMSE) method, but offers lower complexity, while the improved algorithm with DFE outperforms the MMSE method in terms of the bit-error rate (BER) performance.

关键词： orthogonal frequency-division multiplex access (OFDMA) inter-carrier interference (ICI) carrier-frequency offset (CFO) iterative algorithm interference-power-evolution (IPE) chart decision-feedback equalization (DFE)

来源：评论

学校读者我要写书评

暂无评论

Appling contractive mapping hybrid genetic algorithms to finding all solutions of global optimization

Appling contractive mapping hybrid genetic algorithms to fin...

引用

Chinese Control and Decision Conference, CCDC

作者： Xunguang Ju Xiaogen Shao Rong Bao Liqing Xiao Liwen Wang Hongzhen Yu School of Information and Electrical Engineering Xuzhou Institute of Technology Xuzhou China College of Information and Electrical Engineering China University of Mining and Technology Xuzhou China

To solve the schema deception and premature convergence problem in the pure genetic algorithm, based on the theory method of interval, Banach fixpoint and genetic algorithms, the contractive-mapping-hybrid-genetic algorithms (CMGA) were constructed and quadratic extension of Lipschitz was applied to testify the multi mode function extremum. The calculating examples validated the algorithmpsilas excellent performance in the global optimization problem The verifying terms are simple and easy to be actualized. The algorithms speed up the convergence obviously and improved reliability, thus the schema deception and premature convergence problem can be well solved.

关键词： Genetics Complexity theory Gallium iterative algorithm Aerospace electronics Convergence

来源：评论

学校读者我要写书评

暂无评论

iterative Soft Multiuser Detection for MIMO MC-CDMA Systems

Iterative Soft Multiuser Detection for MIMO MC-CDMA Systems

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Zhendong Luo Dawei Huang Bell Laboratories Beijing China Department of Electronic Engineering Tsinghua University Beijing China

In this paper, an iterative soft multiuser detection (MUD) algorithm is proposed for multiple-input multiple-output multi-carrier code-division multiple access (MIMO MC-CDMA) systems. Based on an equivalent system model, an efficient soft MUD algorithm is first derived by the central limit theorem, the property of the complex Gaussian distribution, and fast matrix computation formulas. By iteratively using the soft MUD algorithm with some updated probability information, we then obtain the proposed iterative soft MUD algorithm. Finally, it is shown that this algorithm achieves near-optimal performance with very efficient iterative computations.

关键词： Multiuser detection MIMO algorithm design and analysis Multicarrier code division multiple access iterative algorithm Complexity theory Receiving antennas

来源：评论

学校读者我要写书评

暂无评论

LDPC codes for binary asymmetric channels

LDPC codes for binary asymmetric channels

引用

International Conference on Telecommunications (ICT)

作者： Ninoslav Marina University of Hawaii Honolulu HI USA

In this paper we examine the use of low-density parity-check (LDPC) codes in binary asymmetric channels. The problem is interesting since in some types of binary input fading multiple access channels (MAC) without channel state information (CSI), which use the successive decoding scheme, some of the users may experience asymmetric channels. It is well known that the successive decoder is a set of single user decoders and since there is no CSI at the receiver, the corresponding single user channels may be asymmetric in general. In that case the rate of interest of the user with the asymmetric channel is achieved by an unbalanced input distribution of the binary input. We are interested in constructing LDPC codes for these channels that approach the desired rate tuple in the capacity region. A convenient way of making the output distribution unbalanced is by introducing a mapper at the output of the encoder. Here we explain the method of mapping and its effect on the iterative decoding and derive closed form expressions for the upper bound of the probability of error.

关键词： Parity check codes Decoding iterative decoding Mutual information iterative algorithm Channel estimation Channel capacity

来源：评论

学校读者我要写书评

暂无评论

Minimum Cross Entropy Thresholding for SAR Images

Minimum Cross Entropy Thresholding for SAR Images

引用

3rd International Conference on Information and Communication Technologies, vol.3

作者： Ghada Al-Osaimi Ali El-Zaart Department of Computer Science College of Computer and Information Sciences King Saud University Riyadh Saudi Arabia

Vision plays the most important role in human perception, which is limited to only the visual band of the electromagnetic spectrum. Therefore, the need for Radar imaging systems, to recover some sources that are not within human visual band, is raised. This paper presents a new algorithm for Synthetic Aperture Radar (SAR) images segmentation based on thresholding technique. Generally, segmentation of a SAR image falls into two categories;one based on grey levels and the other based on texture. The present paper deals with SAR images segmentation based on grey levels. We developed a new formula using Minimum Cross Entropy Thresholding (MCET) method for estimating optimal threshold value based on Gamma distribution to analyzing data on images;that means histogram of SAR images is assumed to be a mixture of Gamma distributions. The proposed method is iterative which decreases the number of operation to converge tends to the optimal solution. It is applied on bi-modal and multimodal scenarios. The results obtained are promising.

关键词： SAR Images Image Thresholding Minimum Cross Entropy Gamma Distribution iterative algorithm Multimodal thresholding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：