一种非刚体运动图象序列的特征点对应方法

提出了一种非刚体图象序列特征点对应的新方法 ,首先根据图象序列帧间的时间间隔很小这一特点 ,指出特征点在图象帧间的运动具有平滑性 ,进而提出了一种特征点运动平滑的代价函数。然后将目标跟踪技术应用于特征点的跟踪 ,利用两个一维卡尔曼滤波器分别对特征点的两个坐标进行预测跟踪。在图象帧间的特征点对应过程中 ,该文综合考虑了特征点的预测位置与实际位置之间的距离以及特征点的平滑代价函数等因素 ,从而使特征点的运动轨迹得到正确的延续。特征点的遮挡问题可以通过特征点跟踪过程中对特征点位置的预测得到解决。实验证明 ,该文方法能建立非刚体运动特征点的正确对应 ,并能解决特征点的遮挡问题。     

一种非刚体运动图象序列的特征点对应方法

提出了一种非刚体图象序列特征点对应的新方法,首先根据图象序列帧间的时间间隔很小这一特点,指出特征点在图象帧间的运动具有平滑性,进而提出了一种特征点运动平滑的代价函数。然后将目标跟踪技术应用于特征点的跟踪,利用两个一维卡尔曼滤波器分别对特征点的两个坐标进行预测跟踪。     

基于特征跟踪和网格路径运动的视频稳像算法

针对手持移动设备拍摄的抖动视频问题,提出了一种基于特征跟踪和网格路径运动的视频稳像算法。通过SIFT算法提取视频帧的特征点,采用KLT算法追踪特征点,利用RANSAC算法估计相邻帧间的仿射变换矩阵,将视频帧划分为均匀的网格,计算视频的运动轨迹,再通过极小化能量函数优化平滑多条网格路径。最后由原相机路径与平滑相机路径的关系,计算相邻帧间的补偿矩阵,利用补偿矩阵对每一帧进行几何变换,从而得到稳定的视频。实验表明,该算法在手持移动设备拍摄的抖动视频中有较好的结果,其中稳像后视频的PSNR平均值相比原抖动视频PSNR值大约提升了11.2 dB。与捆绑相机路径方法相比约提升了2.3 dB。图像间的结构相似性SSIM平均值大约提升了59%,与捆绑相机路径方法相比约提升了3.3%。     

Fast Electronic Digital Image Stabilization for Off-Road Navigation

Image stabilization can be used as front-end system for many tasks that require dynamic image analysis, such as navigation and tracking of independently moving objects from a moving platform. We present a fast and robust electronic digital image stabilization system that can handle large image displacements based on a two-dimensional feature-based multi-resolution motion estimation technique. The method tracks a small set of features and estimates the movement of the camera between consecutive frames. Stabilization is achieved by combining all motion from a reference frame and warping the current frame back to the reference. The system has been implemented on parallel pipeline image processing hardware (a Datacube MaxVideo 200) connected to a SUN SPARCstation 20/612 via a VME bus adaptor. Experimental results using video sequences taken from a camera mounted on a vehicle moving on rough terrain show the robustness of the system while running at approximately 20 frames/s.     

Detecting and tracking of multiple pedestrians using motion, color information and the AdaBoost algorithm

Robust detection and tracking of pedestrians in image sequences are essential for many vision applications. In this paper, we propose a method to detect and track multiple pedestrians using motion, color information and the AdaBoost algorithm. Our approach detects pedestrians in a walking pose from a single camera on a mobile or stationary system. In the case of mobile systems, ego-motion of the camera is compensated for by corresponding feature sets. The region of interest is calculated by the difference image between two consecutive images using the compensated image. Pedestrian detector is learned by boosting a number of weak classifiers which are based on Histogram of Oriented Gradient (HOG) features. Pedestrians are tracked by block matching method using color information. Our tracking system can track pedestrians with possibly partial occlusions and without misses using information stored in advance even after occlusion is ended. The proposed approach has been tested on a number of image sequences, and was shown to detect and track multiple pedestrians very well.     

基于神经网络的图象序列特征点匹配

利用神经网络优化技术解决图象序列的特征点匹配问题，将特征点匹配归结为一个带约束的优化问题，并用2D Hopfield网络实现，在Hopfield网络的能量函数的设计中，综合考虑了特征点的预测结果、特征点的遮挡等情况，从而克服了现有的多数方法所存在的误匹配现象，对于特征点的跟踪，头3帧图象的正确匹配是十分关键的。本文提出了一种3D Hopfield网络用以解决头3帧图象的特征点匹配，并提出了一个运动平滑性的代价函数用以构造3D Hopfield网络的能量函数，实际图象序列的实验结果证明了本方法的有效性。     

图象序列运动目标特征点对应的极指数栅格方法

目前的图象序列特征点对应方法是建立在相邻图象间的特征点在运动形式上变化不大 ,即相邻两帧图象间的时间间隔较小这样的一个假设之上的 ,但当相邻图象间的时间间隔较大时 ,则这些方法很难找到对应的特征点 .为此 ,提出了一个由粗到细解决图象序列特征点对应的新方法 ,该方法首先进行粗定位 ,即利用极指数栅格方法来得到运动后目标特征点的大致范围 ;然后通过细定位来得到对应的特征点 .为了使人们对该方法有一全面了解 ,还介绍了该方法的原理 ,并给出了实验结果 .实验证明 ,该方法可以很好地解决时间间隔较大的两帧图象间的特征点对应问题 ,其最大的优点是比通常的方法简单有效 .     

基于相机姿势全局运动估计及改进修复算法的视频稳定技术

在视频稳定的过程中,由于摄像机的运动,造成图像的扭曲.针对这种情况,提出一种基于相机姿势的全局运动估计,同时为了克服图像拼接后,部分区域像素丢失的问题,使用改进后调和模型来修复缺少的像素.算法首先提取特征不变量,然后基于这些特征不变量去估计摄像机的运动矢量,相乘各帧间的运动矢量,可以得到每一帧参考第一帧的运动矢量.运用这个矢量可以很好地计算出没有扭曲的图像.运用计算出的图像与视频帧进行拼接,可以很好的解决图像的扭曲的问题.然而,图像拼接完成后可能导致部分区域像素缺少,为了填充缺少像素,算法使用了改进的调和模型来修复缺少区域.实验结果表明,基于相机姿势的全局运动估计可以很好的解决图像扭曲的问题,同时改进的调和模型可以高效的完成对图像的修复.     

Recovery of the 3-D location and motion of a rigid object through camera image (An Extended Kalman Filter Approach)

This paper deals with the problem of locating a rigid object and estimating its motion in three dimensions. This involves determining the position and orientation of the object at each instant when an image is captured by a camera, and recovering the motion of the object between consecutive frames.In the implementation scheme used here, a sequence of camera images, digitized at the sample instants, is used as the initial input data. Measurements are made of the locations of certain features (e.g., maximum curvature points of an image contour, corners, edges, etc.) on the 2-D images. To measure the feature locations a matching algorithm is used, which produces correspondences between the features in the image and the object.Using the measured feature locations on the image, an algorithm is developed to solve the location and motion problem. The algorithm is an extended Kalman filter modeled for this application.Department of Electrical Engineering and Alberta Center for Machine Intelligence and Robotics, University of Alberta     

交互标记跟踪的三维动态数据对齐

针对三维动态数据特征点匹配所导致的错误对齐问题,采用交互标记和运动跟踪来提高特征点匹配的可靠性和稳定性。首先,对三维动态数据特定帧交互标定特征点;然后,通过运动跟踪和最优预测窗口得到标定特征点在其他帧上的位置;最后,以跟踪匹配的特征点为约束条件来构造等距二分图,得到三维动态数据紧密对齐结果。实验结果表明,所提算法的对齐准确率高于已有算法。     

基于DSP的运动目标跟踪系统

描述了一种以TMS320C6701数字信号处理器为核心的高速图像处理板和图像实时采集卡及摄像头构成的实时运动跟踪系统。在对采集的实时图像序列进行如十预处理后．采用了金字塔结构的图像存储方式和特征点跟踪算法埘运动目标进行跟踪．通过对特征点的运算得到目标运动的偏差怍为摄像头运动的参数,是后根据这些参数控制摄像云台持续跟踪运动目标的移动,最后还给出了在复杂背景下跟踪人体的实验结果。     

Computing occluding and transparent motions

Computing the motions of several moving objects in image sequences involves simultaneous motion analysis and segmentation. This task can become complicated when image motion changes significantly between frames, as with camera vibrations. Such vibrations make tracking in longer sequences harder, as temporal motion constancy cannot be assumed. The problem becomes even more difficult in the case of transparent motions.A method is presented for detecting and tracking occluding and transparent moving objects, which uses temporal integration without assuming motion constancy. Each new frame in the sequence is compared to a dynamic internal representation image of the tracked object. The internal representation image is constructed by temporally integrating frames after registration based on the motion computation. The temporal integration maintains sharpness of the tracked object, while blurring objects that have other motions. Comparing new frames to the internal representation image causes the motion analysis algorithm to continue tracking the same object in subsequent frames, and to improve the segmentation.     

基于直线光流场的三维运动和结构重建

利用直线间运动对应关系，将像素点光流的概念和定义方法应用于直线，提出了直线光流的概念，建立了求解空间物体运动参数的线性方程组，利用三幅图像21条直线的光流场，可以求得物体运动的12个参数以及空间直线坐标．但是在实际应用当中，要找出这21条直线的光流场是很困难的，因此该文提出了运用解非线性方程组的方法，只需要6条直线的光流．就可以分步求出物体的12个运动参数，并根据求得的12个运动参数和一致的图像坐标系中的直线坐标，求得空间直线的坐标，从而实现了三维场景的重建．     

基于区域协方差矩阵和2DPCA学习的视频跟踪方法研究

针对PCA在视频跟踪应用中需要将图像转换成向量而造成信息丢失和小样本等问题,提出一种基于2DPCA学习的自适应性视频跟踪方法。该方法将图像矩阵直接进行处理,保持了跟踪目标的空间结构信息。在粒子滤波框架下采用仿射变换运动模型,并通过协方差特征融合方式评估目标运动状态,提高了目标外观模型的学习能力,实现了鲁棒的自适应性跟踪效果。进行了标准的视频序列测试,结果证明提出的算法能够较好地适应目标姿态、光线和部分遮挡等跟踪问题。     

Robust real-time ground plane motion compensation from a moving vehicle

One method to detect obstacles from a vehicle moving on a planar road surface is the analysis of motion-compensated difference images. In this contribution, a motion compensation algorithm is presented, which computes the required image-warping parameters from an estimate of the relative motion between camera and ground plane. The proposed algorithm estimates the warping parameters from displacements at image corners and image edges. It exploits the estimated confidence of the displacements to cope robustly with outliers. Knowledge about camera calibration, measuremts from odometry, and the previous estimate are used for motion prediction and to stabilize the estimation process when there is not enough information available in the measured image displacements. The motion compensation algorithm has been integrated with modules for obstacle detection and lane tracking. This system has been integrated in experimental vehicles and runs in real time with an overall cycle of 12.5 Hz on low-cost standard hardware. Received: 23 April 1998 / Accepted: 25 August 1999     

一种基于光流场重建三维运动和结构的新方法

提出了一种基于稀疏光流场计算三维运动和结构的线性新方法 ,该方法综合视觉运动分析中的两类处理方法 ,选取图象中的角点作为特征点 ;并检测和跟踪图象序列中的角点 .记录检测到的角点在图象序列中的位移 ,在理论上证明了时变图象的光流场可以近似地用角点的位移场代替 ,从而得到时变图象的稀疏光流场 ;通过光流运动模型的建立 ,推导出由稀疏光流场重建三维物体运动和结构的线性方法 .通过用真实图象序列验证该算法 ,表明该算法取得了较好的效果     

Multilinear Factorizations for Multi-Camera Rigid Structure from Motion Problems

Camera networks have gained increased importance in recent years. Existing approaches mostly use point correspondences between different camera views to calibrate such systems. However, it is often difficult or even impossible to establish such correspondences. But even without feature point correspondences between different camera views, if the cameras are temporally synchronized then the data from the cameras are strongly linked together by the motion correspondence: all the cameras observe the same motion. The present article therefore develops the necessary theory to use this motion correspondence for general rigid as well as planar rigid motions. Given multiple static affine cameras which observe a rigidly moving object and track feature points located on this object, what can be said about the resulting point trajectories? Are there any useful algebraic constraints hidden in the data? Is a 3D reconstruction of the scene possible even if there are no point correspondences between the different cameras? And if so, how many points are sufficient? Is there an algorithm which warrants finding the correct solution to this highly non-convex problem? This article addresses these questions and thereby introduces the concept of low-dimensional motion subspaces. The constraints provided by these motion subspaces enable an algorithm which ensures finding the correct solution to this non-convex reconstruction problem. The algorithm is based on multilinear analysis, matrix and tensor factorizations. Our new approach can handle extreme configurations, e.g. a camera in a camera network tracking only one single point. Results on synthetic as well as on real data sequences act as a proof of concept for the presented insights.     

An efficient implementation of Reid's multiple hypothesis trackingalgorithm and its evaluation for the purpose of visual tracking

An efficient implementation of Reid's multiple hypothesis tracking (MHT) algorithm is presented in which the k-best hypotheses are determined in polynomial time using an algorithm due to Murly (1968). The MHT algorithm is then applied to several motion sequences. The MHT capabilities of track initiation, termination, and continuation are demonstrated together with the latter's capability to provide low level support of temporary occlusion of tracks. Between 50 and 150 corner features are simultaneously tracked in the image plane over a sequence of up to 51 frames. Each corner is tracked using a simple linear Kalman filter and any data association uncertainty is resolved by the MHT. Kalman filter parameter estimation is discussed, and experimental results show that the algorithm is robust to errors in the motion model. An investigation of the performance of the algorithm as a function of look-ahead (tree depth) indicates that high accuracy can be obtained for tree depths as shallow as three. Experimental results suggest that a real-time MHT solution to the motion correspondence problem is possible for certain classes of scenes     

Finding trajectories of feature points in a monocular image sequence

Identifying the same physical point in more than one image, the correspondence problem, is vital in motion analysis. Most research for establishing correspondence uses only two frames of a sequence to solve this problem. By using a sequence of frames, it is possible to exploit the fact that due to inertia the motion of an object cannot change instantaneously. By using smoothness of motion, it is possible to solve the correspondence problem for arbitrary motion of several nonrigid objects in a scene. We formulate the correspondence problem as an optimization problem and propose an iterative algorithm to find trajectories of points in a monocular image sequence. A modified form of this algorithm is useful in case of occlusion also. We demonstrate the efficacy of this approach considering synthetic, laboratory, and real scenes.