We present a modified Temporal Conditional Random Fields framework for modeling and predicting object motion. To facilitate such a powerful graphical model with prediction and come up with a CRF-based predictor, we pr...
详细信息
We present a modified Temporal Conditional Random Fields framework for modeling and predicting object motion. To facilitate such a powerful graphical model with prediction and come up with a CRF-based predictor, we propose a set of new temporal relations for object tracking, with feature functions such as optical flow (calculated among consequent frames). We evaluate our proposed Temporal Conditional Random Field method with real and synthetic data sequences and will show that the TCRF prediction is nearly equivalent with result of template matching. Experimental results show that our proposed method estimates future target state with zero error until target dynamic changes. Our proposed modified CRF method with simple and easy to implement feature functions, can learn any target dynamic, thus, it can predict next state of target with zero error.
The Connected TV can be described as an Internet enabled TV. In the current paper we have proposed a system for connected TV that mash up the information from internet and RSS feeds related to the breaking news aired ...
详细信息
The Connected TV can be described as an Internet enabled TV. In the current paper we have proposed a system for connected TV that mash up the information from internet and RSS feeds related to the breaking news aired over the TV. The proposed system initially localize the text regions from the streamed video in hybrid mode, then recognize them and spot the key words and finally fetch the related information from Internet. Our experimental results show that the localization of the text regions from the video can work with no misses but have some false positives which are taken care by data semantic analysis. The errors of the Optical Character recognition (OCR) module are taken care by using string comparing techniques like longest common subsequence matching and Leveinsthein distance while matching with the RSS feed or internet.
This paper presents a new method for automatic palmprint recognition based on kernel PCA method by integrating the Gabor wavelet representation of palm images. Gabor wavelets are first applied to derive desirable palm...
详细信息
This paper presents a new method for automatic palmprint recognition based on kernel PCA method by integrating the Gabor wavelet representation of palm images. Gabor wavelets are first applied to derive desirable palmprint features. The Gabor transformed palm images exhibit strong characteristics of spatial locality, scale, and orientation selectivity. These images can produce salient features that are most suitable for palmprint recognition. The kernel PCA method then nonlinearly maps the Gabor-wavelet image into a high-dimensional feature space. The proposed algorithm has been successfully tested on two different public data sets from the PolyU palmprint databases for which the samples were collected in two different sessions.
In order to help understand how the genes are affected by different disease conditions in a biological system, clustering is typically performed to analyze gene expression data. In this paper, we propose to solve the ...
详细信息
In order to help understand how the genes are affected by different disease conditions in a biological system, clustering is typically performed to analyze gene expression data. In this paper, we propose to solve the clustering problem using a graph theoretical approach, and apply a novel graph partitioning model -isoperimetric graph partitioning (IGP), to group biological samples from gene expression data. The IGP algorithm has several advantages compared to the well-established spectral graph partitioning (SGP) model. First, IGP requires a simple solution to a sparse system of linear equations instead of the eigen-problem in the SGP model. Second, IGP avoids degenerate cases produced by spectral approach to achieve a partition with higher accuracy. Moreover, we integrate unsupervised gene selection into the proposed approach through two-way ordering of gene expression data, such that we can eliminate irrelevant or redundant genes in the data and obtain an improved clustering result. We evaluate our approach on several well-known problems involving gene expression profiles of colon cancer and leukemia subtypes. Our experiment results demonstrate that IGP constantly outperforms SGP and produces a better result that is closer to the original labeling of sample sets provided by domain experts. Furthermore, the clustering accuracy is improved significantly when IGP is integrated with the unsupervised gene (feature) selection.
Document clustering without any prior knowledge or background information is a challenging problem. In this paper, we propose SS-NMF: a semi-supervised non- negative matrix factorization framework for document cluster...
详细信息
Document clustering without any prior knowledge or background information is a challenging problem. In this paper, we propose SS-NMF: a semi-supervised non- negative matrix factorization framework for document clustering. In SS-NMF, users are able to provide supervision for document clustering in terms of pairwise constraints on a few documents specifying whether they "must" or "cannot" be clustered together. Through an iterative algorithm, we perform symmetric tri-factorization of the document- document similarity matrix to infer the document clusters. Theoretically, we show that SS-NMF provides a general framework for semi-supervised clustering and that existing approaches can be considered as special cases of SS-NMF. Through extensive experiments conducted on publicly available data sets, we demonstrate the superior performance of SS-NMF for clustering documents.
Support vector machines (SVMs) have been promising methods in patternrecognition because of their solid mathematical foundation. In this paper, we propose a localized SVM classification scheme (LSVM). In which we fir...
详细信息
Support vector machines (SVMs) have been promising methods in patternrecognition because of their solid mathematical foundation. In this paper, we propose a localized SVM classification scheme (LSVM). In which we first cluster the training data in each category, and then train a set of SVMs based on these dusters. The SVMs trained from the clusters in each category that are nearest to the given input pattern are then selected for the final classification. Our experiments on six UCI datasets show that LSVM outperforms the traditional SVM.
In region-based image annotation, keywords are usually associated with images instead of individual regions in the training data set. This poses a major challenge for any learning strategy. In this paper, we formulate...
详细信息
In region-based image annotation, keywords are usually associated with images instead of individual regions in the training data set. This poses a major challenge for any learning strategy. In this paper, we formulate image annotation as a supervised learning problem under Multiple-Instance Learning (MIL) framework. We present a novel Asymmetrical Support Vector Machine-based MIL algorithm (ASVM-MIL), which extends the conventional Support Vector Machine (SVM) to the MIL setting by introducing asymmetrical loss functions for false positives and false negatives. The proposed ASVM-MIL algorithm is evaluated on both image annotation data sets and the benchmark MUSK data sets.
We present a new approach to organize an image database by finding a semantic structure interactively based on multi-user relevance feedback. By treating user relevance feedbacks as weak classifiers and combining them...
详细信息
We present a new approach to organize an image database by finding a semantic structure interactively based on multi-user relevance feedback. By treating user relevance feedbacks as weak classifiers and combining them together, we are able to capture the categories in the users' mind and build a semantic structure in the image database. Experiments performed on an image database consisting of general purpose images demonstrate that our system outperforms some of the other conventional methods
In this paper, we present a novel idea of co-clustering image features and semantic concepts. We accomplish this by modelling user feedback logs and low-level features using a bipartite graph. Our experiments demonstr...
详细信息
In this paper, we present a novel idea of co-clustering image features and semantic concepts. We accomplish this by modelling user feedback logs and low-level features using a bipartite graph. Our experiments demonstrate that (1) incorporating semantic information achieves better image clustering and (2) feature selection in co-clustering narrows the semantic gap, thus enabling efficient image retrieval.
In this paper, we present a novel graph theoretic approach to the problem of document-word co-clustering. In our approach, documents and words are modeled as the two vertices of a bipartite graph. We then propose isop...
详细信息
In this paper, we present a novel graph theoretic approach to the problem of document-word co-clustering. In our approach, documents and words are modeled as the two vertices of a bipartite graph. We then propose isoperimetric co-clustering algorithm (ICA) - a new method for partitioning the document-word bipartite graph. ICA requires a simple solution to a sparse system of linear equations instead of the eigenvalue or SVD problem in the popular spectral co-clustering approach. Our extensive experiments performed on publicly available datasets demonstrate the advantages of ICA over spectral approach in terms of the quality, efficiency and stability in partitioning the document-word bipartite graph.
暂无评论