5987649
An Improved Real-Time Contour Tracking Algorithm Using Fast Level Set Method
Human contour provides important information in high level vision tasks such as activity recognition and human computer interaction where detailed analysis of shape deformation is required. In this paper, a real time region-based contour tracking algorithm is presented. The main advantage of our algorithm is the ability of tracking nonrigid objects such as human using an adaptive external speed function with fast level set method. The weighting parameter, λi is adjusted to accommodate the situations in which the object being tracked and the background have similar intensity. Experimental results show the better performance of the proposed algorithm with adaptive weights.
6480622
Mapping low-level features to high-level semantic concepts in region-based image retrieval
In this paper, a novel offline supervised learning method is proposed to map low-level visual features to high-level semantic concepts for region-based image retrieval. The contributions of this paper lie in three folds. (1) For each semantic concept, a set of low-level tokens are extracted from the segmented regions of training images. Those tokens capture the representative information for describing the semantic meaning of that concept; (2) a set of posteriors are generated based on the low-level tokens through pairwise classification, which denote the probabilities of images belonging to the semantic concepts. The posteriors are treated as high-level features that connect images with high-level semantic concepts. Long-term relevance feedback learning is incorporated to provide the supervisory information needed in the above offline learning process, including the concept information and the relevant training set for each concept; (3) an integrated algorithm is implemented to combine two kinds of information for retrieval: the information from the offline feature-to-concept mapping process and the high-level semantic information from the long-term learned memory. Experimental evaluation on 10,000 images proves the effectiveness of our method.
62767012
Incorporating prior knowledge into SVM for image retrieval
SVM based image retrieval suffers from the scarcity of labelled samples. In this paper, this problem is solved by incorporating prior knowledge into SVM. Firstly, some prior knowledge of image retrieval is discussed and constructed. After that, the knowledge is incorporated into SVM optimization as a constraint, and a new knowledge-based target function is formulated. Based on this, a framework of image retrieval with knowledge based SVM is proposed. Experimental results demonstrate that the proposed method can effectively improve the learning and retrieval performance of SVM, especially when the number of labelled samples is small.
6521345
Using Statistical Shape Priors in Geodesic Active Contours for Robust Object Detection
A novel statistical shape prior model based on level set representations is proposed in this paper for robust object detection by geodesic active contours. This prior model is able to accommodate multiple shape states of objects. The level set representations (signed distance map) of the shapes are considered to form distinct clusters in a low dimensional feature subspace and a Gaussian mixture model (GMM) is employed to fit the feature distribution in the subspace. A Bayesian classifier is used to assign the currently detected object to the most similar shape cluster. A shape prior is then constructed from the statistical properties of that cluster and is used to drive the geodesic active contour curve towards it in the subsequent evolution. Experiments demonstrate the effectiveness of our shape prior model
5498052
Natural image retrieval based on features of homogeneous color regions
Natural image retrieval using low-level visual features is a challenging problem for content-based image retrieval. In this paper, a region-based image retrieval (RBIR) approach is proposed. Each image is represented by several feature vectors extracted from homogeneous color regions within an image, and similar images are retrieved based on these region features. In the experimental image database all images are grouped into 16 categories using a moment feature to speed up the retrieval performance. Color mean, color histogram and moment of regions are used as features. From the experiments, it is found that region-based retrieval returns more relevant images than using features based on the entire image.
272438
Hybrid Kernel Machine Ensemble for Imbalanced Data Sets
A two-class imbalanced data problem (IDP) emerges when the data from majority class are compactly clustered and the data from minority class are scattered. Though a discriminative binary support vector machine (SVM) can be trained by manually balancing the data, its performance is usually poor due to the inadequate representation of the minority class. A recognition-based one-class SVM can be trained using the data from the well-represented class only. However, it is not highly discriminative. Exploiting the complementary natures of the two types of SVMs in an ensemble can bring benefits from both worlds in addressing the IDP. Experimental results on both artificial and real benchmark data sets support the feasibility of our proposed method
1881695
Handling Missing Data with Variational Bayesian Learning of ICA
Missing data is common in real-world datasets and is a problem for many estimation techniques. We have developed a variational Bayesian method to perform Independent Component Analysis (ICA) on high-dimensional data containing missing entries. Missing data are handled naturally in the Bayesian framework by integrating the generative density model. Modeling the distributions of the independent sources with mixture of Gaussians allows sources to be estimated with different kurtosis and skewness. The variational Bayesian method automatically determines the dimensionality of the data and yields an accurate density model for the observed data without overfitting problems. This allows direct probability estimation of missing values in the high dimensional space and avoids dimension reduction preprocessing which is not feasible with missing data.
17672081
A Sub-Vector Weighting Scheme for Image Retrieval with Relevance Feedback
In image retrieval with relevance feedback, feature components are weighted to reflect the high-level concepts, and a user's subjective perception, embodied in the images labelled by the user in the feedback. However, the number of labelled images is often small and the covariance matrix needed for weighting will be singular. For this reason, the commonly used methods discard the mutual correlation among the feature components completely and use a diagonal covariance matrix. In this paper, a sub-vector weighting scheme is proposed. This scheme partitions a multi-dimensional visual feature vector into multiple low-dimensional sub-vectors. The singularity of the covariance matrix for each sub-vector can be avoided due to the lower dimensionality of the sub-vectors. Thus, the mutual correlation in each sub-vector can be retained for weighting and an optimally weighted similarity metric can be applied on each sub-vector. The similarity scores obtained from different sub-vectors are combined, as the final scor...
34632260
Restricted Random Testing
This paper presents a novel adaptation of traditional random testing, called Restricted Random Testing (RRT). RRT offers a significant improvement over random testing, as measured by the F-measure. This paper describes the ideology behind RRT and explains its algorithm. RRT's performance is examined using several experiments, the results of which are presented and discussed.
38163613
Bayesian Learning for Image Retrieval Using Multiple Features
Image retrieval using multiple features often uses explicit weights that represent the importance of the features in their similarity metrics. In this paper, a novel retrieval method based on Bayesian Learning is presented. Instead of giving every feature a weight explicitly, the importance of a feature is regulated implicitly by learning a user's perception. Thus, the process of feature combination is adaptive and approximate to a user's perception. Experimental results demonstrate the significance of this method for improving the retrieval efficiency.
46281578
Model-Based Active Object Recognition Using MRF Matching and Sensor Planning
This paper presents an active object recognition algorithm using MAP-MRF matching and sensor planning strategy. The matching between the sensed and model object is based on surface properties. A new measure of surface distinguishability is defined for sensor planning. MAP-MRF framework is used for generating matching label set. A measure of confidence of correct match is determined based on the posterior energy. An active object recognition algorithm is used for determining the next viewpoint of the camera if ambiguity exists in the matching result. The next viewpoint is chosen based the surface with highest distinguishability. Experimental results on images under perfect and imperfect segmentation are presented.