DocumentCode :
2459978
Title :
A Novel High Breakdown M-estimator for Visual Data Segmentation
Author :
Hoseinnezhad, Reza ; Bab-Hadiashar, Alireza
Author_Institution :
Swinburne Univ. of Technol., Melbourne
fYear :
2007
fDate :
14-21 Oct. 2007
Firstpage :
1
Lastpage :
6
Abstract :
Most robust estimators, designed to solve computer vision problems, use random sampling to optimize their objective functions. Since the random sampling process is patently blind and computationally cumbersome, other searches of parameter space using techniques such as Nelder Meade simplex or gradient search techniques have been also proposed (particularly in combination with PbM-estimators). In this paper, we introduce a novel high breakdown M-estimator having a differentiable objective function for which a closed form updating formula is mathematically derived (similar to redescending M-estimators) and used to search the parameter space. The resulting M-estimator has a high breakdown point and is called high breakdown M-estimator (HBM). We show that this objective function can be optimized using an iterative reweighted least squares regression similar to redescending M-estimators. The closed mathematical form of HBM and its guaranteed stability combined with its high breakdown point and fast convergence speed make this estimator an outstanding choice for segmentation of multi-structural data. A number of experiments, using both synthetic and real data have been conducted to show and benchmark the performance of the proposed estimator both in terms of accurate segmentation of numerous structures in the data and also the convergence speed. Moreover, the computational time of HBM, ASSC, MSSE and PbM are compared using the same computing platform and the results show that HBM significantly outperforms aforementioned techniques.
Keywords :
computer vision; convergence of numerical methods; estimation theory; image segmentation; iterative methods; least squares approximations; minimisation; regression analysis; search problems; HBM estimator; computer vision problems; convergence speed; differentiable objective function; high breakdown M-estimator; iterative reweighted least squares regression; objective function minimization; parameter space search; visual data segmentation; Australia; Computer vision; Convergence; Design optimization; Electric breakdown; Equations; Least squares methods; Robustness; Sampling methods; Space technology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on
Conference_Location :
Rio de Janeiro
ISSN :
1550-5499
Print_ISBN :
978-1-4244-1630-1
Electronic_ISBN :
1550-5499
Type :
conf
DOI :
10.1109/ICCV.2007.4408971
Filename :
4408971
Link To Document :
بازگشت