scispace - formally typeset
Search or ask a question

Showing papers by "Henry Allan Rowley published in 2010"


Proceedings ArticleDOI
19 Jul 2010
TL;DR: This work demonstrates the first large-scale image browsing system applied to 200,000 popular queries which utilizes image content to organize image search results and hierarchically clusters them to form an exemplar tree.
Abstract: We demonstrate the first large-scale image browsing system applied to 200,000 popular queries which utilizes image content to organize image search results. Given a query, the system extracts image content features such as color, shape, local features, face signatures and metadata from up to 1000 image results, and hierarchically clusters them to form an exemplar tree. A dynamic web-based user interface allows the user to navigate this hierarchy, allowing fast and interactive browsing. The exemplars of each cluster provide a comprehensive visual overview of the query results, and allow the user to quickly navigate to the images of interest.

15 citations


Proceedings ArticleDOI
19 Jul 2010
TL;DR: This paper compares the efficacy and efficiency of different clustering approaches for selecting a set of exemplar images, to present in the context of a semantic concept and suggests that Affinity Propagation is effective in selecting exemplars that match the top search images but at high computational cost.
Abstract: This paper compares the efficacy and efficiency of different clustering approaches for selecting a set of exemplar images, to present in the context of a semantic concept. We evaluate these approaches using 900 diverse queries, each associated with 1000 web images, and comparing the exemplars chosen by clustering to the top 20 images for that search term. Our results suggest that Affinity Propagation is effective in selecting exemplars that match the top search images but at high computational cost. We improve on these early results using a simple distribution-based selection filter on incomplete clustering results. This improvement allows us to use more computationally efficient approaches to clustering, such as Hierarchical Agglomerative Clustering (HAC) and Partitioning Around Medoids (PAM), while still reaching the same (or better) quality of results as were given by Affinity Propagation in the original study. The computational savings is significant since these alternatives are 7–27 times faster than Affinity Propagation.

10 citations