By Topic

Detecting Recurring Themes in Personal Media Collections

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Das, M. ; Corp. Res. & Eng., Eastman Kodak Co., Rochester, NY, USA ; Loui, A.

The goal of this work is to automatically detect frequently occurring groups of media in a user's collection that have a unifying theme. These groups provide a narrative structure that ties in images that are temporally far apart and cannot be browsed easily. The media in the collection is analyzed by a variety of algorithms to generate metadata of different types. The media and associated metadata are represented as a transactional database, and frequent item set mining is employed to detect frequently occurring groups of images that share several metadata in common. It is expected that a user's primary picture-taking interests (e.g., baby, garden, school sports, etc.), will appear as groups based on some combination of underlying metadata. A confidence and interest measure relevant to the consumer domain is used to determine the quality of the frequent item sets and create a list of the top "themes" within the collection. We also detect annually recurring groups in multi-year collections, as these capture common themes such as birthdays and holidays. Because the detected recurring groups are strictly data-driven (with no a priori assumptions about a user's collection), they are customized to the type of content in specific user's collections. Experiments with large user collections show the usefulness of our approach.

Published in:

Semantic Computing (ICSC), 2011 Fifth IEEE International Conference on

Date of Conference:

18-21 Sept. 2011