City University of Hong Kong
DSpace
 

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: http://hdl.handle.net/2031/4949

Title: Common pattern discovery and multiple appearance modeling for visual content analysis
Other Titles: Tong yong mo shi jian ce yu duo ke shi mo kuai jian mo ji shu yong yu ke shi hua nei rong fen xi
通用模式檢測與多可視模塊建模技術用於可視化內容分析
Authors: Tan, Hung Khoon (陳漢勤)
Department: Dept. of Computer Science
Degree: Master of Philosophy
Issue Date: 2007
Publisher: City University of Hong Kong
Subjects: Image processing -- Digital techniques
Pattern recognition systems
Notes: CityU Call Number: TA1637.T36 2007
Includes bibliographical references (leaves 78-87)
Thesis (M.Phil.)--City University of Hong Kong, 2007
x, 88 leaves : ill. (some col.) ; 30 cm.
Type: Thesis
Abstract: Advances in the modern multimedia technology have led to an ever growing archive of multimedia documents. In order to provide better browsing, sum- marization and indexing of visual contents, there is a need to bridge the gap between low-level features and their high level semantic contents. In this the- sis, we investigate two major tasks related to content analysis: common pattern discovery from a small set of images, and the mining and modeling of multiple visual parts keyword categories from a training set. Both tasks are conducted us- ing only partial-labels at image level. Data mining is explored, as an alternative to learning, to discover the interesting patterns from the image set using partial information. In the ¯rst task, common patterns in multiple images are discovered using matching. The issues in feature robustness, matching robustness and noise ar- tifact are addressed to delve into the potential of using regions as the basic matching unit. We novelly employ the many-to-many (M2M) matching strat- egy, speci¯cally with the Earth Mover's Distance (EMD), to increase resilience towards the structural inconsistency from improper region segmentation of a pat- tern as a result of various geometric and photometric transformations. However, the matching pattern of M2M is dispersed and unregulated in nature, leading to the challenges of mining a common pattern while identifying the underlying transformation. To avoid analysis on unregulated matching, we propose mono- lithic matching for the collaborative mining of common pattern from multiple images. The patterns are re¯ned iteratively using the Expectation-Maximization algorithm by taking advantage of the crowding phenomenon in the EMD °ows. Experiment results show that our approach is robust and can e®ectively handle images with background clutter. To pinpoint the potential of CPD, we further use image retrieval as an example to show the application of CPD for pattern learning in relevancy feedback. In the second task, the problem of learning and modeling of visual semantics of keyword categories is investigated for image annotation. Supervised learning algorithms which learn only a single concept point of a category are limited in their e®ectiveness. Data mining technique is employed to mine multiple con- cepts, where each concept may consist of one or more visual parts, to capture the diverse visual appearances of a single keyword category. For training, the Apriori principle is used to e±ciently mine a set of frequent blobsets to capture the semantics of a rich and diverse visual category. Each concept is ranked based on a discriminative or diverse density measure. For annotation, a level-sensitive matching is used to rank words given an unannotated image.
Online Catalog Link: http://lib.cityu.edu.hk/record=b2217981
Appears in Collections:CS - Master of Philosophy

Files in This Item:

File Description SizeFormat
fulltext.html159 BHTMLView/Open
abstract.html159 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