Visual mouse : SIFT detection and PCA recognition

The paper presents the Visual Mouse (VM), a novel and simple system for interaction with displays via hand gestures. Our method includes detecting bare hands using the fast SIFT (Scale-Invariant Feature Transform) algorithm saving long training time of the Adaboost algorithm, tracking hands based on the CAMShift algorithm, recognizing hand gestures in cluttered background via Principle Components Analysis (PCA) without extracting clear-cut hand contour, and defining simple and robustly interpretable vocabularies of hand gestures, which are subsequently used to control a computer mouse. The system provides a fast and simple interaction experience without the need for more expensive hardware and software.

Object categorization via sparse representation of local features

Sparse representation has been introduced to address many recognition problems in computer vision. In this paper, we propose a new framework for object categorization based on sparse representation of local features. Unlike most of previous sparse coding based methods in object classification that only use sparse coding to extract high-level features, the proposed method incorporates sparse representation and classification into a unified framework. Therefore, it does not need a further classifier. Experimental results show that the proposed method achieved better or comparable accuracy than the well known bag-of-features representation with various classifiers.

Extracting 3D mesh skeletons using antipodal points locations

Finding the skeleton of a 3D mesh is an essential task for many applications such as mesh animation, tracking, and 3D registeration. In recent years, new technologies in computer vision such as Microsoft Kinect have proven that a mesh skeleton can be useful such as in the case of human machine interactions. To calculate the 3D mesh skeleton, the mesh properties such as topology and its components relations are utilized. In this paper, we propose the usage of a novel algorithm that can efficiently calculate a vertex antipodal point. A vertex antipodal point is the diametrically opposite point that belongs to the same mesh. The set of centers of the connecting lines between each vertex and its antipodal point represents the 3D mesh desired skeleton. Post processing is completed for smoothing and fitting centers into optimized skeleton parts. The algorithm is tested on different classes of 3D objects and produced efficient results that are comparable with the literature. The algorithm has the advantages of producing high quality skeletons as it preserves details. This is suitable for applications where the mesh skeleton mapping is required to be kept as much as possible.

Video driven traffic modelling in ParamicsTM

With urbanization and vehicle availability, there exist many traffic problems including congestion, environmental impact and safety. In order to address these problems, we propose a video driven traffic modelling system in this paper. The system can simulate real-world traffic activities in a computer, based on traffic data recorded in videos. Video processing is employed to estimate metrics such as traffic volumes. These metrics are used to update the traffic system model, which is then simulated using the Paramics™ traffic simulation platform. Video driven traffic modelling has widespread potential application in traffic systems, due to the convenience and reduced costs of model development and maintenance. Experiments are conducted in this paper to demonstrate the effectiveness of the proposed system.

Video driven traffic modelling

We propose Video Driven Traffic Modelling (VDTM) for accurate simulation of real-world traffic behaviours with detailed information and low-cost model development and maintenance. Computer vision techniques are employed to estimate traffic parameters. These parameters are used to build and update a traffic system model. The model is simulated using the Paramics traffic simulation platform. Based on the simulation techniques, effects of traffic interventions can be evaluated in order to achieve better decision makings for traffic management authorities. In this paper, traffic parameters such as vehicle types, times of starting trips and corresponding origin-destinations are extracted from a video. A road network is manually defined according to the traffic composition in the video, and individual vehicles associated with extracted properties are modelled and simulated within the defined road network using Paramics. VDTM has widespread potential applications in supporting traffic decision-makings. To demonstrate the effectiveness, we apply it in optimizing a traffic signal control system, which adaptively adjusts green times of signals at an intersection to reduce traffic congestion.

Infrared face recognition: a literature review

Automatic face recognition (AFR) is an area with immense practical potential which includes a wide range of commercial and law enforcement applications, and it continues to be one of the most active research areas of computer vision. Even after over three decades of intense research, the state-of-the-art in AFR continues to improve, benefiting from advances in a range of different fields including image processing, pattern recognition, computer graphics and physiology. However, systems based on visible spectrum images continue to face challenges in the presence of illumination, pose and expression changes, as well as facial disguises, all of which can significantly decrease their accuracy. Amongst various approaches which have been proposed in an attempt to overcome these limitations, the use of infrared (IR) imaging has emerged as a particularly promising research direction. This paper presents a comprehensive and timely review of the literature on this subject.

Recognition from appearance subspaces across image sets of variable scale

Linear subspace representations of appearance variation are pervasive in computer vision. In this paper we address the problem of robustly matching them (computing the similarity between them) when they correspond to sets of images of different (possibly greatly so) scales. We show that the naïve solution of projecting the low-scale subspace into the high-scale image space is inadequate, especially at large scale discrepancies. A successful approach is proposed instead. It consists of (i) an interpolated projection of the low-scale subspace into the high-scale space, which is followed by (ii) a rotation of this initial estimate within the bounds of the imposed “downsampling constraint”. The optimal rotation is found in the closed-form which best aligns the high-scale reconstruction of the low-scale subspace with the reference it is compared to. The proposed method is evaluated on the problem of matching sets of face appearances under varying illumination. In comparison to the naïve matching, our algorithm is shown to greatly increase the separation of between-class and within-class similarities, as well as produce far more meaningful modes of common appearance on which the match score is based.