skip to main content
10.1145/1282280.1282370acmconferencesArticle/Chapter ViewAbstractPublication PagescivrConference Proceedingsconference-collections
Article

VISTO: visual storyboard for web video browsing

Published:09 July 2007Publication History

ABSTRACT

Web video browsing is rapidly becoming a very popular activity in the Web scenario, causing the production of a concise video content representation a real need. Currently, static video summary techniques can be used to this aim. Unfortunately, they require long processing time and hence all the summaries are produced in advance without any users customization. With an increasing number of videos and with the large users heterogeneousness, this is a burden. In this paper we propose VISTO, a summarization technique that produces customized on-the-fly video storyboards. The mechanism uses a fast clustering algorithm that selects the most representative frames using their HSV color distribution and allows users to select the storyboard length and the processing time. An objective and subjective evaluation shows that the storyboards are produced with good quality and in a time that allows on-the-fly usage.

References

  1. http://www.csee.umbc.edu/yongrao1/delaunay.html.Google ScholarGoogle Scholar
  2. The open video projec, http://www.open-video.org.Google ScholarGoogle Scholar
  3. M. S. Charikar. Similarity estimation techniques from rounding algorithms. In Proceedings of STOC-02, 34th Annual ACM Symposium on the Theory of Computing, pages 380--388, Montreal, CA, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. DeMenthon, V. Kobla, and D. Doermann. Video summarization by curve simplification. In Proc. of Computer Visualization and Pattern Recognition, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  5. T. Feder and D. Greene. Optimal algorithms for approximate clustering. In STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 434--444, New York, NY, USA, 1988. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. F. Geraci, M. Pellegrini, P. Pisati, and F. Sebastiani. A scalable algorithm for high-quality clustering of Web snippets. In Proceedings of SAC-06, 21st ACM Symposium on Applied Computing, pages 1058--1062, Dijon, FR, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. F. Geraci, M. Pellegrini, F. Sebastiani, and M. Maggini. Cluster generation and cluster labelling for web snippets. In Proceedings of the 13th Symposium on String Processing and Information Retrieval (SPIRE 2006), pages 25--36, Glasgow, UK., October 2006. Volume 4209 in LNCS. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Y. Gong and X. Liu. Video summarization and retrieval using singular value decomposition. Multimedia Syst., 9(2):157--168, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38(2/3):293--306, 1985.Google ScholarGoogle ScholarCross RefCross Ref
  10. Y. Hadi, F. Essannoui, R. Thami, and D. Aboutajdine. Video summarization by k-medoid clustering. In Proc. of ACM Symposium on Applied Computing, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Y. Hadi, F. Essannouni, and R. O. H. Thami. Video summarization by k-medoid clustering. In SAC '06: Proceedings of the 2006 ACM symposium on Applied computing, pages 1400--1401, New York, NY, USA, 2006. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Hanjalic and H. J. Zhang. An integrated scheme for automated video abstraction based on unsupervised cluster-validity analysis. In IEEE Trans. on Circuits and Systems for Video Technology, volume 9, pages 1280--1289, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. S. Hochbaum and D. B. Shmoys. A best possible approximation algorithm for the k-center problem. Mathematics of Operations Research, 10(2):180--184, 1985.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P. Indyk. Sublinear time algorithms for metric space problems. In Proceedings of STOC-99, ACM Symposium on Theory of Computing, pages 428--434, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. S. Manjunath, J. R. Ohm, V. V. Vasudevan, and A. Yamada. Color and texture descriptors. IEEE Transactions on Circuits and Systems For Video Technology, 11:703--715, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. P. Mundur, Y. Rao, and Y. Yesha. Keyframe-based video summarization using delaunay clustering. International Journal on Digital Libraries, 6(2):219--232, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. S. J. Phillips. Acceleration of k-means and related clustering algorithms. In Proceedings of ALENEX-02, 4th International Workshop on Algorithm Engineering and Experiments, pages 166--177, San Francisco, US, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. B. Shahraray and D. C. Gibbon. Automatic generation of pictorial transcripts of video programs. In A. A. Rodriguez and J. Maitan, editors, Proc. SPIE Vol. 2417, p. 512--518, Multimedia Computing and Networking 1995, Arturo A. Rodriguez; Jacek Maitan; Eds., pages 512--518, Mar. 1995.Google ScholarGoogle Scholar
  19. H. Ueda, T. Miyatake, and S. Yoshizawa. Impact: an interactive natural-motion-picture dedicated multimedia authoring system. In CHI '91: Proceedings of the SIGCHI conference on Human factors in computing systems, pages 343--350, New York, NY, USA, 1991. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Y. Zhuang, Y. Rui, T. S. Huang, and S. Mehrotra. Adaptive key frame extraction using unsupervised clustering. In IEEE International Conference on Image Processing, pages 866--870, 1998.Google ScholarGoogle Scholar

Index Terms

  1. VISTO: visual storyboard for web video browsing

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        CIVR '07: Proceedings of the 6th ACM international conference on Image and video retrieval
        July 2007
        655 pages
        ISBN:9781595937339
        DOI:10.1145/1282280

        Copyright © 2007 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 9 July 2007

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader