中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
a novel fast method for l∞ problems in multiview geometry
Author: Dai Zhijun ; Wu Yihong ; Zhang Fengjun ; Wang Hongan
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Conference Name: 12th European Conference on Computer Vision, ECCV 2012
Conference Date: October 7, 2012 - October 13, 2012
Issued Date: 2012
Conference Place: Florence, Italy
Keyword: Algorithms ; Geometry ; Optimization
Indexed Type: EI
ISSN: 0302-9743
ISBN: 9783642337147
Department: (1) Intelligence Engineering Lab. Institute of Software Chinese Academy of Sciences China; (2) State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences China; (3) National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences China
Sponsorship: Google; National Robotics Engineering Center (NREC); Adobe; Microsoft Research; Mitsubishi Electric
Abstract: Optimization using the L norm is an increasingly important area in multiview geometry. Previous work has shown that globally optimal solutions can be computed reliably using the formulation of generalized fractional programming, in which algorithms solve a sequence of convex problems independently to approximate the optimal L norm error. We found the sequence of convex problems are highly related and we propose a method to derive a Newton-like step from any given point. In our method, the feasible region of the current involved convex problem is contracted gradually along with the Newton-like steps, and the updated point locates on the boundary of the new feasible region. We propose an effective strategy to make the boundary point become an interior point through one dimension augmentation and relaxation. Results are presented and compared to the state of the art algorithms on simulated and real data for some multiview geometry problems with improved performance on both runtime and Newton-like iterations. © 2012 Springer-Verlag.
English Abstract: Optimization using the L norm is an increasingly important area in multiview geometry. Previous work has shown that globally optimal solutions can be computed reliably using the formulation of generalized fractional programming, in which algorithms solve a sequence of convex problems independently to approximate the optimal L norm error. We found the sequence of convex problems are highly related and we propose a method to derive a Newton-like step from any given point. In our method, the feasible region of the current involved convex problem is contracted gradually along with the Newton-like steps, and the updated point locates on the boundary of the new feasible region. We propose an effective strategy to make the boundary point become an interior point through one dimension augmentation and relaxation. Results are presented and compared to the state of the art algorithms on simulated and real data for some multiview geometry problems with improved performance on both runtime and Newton-like iterations. © 2012 Springer-Verlag.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/15826
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Dai Zhijun,Wu Yihong,Zhang Fengjun,et al. a novel fast method for l∞ problems in multiview geometry[C]. 见:12th European Conference on Computer Vision, ECCV 2012. Florence, Italy. October 7, 2012 - October 13, 2012.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Dai Zhijun]'s Articles
[Wu Yihong]'s Articles
[Zhang Fengjun]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Dai Zhijun]‘s Articles
[Wu Yihong]‘s Articles
[Zhang Fengjun]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace