Semantic video indexing is critical for practical video retrieval systems and a generic and scalab.e indexing framework is a must for indexing a large semantic lexicon with over 1000 concepts present. This paper fully...
详细信息
ISBN:
(纸本)9781595937780
Semantic video indexing is critical for practical video retrieval systems and a generic and scalab.e indexing framework is a must for indexing a large semantic lexicon with over 1000 concepts present. This paper fully explores the idea of incorporating many kinds of diverse features into a single framework, combining them altogether to obtain larger degree of invariance which is absent in any of the component features, and thus achieves genericness and scalab.lity. We scale down the formidable computational expense with a clever design of the classification and fusion schemes. To be specific, ~20 kinds of diverse features are extracted to capture limited yet complementary variance in color, texture and edge with spatial constraints implicitly integrated, and over 100 classifiers are built subsequently and fused to produce a generic detector. The extensive experiments on a total of 310 hours of TRECVID news videos show that the proposed framework yields significantly improved performance over that of the best single feature across a variety of concepts. Moreover, a benchmark comparison demonstrates that this approach is state-of-the-art. Meanwhile, the proposed approach generalizes well over previously unseen programs and stations and scales well to a lexicon of over 300 concepts in the LSCOM [18] ontology. Copyright 2007 ACM.
Probabilistic systems are an important theme in AI domain. As the specification language, PCTL is the most frequently used logic for reasoning about probabilistic properties. In this paper, we present a natural and su...
详细信息
ISBN:
(纸本)9781577357384
Probabilistic systems are an important theme in AI domain. As the specification language, PCTL is the most frequently used logic for reasoning about probabilistic properties. In this paper, we present a natural and succinct probabilistic extension of μ-calculus, another prominent logic in the concurrency theory. We study the relationship with PCTL. Surprisingly, the expressiveness is highly orthogonal with PCTL. The proposed logic captures some useful properties which cannot be expressed in PCTL. We investigate the model checking and satisfiability problem, and show that the model checking problem is in UP ∩co-UP, and the satisfiability checking can be decided via reducing into solving parity games. This is in contrast to PCTL as well, whose satisfiability checking is still an open problem.
Though both quantity and quality of semantic concept detection in video are continuously improving, it still remains unclear how to exploit these detected concepts as semantic indices in video search, given a specific...
详细信息
ISBN:
(纸本)1595937331
Though both quantity and quality of semantic concept detection in video are continuously improving, it still remains unclear how to exploit these detected concepts as semantic indices in video search, given a specific query. In this paper, we tackle this problem and propose a video search framework which operates like searching text documents. Noteworthy for its adoption of the well-founded text search principles, this framework first selects a few related concepts for a given query, by employing a tf-idf like scheme, called c-tf-idf, to measure the informativeness of the concepts to this query. These selected concepts form a concept subspace. Then search can be conducted in this concept subspace, either by a Vector Model or a Language Model. Further, two algorithms, i.e., Linear Summation and Random Walk through Concept-Link, are explored to combine the concept search results and other baseline search results in a reranking scheme. This framework is both effective and efficient. Using a lexicon of 311 concepts from the LSCOM concept ontology, experiments conducted on the TRECVID 2006 search data set show that: when used solely, search within the concept subspace achieves the state-of-the-art concept search result;when used to rerank the baseline results, it can improve over the top 20 automatic search runs in TRECVID 2006 on average by approx. 20%, on the most significant one by approx. 50%, all within 180 milliseconds on a normal PC. Copyright 2007 ACM.
A new video retrieval paradigm of query-by-concept emerges recently. However, it remains unclear how to exploit the detected concepts in retrieval given a multimedia query. In this paper, we point out that it is impor...
详细信息
ISBN:
(纸本)9781595937025
A new video retrieval paradigm of query-by-concept emerges recently. However, it remains unclear how to exploit the detected concepts in retrieval given a multimedia query. In this paper, we point out that it is important to map the query to a few relevant concepts instead of search with all concepts. In addition, we show that solving this problem through both text and image inputs are effective for search, and it is possible to determine the number of related concepts by a language modeling approach. Experimental evidence is obtained on the automatic search task of TRECVID 2006 using a large lexicon of 311 learned semantic concept detectors. Copyright 2007 ACM.
Online shopping integrating third-party payment platforms (TPPs) has rapidly developed recently. The integration leads to new security problems derived from complex interactions among Application Programming Interface...
详细信息
Petri net is an important tool to model and analyze concurrent systems, but Petri net models are frequently large and complex, and difficult to understand and modify. Slicing is a technique to remove unnecessary parts...
详细信息
Many crowdsourcing platforms are emerging, leveraging the resources of recruited workers to execute various outsourcing tasks, mainly for those computing-intensive video analytics with high quality requirements. Altho...
详细信息
To calculate the inter-reflection between real objects and virtual ones in augmented reality, recovery of material for the real objects is necessary. In this paper, an approach is proposed to recover the material prop...
详细信息
ISBN:
(纸本)1581138849
To calculate the inter-reflection between real objects and virtual ones in augmented reality, recovery of material for the real objects is necessary. In this paper, an approach is proposed to recover the material properties from a single high dynamic range image for a homogeneous object under complex illumination conditions. By the method, we first acquire a high dynamic range image for the object, and one or a few environment maps in high dynamic range as illumination of the object. Then a simulated annealing algorithm is employed to solve the inverse rendering problem. Finally, we obtain optimal parameter values for the reflection model in approximating the material of the object. In the course of optimization, image-based lighting and ray tracing techniques are used, and as a result the inter-reflection can be calculated in convenience. In addition, the transparent and translucent properties can be also recovered.
A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of underlying physical network. A well-routed message path in such systems may result in a long delay and...
详细信息
Cluster analysis is aimed at classifying elements into categories on the basis of their similarity. And cluster analysis has been widely used in many areas such as pattern recognition, and image processing. In this pa...
详细信息
ISBN:
(纸本)189170639X
Cluster analysis is aimed at classifying elements into categories on the basis of their similarity. And cluster analysis has been widely used in many areas such as pattern recognition, and image processing. In this paper, we propose an approach based on the idea that the density of cluster centers are highest in its k nearest neighborhood or reverse k nearest neighborhood, and clusters is divided by sparse region. We firstly define the similarity between clusters. Based on this idea, no matter non-spherical data or complex manifold data, the proposed algorithm is applicable. And the proposed algorithm has a certain capacity on outliers detection. We demonstrate the power of the proposed algorithm on several test cases. Its clustering performance is better than DBSCAN, DP and K-AP clustering algorithms.
暂无评论