Detection of Guilty Knowledge, Using Single Trial ERPs, Based on Non-linear method of Recurrence plots

Abstract:
In this study, Recurrence Plots (RPs) has been applied as a nonlinear approach in order to detection of guilty subjects’ knowledge based on their single-trial ERPs. The dataset were recorded from 49 human subjects who were participated in a Concealed Information Test (CIT). According to the test protocol, guilty subjects denied their information about familiar faces, so the aim was to detect the concealed faces in these subjects. Recurrence Quantification Analysis (RQAs) were employed in feature extraction stage. Brain's dynamic and it's trajectories in phase space are two important issues that can be indicated in these measures. Results demonstrate, that the appearance of P300 signals in guilty subjects (because of denying a familiar face), can increase the determinism and predictability of their brain’s signals. Also using Genetic Algorithm (GA) in feature selection level together with Linear Discriminant Analysis (LDA) classifier and a new method named: “variable threshold”, we achieved an accuracy about 89.7% on combining information of Fz, Cz and Pz channels.
Language:
Persian
Published:
Signal and Data Processing, Volume:9 Issue: 2, 2013
Page:
37
magiran.com/p1162651  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!