The content and structure of linked information such as sets of web pages or research paper archives are dynamic and keep on changing. Even though different methods are proposed to exploit both the link structure and ...
详细信息
The global expansion of the Web brings the global computing;and the increasing number of problems with increasing complexity & sophistication also makes collaboration desirable. In this paper, we presented a seman...
详细信息
Description logics are widely used to express structured data and provide reasoning facility to query and integrate data from different databases. This paper presents a many-sorted description logic MDL to represent r...
详细信息
Service-oriented computing is a new computing paradigm that utilizes services as fundamental elements for developing applications. Service composition plays a very important role in it. This paper focuses on service c...
详细信息
Syntax-based statistical translation model is proved to be better than phrasebased model, especially for language pairs with very different syntax structures, such as Chinese and English. In this talk I will introduce...
详细信息
This paper illustrates the ICT Statistical Machine Translation system used in the evaluation campaign of the International Workshop on Spoken Language Translation 2010. We participate in the DIALOG tasks for Chinese-t...
详细信息
In this paper, we propose a novel manifold alignment method by learning the underlying common manifold with supervision of corresponding data pairs from different observation sets. Different from the previous algorith...
In this paper we introduce a compactness based clustering algorithm. The compactness of a data class is measured by comparing the inter-subset and intra-subset distances. The class compactness of a subset is defined a...
详细信息
In this paper we introduce a compactness based clustering algorithm. The compactness of a data class is measured by comparing the inter-subset and intra-subset distances. The class compactness of a subset is defined as the ratio of the two distances. A subset is called an isolated cluster (or icluster) if its class compactness is greater than 1. All iclusters make a containment tree. We introduce monotonic sequences of iclusters to simplify the structure of the icluster tree, based on which a clustering algorithm is designed. The algorithm has the following advantages: it is effective on data sets with clusters nonlinearly separated, of arbitrary shapes, or of different densities. The effectiveness of the algorithm is demonstrated by experiments.
One of the most challenging issues in visual information retrieval is retrieval by shape, due to a lack of mathematically rigorous definition of shape similarity. This paper presents a bipolar model for computing shap...
详细信息
One of the most challenging issues in visual information retrieval is retrieval by shape, due to a lack of mathematically rigorous definition of shape similarity. This paper presents a bipolar model for computing shape similarity. Given a discrete region, we cut its Voronoi diagram into two parts along the border of the region and each part is a tree. We use the two trees to respectively model the structures of a region and its complement, which is called the Bipolar Model. We prune the two trees by removing the nodes with small protrusions. The leaf nodes of the pruned trees are interleaved to make a leaf chain. Two regions are compared and matched, using a cyclic edit distance between the two leaf chains, with restricted merge and split operations allowed. We tested our algorithm on the MPEG-7 data set and made a “bullseye” score of 89.9%, which is the best performance ever reported.
Chiaroscuro in art is characterized by strong contrasts between light and dark. An object in a certain light condition has a certain chiaroscuro pattern in appearance; and this pattern is invariant to the changes of i...
详细信息
Chiaroscuro in art is characterized by strong contrasts between light and dark. An object in a certain light condition has a certain chiaroscuro pattern in appearance; and this pattern is invariant to the changes of illumination and pose within a certain extent. In this paper we introduce an object tracking method based on chiaroscuro patterns. The chiaroscuro pattern of an image is computed by running a medial axis transform on selected level sets. The medial axes are pruned and decomposed into segments. These segments make a chiaroscuro pattern. The end points of the segments are collected as key points, which are fed to Kalman filter for object tracking. The effectiveness of the algorithm is demonstrated by experiments.
暂无评论