Approximate Least Trimmed Sum of Squares Fitting and Applications in Image Analysis

被引:22
作者
Shen, Fumin [1 ]
Shen, Chunhua [2 ,3 ]
van den Hengel, Anton [2 ,3 ]
Tang, Zhenmin [1 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Comp Sci & Technol, Nanjing 210094, Jiangsu, Peoples R China
[2] Univ Adelaide, Australian Ctr Visual Technol, Canberra, ACT 5005, Australia
[3] Univ Adelaide, Sch Comp Sci, Canberra, ACT 5005, Australia
基金
澳大利亚研究理事会;
关键词
Least trimmed sum of squares (LTS) regression; outlier removal; robust model fitting; second order cone programming; semidefinite programming; FACE RECOGNITION; ILLUMINATION; EIGENFACES; ALGORITHMS; REGRESSION; CONSENSUS; GEOMETRY;
D O I
10.1109/TIP.2013.2237914
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The least trimmed sum of squares (LTS) regression estimation criterion is a robust statistical method for model fitting in the presence of outliers. Compared with the classical least squares estimator, which uses the entire data set for regression and is consequently sensitive to outliers, LTS identifies the outliers and fits to the remaining data points for improved accuracy. Exactly solving an LTS problem is NP-hard, but as we show here, LTS can be formulated as a concave minimization problem. Since it is usually tractable to globally solve a convex minimization or concave maximization problem in polynomial time, inspired by [1], we instead solve LTS' approximate complementary problem, which is convex minimization. We show that this complementary problem can be efficiently solved as a second order cone program. We thus propose an iterative procedure to approximately solve the original LTS problem. Our extensive experiments demonstrate that the proposed method is robust, efficient and scalable in dealing with problems where data are contaminated with outliers. We show several applications of our method in image analysis.
引用
收藏
页码:1836 / 1847
页数:12
相关论文
共 34 条
[1]   New algorithms for computing the least trimmed squares regression estimator [J].
Agulló, J .
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2001, 36 (04) :425-439
[2]  
[Anonymous], 2000, Multiple View Geometry in Computer Vision
[3]   Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection [J].
Belhumeur, PN ;
Hespanha, JP ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (07) :711-720
[4]  
Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441
[5]  
Chin TJ, 2010, LECT NOTES COMPUT SC, V6315, P533, DOI 10.1007/978-3-642-15555-0_39
[6]   Optimal Randomized RANSAC [J].
Chum, Ondrej ;
Matas, Jiri .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2008, 30 (08) :1472-1482
[7]   RANDOM SAMPLE CONSENSUS - A PARADIGM FOR MODEL-FITTING WITH APPLICATIONS TO IMAGE-ANALYSIS AND AUTOMATED CARTOGRAPHY [J].
FISCHLER, MA ;
BOLLES, RC .
COMMUNICATIONS OF THE ACM, 1981, 24 (06) :381-395
[8]   From few to many: Illumination cone models for face recognition under variable lighting and pose [J].
Georghiades, AS ;
Belhumeur, PN ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (06) :643-660
[9]  
Hartley R, 2004, PROC CVPR IEEE, P504
[10]  
Hartley R, 2007, LECT NOTES COMPUT SC, V4843, P13