1
RESEARCH POSTER PRESENTATION DESIGN © 2012 www.PosterPresentations.com Remote Sensing: Big Spatial Data Terrain classification Software Collaborative Framework The expert labels a very few pixels (ground truth) This sparsely available ground truth is used to learn a classifier. Several approaches are used: K- nearest neighbors (based on k-d trees) SVM (we use a linear kernel in our framework) Once the classifier is obtained, rudimentary labels are obtained for all the superpixels Label refinement: Labels obtained in the previous step are rudimentary. This can cause artifacts (neighboring regions belonging to same class can get different labels). Laplacian propagation is used to smooth the labels obtained in the previous step. Minimize the following cost function separately for each category: is 1 if the superpixel belongs to the category and 0 otherwise. is relaxed to take real values Maximum value of for each category is used as the final label for each superpixel. Semi-supervised Learning Images and Dictionaries: Coding, denoising and registration Machine Learning for Vortex Visualization Representation of Multilevel Structures Shape Complex Segmentation Superpixel formation Superpixel descriptor Building the Superpixel graph Initializing the graph labels Label refinement Parallelization Collaborators: Arunava Banerjee, Anil Biswas, Ting Chen, John Corring, Qi Deng, Yan Deng, Paul Gader, Karthik S. Gurumoorthy, Raghu Machiraju, Pegah Massoudifar, Adrian Peter, Ajit Rajwade, Han-Wei Shen, David Thompson, Ranga Raju Vatsavai, Baba Vemuri, Keith Walters, Alina Zare, Li Zhang Manu Sethi, Yupeng Yan, Anand Rangarajan, Sanjay Ranka Spatiotemporal machine learning for remote sensing and other applications How to map informal settlements (slums, barrios, shanty towns, …) in an efficient manner? Objects may be same (e.g., Buildings, Roads, …), but not the spatial patterns (neighborhoods) Very High Resolution Imagery Parcellation into homogenous regions leads to Huge reduction in data complexity Intensity histograms Corner density Size of Superpixels Binary features based on coarse scale tessellation and multilevel containment Superpixel Descriptor Our approach labels approximately 90% of the pixels correctly in 20 minutes for a 1000 x 1000 image patch while Citation KNN takes 27.8 hours and GMIL takes 3.1 hours for a 1000 x 1000 image patch, at a fixed grid size. Our approach does not require experimentation to obtain the right grid size which is an unsolved problem. Our segment boundaries correspond to natural object boundaries. Most of the steps are easily parallelizable using data decomposition techniques (Parallel versions using MPI, Apache Spark in development). Expect to be able to process 200 square km per core per day Using 1000 cores should result in processing of 200,000 sq km per day. Image Patches 3D, 4D and 5D blocks Mixtures of HOSVDs Research Q: Generalization to non-uniform tesselations? IEEE Trans. Image Proc. 2008, IEEE T-PAMI 2013 Joint work with Arunava Banerjee Hyperspectral Imaging The hyperspectral realm: Numerous bands at each pixel Segmentation, Unmixing and Classification: Spatiotemporal ML Image Segmentati on Endmemb er Extraction Abundan ce Estimatio n Unmixing GRENDEL (Graph-based Endmember Extraction and Labeling Simulation data containing vortices Physics-based feature detectors combined via machine learning into compound classifier (CC) Machine learning Physics CC has lower error rate and better sensitivity and specificity Spatio-temporal machine learning for turbulent flow? Computer Graphics Forum, 2014 Performance and Accuracy Quantize classical system Linear Schrödinger Wave magnitude: Probability, Phase: Curve geom. Apps: Correspondence, indexing, classification Research Direction: Can other classical problems like shortest paths on manifolds be “quantized”? NSF 1143963: IEEE CVPR 2012, SIAM Math Anal. 2012 Manu Sethi, Yupeng Yan, Anand Rangarajan, Ranga Raju Vatsavai, Sanjay Ranka: An efficient computational framework for labeling large scale spatiotemporal remote sensing datasets. IC3 2014: 635-640 Manu Sethi, Yupeng Yan, Anand Rangarajan, Ranga Raju Vatsavai, Sanjay Ranka: Scalable Machine Learning Approaches for Terrain Classication datasets. Submitted. Making Waves With Shapes

Spatiotemporal machine learning for remote sensing and ...abe.ufl.edu/.../posters/RS_PosterSymposium_2014_Rangarajan_Rank… · Manu Sethi, Yupeng Yan, Anand Rangarajan, ... IEEE

Embed Size (px)

Citation preview

Page 1: Spatiotemporal machine learning for remote sensing and ...abe.ufl.edu/.../posters/RS_PosterSymposium_2014_Rangarajan_Rank… · Manu Sethi, Yupeng Yan, Anand Rangarajan, ... IEEE

RESEARCH POSTER PRESENTATION DESIGN © 2012

www.PosterPresentations.com

Remote Sensing: Big Spatial Data

Terrain classification

Software Collaborative Framework

The expert labels a very few pixels (ground truth)

This sparsely available ground truth is used to learn a

classifier.

Several approaches are used:

– K- nearest neighbors (based on k-d trees)

– SVM (we use a linear kernel in our framework)

Once the classifier is obtained, rudimentary labels are

obtained for all the superpixels

Label refinement:

• Labels obtained in the previous step are rudimentary.

• This can cause artifacts (neighboring regions belonging to same class can get different labels).

• Laplacian propagation is used to smooth the labels obtained in

the previous step.

Minimize the following cost function separately for each

category:

– 𝑌𝑖 is 1 if the superpixel belongs to the

category and 0 otherwise.

– 𝑋𝑖 is relaxed to take real values

Maximum value of 𝑋𝑖 for each category is used as the final

label for each superpixel.

Semi-supervised Learning

Images and Dictionaries: Coding, denoising and registration

Machine Learning for Vortex Visualization

Representation of Multilevel Structures

Shape Complex Segmentation

Superpixel formation

Superpixel descriptor

Building the Superpixel graph

Initializing the graph labels

Label refinement

Parallelization

Collaborators: Arunava Banerjee, Anil Biswas, Ting Chen, John Corring, Qi Deng, Yan Deng, Paul Gader, Karthik S. Gurumoorthy, Raghu Machiraju, Pegah Massoudifar, Adrian Peter, Ajit Rajwade, Han-Wei Shen, David Thompson, Ranga Raju Vatsavai, Baba Vemuri, Keith Walters, Alina Zare, Li Zhang

Manu Sethi, Yupeng Yan, Anand Rangarajan, Sanjay Ranka

Spatiotemporal machine learning for remote sensing and other applications

How to map informal settlements

(slums, barrios, shanty towns, …)

in an efficient manner?

Objects may be same (e.g.,

Buildings, Roads, …), but

not the spatial patterns

(neighborhoods)

Very High Resolution Imagery

Parcellation into homogenous regions leads to Huge reduction in data complexity

Intensity histogramsCorner density Size of SuperpixelsBinary features based on coarse scale tessellation and multilevel containment

Superpixel Descriptor

Our approach labels approximately 90% of the pixels correctly in 20 minutes for a 1000 x 1000 image patch while Citation KNN takes 27.8 hours and GMIL takes 3.1 hours for a 1000 x 1000 image patch, at a fixed grid size.Our approach does not require experimentation to obtain the right grid size which is an unsolved problem.Our segment boundaries correspond to natural object boundaries.Most of the steps are easily parallelizable using data decomposition techniques (Parallel versions using MPI, Apache Spark in development).Expect to be able to process 200 square km per core per dayUsing 1000 cores should result in processing of 200,000 sq km per day.

Image Patches3D, 4D and 5D blocksMixtures of HOSVDs

Research Q: Generalization to non-uniform tesselations?

IEEE Trans. Image Proc. 2008, IEEE T-PAMI 2013Joint work with Arunava Banerjee

Hyperspectral Imaging

The hyperspectral realm: Numerousbands at each pixelSegmentation, Unmixing andClassification: Spatiotemporal ML

Image Segmentati

on

Endmember

Extraction

Abundance

Estimation

Unmixing

GRENDEL (Graph-based Endmember Extraction and Labeling

Simulation data containing vorticesPhysics-based feature detectors combinedvia machine learning into compound classifier (CC)

Machine learning Physics CC has lower error rate and better sensitivity and specificity

Spatio-temporal machine learning for turbulent flow?

Computer Graphics Forum, 2014

Performance and Accuracy

Quantize classical system Linear SchrödingerWave magnitude: Probability, Phase: Curve geom.Apps: Correspondence, indexing, classification

Research Direction: Can other classical problemslike shortest paths on manifolds be “quantized”?NSF 1143963: IEEE CVPR 2012, SIAM Math Anal. 2012

Manu Sethi, Yupeng Yan, Anand Rangarajan, Ranga Raju Vatsavai, Sanjay Ranka: An efficient computational framework for labeling large scale spatiotemporal remote sensing datasets. IC3 2014: 635-640Manu Sethi, Yupeng Yan, Anand Rangarajan, Ranga Raju Vatsavai, Sanjay Ranka: Scalable Machine Learning Approaches for Terrain Classication datasets. Submitted.

Making Waves With Shapes