基于变分辨率的自适应窗口目标跟踪方法研究

针对视觉跟踪中运动目标的大小也随之改变这一问题,提出一种基于变分辨率的自适应窗口目标跟踪方法。在最大后验概率视觉跟踪算法基础上,分析了运动目标窗口内外框上的后验概率贡献指标,建立了自适应窗口调整目标尺度的数学模型。当运动目标尺寸变化时,其分辨率也相应变化,为了保证跟踪的实时性和效率,采用变分辨率的特征统计采样方法。在对运动目标实现自适应窗口的跟踪时,特征统计的分辨率也随之改变,对尺寸越大的运动目标尺度赋予更低的分辨率,从而实现基于变分辨率的自适应窗口目标跟踪。     

基于自适应尺度的TLD目标跟踪算法

为提升TLD目标跟踪算法的每帧处理速度,以达到在更高分辨率视频中跟踪目标的实时性要求,在TLD算法框架的基础上,提出了一种基于自适应尺度检测学习的目标跟踪算法(AS-TLD)。当跟踪目标成功时,选取当前帧跟踪到的目标尺度及几个相邻的尺度作为下帧检测目标时滑动窗口尺度的选取范围;而当跟踪失败时,则选取在TLD算法初始化阶段,根据跟踪目标及视频图像大小选定的尺度来保障长时间跟踪目标,从而有效减少了平均每帧扫描的窗口数量。实验结果表明,该方法不仅有效地降低了检测模块的检测时间,显著提高了整体算法速度,而且通过动态选取尺度,在一定程度使得TLD各个模块更加协调,跟踪精确度得到提升。     

基于自适应背景的目标跟踪算法研究

随着现在的社会发展以及经济进步,我国的科学技术方面发展迅速,特别是在技术监控方面更是突飞猛进。为了更好的对目标遮挡影响进行降低,我国在这方面主要依据自适应的技术发展背景下提出目标跟踪计算法,用来完善我国的监督控制技术。这种计算方式第一是根据对观察目标的基本外观形态进行的鉴定与跟踪,将其自身的运动量进行平均计算;其次是根据时空的运行方向与特征进行跟踪目标的计算,建立比较完善整体的运行模型,再根据这个运动模型以及整体的状态对监督目标进行检测与控制,这期间就会形成一种遮挡掩膜。对于掩膜是一种将程序数据等绘制成光刻板,在程序使用期间非常可靠,并且制造成本比较低,使用方便;最后是在不同的使用情况下将不同参数进行收集,自动的适应运动模型的运行。针对这种计算方式的实验主要是利用两种在国际上经常使用的CAVIAR、York数据进行测试,并且根据这两种数据对测试的精准度与多重目标跟踪等进行评定,检测跟踪的整体性能。通过多方面的研究表明这种方式的跟踪的性能非常好,并且还能很好的将跟踪目标的鲁棒性进行遮挡。     

基于Mean-shift的灰度目标跟踪新算法

Mean-shift算法是一种非参数密度估计算法,可以实现快速的最优匹配,在目标的实时跟踪领域起着非常重要的作用。为了有效的将Mean-shift算法应用到灰度图像中,采用了以方向直方图建立目标模型的策略,提出了在灰度图像中以Mean-shift为核心的目标跟踪算法。实验结果表明,该算法具有不受光照条件影响的优点,在低对比度的情况下仍能实现稳定、实时的跟踪目标。     

颜色与纹理相融合的自适应粒子滤波跟踪算法

针对目标跟踪过程中存在的光线变化及目标遮挡等复杂情况所导致的跟踪目标的丢失或跟踪错位等问题,采用特征融合的策略,将其用于粒子滤波框架中进行跟踪。利用特征融合加权直方图的方法来描述目标的颜色和纹理特征,并对变化的目标自适应地更新参考目标模型,能有效地处理视频中由于旋转、遮挡、光线变化带来的影响。实验证明,提出的算法在保证跟踪精确性的情况下,具有较好的适应性及鲁棒性。     

颜色与纹理相融合的自适应粒子滤波跟踪算法

针对目标跟踪过程中存在的光线变化及目标遮挡等复杂情况所导致的跟踪目标的丢失或跟踪错位等问题,采用特征融合的策略,将其用于粒子滤波框架中进行跟踪。利用特征融合加权直方图的方法来描述目标的颜色和纹理特征,并对变化的目标自适应地更新参考目标模型,能有效地处理视频中由于旋转、遮挡、光线变化带来的影响。实验证明,提出的算法在保证跟踪精确性的情况下,具有较好的适应性及鲁棒性。     

基于差分交集的视频对象分割与跟踪算法

视频对象分割算法的性能好坏将直接影响MPEG 4编码产品的质量。连续两次差分后自适应处理,对差分图像取交集获得运动对象的边界,形态学处理后最终获取运动目标。基于改进的Hausdorff距离度量法对后续帧中视频对象进行跟踪。实验结果证明,该方法能够从背景不变的图像序列中较好的提取出运动对象,具有较强的鲁棒性。     

基于自适应非参数统计模型的彩色目标跟踪算法研究

针对复杂环境条件下的视觉跟踪问题,提出一种基于自适应非参数统计模型的彩色目标跟踪算法。利用目标和背景之间的强度差别,基于自适应核密度估计模型对运动目标进行了非参数统计建模。为了实现具有较大范围运动目标的跟踪,在充分考虑目标和背景之间的相关性前提下,采用目标特征统计的背景加权直方图对搜索区域进行了扩大。为了提高对环境变化的适应能力,根据目标和环境的变化自适应更新目标特征分布模型。通过对实际图像序列的实验,结果表明该算法能够有效跟踪运动目标,并且平均迭代次数比传统方法减少了37.28%。     

一种基于自适应权值的立体匹配方法

提出了一种新的自适应权值的立体匹配方法,在匹配中无需逐像素确定其支持窗口的尺寸。首先根据像素间的相似性和邻近性对匹配窗口内每一像素的支持权值进行调整,使与待匹配点位于同一区域的像素权值增大,然后在匹配的代价函数中引入视差平滑性约束项,从而获得最终视差。在Middlebury提供的标准图像上进行了测试。实验结果表明,该方法可以获得良好的视差图。     

Research of object tracking based on soft feature

To solve the problem that traditional object tracking method had disadvantage of too much time consumed by data process and object lost under complex background, a novel approach to object tracking based on the space spectrum and edge spectrum is proposed and verified experimentally. Analyzing precursor features and study the unity and complementary of space spectrum and edge spectrum, research the extraction technology of moving object based on space spectrum and edge spectrum in order to track and forecast information of the moving object in real time. Experiments show that the proposed approach overcomes the problems of data dependence and object occlusion and achieves good tracking results.     

一种基于奇异值分解的舰船辐射噪声目标识别算法

本文针对舰船辐射噪声目标识别问题,提出了一种基于奇异值分解(SVD)的辐射噪声爿标识 别算法。该算法充分利用了不等权值SVD的空间滤波作用,来消除辐射噪声中复杂的干扰成分;结 合二阶累积量谱进行特征分析及提取;然后根据所要解决的实际问题,设计了合适的概率密度函数, 并对其进行训练,作为识别模板;进而根据距离分类准则设计了分类函数,以完成识别分类。运用实 际的舰船辐射噪声数据,进行了仿真实验,结果表明了本文算法的可行性和有效性。     

An image compressed sensing algorithm based on adaptive nonlinear network

Traditional compressed sensing algorithm is used to reconstruct images by iteratively optimizing a small number of measured values. The computation is complex and the reconstruction time is long. The deep learning-based compressed sensing algorithm can greatly shorten the reconstruction time, but the algorithm emphasis is placed on reconstructing the network part mostly. The random measurement matrix cannot measure the image features well, which leads the reconstructed image quality to be improved limitedly. Two kinds of networks are proposed for solving this problem. The first one is Recon Net's improved network IRecon Net, which replaces the traditional linear random measurement matrix with an adaptive nonlinear measurement network. The reconstruction quality and anti-noise performance are greatly improved.Because the measured values extracted by the measurement network also retain the characteristics of image spatial information, the image is reconstructed by bilinear interpolation algorithm(Bilinear) and dilate convolution. Therefore a second network USDCNN is proposed. On the BSD500 dataset, the sampling rates are 0.25, 0.10, 0.04, and 0.01, the average peak signal-noise ratio(PSNR) of USDCNN is 1.62 d B, 1.31 d B, 1.47 d B, and 1.95 d B higher than that of MSRNet. Experiments show the average reconstruction time of USDCNN is 0.2705 s, 0.3671 s, 0.3602 s, and 0.3929 s faster than that of Recon Net. Moreover, there is also a great advantage in anti-noise performance.     

An image joint compression-encryption algorithm based on adaptive arithmetic coding

Through a series of studies on arithmetic coding and arithmetic encryption, a novel image joint compression- encryption algorithm based on adaptive arithmetic coding is proposed. The contexts produced in the process of image compression are modified by keys in order to achieve image joint compression encryption. Combined with the bit-plane coding technique, the discrete wavelet transform coefficients in different resolutions can be encrypted respectively with different keys, so that the resolution selective encryption is realized to meet different application needs. Zero-tree coding is improved, and adaptive arithmetic coding is introduced. Then, the proposed joint compression-encryption algorithm is simulated. The simulation results show that as long as the parameters are selected appropriately, the compression efficiency of proposed image joint compression-encryption algorithm is basically identical to that of the original image compression algorithm, and the security of the proposed algorithm is better than the joint encryption algorithm based on interval splitting.     

An infrared salient object stereo matching algorithm based on epipolar rectification

Due to the higher noise and less details in infrared images, general matching algorithms are prone to obtaining unsatisfying results. Combining the idea of salient object, we propose a novel infrared stereo matching algorithm which applies to unconstrained stereo rigs. Firstly, we present an epipolar rectification method introducing particle swarm optimization and K-nearest neighbor to deal with the problem of epipolar constraint. Then we make use of transition region to extract salient object in the rectified infrared image pairs. Finally, disparity map is generated by matching salient regions. Experiments show that our algorithm deals with the infrared stereo matching of unconstrained stereo rigs with better accuracy and higher speed.     

目标跟踪与定位中的视觉标定算法研究

目标跟踪与定位中的一个重要步骤就是摄像机标定,其目的是估计摄像机的外部和内部参数。在严格的几何约束关系之上建立准确的数学模型,提出一种快速得到摄像机中心的方法,然后通过合理的求解次序获得其他摄像机参数,保证了标定参数的精度。利用计算出来的标定参数校正失真图像中的各个像素位置以重新得到像素间原来的空间关系,从而产生精确的不失真图像,并且利用摄像机标定参数对标定模板上的点进行位置计算后,再和实际位置比较进行检验。图像的校正效果实验以及精度验算的结果表明：提出的算法得到了准确可靠的标定参数,和其他算法相比有效提高了精度,能够满足运动跟踪时目标特征位置估计的精度要求。     

An adaptive mean shift clustering algorithm based on locality-sensitive hashing

The time complexity of the adaptive mean shift is related to the dimension of data and the number of iterations. The amount of computation will increase prohibitively with the increase of the data dimension. An approximate neighborhood queries method is presented for the computation of high dimensional data, in which, the locality-sensitive hashing (LSH) is used to reduce the computational complexity of the adaptive mean shift algorithm. The data-driven bandwidth selection for multivariate data is used in mean shift procedure, and an adaptive mean shift based on LSH with bandwidth estimation (LSH-PE-AMS) algorithm is proposed. Experimental results show that the proposed algorithm can reduce the complexity of the adaptive mean shift algorithm, and can produce a more accurate classification than the fixed bandwidth mean shift algorithm.     

基于自适应加权窗口的相位质量图提取

加权相位解缠算法的解缠精度取决于所提取的质量图的可靠性。目前提取相位质量图的方法大多采用以各个像素为中心的固定窗口法,但当某些像素被噪声严重干扰时,采用固定窗口法提取质量图往往得不到正确的解缠结果。因此,提出了几种自适应加权窗口方法来提取相位质量图,并给出了具体的实现方法和步骤,同时采用加权小波变换相位解缠算法进行相位解缠。实验结果表明,采用自适应加权窗口方法提取相位质量图来确定初始权重系数能获得比较好的解缠效果。     

An adaptive laser beam shaping technique based on a genetic algorithm

A new adaptive beam intensity shaping technique based on the combination of a 19-element piezo-electricity deformable mirror (DM) and a global genetic algorithm is presented. This technique can adaptively adjust the voltages of the 19 actuators on the DM to reduce the difference between the target beam shape and the actual beam shape. Numerical simulations and experimental results show that within the stroke range of the DM, this technique can be well used to create the given beam intensity profiles on the focal plane.     

一种自适应最小范数算法

运用特征子空间方法的关键在于信号子空间或噪声子空间的估计,实际上有些信号的统计特性随时间变化,于是要求得到参数的实时估计值,为此,需要随时根据新的阵列接收数据对信号或噪声子空间进行更新。本文首先分析了一种自适应子空间估计算法,即MALASE(MaximumLikelihoodAdaptiveSubspaceEstimation)算法。然后,把MALASE算法与传统的最小范数(Mini-Norm)高分辨算法相结合,并应用零点跟踪技术,提出了一种自适应Mini-Norm高分辨算法,可用于对时变的信号波达方向(DOA)进行跟踪估计。计算机仿真结果验证了该算法的有效性。