Manifold Learning based on the Manifold Graph Construction using Sparse Representation

Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
In this paper, a sparse representation based manifold learning method is proposed. The construction of the graph manifold in high dimensional space is the most important step of the manifold learning methods that is divided into local and gobal groups. The proposed graph manifold extracts local and global features, simultanstly. After construction the sparse representation based graph manifold, two linear and nonlinear methods are proposed to extracte the embedded data. The proposed method is compared with the common manifold learning methods, LLE, LEM, LPP and PCA. The results on two Persian handwritten databases, HODA and IFHCDB,show the better performance of the proposed method and the recognition rates of 91.89 and 93.89 are achieved on HODA and IFHCDB, respectively. Also, a modification of the proposed method is proposed to reduce the computational complexity. The results on HODA demonstrate the good performance of the modified method and decrease the computational complexity around 6 times.
Language:
Persian
Published:
Journal of Iranian Association of Electrical and Electronics Engineers, Volume:15 Issue: 2, 2018
Pages:
81 to 95
magiran.com/p1856910  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!