An oil painters recognition method based on cluster multiple kernel learning algorithm

A lot of image processing research works focus on natural images, such as in classification, clustering, and the research on the recognition of artworks (such as oil paintings), from feature extraction to classifier design, is relatively few. This paper focuses on oil painter recognition and tries to find the mobile application to recognize the painter. This paper proposes a cluster multiple kernel learning algorithm, which extracts oil painting features from three aspects: color, texture, and spatial layout, and generates multiple candidate kernels with different kernel functions. With the results of clustering numerous candidate kernels, we selected the sub-kernels with better classification performance, and use the traditional multiple kernel learning algorithm to carry out the multi-feature fusion classification. The algorithm achieves a better result on the Painting91 than using traditional multiple kernel learning directly

DBC based Face Recognition using DWT

The applications using face biometric has proved its reliability in last decade. In this paper, we propose DBC based Face Recognition using DWT (DBC- FR) model. The Poly-U Near Infra Red (NIR) database images are scanned and cropped to get only the face part in pre-processing. The face part is resized to 100*100 and DWT is applied to derive LL, LH, HL and HH subbands. The LL subband of size 50*50 is converted into 100 cells with 5*5 dimention of each cell. The Directional Binary Code (DBC) is applied on each 5*5 cell to derive 100 features. The Euclidian distance measure is used to compare the features of test image and database images. The proposed algorithm render better percentage recognition rate compared to the existing algorithm.Comment: 15 pages,9 figures, 4 table

Fuzzy Based Texton Binary Shape Matrix (FTBSM) for Texture Classification

Texton is a extensively applied approach for texture analysis. This technique shows a strong dependence on certain number of parameters. Unfortunately, each variation of values of any parameter may affect the texture characterization performance. Moreover, micro structure texton is unable to extract texture features which also have a negative effect on the classification task. This paper, deals with a new descriptor which avoids the drawbacks mentioned above. To address the above, the present paper derives a new descriptor called Fuzzy Based Texton Binary Shape Matrix (FTBSM) for clear variation of any feature/parameter. The proposed FTBSM are defined based on similarity of neighboring edges on a 3D7;3 neighborhood. With micro-structures serving as a bridge for extracting shape features and it effectively integrates color, texture and shape component information as a whole for texture classification. The proposed FTBSM algorithm exhibits low dimensionality. The proposed FTBSM method is tested on Vistex and Akarmarble texture datasets of natural images. The results demonstrate that it is much more efficient and effective than representative feature descriptors, such as logical operators and GLCM and LBP, for texture classification

Connected Attribute Filtering Based on Contour Smoothness

A new attribute measuring the contour smoothness of 2-D objects is presented in the context of morphological attribute filtering. The attribute is based on the ratio of the circularity and non-compactness, and has a maximum of 1 for a perfect circle. It decreases as the object boundary becomes irregular. Computation on hierarchical image representation structures relies on five auxiliary data members and is rapid. Contour smoothness is a suitable descriptor for detecting and discriminating man-made structures from other image features. An example is demonstrated on a very-high-resolution satellite image using connected pattern spectra and the switchboard platform

Exploiting Feature Correlations by Brownian Statistics for People Detection and Recognition

International audienceCharacterizing an image region by its feature inter-correlations is a modern trend in computer vision. In this paper, we introduce a new image descriptor that can be seen as a natural extension of a covariance descriptor with the advantage of capturing nonlinear and non-monotone dependencies. Inspired from the recent advances in mathematical statistics of Brownian motion, we can express highly complex structural information in a compact and computationally efficient manner. We show that our Brownian covariance descriptor can capture richer image characteristics than the covariance descriptor. Additionally, a detailed analysis of the Brownian manifold reveals that in opposite to the classical covariance descriptor, the proposed descriptor lies in a relatively flat manifold, which can be treated as a Euclidean. This brings significant boost in the efficiency of the descriptor. The effectiveness and the generality of our approach is validated on two challenging vision tasks, pedestrian classification and person re-identification. The experiments are carried out on multiple datasets achieving promising results