Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2015
Robust Ellipse Fitting via Half-Quadratic and Semidefinite Relaxation Optimization
IEEE Transactions on Image Processing (TIP), Volume 24, Issue 11Pages 4276–4286https://doi.org/10.1109/TIP.2015.2460466Ellipse fitting is widely applied in the fields of computer vision and automatic manufacture. However, the introduced edge point errors (especially outliers) from image edge detection will cause severe performance degradation of the subsequent ellipse ...
- research-articleJanuary 2015
Generic Half-Quadratic Optimization for Image Reconstruction
SIAM Journal on Imaging Sciences (SJISBI), Volume 8, Issue 3Pages 1752–1797https://doi.org/10.1137/140987845We study the global and local convergence of a generic half-quadratic optimization algorithm inspired from the dual energy formulation of Geman and Reynolds [IEEE Trans. Pattern Anal. Mach. Intell., 14 (1992), pp. 367--383]. The target application is the ...
- research-articleFebruary 2014
Half-Quadratic-Based Iterative Minimization for Robust Sparse Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence (ITPM), Volume 36, Issue 2Pages 261–275https://doi.org/10.1109/TPAMI.2013.102Robust sparse representation has shown significant potential in solving challenging problems in computer vision such as biometrics and visual surveillance. Although several robust sparse models have been proposed and promising results have been obtained, ...
- ArticleDecember 2012
Robust Nonnegative Matrix Factorization via Half-Quadratic Minimization
ICDM '12: Proceedings of the 2012 IEEE 12th International Conference on Data MiningPages 201–210https://doi.org/10.1109/ICDM.2012.39Nonnegative matrix factorization (NMF) is a popular technique for learning parts-based representation and data clustering. It usually uses the squared residuals to quantify the quality of factorization, which is optimal specifically to zero-mean, ...
- research-articleFebruary 2012
Agglomerative Mean-Shift Clustering
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 24, Issue 2Pages 209–219https://doi.org/10.1109/TKDE.2010.232Mean-Shift (MS) is a powerful nonparametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets. In this paper, for the purpose of algorithmic speedup, we develop an ...
- research-articleAugust 2011
Maximum Correntropy Criterion for Robust Face Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence (ITPM), Volume 33, Issue 8Pages 1561–1576https://doi.org/10.1109/TPAMI.2010.220In this paper, we present a sparse correntropy framework for computing robust sparse representations of face images for recognition. Compared with the state-of-the-art l^1norm-based sparse representation classifier (SRC), which assumes that noise also ...