Abstract-This paper presents a complete image feature representation, based on texton theory proposed by Julesz's, called as a complete texton matrix (CTM)for texture image classification. The present descriptor can be viewed as an improved version of texton cooccurrence matrix (TCM) [1] and Multi-texton histogram (MTH) [2]. It is specially designed for natural image analysis and can achieve higher classification rate. TheCTM can express the spatial correlation of textons and can be considered as a generalized visual attribute descriptor. This paper initially quantized the original textures into 256 colors and computed color gradient from RGB vector space. Then the statistical information of eleven derived textons, on a 2 x 2 grid in a nonoverlapped manner are computed to describe image features more precisely. To reduce the dimensionality the present paper extended the concept of present descriptor and derived a compact CTM (CCTM). The proposed CTM and CCTM methods are extensively tested on the Brodtaz, Outex and UIUC natural images. The results demonstrate the superiority of the present descriptor over the state-of-art representative schemes such as uniform LBP (ULBP), local ternary pattern (LTP), complete -LBP (CLBP), TCM and MTH.

One of the popular descriptor for texture classification is the local binary pattern (LBP). LBP and its variants derives local texture features effectively. This paper integrates the significant local features derived from uniform LBPs(ULBP) and threshold based conversion factor non-uniform (NULBP) with complete textons. This integrated approach represents the complete local structural features of the image. The ULBPs are proposed to overcome the wide histograms of LBP. The ULBP contains fundamental aspects of local features. The LBP is more prone to noise and this may transform ULBP into NULBP and this degrades the overall classification rate. To addresses this, this paper initially transforms back, the ULBPs that are converted in to NULBPs due to noise using a threshold based conversion factor and derives noise resistant fundamental texture (NRFT) image. In the literature texton co-occurrence matrix(TCM) and multi texton histogram (MTH) are derived on a 2x2 window. The main disadvantage of the above texton groups is they fail in representing complete textons. In this paper we have integrated our earlier approach "complete texton matrix (CTM)" [16] on NRFT images. This paper computes the gray level cooccurrence matrix (GLCM) features on the proposed NRFCTM (noise resistant fundamental complete texton matrix) and the features are given to machine learning classifiers for a precise classification. The proposed method is tested on the popular databases of texture classification and classification results are compared with existing methods.

Abstract:In the past few decades Internet and digital technology has grown rapidly. The increasing and rapid advancement of Internet has made it extremely easy to send multimedia data accurate and fast to destination. It has provided various advantages like easy sharing of digital images, copying of digital images without quality degradation and editing of digital images. Also due to increasing trend of Internet, multimedia data is tend to duplicate and modify which makes multimedia security as an extreme concern to take care of. Modification and misusing of valuable data is very common and thus sending multimedia data to intended recipient has become more important. The problems arises includes privacy, corruption or processing of image and counterfeiting. This paper throws light on information hiding in order to protect original data from illegal duplication, distribution and manipulation through "Digital Image Watermarking". Watermarking is an art of hiding information into another file, which could be video, audio, text or image. The paper includes various type of watermarking, different techniques of watermarking.

No abstract

Information retrieval has a well-established tradition of performing laboratory experiments on test collections to compare the relative effectiveness of different retrieval approaches. The experimental design specifies the evaluation criterion to be used to determine if one approach is better than another. Retrieval behavior is sufficiently complex to be difficult to summarize in one number, many different effectiveness measures have been proposed. A concept model is implicitly possessed by users and is generated from their background knowledge. This model learns ontological user profiles from both a world knowledge base and user local instance repositories. The ontology model is evaluated by comparing it against benchmark models in web information gathering. The results show that this ontology model is successful.