Common Pattern DiscoveryHung-Khoon Tan and Chong-Wah NgoDept. of Computer Science, City University of Hong Kong |
Abstract:This paper proposes a new approach for the discovery of common patterns in multiple images by region matching. The issues in feature robustness, matching robustness and noise artifact are addressed to delve into the potential of using regions as the basic matching unit. We novelly employ the many-to-many (M2M) matching strategy, specifically with the Earth Mover's Distance (EMD), to increase resilience towards the structural inconsistency from improper region segmentation of a pattern 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 monolithic matching for the collaborative mining of common pattern from multiple images. The patterns are refined iteratively using the Expectation-Maximization algorithm by taking advantage of the crowding phenomenon in the EMD flows. Experiment results show that our approach is robust and can effectively 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. |
Framework:
|
Reference:
|
Dataset:
|
|
Last updated on Aug, 2008. |