With the increase in the number of e-services, there is a sharp increase in online financial transactions these days. These services require a strong authentication scheme to validate the users of these services and allow access to the resources for strong security. Since two-factor authentication ensures the required security strength, various organizations employ biometric-based or Smart Card or Cryptographic Token-based methods to ensure the safety of user accounts. But most of these methods require a verifier table for validating users at a server. This poses a security threat of stolen-verifier attack. To address this issue, there is a strong need for authentication schemes for e-services that do not require a verifier table at the server. Therefore, this paper proposes the design of an authentication scheme for e-services which should be resistant to various attacks including a stolen verifier attack. The paper will also discuss: 1) The proposed scheme analyzed for security provided against the known authentication attacks 2) The concept implementation of the proposed scheme.

The authentication is used to ensure the authentication of the owner of the data. Currently, the data is available in multimedia format viz., audio, video, image and text. The present paper focuses on the image authentication. The watermarking methods are used for the image authentication. The present paper proposes a novel method of Kurtosis based Watermarking by using Wavelet Transformation (KWWT). The proposed method uses wavelet transformation. Further, the bands or the coefficients are divided into various non overlapped windows. For each of the approximation band windows, the kurtosis value will be estimated. Then the windows in all bands will be selected based on their kurtosis value. Then, the watermark image will be embedded into the selected windows of the bands. Finally, inverse wavelet transformation will be applied to get the resultant watermarked image. The proposed KWWT method is evaluated with 14 input images and 3 watermark images. Various performance measures are estimated and the results show the efficacy of the proposed method.

At present trillion of bytes of information is being created by projects particularly in web. To accomplish the best choice for business benefits, access to that information in a very much arranged and intuitive way is dependably a fantasy of business administrators and chiefs. Information warehouse is the main feasible arrangement that can bring the fantasy into reality. The upgrade of future attempts to settle on choices relies on upon the accessibility of right data that depends on nature of information basic. The quality information must be created by cleaning information preceding stacking into information distribution center following the information gathered from diverse sources will be grimy. Once the information have been pre-prepared and purified then it produces exact results on applying the information mining question. There are numerous cases where the data is sparse in nature. To get accurate results with sparse data is hard. In this paper the main goal is to fill the missing values in acquired data which is sparse in nature. Precisely caution must be taken to choose minimum number of text pieces to fill the holes for which we have used Jaccard Dissimilarity function for clustering the data which is frequent in nature.

Many diversified applications do exist in science & technology, which make use of the primary theory of a recognition phenomenon as one of its solutions. Recognition scenario is incorporated with a set of decisions and the action according to the decision purely relies on the quality of extracted information on utmost applications. Thus, the quality decision making absolutely reckons on processing momentum and precision which are entirely coupled with recognition methodology. In this article, a latest rule is formulated based on the degree of correlation to characterize the generalized recognition constraint and the application is explored with respect to image based information extraction. Machine learning based perception called feed forward architecture of Artificial Neural Network has been applied to attain the expected eminence of elucidation. The proposed method furnishes extraordinary advantages such as less memory requirements, extremely high level security for storing data, exceptional speed and gentle implementation approach.

In this paper, we propose a methodology for color and edge histogram based medicinal plants image retrieval. The medicinal plants are divided into herbs, shrubs and trees. The medicinal plants are used in ayurvedic medicines. Manual identification of medicinal plants requires a priori knowledge. Automatic recognition of medicinal plants is useful. We have considered medicinal plant species, such as Papaya, Neem, Tulasi and Aloevera are considered for identification and retrieval. The color histograms are obtained in RGB, HSV and YCbCr color spaces. The number of valleys and peaks in the color histograms are used as features. But, these features alone are not helpful in discriminating plant images, since majority plant images are green in color. We have used edge and edge direction histograms in the work to get edges in the stem and leafy parts. Finally, these features are used in retrieval of medicinal plant images. Absolute distance, Euclidean distance and mean square error, similarity distance measures are deployed in the work. The results show an average retrieval efficiency of 94% and 98% for edge and edge direction features respectively.