Earticle

One of the most popular and important studies in data mining is association rules mining. Generally, association rules can be divided into two categories called frequent and least. However, finding the least association rules is more complex and time consuming as compared to the frequent one. These rules are very useful in certain application domain such as determining the exceptional association between university’s programs being selected by students. Therefore in this paper, we apply our novel measure called Definite Factors (DF) to determine the significant least association rules from undergraduate’s program selection database. The dataset of computer science student for July 2008/2009 intake from Universiti Malaysia Terengganu was employed in the experiment. The result shows that our measurement can mine these rules and it is at par with the existing benchmarked Relative Support Apriori (RSA) measurement.

A new method for insertion of message using 6th, 7th and 8th bits of pixel values of an image is developed. This method is an improvement over the earlier method [7] in which 6th and 7th bits of pixel values of an image were used. A method to retrieve the message is also given. Another advantage offered by this technique is that the message can be retrieved even if the intruder changes the least significant bit of all the image pixels in which message has been embedded.

In this paper, an image watermarking scheme is presented, in which Least Significant Bit and discrete cosine transform are used. The discrete cosine transform is performed on the original host image, and the secret watermark image is embedded into the coefficient of discrete cosine transform, which will replace the least significant bit. The embedded secret watermark bit will cause minimal distortion of the original host image, but we cannot find the difference of the original host image and the watermarked image. The experiment based on this algorithm demonstrates that the watermarking is robust to the common signal processing techniques, including noise attack, JPEG Compression attack and so on.

Watermarking is an important technique used for copyright protection, authentication, tamper detection and hiding secret information in multimedia contents. In this article a new digital watermarking scheme is proposed based on multiple parameter discrete fractional Fourier transform and using least significant bit (LSB) technique. The multiple parameter discrete fractional Fourier transform (MPDFRFT) is the generalization of the discrete fractional Fourier transform (DFRFT) in terms of its different nature of its fractional orders. The MPDFRFT can converge to DFRFT when all of its fractional order parameters having a similar value. The multiple parameter discrete fractional transforms shows it’s superiority over DFRFT because of that it benefitted us with an extra degree of freedom that is provided by its multiple fractional orders. The LSB technique is more preferable because of its lesser effect on the image characteristics. During the implementation of proposed scheme cover image is subdivided and MPDFRFT is applied to each subdivided image to transformed coefficients and watermark images are embedded by using LSB technique. Similarly during watermark extraction process the reverse order of MPDFRFT is applied for reconstruction of original images along with LSB extraction mechanism. The MPDFRFT fractional order parameters are used as secret key to improve the robustness of the system. The robustness of the watermark image is tested under different attacks such as additive noise, cropping, rotation and Gaussian low-pass filtering is analyzed and the results demonstrate that the embedding scheme has good performance of robustness. The imperceptibility of the proposed scheme against the hostile person is also verified by simulations results.