Redesigning data hiding: Interpolation-based scrambling-embedding method
Simying Ong, KokSheik Wong, Kiyoshi Tanaka
Abstract
Simying Ong, KokSheik Wong, Kiyoshi Tanaka
Abstract
In this paper, we explored the existing data hiding method and re-designed the method into a scrambling- embedding method to unify both scrambling and data embedding. Interpolated-based technique is revised and it is utilized to realize this unification. Experimental results indicate that the proposed method achieve scrambling while able to embed maximum up to ~668,498.8 bits for interpolating 256×256 pixels image into 512×512 pixels image. Besides, parameter W is introduced to enable scalability in output image quality degradation. Finally, the proposed method is compared to the relevant methods for performance evaluation purposes.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we explored the existing data hiding method and re-designed the method into a scrambling- embedding method to unify both scrambling and data embedding. Interpolated-based technique is revised and it is utilized to realize this unification. Experimental results indicate that the proposed method achieve scrambling while able to embed maximum up to ~668,498.8 bits for interpolating 256×256 pixels image into 512×512 pixels image. Besides, parameter W is introduced to enable scalability in output image quality degradation. Finally, the proposed method is compared to the relevant methods for performance evaluation purposes.
Key concepts: Scrambling, Information hiding, Pixel, Embedding, Computer science, Scalability, Interpolation (computer graphics), Image (mathematics)