Discussion: Urban terrain segmentation for the Marmara Region Speaker: Akarun Discussant: Lerner-Lam.

Slides:



Advertisements
Similar presentations
Applications of one-class classification
Advertisements

Active Appearance Models
Robust Speech recognition V. Barreaud LORIA. Mismatch Between Training and Testing n mismatch influences scores n causes of mismatch u Speech Variation.
Classification. Introduction A discriminant is a function that separates the examples of different classes. For example – IF (income > Q1 and saving >Q2)
Data Mining Feature Selection. Data reduction: Obtain a reduced representation of the data set that is much smaller in volume but yet produces the same.
Multi-Label Prediction via Compressed Sensing By Daniel Hsu, Sham M. Kakade, John Langford, Tong Zhang (NIPS 2009) Presented by: Lingbo Li ECE, Duke University.
An Overview of Machine Learning
Wangfei Ningbo University A Brief Introduction to Active Appearance Models.
The loss function, the normal equation,
Recognition using Regions CVPR Outline Introduction Overview of the Approach Experimental Results Conclusion.
1 Segmentation with Global Optimal Contour Xizhou Feng 4/25/2003.
Spatial Interpolation
Basic Data Mining Techniques Chapter Decision Trees.
Basic Data Mining Techniques
A Concept of Environmental Forecasting and Variational Organization of Modeling Technology Vladimir Penenko Institute of Computational Mathematics and.
Project Presentation: March 9, 2006
ICCS-NTUA Contributions to E-teams of MUSCLE WP6 and WP10 Prof. Petros Maragos National Technical University of Athens School of Electrical and Computer.
Team 2: Final Report Uncertainty Quantification in Geophysical Inverse Problems.
Linear and generalised linear models
Characterizing Underconstrained DEM Analysis Mark Weber* *Harvard-Smithsonian Center for Astrophysics CfA – Harvard – UCI AstroStats Seminar Cambridge,
Segmentation Analysis
Olshausen’s Demo. 1.The Training set ?  Natural Images (Olhausen’s database)  How much do we learn ?  face database and car database 2.The Sparseness.
Simultaneous inversion of seabed and water column sound speed profiles in range-dependent shallow-water environments Megan S. Ballard and Kyle M. Becker.
Inductive learning Simplest form: learn a function from examples
Computing a posteriori covariance in variational DA I.Gejadze, F.-X. Le Dimet, V.Shutyaev.
BACKGROUND LEARNING AND LETTER DETECTION USING TEXTURE WITH PRINCIPAL COMPONENT ANALYSIS (PCA) CIS 601 PROJECT SUMIT BASU FALL 2004.
Texture analysis Team 5 Alexandra Bulgaru Justyna Jastrzebska Ulrich Leischner Vjekoslav Levacic Güray Tonguç.
1 Recognition by Appearance Appearance-based recognition is a competing paradigm to features and alignment. No features are extracted! Images are represented.
Face Recognition Using Evolutionary Approaches
CS 782 – Machine Learning Lecture 4 Linear Models for Classification  Probabilistic generative models  Probabilistic discriminative models.
CrIS Use or disclosure of data contained on this sheet is subject to NPOESS Program restrictions. ITT INDUSTRIES AER BOMEM BALL DRS EDR Algorithms for.
Introduction to Machine Learning Supervised Learning 姓名 : 李政軒.
Speech Signal Representations I Seminar Speech Recognition 2002 F.R. Verhage.
The good sides of Bayes Jeannot Trampert Utrecht University.
Week 1 - An Introduction to Machine Learning & Soft Computing
Oslo Gardermoen Oslo N12 N10 N18 N20 N34 N32 N30 N40 N38 N36 N46 N44 N42 N12 N10 N18 N20 N34 N32 N30 N40 N38 N36 N46 N44 N42 GPR(44)GPR(46) GPR(47) GPR(45)
Scene Completion Using Millions of Photographs James Hays, Alexei A. Efros Carnegie Mellon University ACM SIGGRAPH 2007.
Singer similarity / identification Francois Thibault MUMT 614B McGill University.
Biometric Iris Recognition System INTRODUCTION Iris recognition is fast developing to be a foolproof and fast identification technique that can be administered.
Principal Manifolds and Probabilistic Subspaces for Visual Recognition Baback Moghaddam TPAMI, June John Galeotti Advanced Perception February 12,
By Brian Lam and Vic Ciesielski RMIT University
Image Classification for Automatic Annotation
ZEIT4700 – S1, 2015 Mathematical Modeling and Optimization School of Engineering and Information Technology.
Goal of Learning Algorithms  The early learning algorithms were designed to find such an accurate fit to the data.  A classifier is said to be consistent.
Motion Estimation using Markov Random Fields Hrvoje Bogunović Image Processing Group Faculty of Electrical Engineering and Computing University of Zagreb.
Model Fusion and its Use in Earth Sciences R. Romero, O. Ochoa, A. A. Velasco, and V. Kreinovich Joint Annual Meeting NSF Division of Human Resource Development.
Data Mining and Decision Support
Adaptive Wavelet Packet Models for Texture Description and Segmentation. Karen Brady, Ian Jermyn, Josiane Zerubia Projet Ariana - INRIA/I3S/UNSA June 5,
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
Irfan Ullah Department of Information and Communication Engineering Myongji university, Yongin, South Korea Copyright © solarlits.com.
Dr. Chen, Data Mining  A/W & Dr. Chen, Data Mining Chapter 3 Basic Data Mining Techniques Jason C. H. Chen, Ph.D. Professor of MIS School of Business.
Mobile Robot Localization and Mapping Using Range Sensor Data Dr. Joel Burdick, Dr. Stergios Roumeliotis, Samuel Pfister, Kristo Kriechbaum.
Data Mining Lectures Lecture 7: Regression Padhraic Smyth, UC Irvine ICS 278: Data Mining Lecture 7: Regression Algorithms Padhraic Smyth Department of.
CSC2535: Computation in Neural Networks Lecture 7: Independent Components Analysis Geoffrey Hinton.
Multidisciplinary Design and Optimization (MDO) Natural Evolution of that Other Engineering Activity. Dr. Rob McDonald Lockheed Martin Endowed Professor.
By Brian Lam and Vic Ciesielski RMIT University
LECTURE 10: DISCRIMINANT ANALYSIS
CH. 2: Supervised Learning
Statement of the Tomography Problem
Image Segmentation Techniques
DICOM 11/21/2018.
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
Intelligent Systems and
Lecture 4: Econometric Foundations
Biointelligence Laboratory, Seoul National University
The loss function, the normal equation,
LECTURE 09: DISCRIMINANT ANALYSIS
Mathematical Foundations of BME Reza Shadmehr
Wiener Filtering: A linear estimation of clean signal from the noisy signal Using MMSE criterion.
Supervised machine learning: creating a model
Presentation transcript:

Discussion: Urban terrain segmentation for the Marmara Region Speaker: Akarun Discussant: Lerner-Lam

Classic Geophysical Inverse Problem Forward Problem: Image = F { Classifications [segments] } Segments = geographic basis functions, change with time. Useful for hypothesis testing and examining prior assumptions about geographic variation.

Inverse Problem l Classifications [segments] = F -1 {Image} l F -1 = F † l Inverse = generalized inverse (approximate) l Treated by Stochastic Techniques and l Genetic or Evolutionary Algorithms, AI (training), matched filtering, wavelets, empirical orthogonal eigenfunctions analysis, etc.

Basic Issues l Uniqueness of derived classifications. Do different combinations of classifications fit the data equally well? l Error model, including covariance. Uncertainties as input to further calculations. l Resolving power of data. –Geographical resolution (function of instrument) –Ability to distinguish between classifications l Optimizing a penalty function, including prior knowledge

Other issues l Proxy set –What needs to be quantified? l Relate to multidisciplinary needs –What is measurable/detectable? l Collateral data sets l Groundtruth: minimum (necessary and sufficient) tests l Baselining: time dimension l Background and causal changes –Global experience database –EOF ( t): time variation of geographic basis functions