首页> 外文会议>AMOS 2013 >RANSACing Optical Image Sequences for GEO and near-GEO Objects
【24h】

RANSACing Optical Image Sequences for GEO and near-GEO Objects

机译:Ranacing Geo和近地Geo对象的光学图像序列

获取原文

摘要

This paper describes statistical models and an efficient Monte-Carlo algorithm for detecting tracks of slowly moving objects in optical telescope imagery sequences. The algorithm is based on accurate robust image pre-registration with respect to the star background, hot/warm pixel suppression, extracting dense normalized local image features, pixelwise statistical event detection, segmentation of event maps to putative image primitives, and finding consistent track sequences composed of the image primitives. Good performance at low SNR and robustness of detection with respect to fast or slow-moving thin overhead clouds is achieved by an event detection model which requires collecting at least 10 images of a particular spatial direction. The method does not degrade due to an accumulation of acquisition artifacts if more images are available. The track sequence detection method is similar in spirit to LINE [Yanagisawa et al, T JPN SOC AERONAUT S 2012]. The detection is performed by the RANSAC robust method modified for a concurrent detection of a fixed number of tracks, followed by an acceptance test based on a maximum posterior probability classifier. The statistical model of an image primitive track is based on the consistence between the size and the inclination angle of the image primitive, its image motion velocity, and the sidereal velocity, together with a consistence in relative magnitude. The method does not presume any particular movements of the object, as long as its motion velocity is constant. It can detect tracks without any constraints on their angular direction or length. The detection does not require repeated image transformations (rotations etc.), which makes it computationally efficient. The detection time is linear in the number of input images and, unlike in the LINE proposal method, the number of RANSAC proposals is (theoretically) independent of the number of putative image primitives. The current (unoptimized) experimental implementation run several hours on a standard two-core CPU architecture. Reliable detection up to the magnitude of 16.5 has been obtained on a test sequence of over 5800 images from the 50 cm TAOS telescope at Lulin Observatory, Taiwan. A comparison with the FPGA Image Stacking, which was the most successful method tested by [Yanagisawa et al, AMOS 2012] shows the proposed method is able to detect 62% more objects of magnitudes 11 - 13.5,38% more objects of magnitudes 13.5 - 16.5, but only 33% of objects of magnitudes 16.5 - 19. If optimized for speed,the proposed algorithm would be suitable for online detection, assuming an order of 10 or more running images are buffered. The algorithm is not suitable for fast object velocities at which the object typically enters/escapes the field of view during exposure.
机译:本文介绍了用于检测光学望远镜图像序列中的缓慢移动物体轨道的统计模型和高效的蒙特卡罗算法。该算法基于关于星背景的精确鲁棒图像预先登记,热/升温像素抑制,提取密集归一化局部图像特征,Pixelive统计事件检测,事件映射的分割给推定的图像基元,并找到一致的轨道序列由图像基元组成。通过事件检测模型实现了低SNR的低SNR和检测的鲁棒性的良好性能,该事​​件检测模型需要收集特定空间方向的至少10个图像。如果更多图像可用,则该方法由于采集伪像的累积而不会降低。轨道序列检测方法在精神上类似于线[Yanagisawa等,T JPN SoC Aeronaut S 2012]。通过修改的Ransac鲁棒方法来执行检测,用于修改固定数量的轨道的并发检测,然后基于最大后概率分类器进行接受测试。图像原语轨道的统计模型基于图像基元的尺寸和倾斜角与恒星速度与相对幅度的一致性之间的尺寸和倾斜角度之间的一致性。该方法不假设物体的任何特定运动,只要其运动速度是恒定的。它可以检测到它们角度方向或长度的任何约束的曲目。检测不需要重复的图像变换(旋转等),这使得它计算得高效。检测时间在输入图像的数量中线性,并且与线路提议方法不同,RANSAC提案的数量是(理论上)独立于推定图像基元的数量。当前(未优化)实验实施在标准的双核CPU架构上运行几个小时。在台湾卢文天文台50厘米陶斯望远镜的5800张图片的测试序列上获得了可靠的检测。与[yanagisawa等人,AMOS 2012]测试的FPGA图像堆叠的比较,这是[Yanagisawa等,2012]测试的最成功的方法,示出了所提出的方法能够检测62%的幅度11-13.5,38%的大小13.5 - 16.5,但只有33%的大小16.5-19。如果针对速度优化,则该算法适用于在线检测,假设缓冲了10个或更多运行图像的顺序。该算法不适用于对象通常在曝光期间进入/逃离视野的快速对象速度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号