|
| 作者 | Dai Zhijun
; Wu Yihong
; Zhang Fengjun
; Wang Hongan
|
| 出版日期 | 2012
|
| 会议名称 | 12th European Conference on Computer Vision, ECCV 2012
|
| 会议日期 | October 7, 2012 - October 13, 2012
|
| 会议地点 | Florence, Italy
|
| 关键词 | Algorithms
Geometry
Optimization
|
| 页码 | 116-129
|
| 中文摘要 | 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. |
| 英文摘要 | 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. |
| 收录类别 | EI
|
| 会议主办者 | Google; National Robotics Engineering Center (NREC); Adobe; Microsoft Research; Mitsubishi Electric
|
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 语种 | 英语
|
| ISSN号 | 0302-9743
|
| ISBN号 | 9783642337147
|
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15826]  |
| 专题 | 软件研究所_软件所图书馆_会议论文
|
推荐引用方式
GB/T 7714 |
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.
|
