Weiyang Liu

KCRC-LCD: Discriminative kernel collaborative representation with locality constrained dictionary for visual categorization

Abstract We consider the image classification problem via kernel collaborative representation classification with locality constrained dictionary (KCRC-LCD). Specifically, we propose a kernel collaborative representation classification (KCRC) approach in which kernel method is used to improve the discrimination ability of collaborative representation classification (CRC). We then measure the similarities between the query and atoms in the global dictionary in order to construct a locality constrained dictionary (LCD) for KCRC. In addition, we discuss several similarity measure approaches in LCD and further present a simple yet effective unified similarity measure whose superiority is validated in experiments. There are several appealing aspects associated with LCD. First, LCD can be nicely incorporated under the framework of KCRC. The LCD similarity measure can be kernelized under KCRC, which theoretically links CRC and LCD under the kernel method. Second, KCRC-LCD becomes more scalable to both the training set size and the feature dimension. Example shows that KCRC is able to perfectly classify data with certain distribution, while conventional CRC fails completely. Comprehensive experiments on widely used public datasets also show that KCRC-LCD is a robust discriminative classifier with both excellent performance and good scalability, being comparable or outperforming many other state-of-the-art approaches.

Structured occlusion coding for robust face recognition

Occlusion in face recognition is a common yet challenging problem. While sparse representation based classification (SRC) has been shown promising performance in laboratory conditions (i.e. noiseless or random pixel corrupted), it performs much worse in practical scenarios. In this paper, we consider the practical face recognition problem, where the occlusions are predictable and available for sampling. We propose the structured occlusion coding (SOC) to address occlusion problems. The structured coding here lies in two folds. On one hand, we employ a structured dictionary for recognition. On the other hand, we propose to use the structured sparsity in this formulation. Specifically, SOC simultaneously separates the occlusion and classifies the image. In this way, the problem of recognizing an occluded image is turned into seeking a structured sparse solution on occlusion-appended dictionary. In order to construct a well-performing occlusion dictionary, we propose an occlusion mask estimating technique via locality constrained dictionary (LCD), showing striking improvement in occlusion sample. On a category-specific occlusion dictionary, we replace l1 norm sparsity with the structured sparsity which is shown more robust, further enhancing the robustness of our approach. Moreover, SOC achieves significant improvement in handling large occlusion in real world. Extensive experiments are conducted on public data sets to validate the superiority of the proposed algorithm.

A novel kernel collaborative representation approach for image classification

Sparse representation classification (SRC) plays an important role in pattern recognition. Recently, a more generic method named as collaborative representation classification (CRC) has greatly improved the efficiency of SRC. By taking advantage of recent development of CRC, this paper explores to smoothly apply the kernel technique to further improve its performance and proposes the kernel CRC (KCRC) approach. Tested by multiple databases in experiments, KCR-C has shown that it can perfectly classify the data with the same direction distribution with limited complexity, and outperforms CRC, SRC and some other conventional algorithms.

Joint kernel dictionary and classifier learning for sparse coding via locality preserving K-SVD

We present a locality preserving K-SVD (LP-KSVD) algorithm for joint dictionary and classifier learning, and further incorporate kernel into our framework. In LP-KSVD, we construct a locality preserving term based on the relations between input samples and dictionary atoms, and introduce the locality via nearest neighborhood to enforce the locality of representation. Motivated by the fact that locality-related methods works better in a more discriminative and separable space, we map the original feature space to the kernel space, where samples of different classes become more separable. Experimental results show the proposed approach has strong discrimination power and is comparable or outperforms some state-of-the-art approaches on public databases.

Jointly Learning Non-negative Projection and Dictionary with Discriminative Graph Constraints for Classification

Sparse coding with dictionary learning (DL) has shown excellent classification performance. Despite the considerable number of existing works, how to obtain features on top of which dictionaries can be better learned remains an open and interesting question. Many current prevailing DL methods directly adopt well-performing crafted features. While such strategy may empirically work well, it ignores certain intrinsic relationship between dictionaries and features. We propose a framework where features and dictionaries are jointly learned and optimized. The framework, named joint non-negative projection and dictionary learning (JNPDL), enables interaction between the input features and the dictionaries. The non-negative projection leads to discriminative parts-based object features while DL seeks a more suitable representation. Discriminative graph constraints are further imposed to simultaneously maximize intra-class compactness and inter-class separability. Experiments on both image and image set classification show the excellent performance of JNPDL by outperforming several state-of-the-art approaches.

A kernel-based l 2 norm regularized least square algorithm for vehicle logo recognition

We consider the problem of automatically recognizing the vehicle logos from the frontal views with varying illumination, as well as certain corruption. To better address the problem, a kernel-based l2 norm regularized least square (RLS) algorithm is proposed in the paper. Kernel technique is smoothly combined with the l2 norm RLS algorithm to enhance the performance of vehicle logo recognition (VLR). As an extension, the improvement of dictionary is also considered. A simple mechanism of constructing an adaptive online dictionary has been presented and experimented. Experimental results show that our proposed algorithm outperforms the original l2 norm RLS algorithm and the l1 norm based algorithms.

Multi-kernel collaborative representation for image classification

We consider the image classification problem via multiple kernel collaborative representation (MKCR). We generalize the kernel collaborative representation based classification to a multi-kernel framework where multiple kernels are jointly learned with the representation coefficients. The intrinsic idea of multiple kernel learning is adopted in our MKCR model. Experimental results show MKCR converges within reasonable iterations and achieves state-of-the-art performance.

LB-MSNC: A load-balanced multicast switching fabric with network coding

A good switching fabric should be endowed with the properties of no internal buffers, delay guarantee, low component complexity and high-speed multicast, which are difficult for conventional switching fabrics to achieve, fueling the great interest in designing a new switching fabric that can support large-scale extension and high-speed multicast. Motivated by this, we reuse the self-routing Boolean concentrator network and embed a Multicast Packets Copy Separation (MPCS) in front to construct a load-balanced multicast switching fabric. Concretely, MPCS module replicates the multicast packets and forwards them according to the multicast addresses. The first phase of LB-MSNC is responsible for balancing the incoming traffic into uniform cells while the second phase is in charge of self-routing the cells to their final destinations. Differing from the existing fabrics, LB-MSNC is combined with the merits of network coding against the packet loss. Experimental results and analysis have verified that the proposed fabric is able to achieve high-speed multicast switching and suitable for building super large-scale switching fabric in Next Generation Network(NGN) with all the advantages mentioned above.

Prologue: Unified Polymorphic Routing Towards Flexible Architecture of Reconfigurable Infrastructure

Today’s Internet architecture was designed and proposed in the 60s and 70s with the intention to interconnect several computing resources across a geographically distributed user group. With the advent of substantially various Internet businesses, traditional Internet is increasingly powerless to satisfy the unprecedented demands. This paper probed the polymorphic routing prototype based on proposed Flexible Architecture of Reconfigurable Infrastructure (FARI) which attempts to emerge as a clean-slate revolution of future Internet and resorts to centralized control manner. Routers in FARI were reconfigurable to adapt to different businesses in terms of identifier type. Moreover, a preliminary framework of FARI is proposed in the end of the article.

Dictionary construction for sparse representation classification: A novel cluster-based approach

There has been a rapid development in sparse representation classification (SRC) since it came out. Most previous work on dictionary improvement was to enhance the classification performance by modifying the dictionary representation structure while this paper concentrates on the reduction of dictionary length with nearly no sacrifice in classification accuracy. A novel cluster-based dictionary construction approach for SRC is proposed in this paper. Both cluster technique and clustering evaluation index are introduced to help construct an optimal dictionary for better classification performance. Results of experiments have verified that the new dictionary does not lose discrimination ability while its running time is greatly reduced. Most importantly, its robustness is also preserved.