Abstract :
In this paper, we investigate an approach for reconstructing storyline graphs from large-scale collections of Internet images, and optionally other side information such as friendship graphs. The storyline graphs can be an effective summary that visualizes various branching narrative structure of events or activities recurring across the input photo sets of a topic class. In order to explore further the usefulness of the storyline graphs, we leverage them to perform the image sequential prediction tasks, from which photo recommendation applications can benefit. We formulate the storyline reconstruction problem as an inference of sparse time-varying directed graphs, and develop an optimization algorithm that successfully addresses a number of key challenges of Web-scale problems, including global optimality, linear complexity, and easy parallelization. With experiments on more than 3.3 millions of images of 24 classes and user studies via Amazon Mechanical Turk, we show that the proposed algorithm improves other candidate methods for both storyline reconstruction and image prediction tasks.
Keywords :
Internet; directed graphs; image reconstruction; image retrieval; image sequences; optimisation; Internet images; Web community photo; Web-scale problem; branching narrative structure; friendship graph; global optimality; image recommendation; image sequential prediction task; linear complexity; optimization algorithm; sparse time-varying directed graph; storyline graph; storyline reconstruction problem; Decoding; Image coding; Image edge detection; Image reconstruction; Optimization; Streaming media; Vectors; Image recommendation; Storyline reconstruction;