MM-INTEREST Archives

ACM SIGMM Interest List

MM-INTEREST@LISTSERV.ACM.ORG

Options: Use Forum View

Use Monospaced Font
Show Text Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Content-Type:
text/plain; charset=ISO-8859-1; format=flowed
Date:
Tue, 31 Jul 2012 11:08:44 +0200
Reply-To:
Cees Snoek <[log in to unmask]>
Subject:
MIME-Version:
1.0
Message-ID:
Content-Transfer-Encoding:
7bit
Sender:
ACM SIGMM Interest List <[log in to unmask]>
From:
Cees Snoek <[log in to unmask]>
Parts/Attachments:
text/plain (195 lines)
+++++++++++++++++++++++++
*News*
+++++++++++++++++++++++++
--Keynotes by
     * Jitendra Malik, UC Berkeley
     * Paul Natsev, Google/YouTube

--Special Sessions:
     * Multimedia Event Detection
     * Bay Area Multimedia: what's cooking in the multimedia research 
labs of the Bay Area?

--Submission opportunity until August 10, 2012.


+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
                         *CALL FOR PAPERS*
             IS&T and SPIE International Conference on
       *Multimedia Content Access: Algorithms and Systems VII*

   3 - 7 February 2013, Hyatt Regency San Francisco Airport Hotel
              San Francisco, California, United States

                     http://www.spie.org/ei123
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


+++++++++++++++++++++++++
*Aims and Scope*
+++++++++++++++++++++++++

Modern computer technology has brought multimedia to the limelight as a 
new communication form, quite possibly the first original communication 
form of the computer age. Today, "being multimedia" is a real 
possibility for almost any online computer user, and the social 
communicative possibilities that will ensue from this fact will have an 
impact in a wide range of fields. To benefit from this potential, 
developers need reliable techniques for the analysis, search, and 
management of multimedia data, as well as distributed system 
architectures in which these techniques can be embedded to effectively 
help the users. The purpose of this conference is to create an 
international forum to address the research challenges and opportunities 
of multimedia content analysis, management and retrieval.

We are soliciting high quality submissions to present new and daring 
ideas, question established paradigms and unwritten rules, and introduce 
new and original research directions in the following (and related) areas:


+++++++++++++++++++++++++
*Topics of Interest*
+++++++++++++++++++++++++

--Image and Video Content Analysis:

     * image, audio and video characterization (feature extraction)
     * fusion of text, image, video and audio data
     * content parsing, clustering and classification
     * semantic modeling
     * image, video and audio similarity measures
     * object and event detection and recognition
     * content analysis methods and algorithms
     * benchmarking of content analysis methods and algorithms
     * affective content analysis
     * image and video quality assessment

--Content Management and Delivery:

     * multimedia databases
     * multimedia standards
     * social multimedia
     * peer-to-peer storage and search techniques
     * indexing and data organization
     * system optimization for search and retrieval
     * storage hierarchies, scalable storage
     * personalized content delivery

--Image and Video Content Search:

     * multimedia data mining
     * active learning and relevance feedback
     * query models
     * browsing and visualization
     * search issues in distributed and heterogeneous systems
     * benchmarking search, browsing, and retrieval algorithms and systems
     * generation of video summaries and abstracts
     * cognitive aspects of human/machine systems

--Internet Imaging and Multimedia:

     * peer-to-peer imaging systems for the internet
     * content creation and presentation for the internet
     * content analysis for social tag generation, denoising and propagation
     * socially enriched image and video retrieval
     * web cameras: impact on content analysis
     * interactive multimedia creation for the internet
     * content rating, authentication, non-repudiation, and cultural 
differences in content perception
     * web crawling, caching, and security
     * multimedia on the semantic web
     * user interfaces
     * mobile visual information processing and management.


+++++++++++++++++++++++++
*Paper Submission*
+++++++++++++++++++++++++

Papers covering original material should be at least 6 pages long and 
contain a text summary (200 words maximum) suitable for early release. 
Manuscripts should be formatted according to the SPIE template specified 
at: http://spie.org/x33801.xml
Your manuscript must be submitted in appropriate format using the SPIE 
submission website at:
http://spie.org/app/submissions/submit/Overview.aspx?EventID=997533

To ensure a high-quality conference, all submissions will be assessed by 
the program committee for technical merit and suitability of content. 
Publication of your manuscript on SPIE Digital Library offers worldwide 
access within 2 to 4 weeks after the meeting.

With over 300,000 papers covering 1990 to the present, SPIE Digital 
Library is the world's largest collection of research papers in optics 
and photonics. Proceedings are indexed in numerous online databases 
including INSPEC, Ei Compendex, Physics Abstracts, Chemical Abstracts, 
SPIN, International Aerospace Abstracts, ISI Index to Scientific and 
Technical Proceedings, and the Smithsonian/NASA Astrophysics Data System 
Abstract Service (ADS)

Publish your manuscript with attached multimedia files in SPIE Digital 
Library. After publication in Proceedings, expand and revise your paper 
and submit it to one of IS&T/SPIE's peer-reviewed journals! 
(http://spie.org/journals).


+++++++++++++++++++++++++
*Important Dates*
+++++++++++++++++++++++++

-- Paper submission deadline: August 10, 2012
-- Notification of acceptance: September 28, 2012
-- Camera-ready manuscript: November 26, 2012


+++++++++++++++++++++++++
*Program Committee*
+++++++++++++++++++++++++

John Adcock, FX Palo Alto Lab. (United States)
Noboru Babaguchi, Osaka Univ. (Japan)
Tat-Seng Chua, National Univ. of Singapore (Singapore)
Matthew L. Cooper, FX Palo Alto Lab. (United States)
Francesco G. B. De Natale, Univ. degli Studi di Trento (Italy)
Alberto Del Bimbo, Univ. degli Studi di Firenze (Italy)
Jianping Fan, The Univ. of North Carolina at Charlotte (United States)
Yuli Gao, Google (United States)
Alan Hanjalic, Technische Univ. Delft (Netherlands)
Alexander G. Hauptmann, Carnegie Mellon Univ. (United States)
Winston H. Hsu, National Taiwan Univ. (Taiwan)
Gang Hua, Stevens Institute of Technology (United States)
Xian-Sheng Hua, Microsoft Research Asia (China)
Yu-Gang Jiang, Fudan Univ. (China)
Paul H. Lewis, Univ. of Southampton (United Kingdom)
Xirong Li, Univ. van Amsterdam (Netherlands)
Rainer W. Lienhart, Univ. Augsburg (Germany)
Qian Lin, Hewlett-Packard Labs. (United States)
Vasileios Mezaris, Informatics and Telematics Institute (Greece)
Chong-Wah Ngo, City Univ. of Hong Kong (Hong Kong, China)
Yong Rui, Microsoft Corp. (China)
Alan F. Smeaton, Dublin City Univ. (Ireland)
John R. Smith, IBM Thomas J. Watson Research Ctr. (United States)
Hari Sundaram, Arizona State Univ. (United States)
Qi Tian, The Univ. of Texas at San Antonio (United States)
Dong Wang, Hulu (United States)
Meng Wang, National Univ. of Singapore (Singapore)
Changsheng Xu, Institute of Automation (China)
Rong Yan, Facebook Inc. (United States)
Jun Yang, Facebook Inc. (United States)


+++++++++++++++++++++++++
*Organizing Committee*
+++++++++++++++++++++++++

Cees G. M. Snoek, University of Amsterdam (Netherlands)
Nicu Sebe, University of Trento (Italy)
Lyndon Kennedy, Yahoo! Research (USA)

############################

To unsubscribe from the MM-INTEREST list:
write to: mailto:[log in to unmask]
or click the following link:
http://listserv.acm.org/SCRIPTS/WA-ACMLPX.EXE?SUBED1=MM-INTEREST&A=1

ATOM RSS1 RSS2