1 / 11

SnapWorks

SnapWorks. Group 11 Krimy Amichandwala Nihar Gadkari Samantha Misra Urja Shah. SnapWorks. SnapWorks is a photo storing website which provides ways to automate the process of arranging photos based on location and time. Motivation & Features Method Algorithm Take a peek.

evelia
Télécharger la présentation

SnapWorks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. SnapWorks Group 11 Krimy Amichandwala Nihar Gadkari Samantha Misra Urja Shah

  2. SnapWorks SnapWorks is a photo storing website which provides ways to automate the process of arranging photos based on location and time. • Motivation & Features • Method • Algorithm • Take a peek

  3. Motivation & Features Photos form an integral part of one’s memories and information sharing User spends more time in arranging the photos based on events and location Features: • Upload photographs • Overlay them on the map • View clusters based on event • View clusters based on location

  4. Method • Overlay of images on a map – Google Maps API • JavaScript =>ASP. Net

  5. Method Time and Location Information • Metadata of digital images – EXIF tags • Opanda – EXIF Editor • MetaData Extractor

  6. Algorithm • Automatic Organization for Digital Photographs with Geographic Coordinates • The algorithm consists of 3 passes: • Linear pass over sequence of photos • Clustering the photos based on location using dynamic programming algorithm for k-segmentation • Second linear pass merging related photos into a segment

  7. Algorithm • S1, S2, S3 denote the segments formed by 1st pass. • C1, C2 denote the location clusters formed by 2nd pass. • The 3rd pass performs the final event segmentation as shown below

  8. Algorithm • Based on the number of photos in each cluster, perform the k-segmentation algorithm on that cluster recursively. • Algorithm will adapt itself to adjust for a high density region like the San Francisco cluster below. • Naming the clusters will be done by using Google Maps API.

  9. Extensions • Naming the events automatically • Sharing and commenting • Panoramic view • Clustering based on people

  10. References • Automatic organization for digital photographs with geographic coordinates, Mor Naaman, Yee Jiun Song, Andreas Paepcke, Hector GarciaMolina, ACM, 2004. • Time as essence for photo browsing through personal digital libraries, A. Graham, H. Garcia-Molina, A. Paepcke, andT. Winograd, ACM/IEEE-CS, 2002. • Mining Sequential Data - in Search of Segmental Structures, Niina Haiminen (Academic Dissertation) – University of Helsinki, Finland, April 2008

  11. Thank you!

More Related