Efficient video retrieval using index structure
β Scribed by Jing Zhang
- Book ID
- 102866007
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 670 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0899-9457
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Video retrieval remains a challenging problem since most of traditional query algorithms are ineffectual and timeβconsuming. In this article, we proposed a new video retrieval method, which segments the video stream by visual similarity between neighboring frames, and adopt the highβdimensional index structure to organize segments. Furthermore, a new similarity measure is brought forward to improve the query accuracy by synthetically taking into account the visual similarity and temporal order among video segments. Based on the similarity measure, we propose a novel video clip retrieval algorithm which achieves high query efficiency by using restricted sliding window to construct candidate video clips. Experimental results show that the proposed video retrieval method is efficient and effective. Β© 2008 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 18, 113β123, 2008
π SIMILAR VOLUMES
## Abstract In Japanese, the border between words is not explicitly indicated. Consequently, nβgram (a tuple of __n__ characters) indexing is usually applied to document retrieval. Retrieval based on the nβgram indexing is performed for long retrieval words as follows. After dividing the long retri
This paper aims to show that by using low level feature extraction, motion and object identifying and tracking methods, features can be extracted and indexed for eYcient and eVective retrieval for video; such as an awards ceremony video. Video scene/shot analysis and key frame extraction are used as
While the largest common subgraph (LCSG) between a query and a database of models can provide an elegant and intuitive measure of similarity for many applications, it is computationally expensive to compute. Recently developed algorithms for subgraph isomorphism detection take advantage of prior kno