Efficient conic fitting with an analytical Polar-N-Direction geometric distance
Wu, Yihong1,2; Wang, Haoren1,2; Tang, Fulin1,2; Wang, Zhiheng3
发表期刊PATTERN RECOGNITION
ISSN0031-3203
2019-06-01
卷号90页码:415-423
通讯作者Wu, Yihong(yhwu@nlpr.ia.ac.cn) ; Wang, Zhiheng(wzhenry@eyou.com)
摘要Fitting conics from images is a preliminary step for its plentiful applications. It is a common sense that geometric distance based fitting methods are better than algebraic distance based ones. However, for a long time, there has not been a geometric distance between a point and a general conic that allows easy computation and achieves high accuracy simultaneously. Though Sampson distance is widely accepted, it is only a first-order approximation. For other geometric distances, the computations are too complex to be popular in practice. In this paper, we derive a new geometric distance between a point and a general conic, called Polar-N-Direction distance. The distance can be adapted to a projective transformation because it is computed along the normal direction of the polar line of the point, making conic fitting more robust. Moreover, Polar-N-Direction distance is accurate and simultaneously still analytical in an explicit representation, which is quite easy to be implemented. Then, based on the distance, a new cost function is constructed. The conic fitting optimization by minimizing this cost function has all the merits of the geometric distance based methods and simultaneously avoids their limitations. Experiments show that the conic fitting method is greatly efficient. (C) 2019 Elsevier Ltd. All rights reserved.
关键词Conic fitting Geometric distance Sampson distance
DOI10.1016/j.patcog.2019.01.023
关键词[WOS]PARAMETER-ESTIMATION ; FIT FUNCTIONS ; ELLIPSE ; SECTIONS ; ERROR ; BIAS ; CURVES ; CIRCLE ; IMAGE
收录类别SCI
语种英语
资助项目National Natural Science Foundation of China[61836015] ; National Natural Science Foundation of China[61421004] ; National Natural Science Foundation of China[61572499] ; Henan Science and Technology Innovation Outstanding Youth Program[184100510009] ; National Natural Science Foundation of China[61836015] ; National Natural Science Foundation of China[61421004] ; National Natural Science Foundation of China[61572499] ; Henan Science and Technology Innovation Outstanding Youth Program[184100510009]
项目资助者National Natural Science Foundation of China ; Henan Science and Technology Innovation Outstanding Youth Program
WOS研究方向Computer Science ; Engineering
WOS类目Computer Science, Artificial Intelligence ; Engineering, Electrical & Electronic
WOS记录号WOS:000463130400034
出版者ELSEVIER SCI LTD
七大方向——子方向分类三维视觉
引用统计
被引频次:12[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://ir.ia.ac.cn/handle/173211/23616
专题多模态人工智能系统全国重点实验室_机器人视觉
通讯作者Wu, Yihong; Wang, Zhiheng
作者单位1.Chinese Acad Sci, Natl Lab Pattern Recognit, Inst Automat, 95 Zhongguancun East Rd, Beijing 100190, Peoples R China
2.Univ Chinese Acad Sci, 19A Yuquan Rd, Beijing 100049, Peoples R China
3.Henan Polytech Univ, Coll Comp Sci & Technol, 2001 Century Ave, Jiaozuo 454000, Henan, Peoples R China
第一作者单位模式识别国家重点实验室
通讯作者单位模式识别国家重点实验室
推荐引用方式
GB/T 7714
Wu, Yihong,Wang, Haoren,Tang, Fulin,et al. Efficient conic fitting with an analytical Polar-N-Direction geometric distance[J]. PATTERN RECOGNITION,2019,90:415-423.
APA Wu, Yihong,Wang, Haoren,Tang, Fulin,&Wang, Zhiheng.(2019).Efficient conic fitting with an analytical Polar-N-Direction geometric distance.PATTERN RECOGNITION,90,415-423.
MLA Wu, Yihong,et al."Efficient conic fitting with an analytical Polar-N-Direction geometric distance".PATTERN RECOGNITION 90(2019):415-423.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Wu_et_al_2019_Effici(2113KB)期刊论文作者接受稿开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Wu, Yihong]的文章
[Wang, Haoren]的文章
[Tang, Fulin]的文章
百度学术
百度学术中相似的文章
[Wu, Yihong]的文章
[Wang, Haoren]的文章
[Tang, Fulin]的文章
必应学术
必应学术中相似的文章
[Wu, Yihong]的文章
[Wang, Haoren]的文章
[Tang, Fulin]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Wu_et_al_2019_Efficient_conic_fitting_with_an_analytical.pdf
格式: Adobe PDF
此文件暂不支持浏览
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。