Rank Constraints for Homographies over Two Views: Revisiting the Rank Four Constraint
文献类型：期刊论文
| 作者 | Pei Chen; David Suter |
| 刊名 | INTERNATIONAL JOURNAL OF COMPUTER VISION
 |
| 出版日期 | 2009 |
| 卷号 | 81期号:2页码:205-225 |
| 英文摘要 | It is well known that one can collect the coefficients of five (or more) homographies between two views into a large, rank deficient matrix. In principle, this implies that one can refine the accuracy of the estimates of the homography coefficients by exploiting the rank constraint. However, the standard rank-projection approach is impractical for two different reasons: it requires many homographies to even score a modest gain; and, secondly, correlations between the errors in the coefficients will lead to poor estimates. In this paper we study these problems and provide solutions to each. Firstly, we show that the matrices of the homography coefficients can be recast into two parts, each consistent with ranks of only one. This immediately establishes the prospect of realistically (that is, with as few as only three or four homographies) exploiting the redundancies of the homographies over two views. We also tackle the remaining issue: correlated coefficients. We compare our approach with the "gold standard"; that is, non-linear bundle adjustment (initialized from the ground truth estimate-the ideal initialization). The results confirm our theory and show one can implement rank-constrained projection and come close to the gold standard in effectiveness. Indeed, our algorithm (by itself), or our algorithm further refined by a bundle adjustment stage; may be a practical algorithm: providing generally better results than the "standard" DLT (direct linear transformation) algorithm, and even better than the bundle adjustment result with the DLT result as the starting point. Our unoptimized version has roughly the same cost as bundle adjustment and yet can generally produce close to the "gold standard" estimate (as illustrated by comparison with bundle adjustment initialized from the ground truth).Independent of the merits or otherwise of our algorithm, we have illuminated why the naive approach of direct rank-projection is relatively doomed to failure. Moreover, in revealing that there are further rank constraints, not previously known; we have added to the understanding of these issues, and this may pave the way for further improvements. |
| 收录类别 | SCI |
| 原文出处 | http://www.springerlink.com/content/b308x474273w5808/ |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/2375]  |
| 专题 | 深圳先进技术研究院_集成所 |
| 作者单位 | INTERNATIONAL JOURNAL OF COMPUTER VISION |
| 推荐引用方式 GB/T 7714 | Pei Chen,David Suter. Rank Constraints for Homographies over Two Views: Revisiting the Rank Four Constraint[J]. INTERNATIONAL JOURNAL OF COMPUTER VISION,2009,81(2):205-225. |
| APA | Pei Chen,&David Suter.(2009).Rank Constraints for Homographies over Two Views: Revisiting the Rank Four Constraint.INTERNATIONAL JOURNAL OF COMPUTER VISION,81(2),205-225. |
| MLA | Pei Chen,et al."Rank Constraints for Homographies over Two Views: Revisiting the Rank Four Constraint".INTERNATIONAL JOURNAL OF COMPUTER VISION 81.2(2009):205-225. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。