Rendering Effective Route Maps: Improving Usability Through Generalization Maneesh Agrawala, Chris Stolte Stanford University Presented by Ken Deeter.

Slides:



Advertisements
Similar presentations
Thomas Herrmann Software - Ergonomie bei interaktiven Medien Create Meaningful Icons.
Advertisements

Antony Lewis Institute of Astronomy, Cambridge
Preparing to Draw and Geometric Construction Log$ Hit Fally Marlo.
Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
Inpainting Assigment – Tips and Hints Outline how to design a good test plan selection of dimensions to test along selection of values for each dimension.
Grey Level Enhancement Contrast stretching Linear mapping Non-linear mapping Efficient implementation of mapping algorithms Design of classes to support.
Lecture 24 Coping with NPC and Unsolvable problems. When a problem is unsolvable, that's generally very bad news: it means there is no general algorithm.
Fitting: The Hough transform. Voting schemes Let each feature vote for all the models that are compatible with it Hopefully the noise features will not.
But fines vary depending upon location. WHY ARE THOSE CHAIRS THERE?
Proportion Priors for Image Sequence Segmentation Claudia Nieuwenhuis, etc. ICCV 2013 Oral.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.
3 Communicating Design Ideas © Goodheart-Willcox Co., Inc. Permission granted to reproduce for educational use only. Objectives Explain the three basic.
1Notes  Handing assignment 0 back (at the front of the room)  Read the newsgroup!  Planning to put 16mm films on the web soon (possibly tomorrow)
A New Force-Directed Graph Drawing Method Based on Edge- Edge Repulsion Chun-Cheng Lin and Hsu-Chen Yen Department of Electrical Engineering, National.
Motion Analysis (contd.) Slides are from RPI Registration Class.
A Guide to Oracle9i1 Advanced Forms Builder Topics Chapter 10.
Normalized Cuts Demo Original Implementation from: Jianbo Shi Jitendra Malik Presented by: Joseph Djugash.
3D Hand Pose Estimation by Finding Appearance-Based Matches in a Large Database of Training Views
Today: Calibration What are the camera parameters?
Foundations of Technology Technology Design Folio [TYPE TITLE HERE] [TYPE NAME HERE] Customize this PowerPoint Template to make it your own. Some slides.
Simulated Annealing G.Anuradha. What is it? Simulated Annealing is a stochastic optimization method that derives its name from the annealing process used.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
IE 607 Constrained Design: Using Constraints to Advantage in Adaptive Optimization in Manufacturing.
Satellites in Our Pockets: An Object Positioning System using Smartphones Justin Manweiler, Puneet Jain, Romit Roy Choudhury TsungYun
Copyright R. Weber Search in Problem Solving Search in Problem Solving INFO 629 Dr. R. Weber.
WP3 - 3D reprojection Goal: reproject 2D ball positions from both cameras into 3D space Inputs: – 2D ball positions estimated by WP2 – 2D table positions.
Chapter 8: Problem Solving
Esri UC2013. Technical Workshop. Technical Workshop 2013 Esri International User Conference July 8–12, 2013 | San Diego, California Generalization for.
Techniques for Analysis and Calibration of Multi- Agent Simulations Manuel Fehler Franziska Klügl Frank Puppe Universität Würzburg Lehrstuhl für Künstliche.
Computer Graphics An Introduction. What’s this course all about? 06/10/2015 Lecture 1 2 We will cover… Graphics programming and algorithms Graphics data.
1 CSC 221: Introduction to Programming Fall 2012 Functions & Modules  standard modules: math, random  Python documentation, help  user-defined functions,
1 Human Computer Interaction Week 12 Information Search & Visualization.
Designing Interface Components. Components Navigation components - the user uses these components to give instructions. Input – Components that are used.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Similarity. DilationA dilation is a transformation that maps every point in a pre-image to another point in an image by enlarging or reducing by a specific.
Particle Filters for Shape Correspondence Presenter: Jingting Zeng.
Metro Transit-Centric Visualization for City Tour Planning Pio Claudio and Sung-Eui Yoon.
Object Orientated Data Topic 5: Multimedia Technology.
Chapter 6: NavigationCopyright © 2004 by Prentice Hall 6. Navigation Design Site-level navigation: making it easy for the user to get around the site Page-level.
Telecom ParisTech Thursday, 28/07/11, Vancouver, Canada, IGARSS 2011 Extraction of water surfaces in simulated Ka-band SAR images of KaRIN on SWOT Fang.
1 Rendering Geometry with Relief Textures L.Baboud X.Décoret ARTIS-GRAVIR/IMAG-INRIA.
Monte Carlo Methods1 T Special Course In Information Science II Tomas Ukkonen
3D Interaction Techniques for Virtual Environments
MAPS Maps are a visual representation of the Earth’s surface, drawn to scale and made for a specific purpose. 7/10 Each unique map projection serves a.
A Case Study of Interaction Design. “Most people think it is a ludicrous idea to view Web pages on mobile phones because of the small screen and slow.
Motion Planning in Games Mark Overmars Utrecht University.
Optimization with Neural Networks Presented by: Mahmood Khademi Babak Bashiri Instructor: Dr. Bagheri Sharif University of Technology April 2007.
Rendering Synthetic Objects into Real Scenes: Bridging Traditional and Image-based Graphics with Global Illumination and High Dynamic Range Photography.
Mao Lin Huang University of Technology, Sydney, Visual Representations of Data and Knowledge.
1cs426-winter-2008 Notes  Will add references to splines on web page.
The InfoVis Toolkit Jean-Daniel Fekete INRIA Futurs/LRI, France
L10 – Map labeling algorithms NGEN06(TEK230) – Algorithms in Geographical Information Systems L10- Map labeling algorithms by: Sadegh Jamali (source: Lecture.
 A navigational display should serve these four different classes of tasks:  Provide guidance about how to get to a destination  Facilitate planning.
Shape similarity and Visual Parts Longin Jan Latecki Temple Univ., In cooperation with Rolf Lakamper (Temple Univ.),
DATA OUTPUT  maps  tables. DATA OUTPUT output from GIS does not have to be a map many GIS are designed with poor map output capabilities types of output:
Computational Thinking
Image-Based Rendering Geometry and light interaction may be difficult and expensive to model –Think of how hard radiosity is –Imagine the complexity of.
Learning the Basics of ArcMap 3.3 Updated 4/27/2010 Using Arc/View pt. 1 1.
David Luebke 3/17/2016 Advanced Computer Graphics Antialiasing David Luebke
Automated Geo-referencing of Images Dr. Ronald Briggs Yan Li GeoSpatial Information Sciences The University.
Processing Images and Video for An Impressionist Effect Automatic production of “painterly” animations from video clips. Extending existing algorithms.
Energy minimization Another global approach to improve quality of correspondences Assumption: disparities vary (mostly) smoothly Minimize energy function:
Types of Maps and Map Projections
Local search algorithms In many optimization problems, the path to the goal is irrelevant; the goal state itself is the solution State space = set of "complete"
Computational Thinking
UNIT 8: Dimensioning In AutoCAD
MAPS Maps are a visual representation of the Earth’s surface, drawn to scale and made for a specific purpose. 7/10 Each unique map projection serves a.
LO To assess my understanding of transformations
Knowledge-Based Organ Identification from CT Images
First Exam 18/10/2010.
Presentation transcript:

Rendering Effective Route Maps: Improving Usability Through Generalization Maneesh Agrawala, Chris Stolte Stanford University Presented by Ken Deeter

General Idea Automatically generate a route map that has the same properties as a hand drawn map. Hand drawn maps: –Exaggerated Lengths (non-constant scale factor) –No irrelevant information

More Specifically Constant scale factor –Road lengths on a conventional map vary in several orders of magnitude => small roads and neighborhoods are hard to navigate with large maps Information irrelevant to navigation –Names of locations, places, cities, etc. that are all far away from the route –Takes up space that would be otherwise useful for showing crossroads and relevant landmarks

Cog. Psych. Research Recipe for an effective route map: –Clearly communicate all turning points NOT: –Correct lengths –Correct angles –Correct shape

Generalization Techniques Generalize Length –Use more space for short roads, less for longer ones. Distribute based on importance, not physical length Generalize Angle –Align roads or make room for others Generalize Shape –Navigator doesn’t need to know roads shape. –Simpler roads are easier to differentiate on a map.

Route Map Generation Pipeline Input: Route data Process: –Shape simplification –Road Layout –Label Layout –Context Layout –Decoration Output: Map image

Shape Simplification Simplify roads but with specific constraints –No missing intersection –No false intersection –No wrong turn direction For roads where shape is important (curvy such as highway ramps) be more conservative.

Road Layout Formulated as a search in the space of all road layout configurations. –Simulated annealing to find optimal layouts –Requires layout scoring function, and perturbation function Perturbation modifies a length of a road by up to 20% or orientation by 5 degrees

Layout Scoring Penalize for short roads Penalize for change in ordering of length of roads Penalize for change in orientation from original Penalize for missing and false intersections (many tricky details.. See paper for speficics) Penalize for bad shape: if orientation of start and endpoints is different, or if they are too close

Remaining Layout Label: Tries to layout labels deterministically, then resorts to search for conflict resolution Context: Adds crossroad and landmark information Decoration: global orientation arrow, explicit turn points,

Output Image Size Estimate at first by using simple distortion. For small displays find orientation that takes best advantage of devices vertical scrolling capability (most routes are not square) –At the same time try to keep north as up –Resolution: 200 pixels for routes with 10 steps + 10 pixels/step

Evaluation 2200 users, voluntary feedback (self- selected) More than 95% percent said they would use the system

Drawbacks Layout still fails in some cases –Random search does not converge to optimal layout –Sometimes impossible to stay within all constraints Not useful for long trips Not useful for when people get lost PDA displays more likely to have problems of overlapping labels

Demo at mapblast.com