جستجوی مقالات مرتبط با کلیدواژه "texture" در نشریات گروه "برق"

In recent years, image annotation is one of the active research topics. In this article, a semi-supervised cooperative clustering technique is proposed for image annotation. Clustering methods are very popular because they do not require annotations. In order to achieve the highest efficiency, the clustering results of six systems with different color space and similarity criteria are cooperatively combined with the majority vote. When the number of votes for an image is low, relevant feedback is used to annotate it. One of the most important parts of the image retrieval system and clustering algorithm is determining the appropriate similarity criteria between images. Nowadays, the linear similarity criterion is mostly used to determine the similarity between images, but the nonlinear models can have much better performance due to their proximity to the human vision system, for this purpose, the KMRBF nonlinear similarity criterion is used to simulate vision. Humans and improvement of recovery results are suggested. Experiments on the Corel image database and satellite images show that the proposed method has good performance. According to the results obtained in the satellite image database, the YIQ color space has a higher accuracy (82.5%). Also, the three color spaces CIELab, HSV and YIQ have higher efficiency, because in these color spaces, luminance is separated from chrominance and these color spaces are closer to the human vision system.

In this paper we describe a novel noise-robust texture classification method using joint multiscale local binary pattern. The first step in texture classification is to describe the texture by extracting different features. So far, several methods have been developed for this topic, one of the most popular ones is Local Binary Pattern (LBP) method and its variants such as Completed Local Binary Pattern, Extended Local Binary Pattern, Local Temporary Pattern, Local Contrast Pattern, etc. In order to extract the features of a texture in different scales, the LBP method can be implemented in a multi-scale framework. For this purpose, the extracted feature vectors at different scales are usually concatenated together to produce the final feature vector with a longer length. But such a scheme has two main shortcomings. First, the LBP method is very sensitive to noise, hence by adding noise to a texture image, its feature vectors may change significantly. Second, by increasing the number of the scales, the length of the final feature vector is increased accordingly. This action increases the classification process time, and it may reduce the classification accuracy. To mitigate these shortcomings, this paper presents a method based on multiscale LBP, which has a better resistance against white Gaussian noise, while the length of its final feature vector is equal to the length of the final feature vector produced by the original LBP method. To implement the proposed method, we used 17 circular binary masks that contain 8 directed first-order masks, 8 directed second-order masks and 1 undirected mask. These masks have positive and negative weightes and each group of these masks have different radius which after convolution with input image extract features in different scales. Experiments were performed on four test groups of Outex database. Experimental results show that the proposed method is superior to the existing state-of-the-art methods. The complexity of proposed method is also analyzed. The results show that in this method, despite obtaining excellent classification accuracy, the complexity of the method has not changed much and even its complexity is less than some of the existing state-of-the-art methods.