An improved Sudoku-based data hiding scheme using greedy method
by Chin-Chen Chang; Guo-Dong Su; Chia-Chen Lin
International Journal of Computational Science and Engineering (IJCSE), Vol. 23, No. 1, 2020

Abstract: Inspired by Chang et al.'s scheme, an improved Sudoku-based data hiding scheme is proposed here. The major idea of our improved scheme is to find the approximate optimal solution of Sudoku using the greedy method instead of via a brute-force search for an optimal solution. Later, the found approximate optimal solution of Sudoku is used to offer satisfactory visual stego-image quality with a lower execution time during the embedding procedure. Simulation results confirmed that the average stego-image quality is enhanced by around 90.51% compared to Hong et al.'s scheme, with relatively less execution time compared to a brute-force search method.

Online publication date: Thu, 08-Oct-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com