对无临近点信息干涉条纹的参数估计

用广义radon变换可以从运动目标产生的干涉条纹中估计出目标的运动参数和波导不变量。但是当干涉条纹中没有出现临近点时,用此方法估计不出真实值。为了解决此问题,提出了一种新的估计方法。主要过程是先从时频图中提取出干涉条纹轨迹,再去搜索与此轨迹误差最小的最优曲线,此曲线的参数值代表目标的运动参数和波导不变量。仿真和海试结果表明,在干涉条纹无临近点信息情况下,用广义radon变换估计的参数值与真实值偏差很大,但是文中提出的方法仍能估计出较准确的结果。     

Oil spill detection from SAR intensity imagery using a marked point process

This paper presents a new algorithm for the detection of oil spill from SAR intensity images. The proposed algorithm combines the marked point process, Bayesian inference and Markov Chain Monte Carlo (MCMC) technique. In this paper, the candidates of oil spills or dark spots in a SAR intensity image are characterized by a Poisson marked point process. The marked point process is formed by a group of random points (as a point process modelling the locations of oil spills) and a set of parameters including geometric parameters of windows centred at the random points and gamma distribution parameters (as the marks attaching to each point). As a result, the candidates of oil spills are represented by a group of windows, in which the intensities of pixels follow independent and identical gamma distribution with lower mean than that for the identical gamma distribution of the pixels out of windows. Following the Bayesian paradigm, the posterior distribution, which characterizes the locations and statistical distributions of oil spills, can be obtained up to a normalizing constant. In order to simulate from the posterior distribution and to estimate the parameters of the posterior distribution, the Revisable Jump MCMC (RJMCMC) algorithm is used. The optimal locations and sizes of dark spots are obtained by a maximum a posteriori (MAP) algorithm. The proposed approach is tested using Radarsat-1 SAR images with oil spills indicated by human analysts. The results show that the proposed approach works well and is very promising.     

基于MAP的全局运动估计算法

常见的全局运动算法存在的问题是仅仅考虑像素的残差,而忽略了相邻像素和分割信息等因素对算法的影响。为了解决上述问题,该文提出一个基于最大后验概率（MAP）的全局运动估计算法。通过MAP算法定义系统能量,引入先验能量来描述像素的相邻关系和分割信息,将系统能量作为目标函数通过LM算法估计全局运动参数。实验结果证明了该算法的有效性。     

基于HMRF先验模型的超分辨率重建

针对基于最大后验概率(MAP)的超分辨率重建算法在重建图像过程中存在的问题,提出一种基于Huber-马尔可夫随机场(HMRF)先验模型的超分辨率重建方法,采用HMRF作为图像先验模型,对图像进行分段超分辨率重建。仿真实验结果表明,与传统的MAP算法相比,该方法能更好地保存重建图像的边缘细节,有效提高重建图像的质量。     

一种层次型移动IPv6的MAP选择机制的研究

在MIPv6(Mobile IPv6,移动IPv6)的基础上,学者们提出了HMIPv6(Hierarchical MIPv6,层次移动IPv6)。但是HMIPv6的移动锚点MAP(Mobile Anchor Point)选择机制存在MAP负载过于集中、MAP中路径过长等问题。在HMIPv6的基础上,提出一种基于位置区域的MAP选择机制,使MN(Mobile Node)主动选择最适合自己的MAP。仿真结果显示,负载不再集中在某一MAP上,MN选择了最适合的MAP,缩短了MAP到MN的路径。     

Bayesian zero-order TSK fuzzy system modeling

Different from the existing TSK fuzzy system modeling methods, a novel zero-order TSK fuzzy modeling method called Bayesian zero-order TSK fuzzy system (B-ZTSK-FS) is proposed from the perspective of Bayesian inference in this paper. The proposed method B-ZTSK-FS constructs zero-order TSK fuzzy system by using the maximum a posteriori (MAP) framework to maximize the corresponding posteriori probability. First, a joint likelihood model about zero-order TSK fuzzy system is defined to derive a new objective function which can assure that both antecedents and consequents of fuzzy rules rather than only their antecedents of the most existing TSK fuzzy systems become interpretable. The defined likelihood model is composed of three aspects: clustering on the training set for antecedents of fuzzy rules, the least squares (LS) error for consequent parameters of fuzzy rules, and a Dirichlet prior distribution for fuzzy cluster memberships which is considered to not only automatically match the “sum-to-one” constraints on fuzzy cluster memberships, but also make the proposed method B-ZTSK-FS scalable for large-scale datasets by appropriately setting the Dirichlet index. This likelihood model indeed indicates that antecedent and consequent parameters of fuzzy rules can be linguistically interpreted and simultaneously optimized by the proposed method B-ZTSK-FS which is based on the MAP framework with the iterative sampling algorithm, which in fact implies that fuzziness and probability can co-jointly work for TSK fuzzy system modeling in a collaborative rather than repulsive way. Finally, experimental results on 28 synthetic and real-world datasets are reported to demonstrate the effectiveness of the proposed method B-ZTSK-FS in the sense of approximation accuracy, interpretability and scalability.     

面向分层移动IPv6 网络的动态指针推进机制

基于指针推进机制的分层移动IPv6方案因未考虑移动锚点管理域的影响,导致较高的注册和报文分发开销.提出一种面向分层移动IPv6网络的动态指针推进机制(dynamic pointer forwarding scheme for HMIPv6 networks,简称DPF-HMIPv6),移动节点可根据所选移动锚点的管理域大小,动态调整指针推进机制.若所选移动锚点的管理域大于特定阈值,则移动节点通过在接入路由器间构建指针链来避免频繁地向移动锚点注册;若所选移动锚点的管理域小于阈值,则移动节点通过在移动锚点间构建指针链来避免频繁地向家乡代理注册.数值分析和仿真实验的结果表明,该方案能够有效解决现有方案存在的问题,显著降低分层移动IPv6网络的开销.     

分级移动IPv6中一种新的自适应MAP选择算法*

分级移动IPv6中存在单点故障和负荷集中问题。提出一种基于分布式MAP结构的自适应MAP选择算法,综合考虑移动节点的当前速度、会话到达率、MAP负荷及距离等因素,以MN注册后将产生的移动性管理信令开销最小为依据进行选择。仿真结果表明,自适应MAP选择算法能够根据移动节点和网络的当前特性优化地选择不同的MAP进行注册,使移动性管理信令开销最小,具有较好的负荷分担效果,并一定程度上增强了分级结构的鲁棒性。与最远/近MAP选择方案相比,自适应MAP选择算法能够提高网络的吞吐量及减少平均切换时延。     

Turbo码交织矩阵的一种改进设计

Ｔｕｒｂｏ码以其优异的性能而迅速成为近年来信道编码领域研究的热点。在Ｔｕｒｂｏ码的设计中,交织矩阵是影响其整体性能的重要因素。尤其是在采用小规模交织矩阵时,不同的设计产生的结果差别很大,本文提出一种交织矩阵的改进设计方法,它能够使成员码编码器网络在一帧数据编码结束后全部终结归零,从而为译码判决提供了正确的初始条件,与传统的非全归零交织矩阵相比较,分析结果表明本文提出的设计方案性能更优。３１     

基于最大后验估计的自适应盲均衡算法

为了减小最大后验概率(MAP)盲均衡算法中稳态误差和收敛速度,提出了一种改进的基于最大后验估计的盲均衡算法.运用不等概思想改进自适应σ的MAP盲均衡算法,得到了基于概率和自适应σ的MAP盲均衡算法.定量分析和仿真结果表明改进算法和MAP的盲均衡算法相比,稳态调整量的理论值更小,稳态剩余根均方误差值小于MAP盲均衡算法,收敛速度快于MAP盲均衡算法.