首页> 外文会议>IEEE International Symposium on Circuits and Systems >Banknote reconstruction from fragments using quadratic programming and SIFT points
【24h】

Banknote reconstruction from fragments using quadratic programming and SIFT points

机译:使用二次编程和SIFT点从片段重建钞票

获取原文

摘要

Due to a variety of accidents, banknotes may be broken into several fragments. These fragments are usually stained, burned, partially lost, and twisted, which makes banknote reconstruction a hard problem. Since the fragments are always not intact, the traditional edge and texture based fragment assembling methods cannot be applied here. In this paper, we develop a framework for banknote reconstruction. We applied the techniques of SIFT point matching, RANSAC, and feature-based alignment. Moreover, convex quadratic optimization based on maximizing the reconstructed area and avoiding overlapping is adopted. Several simulations are given to demonstrate the effectiveness of our framework.
机译:由于各种事故,纸币可能会分成几个碎片。这些碎片通常会被染色,燃烧,部分丢失和扭曲,这使钞票重建成为一个难题。由于片段始终不完整,因此无法在此应用基于传统边缘和纹理的片段组装方法。在本文中,我们开发了用于钞票重建的框架。我们应用了SIFT点匹配,RANSAC和基于特征的对齐技术。此外,采用了基于最大化重构区域并避免重叠的凸二次方优化算法。进行了一些模拟,以证明我们框架的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号