基于多模式弱分类器的AdaBoost-Bagging车辆检测算法

针对现有车辆检测算法在实际复杂道路情况下对车辆有效检测率不高的问题,提出了融合多模式弱分类器,并以AdaBoost-Bagging集成为强分类器的车辆检测算法。结合判别式模型善于利用较多的特征形成较好决策边界和生成式模型善于利用较少的特征排除大量负样本的优点,以Haar特征训练判别式弱分类器,以HOG特征训练生成式弱分类器,以AdaBoost算法为桥梁,采用泛化能力强的Bagging学习器集成算法得到AdaBoost-Bagging强分类器,利用Caltech1999数据库和实际道路图像对检测算法进行了验证。验证结果表明:相比于单模式弱分类器,AdaBoostBagging强分类器在分类能力和处理时间上均具有优越性,表现为较高的检测率与较低的误检率,分别为95.7%、0.000 27%,每帧图像的检测时间较少,为25ms;与传统级联AdaBoost分类器相比,AdaBoost-Bagging强分类器虽然增加了12%的检测时间和30%的训练时间,但检测率提升了1.8%,误检率降低了0.000 06%;本文算法的检测性能显著优于基于Haar特征的AdaBoost分类器算法、基于HOG特征的SVM分类器算法、基于HOG特征的DPM分类器算法,具有较佳的车辆检测效果。     

基于粒子群算法的水下多元线阵阵形有源校正方法

针对存在阵元位置误差的水下多元线阵,提出一种基于粒子群优化算法的远场有源阵形校正方法.该方法选用2个辅助源分时工作方式,利用无条件最大似然方位估计算法构建目标函数,并通过粒子群算法对阵元位置进行寻优.利用该方法对均匀线阵进行性能仿真实验.结果表明:该方法稳健性好、校正精度高,具有一定的应用前景.     

基于进化规划算法的舰船辐射噪声分类

神经网络分类器在舰船辐射噪声分类中得到了广泛的应用.针对神经网络分类器的设计困难,提出一种基于进化规划算法的设计方法.在该方法中,进化算法的适应度函数不是取为神经网络分类器对训练样本的识别率,而是对训练样本的可分性和聚合度同时考虑,这样能够在保证识别精度的前提下,使网络分类器具有良好的泛化能力,而且该方法不仅能够对待识别的样本进行离线学习,也能够在线学习.使用该分类器对舰船辐射噪声进行分类识别试验,结果表明该方法设计的分类器具有良好的性能.     

Estimation of origin-destination matrices from link counts and sporadic routing data

Estimation of origin-destination (OD) matrices from link count data is a challenging problem because of the highly indeterminate relationship between the observations and the latent route flows. Conversely, estimation is straightforward if we observe the path taken by each vehicle. We consider an intermediate problem of increasing practical importance, in which link count data is supplemented by routing information for a fraction of vehicles on the network. We develop a statistical model for these combined data sources and derive some tractable normal approximations thereof. We examine likelihood-based inference for these normal models under the assumption that the probability of vehicle tracking is known. We show that the likelihood theory can be non-standard because of boundary effects, and provide conditions under which such irregular behaviour will be observed in practice. For regular cases we outline connections with existing generalised least squares methods. We then consider estimation of OD matrices under estimated and/or misspecified models for the probability of vehicle tracking. Theoretical developments are complemented by simulation experiments and an illustrative example using a section of road network from the English city of Leicester.     

S变换在水下目标识别中的应用

研究了基于S变换模时频矩阵相似度的水下目标识别方法。根据测试样本对应的S变换模时频矩阵与标准样本对应的S变换模时频矩阵之间的相似度最大原则对测试样本进行识别。该方法不需要辅助分类器而直接实现目标识别,计算简单快速。仿真实验表明,该方法的识别率较高,且受噪声影响小,适合于水下目标识别。     

A new estimation approach for the multiple discrete–continuous probit (MDCP) choice model

This paper develops a blueprint (complete with matrix notation) to apply Bhat’s (2011) Maximum Approximate Composite Marginal Likelihood (MACML) inference approach for the estimation of cross-sectional as well as panel multiple discrete–continuous probit (MDCP) models. A simulation exercise is undertaken to evaluate the ability of the proposed approach to recover parameters from a cross-sectional MDCP model. The results show that the MACML approach does very well in recovering parameters, as well as appears to accurately capture the curvature of the Hessian of the log-likelihood function. The paper also demonstrates the application of the proposed approach through a study of individuals’ recreational (i.e., long distance leisure) choice among alternative destination locations and the number of trips to each recreational destination location, using data drawn from the 2004 to 2005 Michigan statewide household travel survey.     

一种单脉冲末制导雷达抗质心干扰算法

为了提高单脉冲末制导雷达的抗质心干扰能力,结合信号到达方向（DOA）的极大似然估计法和卡尔曼滤波,提出了一种新的算法。首先,在假设目标和干扰数量、参数已知的情况下,建立雷达多次接收信号匹配滤波后跟踪回波附近的多个相邻采样点的似然函数。其次,计算得到目标和干扰信号DOA、延迟和功率的极大似然估计,并应用最小描述长度（MDL）准则判断目标和干扰数量。最后,设计了合适的卡尔曼滤波器用于正确跟踪目标。仿真结果验证了算法的有效性。     

基于Monte Carlo抽样方法的随机离散化在分组数据中的应用

对一种基于Monte Carlo抽样方法的随机离散化做了改进,并将改进后方法应用于分组数据的统计推断中,用来计算未知参数的近似极大似然估计和区间估计.改进后的方法弥补了原方法有时不能满足Sn(f)≈S(f)的缺点.该方法思想简单,易于执行,并且是非迭代,任意维的.所以,通过实例模拟,还可以看出该方法运行速度快,远优于Gibbs抽样、EM算法等其它几种方法.而且运算结果精度高,尤其表现在未知参数的区间估计上.因此提供了一种计算未知参数估计的简单方法.     

机动目标跟踪典型算法评述

机动目标跟踪算法可以划分为两种：极大似然法和贝叶斯估计法，前者通过对目标量测序列的分析，采用与当前目标运动模式匹配度最高（极大似然性）的模型（包括系统模型和观测模型）对目标状态进行跟踪和估计；后者则首先假定一组模型，再根据量测序列进一步估计出其中每个模型的匹配概率，最后采用贝叶斯公式对全部或部分模型估计进行综合。在此框架下，论文对其中的一些典型算法进行总结和分析。     

A nested recursive logit model for route choice analysis

We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination. The value functions are the solution to a system of non-linear equations. We propose an iterative method with dynamic accuracy that allows to efficiently solve these systems.We report estimation results and a cross-validation study for a real network. The results show that the NRL model yields sensible parameter estimates and the fit is significantly better than the RL model. Moreover, the NRL model outperforms the RL model in terms of prediction.