IJENS Publisher Indexed In SCOPUS


Title: Robust Digital Image Steganography within Coefficient Difference on Integer Haar Wavelet Transform
Author(s): Nur Azman Abu, Prajanto Wahyu Adi, Othman Mohd
Pages: 1-8 Paper ID:143802-1919-IJVIPNS-IJENS Published: April, 2014
Abstract: The development of digital information has lead to increasing demands on information security technology in order to protect the confidentiality of information. Digital steganography is one of technologies that is capable of protecting the information from unauthorized interception. It is due to its capability to hide the embedded of the information without attracting the eavesdropper’s attention. Among digital media, digital image is the most widely used medium for steganography. Discrete Cosine Transform (DCT) is a well known technique in digital image steganography. The use of DCT on small blocks may pose blocking effects and unintended artifacts on the overall image. These disadvantages of DCT can be eliminated by using Discrete Wavelet Transform (DWT) which is more compatible with the Human Visual System (HVS). However the floating point of DWT can causes some loss of information. On the other hand, Integer Wavelet Transform (IWT) represented in finite precision can avoid the problem of floating point precision in DWT. In this paper, the messages are embedded on the 1-level Integer Haar Wavelet Transform (IHWT) using coefficient difference scheme that is adopted from Pixel Value Differencing (PVD). The messages are embedded on the difference values of two adjacent wavelet coefficients. The result shows that the proposed method can easily outperform the existing method that employ IHWT and Pixel Mapping Method (PMM) in term of imperceptibility as well as the maximum capacity.
Keywords: steganography, watermarking, integer wavelet transform, image processing.
Full Text (.pdf)  International Journals Of Engineering and Sciences | 584 KB
Title: Degree Elevation of Interval B-Spline Curves
Author(s): O. Ismail
Pages: 9-14 Paper ID:146702-8181-IJVIPNS-IJENS Published: April, 2014
Abstract: This paper presents an efficient method for degree elevation of interval B-spline curves. The four fixed Kharitonov's polynomials (four fixed B-spline curves) associated with the original interval B-spline curve are obtained. The method is based on the matrix identity. The B-spline basis functions are represented as linear combinations of the B-splines of a higher degree. The process of degree elevation is applied to the four fixed B-spline curves of degree n to obtain the four fixed B-spline curves of degree n+k without changing their shapes. Finally the new interval vertices ?{[ß_i^-,ß_i^+ ]}?_(i=0)^(n+k) of the new interval polygon are obtained from vertices of the new fixed polygons of the four fixed B-spline curves. An illustrative example is included in order to demonstrate the effectiveness of the proposed method.
Keywords: Computer graphics, CAGD, degree elevation, interval B-spline curves.
Full Text (.pdf)  International Journals Of Engineering and Sciences | 404 KB