City University of Hong Kong

CityU Institutional Repository >
3_CityU Electronic Theses and Dissertations >
ETD - Dept. of Computer Science  >
CS - Master of Philosophy  >

Please use this identifier to cite or link to this item:

Title: On efficient clustering and indexing methods over large video sequences
Other Titles: Da gui mo shi pin shu ju de gao xiao ju lei ji suo yin fang fa
Authors: Yang, Yu (楊宇)
Department: Department of Computer Science
Degree: Master of Philosophy
Issue Date: 2008
Publisher: City University of Hong Kong
Subjects: Digital video.
Cluster analysis.
Principal components analysis.
Notes: vi, 73 leaves : ill. 30 cm.
Thesis (M.Phil.)--City University of Hong Kong, 2008.
Includes bibliographical references (leaves 67-73)
CityU Call Number: TK6680.5 .Y36 2008
Type: thesis
Abstract: As video data is widely used over the Internet, how to manipulate video efficiently is a challenging problem to many researchers. In order to perform content-based video similarity search, we need to firstly perform video summarization to extract the representative frames from each video clips, namely, keyframes. The similarity between two video sequences can thus be measured by the percentages of similar keyframes shared by both video sequences, when each keyframe is extracted and represented as a highdimensional feature vector. The direct computation of such similarity over the whole dataset would, however, involve time-consuming sequential scans over the entire highdimensional data space. Meanwhile, existing indexing techniques on high-dimensional vector space suffer from the notorious “curse of dimensionality”. Therefore, an efficient and effective indexing method is needed to reduce the computation cost for the similarity search on video sequences. In this thesis, we propose an efficient subspace discovering and clustering technique to automatically discover correlated clusters. We adopt a dimensionality reduction technique called Principal Component Analysis (PCA) to transform the vector data into a new vector space with reduced dimensions, and iteratively discover clusters on the deeper subspaces. A corresponding indexing structure is proposed to reflect the cluster hierarchy, so that we can then easily prune out large potions of dissimilar frames by looking at the relationship of their corresponding clusters. Extensive experiments over large-scale video datasets show the efficiency and usefulness of our method.
Online Catalog Link:
Appears in Collections:CS - Master of Philosophy

Files in This Item:

File Description SizeFormat
abstract.html134 BHTMLView/Open
fulltext.html134 BHTMLView/Open

Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!
DSpace Software © 2013 CityU Library - Send feedback to Library Systems
Privacy Policy · Copyright · Disclaimer