融合LBP与背景建模的自适应目标检测混合算法

提高目标检测算法在复杂场景下的检测鲁棒性是目前计算机视觉领域的一个重点、难点问题。为了实现在多种背景扰动以及阴影同时存在的复杂场景下,对运动目标的准确、鲁棒提取,论文提出了一种融合纹理特征和背景建模的自适应目标检测混合算法。首先,为了对阴影进行有效处理,论文提出融合纹理特征的背景建模法;同时,在背景建模的基础上,引入亮度信息预处理程序;最后,论文在对复杂场景下(包括室内、室外)的背景扰动进行分析归类的基础上,将帧间差分法和背景建模法有机结合,有效提高算法对复杂场景的适应性。实验结果表明,复杂场景下,该算法对大多数背景扰动都具有一定的鲁棒性,能够实时、准确地检测出运动目标。

采用扩展MRF的红外目标自适应检测方法

针对天基红外监视系统中不同形状目标的联合检测问题,提出基于扩展马尔可夫随机场的自适应目标检测算法。首先分析了天基红外监视系统中的目标特性,在此基础上以典型目标形状为模板,构建了扩展的马尔可夫随机场邻域系统;其次构建了新的马尔可夫势函数,并利用红外图像中背景与目标之间的马尔可夫势差异,将复杂背景中不同形状目标联合检测问题转换为马尔可夫势差异的判别问题,有效解决了马尔可夫随机场理论框架下混合形状目标检测问题。仿真试验结果表明,所提出的算法能够根据目标形状的变化自适应地检测各类目标,并可在不同图像信杂比条件下进行目标检测处理,具有较强的鲁棒性。

一种高分辨率雷达海上目标自适应检测器

针对海上目标因波浪起伏和转向等导致的姿态变化引起的散射点起伏问题,在未知协方差矩阵的复高斯噪声背景下,研究了高距离分辨率雷达的距离扩展目标自适应检测问题。利用与待检测单元具有相同协方差矩阵结构的辅助数据估计未知噪声协方差矩阵,基于两步法检测策略获得了自适应检测器。恒虚警率特性分析表明,该检测器对不同噪声背景均具有很好的自适应特性。检测性能分析表明,该检测器对不同的目标模型具有很好的鲁棒性,且能有效避免"坍塌损失"。另外,通过增加传感器个数,可有效提高检测器性能。

空/时对称阵列雷达非高斯杂波背景下多秩距离扩展目标检测方法

针对多通道阵列雷达从实际杂波中检测目标场景,该文提出了一种面向多通道阵列雷达非高斯杂波背景的多秩距离扩展目标检测方法。首先,利用秩大于1的子空间矩阵和相应距离单元的坐标向量,建立了多秩距离扩展目标模型;然后,利用雷达接收单元空间或时间中心对称探测场景下杂波协方差矩阵的反对称结构信息,通过酉变换,采取广义似然比、Rao、Wald检验准则,构建待解参数小样本估计策略,设计了面向非高斯杂波背景的多秩距离扩展目标检测方法。最后,通过理论推导证明了所提检测方法相对于杂波协方差矩阵具有恒虚警特性。基于仿真数据和实测数据的实验结果表明,所提检测方法能够保证对杂波协方差矩阵具有恒虚警特性,此外,相较于现有检测方法,所提检测方法提升了小训练支持的目标检测性能,并且在导向矢量失配条件下,有效地改善目标检测的稳健性。

异常值个数未知下辅助数据自适应筛选方法

在雷达目标多通道自适应检测场景下,诸多非均匀背景因素易导致异常值干扰,使得辅助数据独立同分布条件难以满足,已有辅助数据筛选方法往往假定异常值个数已知,在个数未知的情况下面临较大性能损失。为此,该文研究了异常值个数未知情况下辅助数据自适应筛选方法。首先,在杂噪协方差矩阵已知条件下,建立了异常数据集合的最大似然估计,基于广义内积对辅助数据进行初步排序,将异常数据集合的最大似然估计过程简化为异常值个数估计。其次,利用快速最大似然方法进行未知协方差矩阵估计,提出了未知异常值个数下辅助数据自适应筛选方法。进一步地,为降低异常值对初步排序性能的不利干扰,基于归一化采样协方差矩阵设计了归一化广义内积形式,并结合迭代估计方式,对前述辅助数据自适应筛选流程进行改进。仿真结果表明,与广义内积相比,采用归一化广义内积可获得更高的筛选精度,采用较小迭代次数即可获得稳定的归一化信干比改善;与已有辅助数据筛选方法相比,该文所提方法在异常值个数未知条件下具有更好的筛选性能。

子空间不确定下多重假设AMF、Rao与Wald检测方法

由于目标多秩子空间大小的不确定性会导致多重假设检测发生,传统目标自适应二元检测方法不再适用。针对此问题,文章提出了子空间不确定下多重假设AMF、Rao与Wald检测方法。首先,基于Kullback-Leibler信息准则,建立了目标多秩子空间存在多种假设下的目标检测模型;然后,基于AMF、Rao和Wald检测准则,设计多重假设检测器,并优化估计未知参数与计算惩罚项。最后,通过仿真实验验证了所提检测器的性能,并分析了惩罚项对各检测器性能的影响。实验结果表明,相比传统检测器,所提检测器在一定情况下具有更优的检测性能。

非高斯杂波下自适应雷达目标检测新方法

在球不变随机向量(SIRV)非高斯杂波背景下,研究了多脉冲相参雷达目标的自适应检测问题。假设杂波具有相同的协方差矩阵结构和可能相关的纹理分量,提出了新的协方差矩阵估计器,并获得了相应的自适应归一化匹配滤波器(ANMF)。理论分析表明,在估计杂波分组大小与实际情况匹配时,所获得的ANMF对杂波功率水平和协方差矩阵结构均具有恒虚警率(CFAR)特性。仿真结果表明:当估计的杂波分组大小失配时,所获得的ANMF具有近似CFAR特性,并进一步分析了不同参数变化对所提检测器性能的影响。与已有的ANMF相比,所获得的ANMF具有更好的检测性能,且迭代次数更小,其相对于已知杂波协方差矩阵的最优归一化匹配滤波器(NMF)的检测损失也更小,具有很好的实际应用前景。

复合高斯杂波协方差矩阵估计的失配性能分析

在球不变随机向量的复合高斯杂波满足局部均匀的背景下,当估计的杂波分组大小与实际情况失配时,分析了自适应归一化匹配滤波器(ANMF)的恒虚警率(CFAR)特性和检测性能.理论分析表明,当杂波实际分组大小是估计分组大小的整数倍时,ANMF检测器对协方差矩阵结构和杂波功率水平均具有CFAR特性;而在其它的情况下ANMF检测器只对协方差矩阵结构具有CFAR特性.仿真结果还表明,不同子集的选取对ANMF检测器的CFAR特性影响不大;而在不同的失配条件下,ANMF存在不同程度的检测损失,且在纹理分量相关性信息完全未知时检测损失最大.

A new approach for real time object detection and tracking on high resolution and multi-camera surveillance videos using GPU

High resolution cameras and multi camera systems are being used in areas of video surveillance like security of public places, traffic monitoring, and military and satellite imaging. This leads to a demand for computational algorithms for real time processing of high resolution videos. Motion detection and background separation play a vital role in capturing the object of interest in surveillance videos, but as we move towards high resolution cameras, the time-complexity of the algorithm increases and thus fails to be a part of real time systems. Parallel architecture provides a surpass platform to work efficiently with complex algorithmic solutions. In this work, a method was proposed for identifying the moving objects perfectly in the videos using adaptive background making, motion detection and object estimation. The pre-processing part includes an adaptive block background making model and a dynamically adaptive thresholding technique to estimate the moving objects. The post processing includes a competent parallel connected component labelling algorithm to estimate perfectly the objects of interest. New parallel processing strategies are developed on each stage of the algorithm to reduce the time-complexity of the system. This algorithm has achieved a average speedup of 12.26 times for lower resolution video frames(320×240, 720×480, 1024×768) and 7.30 times for higher resolution video frames(1360×768, 1920×1080, 2560×1440) on GPU, which is superior to CPU processing. Also, this algorithm was tested by changing the number of threads in a thread block and the minimum execution time has been achieved for 16×16 thread block. And this algorithm was tested on a night sequence where the amount of light in the scene is very less and still the algorithm has given a significant speedup and accuracy in determining the object.

Improved Real-time Implementation of Adaptive Gassian Mixture Model-based Object Detection Algorithm for Fixed-point DSP Processors

Foreground moving object detection is an important process in various computer vision applications such as intelligent visual surveillance, HCI, object-based video compression, etc. One of the most successful moving object detection algorithms is based on Adaptive Gaussian Mixture Model （AGMM）. Although ACMM-hased object detection shows very good performance with respect to object detection accuracy, AGMM is very complex model requiring lots of floatingpoint arithmetic so that it should pay for expensive computational cost. Thus, direct implementation of the AGMM-based object detection for embedded DSPs without floating-point arithmetic HW support cannot satisfy the real-time processing requirement. This paper presents a novel rcal-time implementation of adaptive Gaussian mixture model-based moving object detection algorithm for fixed-point DSPs. In the proposed implementation, in addition to changes of data types into fixed-point ones, magnification of the Gaussian distribution technique is introduced so that the integer and fixed-point arithmetic can be easily and consistently utilized instead of real nmnher and floatingpoint arithmetic in processing of AGMM algorithm. Experimental results shows that the proposed implementation have a high potential in real-time applications.

Adaptive multi-modal feature fusion for far and hard object detection

In order to solve difficult detection of far and hard objects due to the sparseness and insufficient semantic information of LiDAR point cloud,a 3D object detection network with multi-modal data adaptive fusion is proposed,which makes use of multi-neighborhood information of voxel and image information.Firstly,design an improved ResNet that maintains the structure information of far and hard objects in low-resolution feature maps,which is more suitable for detection task.Meanwhile,semantema of each image feature map is enhanced by semantic information from all subsequent feature maps.Secondly,extract multi-neighborhood context information with different receptive field sizes to make up for the defect of sparseness of point cloud which improves the ability of voxel features to represent the spatial structure and semantic information of objects.Finally,propose a multi-modal feature adaptive fusion strategy which uses learnable weights to express the contribution of different modal features to the detection task,and voxel attention further enhances the fused feature expression of effective target objects.The experimental results on the KITTI benchmark show that this method outperforms VoxelNet with remarkable margins,i.e.increasing the AP by 8.78%and 5.49%on medium and hard difficulty levels.Meanwhile,our method achieves greater detection performance compared with many mainstream multi-modal methods,i.e.outperforming the AP by 1%compared with that of MVX-Net on medium and hard difficulty levels.

Bayesian moving object detection in dynamic scenes using an adaptive foreground model

Accurate detection of moving objects is an important step in stable tracking or recognition. By using a nonparametric density estimation method over a joint domain-range representation of image pixels, the correlation between neighboring pixels can be used to achieve high levels of detection accuracy in the presence of dynamic background. However, color similarity between foreground and background will cause many foreground pixels to be misclassified. In this paper, an adaptive foreground model is exploited to detect moving objects in dynamic scenes. The foreground model provides an effective description of foreground by adaptively combining the temporal persistence and spatial coherence of moving objects. Building on the advantages of MAP-MRF (the maximum a posteriori in the Markov random field) decision framework, the proposed method performs well in addressing the challenging problem of missed detection caused by similarity in color between foreground and background pixels. Experimental results on real dynamic scenes show that the proposed method is robust and efficient.