Please use this identifier to cite or link to this item: https://doi.org/10.1145/2072298.2071916
Title: Next photo please: Towards visually consistent sequential photo browsing
Authors: Liu, D.
Yan, S. 
Zhang, H.-J.
Keywords: Sequential photo browsing
Tsp
Vision persistency
Issue Date: 2011
Citation: Liu, D.,Yan, S.,Zhang, H.-J. (2011). Next photo please: Towards visually consistent sequential photo browsing. MM'11 - Proceedings of the 2011 ACM Multimedia Conference and Co-Located Workshops : 973-976. ScholarBank@NUS Repository. https://doi.org/10.1145/2072298.2071916
Abstract: Sequential photo browsing has become the most important function in the desktop and online image repository management systems, where existing systems typically display the photos in default orders such as the lexicographic order of the photo filename or the chronological order of the photo taken time. However, these browsing orders, especially when the browsing speed is fast, ignore the vision persistency characteristic of human visual systems, which results in inconsistent visual experience for photo viewers. To address this issue, we construct a photo relationship graph based on various kinds of visual features that complementarily reflect human visual perception. Then the seeking of visually consistent photo browsing sequence is cast into a traveling salesman problem which seeks an optimal path with minimum visual distance within the graph structure. Experiment results on sequential browsing of Flickr photo groups indicate that the proposed method clearly beats the other sequential photo browsing methods in terms of visual consistency. Copyright 2011 ACM.
Source Title: MM'11 - Proceedings of the 2011 ACM Multimedia Conference and Co-Located Workshops
URI: http://scholarbank.nus.edu.sg/handle/10635/71136
ISBN: 9781450306164
DOI: 10.1145/2072298.2071916
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


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