Steganalysis of LSB Matching Based on Improved Logistic Regression Algorithm
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Least significant bit (LSB) matching algorithm and common steganographic methods, which use Gaussian support vector machine (GSVM) algorithm as the classifier, spend too much training time. Therefore, an improved logistic regression classifying algorithm named L curve truncated regularized iteratively re-weighted least squares(LTR IRLS) is proposed. Firstly, near optimal parameters of Tikhonov regularization are determined based on L curve, and convergence parameters of the truncated Newton algorithm are obtained through experiments for increasing the detection accuracy. Secondly, iteratively re-weighted least squares are utilized to search for the maximum loss expectancy and truncated Newton methods are utilized to avoid computing the Hessian matrix in the objective function, therefore reducing the computation amount greatly. Theoretical analysis and experimental results verify that LTR IRLS can ensure the detection accuracy rate higher than GSVM classifier, meanwhile reducing the training time and increaseing the detection speed.

    Reference
    Related
    Cited by
Get Citation

Guo Jichang, Ji Wenchi, Gu Xiangyuan. Steganalysis of LSB Matching Based on Improved Logistic Regression Algorithm[J].,2015,30(6):1160-1168.

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: December 24,2015
  • Published:
Article QR Code