کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6940353 1450011 2018 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Non-greedy Max-min Large Margin based on L1-norm
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
Non-greedy Max-min Large Margin based on L1-norm
چکیده انگلیسی
In recent years, there have been several L1-norm-based linear projection methods and max-min-based dimensionality reduction methods, which show robustness to outliers and noises and show large margin for discrimination. In this paper, we propose L1-norm-based max-min large margin (MLM-L1) for linear projection-based dimensionality reduction. It makes use of the robustness of L1-norm to outliers and noises and the max-min idea for large margin. A non-greedy iterative algorithm (NMLM-L1) is proposed to solve the optimization problem of the proposed MLM-L1. Experiments on several face image databases show that the proposed method has better classification performance than its closely related methods.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition Letters - Volume 108, 1 June 2018, Pages 38-47
نویسندگان
, , , ,