TVCG 2013 Sungkil Lee, Mike Sips, and Hans-Peter Seidel.

Slides:



Advertisements
Similar presentations
Dynamic View Selection for Time-Varying Volumes Guangfeng Ji* and Han-Wei Shen The Ohio State University *Now at Vital Images.
Advertisements

Mustafa Cayci INFS 795 An Evaluation on Feature Selection for Text Clustering.
Unsupervised Learning Clustering K-Means. Recall: Key Components of Intelligent Agents Representation Language: Graph, Bayes Nets, Linear functions Inference.
Unsupervised Learning
Ms. Stephenson’s Jeopardy
Leveraging Stereopsis for Saliency Analysis
 Image Characteristics  Image Digitization Spatial domain Intensity domain 1.
Color Compatibility From Large Datasets Peter O’Donovan University of Toronto Aseem Agarwala Adobe Systems, Inc. Aaron Hertzmann University of Toronto.
Image Processing IB Paper 8 – Part A Ognjen Arandjelović Ognjen Arandjelović
Presented by: Mingyuan Zhou Duke University, ECE April 3, 2009
Chapter 4: Linear Models for Classification
® Copyright 2008 Adobe Systems Incorporated. All rights reserved. ® 1 INTRODUCTION TO GRAPHIC DESIGN MOVEMENT, BALANCE, UNITY, CONTRAST, EMPHASIS, LINE,
Metrics, Algorithms & Follow-ups Profile Similarity Measures Cluster combination procedures Hierarchical vs. Non-hierarchical Clustering Statistical follow-up.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Fuzzy Support Vector Machines (FSVMs) Weijia Wang, Huanren Zhang, Vijendra Purohit, Aditi Gupta.
Chapter 2: Pattern Recognition
Jierui Xie, Boleslaw Szymanski, Mohammed J. Zaki Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180, USA {xiej2, szymansk,
Apparent Greyscale: A Simple and Fast Conversion to Perceptually Accurate Images and Video Kaleigh SmithPierre-Edouard Landes Joelle Thollot Karol Myszkowski.
Perceptual Evaluation of Colour Gamut Mapping Algorithms Fabienne Dugay The Norwegian Color Research Laboratory Faculty of Computer Science and Media Technology.
Supervised Distance Metric Learning Presented at CMU’s Computer Vision Misc-Read Reading Group May 9, 2007 by Tomasz Malisiewicz.
SVMs Finalized. Where we are Last time Support vector machines in grungy detail The SVM objective function and QP Today Last details on SVMs Putting it.
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
Nonlinear Dimensionality Reduction by Locally Linear Embedding Sam T. Roweis and Lawrence K. Saul Reference: "Nonlinear dimensionality reduction by locally.
Sometimes, Tables can be confusing
® Copyright 2008 Adobe Systems Incorporated. All rights reserved. ® 1 INTRODUCTION TO GRAPHIC DESIGN MOVEMENT, BALANCE, UNITY, CONTRAST, EMPHASIS, LINE,
Entropy and some applications in image processing Neucimar J. Leite Institute of Computing
Methods in Medical Image Analysis Statistics of Pattern Recognition: Classification and Clustering Some content provided by Milos Hauskrecht, University.
Any questions about the current assignment? (I’ll do my best to help!)
EM and expected complete log-likelihood Mixture of Experts
Network Aware Resource Allocation in Distributed Clouds.
ADVANCED CLASSIFICATION TECHNIQUES David Kauchak CS 159 – Fall 2014.
Creating visually attractive and appealing publications.
Data Reduction. 1.Overview 2.The Curse of Dimensionality 3.Data Sampling 4.Binning and Reduction of Cardinality.
Visibility map (high low) Surveillance with Visual Tagging and Camera Placement J. Zhao and S.-C. Cheung — Center for Visualization and Virtual Environment,
Data Mining Practical Machine Learning Tools and Techniques Chapter 4: Algorithms: The Basic Methods Section 4.6: Linear Models Rodney Nielsen Many of.
Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Intelligent Systems Laboratory 1 CLUSTERS Prof. George Papadourakis,
Computer Vision Lab. SNU Young Ki Baik Nonlinear Dimensionality Reduction Approach (ISOMAP, LLE)
Multidimensional Scaling Vuokko Vuori Based on: Data Exploration Using Self-Organizing Maps, Samuel Kaski, Ph.D. Thesis, 1997 Multivariate Statistical.
Clustering What is clustering? Also called “unsupervised learning”Also called “unsupervised learning”
Graph-based Text Classification: Learn from Your Neighbors Ralitsa Angelova , Gerhard Weikum : Max Planck Institute for Informatics Stuhlsatzenhausweg.
A survey of different shape analysis techniques 1 A Survey of Different Shape Analysis Techniques -- Huang Nan.
12 mhj/ Optimal Color Representation of Multi Spectral Data M.L.H. van Driel s Supervisors: P. Sereda Prof. B.M. ter Haar Romeny.
Histograms and Color Balancing Computational Photography Derek Hoiem, University of Illinois 09/10/15 “Empire of Light”, Magritte.
Region-Based Saliency Detection and Its Application in Object Recognition IEEE TRANSACTIONS ON CIRCUITS AND SYSTEM FOR VIDEO TECHNOLOGY, VOL. 24 NO. 5,
Creating Better Thumbnails Chris Waclawik. Project Motivation Thumbnails used to quickly select a specific a specific image from a set (when lacking appropriate.
Nonlinear Dimensionality Reduction Approach (ISOMAP)
Ensemble Color Segmentation Spring 2009 Ben-Gurion University of the Negev.
Associative Hierarchical CRFs for Object Class Image Segmentation
Image Emotional Semantic Query Based On Color Semantic Description Wei-Ning Wang, Ying-Lin Yu Department of Electronic and Information Engineering, South.
Recognition Using Visual Phrases
Chapter 13 (Prototype Methods and Nearest-Neighbors )
Final Exam Review CS479/679 Pattern Recognition Dr. George Bebis 1.
Stas Goferman Lihi Zelnik-Manor Ayellet Tal Technion.
Lightness filtering in color images with respect to the gamut School of Electrical Engineering and Computer Science Kyungpook National Univ. Fourteenth.
03/03/03© 2003 University of Wisconsin Last Time Subsurface scattering models Sky models.
Learning Kernel Classifiers 1. Introduction Summarized by In-Hee Lee.
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
 Mentor : Prof. Amitabha Mukerjee Learning to Detect Salient Objects Team Members - Avinash Koyya Diwakar Chauhan.
May 2003 SUT Color image segmentation – an innovative approach Amin Fazel May 2003 Sharif University of Technology Course Presentation base on a paper.
Applied Cartography and Introduction to GIS GEOG 2017 EL Lecture-5 Chapters 9 and 10.
ASP algorithm Image term Stretch term Bending term Self-proximity term Vertex-vertex proximity constraints.
Semi-Supervised Clustering
Ke Chen Reading: [7.3, EA], [9.1, CMB]
IMAGE SEGMENTATION USING THRESHOLDING
Elements of design Elements are the building blocks of any design.
Presented by: Chang Jia As for: Pattern Recognition
Text Categorization Berlin Chen 2003 Reference:
Gradient Domain Salience-preserving Color-to-gray Conversion
Mosaic artifacts reduction in SIPS Backscatter
Presentation transcript:

TVCG 2013 Sungkil Lee, Mike Sips, and Hans-Peter Seidel

 Introduction  Class Visibility  Optimization  Example  Conclusion

 Principles of effective color palettes (Trumbo, 1981) ◦ Order: colors chosen to present an ordered statistical variables should be perceived as preserving that order. ◦ Separation: colors chosen to present the differences of a variable should be clearly perceived as different.

 ColorBrewer.org: An Online Tool for Selecting Colour Schemes for Maps (The Cartographic Journal 2003) 

 In this work, it focus on separation, which is still challenging. ◦ Wrong use of categorical colors may lead misleading interpretation of data. ◦ Many visualization packages provide little guidance on color selection.

 Dominant structures locally suppress small inhomogeneous groups. ◦ Even the same colors are not perceived as equal and distinct.

 Dominant structures locally suppress small inhomogeneous groups. ◦ Global contrast enhancement alleviates the symptom, but not that much.

 A measure of perceptual intensity for categorical differences.  An optimization metric to make categorical differences visible to users.

 Perceptually-driven: ◦ class visibility as a metric to measure the perceptual intensity of a categorical groups  Visibility equalization by optimization: ◦ to optimize the class visibility function of input data ◦ The optimization aims to balance the local contrast of the image between small and large groups.

 Hence, we instead introduce point saliency, which exactly weight the contribution of categorical color at a single data point. ◦ The point saliency is measured as the color difference from the average color of neighboring data points.  Color difference, Δ, is measured by the CIE76 metric, which is the Euclidean distance in CIE Lab.

 The class visibility, defined for each data point, is estimated by: ◦ weighting its point saliency with its structural weight the number of data points, in a neighboring surround, whose labels are the same as the center point

 The mean class visibility of each class is computed by the average of the data points that belong to its category.

Note that hue values (θ ) will stay constant during the optimization. Target Visibility T: the mean over all V m L k and r k are the lightness and chroma of C k in LCH space.

barrier function:

i and j indicate the color pair selected from all the classes J : just noticeable difference (JND) of Lab color (3-7 JND in this paper)

The final resulting cost functional with the constraints to optimize is: In practice, they found that a fixed value of 10 produces satisfactory results anyway. nonlinear conjugate gradient-based minimization

 Our optimization attempts to equalize all the mean class visibilities to a single target constant T.  T mean : average of mean class visibilities ◦ Strong classes are weakened, while weak classes are improved.  T max : maximum among all the mean class visibilities ◦ All the classes are strengthened.

 class visibility as a measure of perceptual intensity in categorical data visualization  an automated color optimization algorithm to make categorical distinction clearly visible  No simple rule to choose target visibility: T mean, T max, or others.  During the optimization, hue value was fixed. ◦ the change of hue will be useful for large-scale discrimination