Query-expanded collaborative representation based classification with class-specific prototypes for object recognition

Linear representation based classifiers (LinearRCs) assume that a query image can be represented as a linear combination of dictionary atoms or prototypes with various priors (e.g., sparsity), which have achieved impressive results in face recognition. Recently, a few attempts have been made to deal with more general cases (e.g., multi-view or multi-pose objects, more generic objects, etc.) but with additional requirements. In this paper, we present a query-expanded collaborative representation based classifier with class-specific prototypes (QCRC_CP) from the general perspective. First, we expand a single query in a multi-resolution way to cover rich variations of object appearances, thereby generating a query set. We then condense the gallery images to a small amount of prototypical images by maximizing canonical correlation in a class-specific way, in which the implicit query-dependent data locality discards the outliers. Given the query set, we finally propose a multivariate LinearRC with collaborative prior to identify the query according to the rule of minimum normalized residual (MNR). Experiments on four object recognition datasets (FERET pose, Swedish leaf, Chars74K, and ETH-80) show that our method outperforms the state-of-the-art LinearRCs with performance increases at least 3.1%, 3.8%, 10.4% and 3.1% compared to other classifiers.     

Spacetime texture representation and recognition based on a spatiotemporal orientation analysis

This paper is concerned with the representation and recognition of the observed dynamics (i.e., excluding purely spatial appearance cues) of spacetime texture based on a spatiotemporal orientation analysis. The term "spacetime texture" is taken to refer to patterns in visual spacetime, (x,y,t), that primarily are characterized by the aggregate dynamic properties of elements or local measurements accumulated over a region of spatiotemporal support, rather than in terms of the dynamics of individual constituents. Examples include image sequences of natural processes that exhibit stochastic dynamics (e.g., fire, water, and windblown vegetation) as well as images of simpler dynamics when analyzed in terms of aggregate region properties (e.g., uniform motion of elements in imagery, such as pedestrians and vehicular traffic). Spacetime texture representation and recognition is important as it provides an early means of capturing the structure of an ensuing image stream in a meaningful fashion. Toward such ends, a novel approach to spacetime texture representation and an associated recognition method are described based on distributions (histograms) of spacetime orientation structure. Empirical evaluation on both standard and original image data sets shows the promise of the approach, including significant improvement over alternative state-of-the-art approaches in recognizing the same pattern from different viewpoints.     

Graph steered discriminative projections based on collaborative representation for Image recognition

Multimedia Tools and Applications - Dimensionality reduction techniques are commonly used for image recognition. We propose a graph steered dimensionality reduction method called Discriminative...     

Multi-resolution dictionary collaborative representation for face recognition

Pattern Analysis and Applications - In this paper, a multi-resolution dictionary collaborative representation(MRDCR) method for face recognition is proposed. Unlike most of the traditional sparse...     

Robust video summarization using collaborative representation of adjacent frames

Multimedia Tools and Applications - With the ever increasing volume of video content, efficient and effective video summarization (VS) techniques are urgently demanded to manage a large amount of...     

Learning locality-constrained collaborative representation for robust face recognition

The models of low-dimensional manifold and sparse representation are two well-known concise models that suggest that each data can be described by a few characteristics. Manifold learning is usually investigated for dimension reduction by preserving some expected local geometric structures from the original space into a low-dimensional one. The structures are generally determined by using pairwise distance, e.g., Euclidean distance. Alternatively, sparse representation denotes a data point as a linear combination of the points from the same subspace. In practical applications, however, the nearby points in terms of pairwise distance may not belong to the same subspace, and vice versa. Consequently, it is interesting and important to explore how to get a better representation by integrating these two models together. To this end, this paper proposes a novel coding algorithm, called Locality-Constrained Collaborative Representation (LCCR), which introduce a kind of local consistency into coding scheme to improve the discrimination of the representation. The locality term derives from a biologic observation that the similar inputs have similar codes. The objective function of LCCR has an analytical solution, and it does not involve local minima. The empirical studies based on several popular facial databases show that LCCR is promising in recognizing human faces with varying pose, expression and illumination, as well as various corruptions and occlusions.     

Supervised neighborhood regularized collaborative representation for face recognition

How to represent a test sample is very crucial for linear representation based classification. The famous sparse representation focuses on employing linear combination of small samples to represent the query sample. However, the local structure and label information of data are neglected. Recently, locality-constrained collaborative representation (LCCR) has been proposed and integrates a kind of locality-constrained term into the collaborative representation scheme. For each test sample, LCCR mainly considers its neighbors to deal with noise and LCCR is robust to various corruptions. However, the nearby samples may not belong to the same class. To deal with this situation, in this paper, we not only utilize the positive effect of neighbors, but also consider the side effect of neighbors. A novel supervised neighborhood regularized collaborative representation (SNRCR) is proposed, which employs the local structure of data and the label information of neighbors to improve the discriminative capability of the coding vector. The objective function of SNRCR obtains the global optimal solution. Many experiments are conducted over six face data sets and the results show that SNRCR outperforms other algorithms in most case, especially when the size of training data is relatively small. We also analyze the differences between SNRCR and LCCR.     

Domain adaptive collaborative representation based classification

Multimedia Tools and Applications - Conventional representation based classification methods, such as sparse representation based classification (SRC) and collaborative representation based...     

Weighted average integration of sparse representation and collaborative representation for robust face recognition

Computational Visual Media - Sparse representation is a significant method to perform image classification for face recognition. Sparsity of the image representation is the key factor for robust...     

Exploring probabilistic localized video representation for human action recognition

In recent years, the bag-of-words (BoW) video representations have achieved promising results in human action recognition in videos. By vector quantizing local spatial temporal (ST) features, the BoW video representation brings in simplicity and efficiency, but limitations too. First, the discretization of feature space in BoW inevitably results in ambiguity and information loss in video representation. Second, there exists no universal codebook for BoW representation. The codebook needs to be re-built when video corpus is changed. To tackle these issues, this paper explores a localized, continuous and probabilistic video representation. Specifically, the proposed representation encodes the visual and motion information of an ensemble of local ST features of a video into a distribution estimated by a generative probabilistic model. Furthermore, the probabilistic video representation naturally gives rise to an information-theoretic distance metric of videos. This makes the representation readily applicable to most discriminative classifiers, such as the nearest neighbor schemes and the kernel based classifiers. Experiments on two datasets, KTH and UCF sports, show that the proposed approach could deliver promising results.     

A new method for expiration code detection and recognition using gabor features based collaborative representation

Text in images and video contains important information for visual content understanding, indexing, and recognizing. Extraction of this information involves preprocessing, localization and extraction of the text from a given image. In this paper, we propose a novel expiration code detection and recognition algorithm by using Gabor features and collaborative representation based classification. The proposed system consists of four steps: expiration code location, character isolation, Gabor features extraction and characters recognition. For expiration code detection, the Gabor energy (GE) and the maximum energy difference (MED) are extracted. The performance of the recognition algorithm is tested over three Gabor features: GE, magnitude response (MR) and imaginary response (IR). The Gabor features are classified based on collaborative representation based classifier (GCRC). To encompass all frequencies and orientations, downsampling and principal component analysis (PCA) are applied in order to reduce the features space dimensionality. The effectiveness of the proposed localization algorithm is highlighted and compared with other existing methods. Extensive testing shows that the suggested detection scheme outperforms existing methods in terms of detection rate for large image database. Also, GCRC show very competitive results compared with Gabor feature sparse representation based classification (GSRC). Also, the proposed system outperforms the nearest neighbor (NN) classifier and the collaborative representation based classification (CRC).     

Multiplication fusion of sparse and collaborative representation for robust face recognition

Multimedia Tools and Applications - Sparse representation based classification (SRC) and collaborative representation based classification (CRC) are two well-known methods in representation-based...     

Font recognition based on global texture analysis

We describe a novel texture analysis-based approach toward font recognition. Existing methods are typically based on local typographical features that often require connected components analysis. In our method, we take the document as an image containing some specific textures and regard font recognition as texture identification. The method is content-independent and involves no detailed local feature analysis. Experiments are carried out by using 14000 samples of 24 frequently used Chinese fonts (six typefaces combined with four styles), as well as 32 frequently used English fonts (eight typefaces combined with four styles). An average recognition rate of 99.1 percent is achieved. Experimental results are also included on the robustness of the method against image degradation (e.g., pepper and salt noise) and on the comparison with existing methods     

A collaborative representation based projections method for feature extraction

In graph embedding based methods, we usually need to manually choose the nearest neighbors and then compute the edge weights using the nearest neighbors via L2 norm (e.g. LLE). It is difficult and unstable to manually choose the nearest neighbors in high dimensional space. So how to automatically construct a graph is very important. In this paper, first, we give a L2-graph like L1-graph. L2-graph calculates the edge weights using the total samples, avoiding manually choosing the nearest neighbors; second, a L2-graph based feature extraction method is presented, called collaborative representation based projections (CRP). Like SPP, CRP aims to preserve the collaborative representation based reconstruction relationship of data. CRP utilizes a L2 norm graph to characterize the local compactness information. CRP maximizes the ratio between the total separability information and the local compactness information to seek the optimal projection matrix. CRP is much faster than SPP since CRP calculates the objective function with L2 norm while SPP calculate the objective function with L1 norm. Experimental results on FERET, AR, Yale face databases and the PolyU finger-knuckle-print database demonstrate that CRP works well in feature extraction and leads to a good recognition performance.