空间关联与多子区规范化梯度方向直方图的 异源图像匹配

提出一种基于稀疏空域分割与梯度方向直方图的异源图像匹配方法。将图像分为多个子区,计算每个子区的梯度方向直方图;计算直方图的汇聚度,并根据汇聚度计算直方图相似性;采用两步搜索法,寻找与基准图中与实时图直方图相似度最高的窗口即为正确匹配结果。采用仿真图和真实异源图像对算法进行了测试,结果表明,这种方法能够可靠快速实现异源图像匹配。     

航拍图像车辆检测中的圆形滤波器HOG特征快速计算

航拍图像中车辆一般近似为矩形结构,因此通过统计检测窗口中的梯度方向直方图并根据梯度主方向估计车辆朝向,将检测窗口旋转到相应方向进行分类器判别。车辆检测采用级联boosting分类器和梯度方向直方图特征,针对旋转窗口中梯度方向直方图特征的计算,设计一种基于圆形滤波器的梯度方向直方图特征。与传统基于积分直方图的梯度方向直方图特征提取方法相比,显著提高了旋转窗口中梯度方向直方图特征的计算效率,在计算每个像素的梯度时采用查找表代替梯度向量的求模和角度计算也减小了计算量。使用真实图像进行的实验表明,该车辆检测算法快速高效。     

二值化编码和相位相关的鲁棒景像匹配方法

结合二值化编码和相位相关,提出了一种快速有效的鲁棒景像匹配方法.首先利用2×2窗口上主对角线上像素灰度值的升降对实时图和基准子图进行二值化编码;然后,搜索二值化后的实时图在基准图中的位置,即,根据二值化后的实时图和基准子图的相位相关函数进行定位.多组实验与分析表明,该景像匹配定位算法对部分遮挡、图像灰度与对比度变化以及复杂噪声干扰等都具有比较强的鲁棒性.     

新型机载布撤器子母弹对跑道封锁效能计算方法

研究了装载新型反跑道子弹药的防区外机载布撒器对跑道封锁效能的计算方法。首先简要介绍了新型反跑道子弹的工作原理和攻击跑道的特点;然后,根据分段毁伤跑道的战术要求引入横向切断概率和纵向封锁边界两个概念描述单发子母弹对跑道的毁伤效果,并利用简单易行的“边界窗口扫描法”搜索两个攻击区域之间是否存在最小起降窗口,最后给出跑道整体失效概率的计算方法和布撒器瞄准点优化方法。     

用于三维点云表示的扩展点特征直方图算法

局部特征提取在点云相关应用中具有十分重要的作用,因此提出一种用于点云局部特征表示的扩展点特征直方图描述子。针对邻域点的两两点对提出一系列不变量;在特征点上构建一个局部参考坐标框架以获得特征描述子对旋转和平移的不变性;将关键点局部邻域划分成多个子空间,并依据每个子空间中的点对不变量构建一个直方图;将所有直方图串联起来得到扩展点特征直方图特征描述子。采用Bologna公共数据集对扩展点特征直方图特征描述子的性能进行测试,并与多个现有算法进行对比。结果表明,扩展点特征直方图特征描述子获得了良好的性能,其结果优于多个现有的特征描述子。     

跑道失效率的一种快速解析近似计算方法

针对现有的跑道失效率计算方法对数据的处理要求很复杂,并且计算效率较低,难以满足实时性要求的不足,提出一种快速的解析近似计算方法,通过有利弹着区的选取以及瞄准点的优化选择,将问题从搜索最小升降窗口转化为求解母弹对有利弹着区的命中概率,免去了搜索升降窗口的计算时间,从而大幅提高了计算效率。仿真结果表明,快速解析近似计算方法计算速度快且满足了精度要求。     

基于空间子区一致性的异源图像匹配方法

提出一种基于空间子区一致性的异源图像匹配方法.该方法中,将图像划分为许多大小相同的子区;分别计算邻近子区间的灰度直方图距离,得到一种图像结构特征描述--似邻矩阵;利用似邻矩阵计算图像间的子区一致性;采用改进的搜索策略,快速获得匹配结果.实验结果表明,该方法在正确率和计算时间方面均优于传统方法.     

基于圆形滤波器HOG特征的航拍图像车辆快速检测算法

航拍图像中车辆一般近似为矩形结构,因此通过统计检测窗口中的梯度方向直方图并根据梯度主方向估计车辆朝向,然后将检测窗口旋转到相应方向进行分类器判别。车辆检测采用级联boosting分类器和梯度方向直方图特征(HOG,Histograms of Orient Gradient),针对旋转窗口中HOG特征的计算,设计了一种基于圆形滤波器的HOG(Circle Filter based HOG,CFHOG)特征,与传统基于积分直方图的HOG特征提取方法相比,显著提高了旋转窗口中HOG特征的计算效率,此外在计算每个像素的梯度时采用查找表代替梯度向量的求模和角度计算也减小了计算量。使用真实图像进行的实验表明本文车辆检测算法快速高效。     

结合分割和改进SIFT的不同波段SAR图像配准

针对不同波段SAR图像配准问题,提出一种结合阈值分割和改进SIFT描述子的配准方法。该方法首先基于改进的二维交叉熵进行图像分割,通过形态学处理获得图像的稳定区域;然后利用Sobel算子改进特征点梯度幅值和方向的计算,并通过优化的梯度位置方向直方图(GLOH)特征生成新的关键点描述子;最后采用距离比和快速抽样一致(FSC)算法获得最佳匹配点对,完成图像配准。实验结果表明,该方法在提升算法效率的同时,可以获得较高的配准精度。     

自适应窗口仿射最小二乘匹配方法

为了解决仿射最小二乘匹配方法在未知初始参数条件下无法自适应选择匹配窗口的问题,提出了一种基于局部形状估计的自适应窗口最小二乘匹配方法。利用LOG(Laplacian of Gaussian)算子检测特征点以及特征点所在的尺度;在特征点邻域内根据特征尺度计算局部二阶矩矩阵,用二阶矩矩阵估计特征点局部的形状特征;根据特征点局部的形状自适应选择初始匹配窗口进行仿射最小二乘迭代。实验结果表明,该方法在较大仿射变形下能够准确的选择有效匹配区域,避免因窗口内容差异造成的迭代不收敛问题。     

一种改进的Mean-shift目标跟踪算法

提出了一种利用多帧图像中目标区域颜色直方图特征信息的Mean-shift目标跟踪算法,该算法以Mean-shift为核心,在对目标模板建立特征模型时,不仅考虑了前一帧的目标区域的颜色直方图,而且将前数帧中目标区域的颜色直方图通过加权一起考虑,从而提高了跟踪的稳定性。     

机载平台野外立体场景弱小变化目标检测

提出了一种针对机载序列图像的野外立体场景弱小变化目标检测新方法。为了补偿平台运动,提出了一种级联图像配准模式,即首先通过生物视觉方法对待检图像进行快速粗配准,然后通过不变系数最小二乘匹配进行精配准;为了补偿图像间的灰度变化,提出了直方图一致性变换方法,该方法不仅可以处理线性灰度变化而且可以处理非线性灰度变化;为了弱化场景立体效应影响,提出分子区的方法,即通过将图像划分为若干子区,各对应子区独立求解仿射参数,使得待检图像不同位置子区可以对应不同几何变换参数。光电吊舱真实图像变化检测实验,证明了文章方法的正确性和有效性。     

基于多测量融合的粒子滤波跟踪算法

复杂背景下运动目标的可靠跟踪,是计算机视觉领域中一个极具挑战性的问题。提出了一种融合颜色和纹理信息的粒子滤波跟踪算法,在粒子滤波的测量阶段,使用颜色直方图对目标进行颜色描述,用梯度方向向量对目标进行纹理描述。对这两种信息,分别用Bhattacharyya系数和欧几里德距离比较粒子与参考模板的相似性。为解决目标变化和遮挡问题,采用了模板更新策略。实验结果表明该方法是稳健的,能够在复杂的背景下对运动目标进行有效、可靠的跟踪。     

加权随机模拟的时变可靠性分析方法

针对结构时变可靠性的随机模拟分析方法计算代价大的问题,在极值方法的基础上提出基于加权随机模拟的时变可靠性分析策略。时变可靠性分析需要计算在不同时间处的失效概率,通常需要进行多次可靠性分析,计算代价巨大。所提方法通过对常规静态可靠性的随机模拟方法进行改进拓展,运用加权策略分别发展了加权蒙特卡洛法和加权重要抽样法,使之能够高效分析计算时变可靠性问题。所提方法仅需一次常规可靠性分析模拟,即可得到时变失效概率函数估计。采用管状悬臂梁和十杆桁架两个算例进行验证。结果表明,基于加权思想的分析方法在能确保精确度的前提下能够大幅度减小计算量,提高计算效率。     

Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

A forward network simplex algorithm for solving multiperiod network flow problems

An optimization model which is frequently used to assist decision makers in the areas of resource scheduling, planning, and distribution is the minimum cost multiperiod network flow problem. This model describes network structure decision-making problems over time. Such problems arise in the areas of production/distribution systems, economic planning, communication systems, material handling systems, traffic systems, railway systems, building evacuation systems, energy systems, as well as in many others. Although existing network solution techniques are efficient, there are still limitations to the size of problems that can be solved. To date, only a few researchers have taken the multiperiod structure into consideration in devising efficient solution methods. Standard network codes are usually used because of their availability and perceived efficiency. In this paper we discuss the development, implementation, and computational testing of a new technique, the forward network simplex method, for solving linear, minimum cost, multiperiod network flow problems. The forward network simplex method is a forward algorithm which exploits the natural decomposition of multiperiod network problems by limiting its pivoting activity. A forward algorithm is an approach to solving dynamic problems by solving successively longer finite subproblems, terminating when a stopping rule can be invoked or a decision horizon found. Such procedures are available for a large number of special structure models. Here we describe the specialization of the forward simplex method of Aronson, Morton, and Thompson to solving multiperiod network network flow problems. Computational results indicate that both the solution time and pivot count are linear in the number of periods. For standard network optimization codes, which do not exploit the multiperiod structure, the pivot count is linear in the number of periods; however, the solution time is quadratic.     

Evaluating the potential effects from probabilistic selling of similar products

In this article, we consider an online retailer who sells two similar products (A and B) over a finite selling period. Any stock left at the end of the period has no value (like clothes going out of fashion at the end of a season). Aside from selling the products at regular prices, he may offer an additional option that sells a probabilistic good, “A or B,” at a discounted price. Whenever a customer buys a probabilistic good, he needs to assign one of the products for the fulfillment. Considering the choice behavior of potential customers, we model the problem using continuous‐time, discrete‐state, finite‐horizon dynamic programming. We study the optimal admission decisions and devise two scenarios, whose value functions can be used as benchmarks to evaluate the demand induction effect and demand dilution effect of probabilistic selling (PS). We further investigate an extension of the base MDP (Markov Decision Process) model in which the fulfillment of probabilistic sales is uncontrollable by the retailer. A special case of the extended model can be used as a benchmark to quantify the potential inventory pooling effect of PS. Finally, numerical experiments are conducted to evaluate the overall profit improvement, and the effects from adopting the PS strategy. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 604–620, 2014     

Quadratic bottleneck problems

We study the quadratic bottleneck problem (QBP) which generalizes several well‐studied optimization problems. A weak duality theorem is introduced along with a general purpose algorithm to solve QBP. An example is given which illustrates duality gap in the weak duality theorem. It is shown that the special case of QBP where feasible solutions are subsets of a finite set having the same cardinality is NP‐hard. Likewise the quadratic bottleneck spanning tree problem (QBST) is shown to be NP‐hard on a bipartite graph even if the cost function takes 0–1 values only. Two lower bounds for QBST are derived and compared. Efficient heuristic algorithms are presented for QBST along with computational results. When the cost function is decomposable, we show that QBP is solvable in polynomial time whenever an associated linear bottleneck problem can be solved in polynomial time. As a consequence, QBP with feasible solutions form spanning trees, s‐t paths, matchings, etc., of a graph are solvable in polynomial time with a decomposable cost function. We also show that QBP can be formulated as a quadratic minsum problem and establish some asymptotic results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

给定人员情况下最小化开发时间和成本的软件项目调度

给出了一种软件项目的随机调度模型.它明确地把调度策略作为输入,一旦调度策略确定,模型就可以输出关于项目的完成时间或成本的一个概率分布.利用随机最优化技术,能够计算出软件项目的一个调度策略,它使得项目在人员给定的情况下开发时间和成本最小.     

一种基于Mellin变换的水声宽带相关模糊函数的快速算法

提出了一种基于Mellin 变换的快速算法,其特点是在给定的某一时刻得到不同尺度下的变换结果,算法的运算量与待分析的时延成正比,而在固定时刻下的运算量为两个2M点的FFT和一次2M点复数乘法(M为待分析的尺度的个数).该算法的优点是实时性好,且适合于水声信号领域尺度跨度小、尺度分析较细的特点,并给出了与直接法、CZT法的比较结果.