Hyper-renormalization: Non-minimization Approach for Geometric Estimation

K. Kanatani, A. Al-Sharadqah, N. Chernov, Y. Sugaya
{"title":"Hyper-renormalization: Non-minimization Approach for Geometric Estimation","authors":"K. Kanatani, A. Al-Sharadqah, N. Chernov, Y. Sugaya","doi":"10.2197/ipsjtcva.6.143","DOIUrl":null,"url":null,"abstract":"The technique of “renormalization” for geometric estimation attracted much attention when it appeared in early 1990s for having higher accuracy than any other then known methods. The key fact is that it directly specifies equations to solve, rather than minimizing some cost function. This paper expounds this “non-minimization approach” in detail and exploits this principle to modify renormalization so that it outperforms the standard reprojection error minimization. Doing a precise error analysis in the most general situation, we derive a formula that maximizes the accuracy of the solution; we call it hyper-renormalization. Applying it to ellipse fitting, fundamental matrix computation, and homography computation, we confirm its accuracy and efficiency for sufficiently small noise. Our emphasis is on the general principle, rather than on individual methods for particular problems.","PeriodicalId":38957,"journal":{"name":"IPSJ Transactions on Computer Vision and Applications","volume":"14 1","pages":"143-159"},"PeriodicalIF":0.0000,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IPSJ Transactions on Computer Vision and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2197/ipsjtcva.6.143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 9

Abstract

The technique of “renormalization” for geometric estimation attracted much attention when it appeared in early 1990s for having higher accuracy than any other then known methods. The key fact is that it directly specifies equations to solve, rather than minimizing some cost function. This paper expounds this “non-minimization approach” in detail and exploits this principle to modify renormalization so that it outperforms the standard reprojection error minimization. Doing a precise error analysis in the most general situation, we derive a formula that maximizes the accuracy of the solution; we call it hyper-renormalization. Applying it to ellipse fitting, fundamental matrix computation, and homography computation, we confirm its accuracy and efficiency for sufficiently small noise. Our emphasis is on the general principle, rather than on individual methods for particular problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
超重整化:几何估计的非最小化方法
几何估计的“重整化”技术在20世纪90年代初出现时,因其比当时已知的任何方法都具有更高的精度而受到广泛关注。关键的事实是,它直接指定要求解的方程,而不是最小化某个成本函数。本文详细阐述了这种“非最小化方法”,并利用这一原理对重整化进行修正,使其优于标准的重投影误差最小化。在最一般的情况下进行精确的误差分析,我们推导出一个公式,使解的精度最大化;我们称之为超重整化。将其应用于椭圆拟合、基本矩阵计算和单应性计算,在噪声足够小的情况下,验证了其准确性和有效性。我们的重点是一般原则,而不是个别问题的个别方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IPSJ Transactions on Computer Vision and Applications
IPSJ Transactions on Computer Vision and Applications Computer Science-Computer Vision and Pattern Recognition
自引率
0.00%
发文量
0
期刊最新文献
3D human pose estimation model using location-maps for distorted and disconnected images by a wearable omnidirectional camera Application of evolutionary and swarm optimization in computer vision: a literature survey Pseudo-labelling-aided semantic segmentation on sparsely annotated 3D point clouds Phase disambiguation using spatio-temporally modulated illumination in depth sensing Deep learning-based strategies for the detection and tracking of drones using several cameras
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1