中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Subject: Computer Science ; Engineering
Title:
robust maximum likelihood estimation by sparse bundle adjustment using the l1 norm
Author: Dai Zhijun ; Zhang Fengjun ; Wang Hongan
Source: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Conference Name: 2012 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2012
Conference Date: June 16, 2012 - June 21, 2012
Issued Date: 2012
Conference Place: Providence, RI, United states
Keyword: Jacobian matrices ; Maximum likelihood estimation
Indexed Type: EI ; ISTP
ISSN: 1063-6919
ISBN: 9781467312264
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
Sponsorship: IEEE
Abstract: Sparse bundle adjustment is widely used in many computer vision applications. In this paper, we propose a method for performing bundle adjustments using the L1 norm. After linearizing the mapping function in bundle adjustment on its first order, the kernel step is to compute the L1 norm equations. Considering the sparsity of the Jacobian matrix in linearizing, we find two practical methods to solve the L1 norm equations. The first one is an interior-point method, which transfer the original problem to a problem of solving a sequence of L2 norm equations, and the second one is a decomposition method which uses the differentiability of linear programs and represents the optimal updating of parameters of 3D points by the updating variables of camera parameters. The experiments show that the method performs better for both synthetically generated and real data sets in the presence of outliers or Laplacian noise compared with the L2 norm bundle adjustment, and the method is efficient among the state of the art L1 minimization methods. © 2012 IEEE.
English Abstract: Sparse bundle adjustment is widely used in many computer vision applications. In this paper, we propose a method for performing bundle adjustments using the L1 norm. After linearizing the mapping function in bundle adjustment on its first order, the kernel step is to compute the L1 norm equations. Considering the sparsity of the Jacobian matrix in linearizing, we find two practical methods to solve the L1 norm equations. The first one is an interior-point method, which transfer the original problem to a problem of solving a sequence of L2 norm equations, and the second one is a decomposition method which uses the differentiability of linear programs and represents the optimal updating of parameters of 3D points by the updating variables of camera parameters. The experiments show that the method performs better for both synthetically generated and real data sets in the presence of outliers or Laplacian noise compared with the L2 norm bundle adjustment, and the method is efficient among the state of the art L1 minimization methods. © 2012 IEEE.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/15789
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Dai Zhijun,Zhang Fengjun,Wang Hongan. robust maximum likelihood estimation by sparse bundle adjustment using the l1 norm[C]. 见:2012 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2012. Providence, RI, United states. June 16, 2012 - June 21, 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
[Zhang Fengjun]'s Articles
[Wang Hongan]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Dai Zhijun]‘s Articles
[Zhang Fengjun]‘s Articles
[Wang Hongan]‘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-2019  中国科学院软件研究所 - Feedback
Powered by CSpace