共查询到19条相似文献,搜索用时 93 毫秒
1.
提出了一种改进块匹配宏块分布排列的快速传感器电子稳像算法,通过陀螺传感器测量摄像系统的抖动,利用小范围快速块匹配算法估计局部运动矢量,再运用最小二乘法解算全局运动矢量.小范围快速块匹配算法得到的局部运动矢量准确度高,仅需部分局部运动矢量即可准确解算出全局运动矢量.基于此在保证运动矢量准确度情况下,对块匹配宏块的分布排列进行了改进,从而减少匹配宏块数量加快算法速度.通过对宏块网格模型的分析,得出对小范围快速块匹配算法进行宏块分布改进的方案,进而设计出快速传感器电子稳像算法.仿真及实验表明:运算时间提高89%左右,且算法准确度略高于改进前算法. 相似文献
2.
为了消除载体姿态变化和振动造成的视频抖动,提出了一种机载摄像系统的电子稳像算法。将图像分为若干个块,每个块中取一个点作为特征点,采用块匹配算法在局部区域进行特征点匹配,然后利用改进的随机一致性检测算法剔除误匹配的特征点,最后采用卡尔曼滤波算法对图像的运动参数进行滤波,得到稳定后的视频图像。该算法时间复杂度和空间复杂度低,便于在硬件平台上实现,实验结果表明,该算法稳像精度高,精度达到1个像素,适应性好,能较好地实现图像序列稳定。 相似文献
3.
4.
提出了一种改进块匹配宏块分布排列的快速传感器电子稳像算法,通过陀螺传感器测量摄像系统的抖动,利用小范围快速块匹配算法估计局部运动矢量,再运用最小二乘法解算全局运动矢量.小范围快速块匹配算法得到的局部运动矢量准确度高,仅需部分局部运动矢量即可准确解算出全局运动矢量.基于此在保证运动矢量准确度情况下,对块匹配宏块的分布排列进行了改进,从而减少匹配宏块数量加快算法速度.通过对宏块网,格模型的分析,得出对小范围快速块匹配算法进行宏块分布改进的方案,进而设计出快速传感器电子稳像算法.仿真及实验表明:运算时间提高89%左右,且算法准确度略高于改进前算法. 相似文献
5.
6.
7.
基于时间序列预测的电子稳像算法研究 总被引:1,自引:1,他引:0
块匹配电子稳像算法是一种稳定性好、准确度高的电子稳像算法.块匹配算法在目标区域中从起始点到匹配点进行搜索时,需要对图像块进行反复匹配,计算量大、实时性差成为限制其应用的主要问题.本文从缩小块匹配算法搜索范围的思想出发,提出了一种利用时间序列预测来确定最优搜索起始点的电子稳像算法.根据图像序列全局运动矢量的内部统计特性,选择合适的时间序列模型;采用AIC准则和Durbin-Levinson递推算法估计模型的阶次和参量,并通过残差检验对模型进行检验和更新.利用建立的时间序列模型和历史数据对当前时刻全局运动矢量进行最优预测,并将其作为搜索起点来进行下一步精确搜索.实验结果证明,时间序列预测方法有效缩小了块匹配算法的搜索范围,使计算速度得到较大幅度的提高,并可直接推广到其它电子稳像算法中. 相似文献
8.
提出了一种基于特征点匹配和校验的鲁棒实时电子稳像算法.首先利用Kanade-Lucas-Tomasi角点检测器提取参考帧和当前帧的特征点,并用绝对误差和准则进行特征点匹配|在校验阶段,提出一种能够有效剔除前景运动物体特征点和错误匹配点的空间位置不变准则|最后,在相似运动模型下,利用最小二乘法求解全局运动矢量进行运动补偿.实验证明:该算法满足实时性要求,对视频的平移、旋转、缩放运动都有较好的稳像效果,并对运动物体具有鲁棒性. 相似文献
9.
针对手持移动摄像装置拍摄视频序列相邻帧间存在平移、小角度旋转运动,而且易受噪声、光照变化的影响等问题,提出一种基于优化Oriented FAST and rotated BRIEF(ORB)特征匹配的实时鲁棒电子稳像算法。对相邻帧预处理后用Oriented FAST算子检测特征点,再用Rotated BRIEF描述提取的特征点并采用近邻汉明距离匹配特征点对,然后采用级联滤波去除误匹配点对,最后使用迭代最小二乘法(ILSM)拟合模型参量进行运动补偿实现稳像。图像匹配测试和稳像实验结果表明:基于改进的ORB算法的电子稳像方法补偿每一帧的时间均小于0.1 s,定位精度可达亚像素级,能有效补偿帧间平移旋转运动,而且对噪声和光照变化有较强鲁棒性。经稳像处理后,实拍视频质量明显提高,峰值信噪比(PSNR)平均提高了10 db。 相似文献
10.
运动背景下的帧间稳像技术 总被引:1,自引:0,他引:1
针对运动背景下帧间稳像技术,提出了一种带运动矢量修正的灰度投影运动估计算法。采用该算法分别对当前帧和参考帧的行、列计算灰度投影序列;将当前帧投影序列局部分块,分别将每一分块与参考帧行、列投影曲线进行互相关计算,得到基于局部投影的行、列运动矢量集合;以分块区域的相关置信度为权系数衡量参数,计算每一分块的像素位移权值,从而计算某一方向帧间的加权运动矢量。实验结果表明:该方法可以使运动目标造成的影响只作用于其中若干个局部分块,而其他分块不受此影响,尽可能保证稳像的准确性。采用该方法稳像后的图像与参考帧图像的均方根误差(RMSE)值明显下降,与参考帧图像更加吻合。 相似文献
11.
Fei Yu Mei Hui Wei Han Peng Wang Li-quan Dong Yue-jin Zhao 《Optics Communications》2010,283(23):4619-4625
Image block matching is one of the motion estimation methods for video inter-frame coding and digital image stabilization. The methods used for matching and searching will greatly affect the accuracy and speed of block matching. The block matching method based on the oblique vectors is suggested in this paper where matching parameters contain both horizontal and vertical vectors in the image blocks at the same time. Improved matching information can be obtained after making correlative calculations in the oblique direction. A novel search method of matching block based on the idea of simulated annealing is presented in this paper to improve the searching speed, accuracy and robustness in the fast operation of the block-matching motion estimation. The simulated annealing algorithm can easily escape from the trap of local minima effectively. With the two methods the block matching can be used for motion estimation at the real-time image processing system and high estimation accuracy can be achieved. An image stabilization system based on DSP (Digital Signal Processing) system is developed to verify this algorithm. Results show that both the matching accuracy and the search speed are improved with the methods presented. 相似文献
12.
13.
14.
15.
In the problem of blind image deconvolution, estimation of blurring kernel is the first and foremost important step. Quality of restored image highly depends upon the accuracy of this estimation. In this paper we propose a modified cepstrum domain approach combined with bit-plane slicing method to estimate uniform motion blur parameters, which improves the accuracy without any manual intervention. A single motion blurred image under spatial invariance condition is considered. It is noted that the fourth bit plane of the modified cepstrum carries an important cue for estimating the blur direction. With the exploration of this bit plane no other post processing is required to estimate blur direction. The experimental evaluation is carried out on both real-blurred photographs and synthetically blurred standard test images such as Berkeley segmentation dataset and USC-SIPI texture image database. The experimental results show that the proposed method is capable of estimating blur parameters more accurately than the existing methods. 相似文献
16.
基于灰度投影的数字近景摄影立体影像匹配 总被引:3,自引:0,他引:3
根据数字近景摄影测量的特点,针对建筑物三维建模的需要,提出了基于灰度投影的影像匹配算法。该算法将影像行、列两个方向上的一维灰度投影,拓展为行、列、主对角线和次对角线四个方向上的一维灰度投影,计算左右影像的四个一维投影向量间的相似性测度的加权平均值作为最后的匹配测度。利用相对定向线性变换(RLT)算法来确定同名核线,以改进的动态定界法来控制待匹配点序列中后续点沿核线匹配的搜索范围,以减少匹配的搜索空间并提高匹配的准确度。利用该算法对建筑物数字近景摄影影像进行了实验,结果表明该算法具有较高的匹配速度和匹配准确率。 相似文献
17.
基于运动估计和ROI编码的干涉多光谱图像压缩 总被引:1,自引:1,他引:0
根据干涉多光谱图像的谱间相关性和光谱分布特点,提出一种基于运动估计和感兴趣区域编码的干涉多光谱图像压缩方法.为了去除多光谱图像的谱间相关性,采用运动估计法,对补偿后的图像(即预测误差)进行小波变换及率失真优化截取内嵌码块编码.同时采用率失真斜率提升的感兴趣区域编码方法,更好地保护光谱信息,使图像在相同的光谱分辨率下具有更好的空间分辨率.实验结果与基于三维小波变换的压缩方法以及比特平面移位的感兴趣区域编码方法相比,本文所提方法能有效改善恢复图像质量,提高编码效率,更好地保护光谱信息. 相似文献
18.
Image encryption is an effective method to protect images or videos by transferring them into unrecognizable formats for different security purposes. To improve the security level of bit-plane decomposition based encryption approaches, this paper introduces a new image encryption algorithm by using a combination of parametric bit-plane decomposition along with bit-plane shuffling and resizing, pixel scrambling and data mapping. The algorithm utilizes the Fibonacci P-code for image bit-plane decomposition and the 2D P-Fibonacci transform for image encryption because they are parameter dependent. Any new or existing method can be used for shuffling the order of the bit-planes. Simulation analysis and comparisons are provided to demonstrate the algorithm's performance for image encryption. Security analysis shows the algorithm's ability against several common attacks. The algorithm can be used to encrypt images, biometrics and videos. 相似文献
19.
Compared with the traditional forward compositional matching strategy, the inverse compositional matching strategy has almost the same accuracy, but has an obviously higher efficiency than the former in digital image correlation (DIC) algorithms. Based on the inverse compositional matching strategy and the auxiliary displacement functions, a more accurate inverse compositional Gauss-Newton (IC-GN2) algorithm with a new second-order shape operator is proposed for nonuniform and large deformation measurements. A theoretical deduction showed that the new proposed second-order shape operator is invertible and can steadily attain second-order precision. The result of the numerical simulation showed that the matching accuracy of the new IC-GN2 algorithm is the same as that of the forward compositional Gauss-Newton (FC-GN2) algorithm and is relatively better than in IC-GN2 algorithm. Finally, a rubber tension experiment with a large deformation of 27% was performed to validate the feasibility of the proposed algorithm. 相似文献