Reduce Dimensions of CDF Steganalysis Approach Using a Graph Theory Based Feature Selection Method
Author(s):
Abstract:
The steganalysis purpose is to prevent the pursuit of steganography methods for your goals. In steganography, in order to evaluate new ideas, there should be known steganalysis attacks on them, and the results should be compared with other existing methods. One of the most well-known steganalysis methods is CDF method that used in this research.
One of the major challenges in the image steganalysis issue is the large number of extracted features. High-dimensional data sets from two directions reduce steganalysis performance. On the one hand, with the increase in the dimensions of the data, the volume of computing increases, and on the other hand, a model based on high-dimensional data has a low generalization capability and increases probability of overfitting. As a result, reducing the dimensions of the problem can both reduce the computational complexity and improve the steganalysis performance. In this paper, has been tried to combine the concept of the maximum weighted clique problem and edge centrality measure, and to consider the suitability of each feature, to select the most effective features with minimum redundancy as the final features. The simulation results on the SPAM and CC-PEV data showed that the proposed method had a good performance and accurately obtained about 96% in the detection of data embedding in the images, and this method is more accurate than the previously known methods.
One of the major challenges in the image steganalysis issue is the large number of extracted features. High-dimensional data sets from two directions reduce steganalysis performance. On the one hand, with the increase in the dimensions of the data, the volume of computing increases, and on the other hand, a model based on high-dimensional data has a low generalization capability and increases probability of overfitting. As a result, reducing the dimensions of the problem can both reduce the computational complexity and improve the steganalysis performance. In this paper, has been tried to combine the concept of the maximum weighted clique problem and edge centrality measure, and to consider the suitability of each feature, to select the most effective features with minimum redundancy as the final features. The simulation results on the SPAM and CC-PEV data showed that the proposed method had a good performance and accurately obtained about 96% in the detection of data embedding in the images, and this method is more accurate than the previously known methods.
Keywords:
Language:
Persian
Published:
Iranian Journal of Electrical and Computer Engineering, Volume:16 Issue: 4, 2019
Pages:
301 to 309
magiran.com/p1972721
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
دسترسی سراسری کاربران دانشگاه پیام نور!
اعضای هیئت علمی و دانشجویان دانشگاه پیام نور در سراسر کشور، در صورت ثبت نام با ایمیل دانشگاهی، تا پایان فروردین ماه 1403 به مقالات سایت دسترسی خواهند داشت!
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!