Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/67406
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Smooth Approximation of L-infinity-Norm for Multi-view Geometry |
Author: | Dai, Y. Li, H. He, M. Shen, C. |
Citation: | Proceedings of International Conference on Digital Image Computing - Techniques and Applications (DICTA'09), 1-3 December, 2009; pp.339-346 |
Publisher: | IEEE |
Publisher Place: | Online |
Issue Date: | 2009 |
ISBN: | 9780769538662 |
Conference Name: | Digital Image Computing: Techniques and Applications (2009 : Melbourne, Australia) |
Statement of Responsibility: | Yuchao Dai, Hongdong Li, Mingyi He and Chunhua Shen |
Abstract: | Recently the L∞-norm optimization has been introduced to multi-view geometry to achieve global optimality. It is solved through solving a sequence of SOCP (second order cone programming) feasibility problems which needs sophisticated solvers and time consuming. This paper presents an efficient smooth approximation of L∞-norm optimization in multi-view geometry using log-sum-exp functions. We have proven that the proposed approximation is pseudo-convex with the property of uniform convergence. This allows us to solve the problem using gradient based algorithms such as gradient descent to overcome the non-differentiable property of L∞ norm. Experiments on both synthetic and real image sequence have shown that the proposed algorithm achieves high precision and also significantly speeds up the implementation. © 2009 IEEE. |
Rights: | © Copyright 2011 IEEE – All Rights Reserved |
DOI: | 10.1109/DICTA.2009.64 |
Published version: | http://dx.doi.org/10.1109/dicta.2009.64 |
Appears in Collections: | Aurora harvest 5 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.