Image Processing for Physical Data

Slides:



Advertisements
Similar presentations
Active Shape Models Suppose we have a statistical shape model –Trained from sets of examples How do we use it to interpret new images? Use an “Active Shape.
Advertisements

Area and perimeter calculation using super resolution algorithms M. P. Cipolletti – C. A. Delrieux – M. C. Piccolo – G. M. E. Perillo IADO – UNS – CONICET.
Unsupervised Learning Clustering K-Means. Recall: Key Components of Intelligent Agents Representation Language: Graph, Bayes Nets, Linear functions Inference.
KinectFusion: Real-Time Dense Surface Mapping and Tracking
Learning With Dynamic Group Sparsity Junzhou Huang Xiaolei Huang Dimitris Metaxas Rutgers University Lehigh University Rutgers University.
ATEC Procedural Animation Introduction to Procedural Methods in 3D Computer Animation Dr. Midori Kitagawa.
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
1 Abstract This paper presents a novel modification to the classical Competitive Learning (CL) by adding a dynamic branching mechanism to neural networks.
Contents Description of the big picture Theoretical background on this work The Algorithm Examples.
Electron dynamics and molecular Coulomb explosion: critical radius vs dynamic screening Kun Zhao, III Hill (University of Maryland) Session H4. Intense-Field.
Slide 1 EE3J2 Data Mining Lecture 16 Unsupervised Learning Ali Al-Shahib.
Color: Readings: Ch 6: color spaces color histograms color segmentation.
Presented by Ozgur D. Sahin. Outline Introduction Neighborhood Functions ANF Algorithm Modifications Experimental Results Data Mining using ANF Conclusions.
Evaluating Performance for Data Mining Techniques
Unsupervised Learning. CS583, Bing Liu, UIC 2 Supervised learning vs. unsupervised learning Supervised learning: discover patterns in the data that relate.
Intelligent Database Systems Lab 1 Advisor : Dr. Hsu Graduate : Jian-Lin Kuo Author : Silvia Nittel Kelvin T.Leung Amy Braverman 國立雲林科技大學 National Yunlin.
Outline 3  PWA overview Computational challenges in Partial Wave Analysis Comparison of new and old PWA software design - performance issues Maciej Swat.
MEDICAL IMAGE REGISTRATION BY MAXIMIZATION OF MUTUAL INFORMATION Dissertation Defense by Chi-hsiang Lo June 27, 2003 PRESENTATION.
MACHINE LEARNING 8. Clustering. Motivation Based on E ALPAYDIN 2004 Introduction to Machine Learning © The MIT Press (V1.1) 2  Classification problem:
Optimization of parameters for jet finding algorithm for p+p collisions at E cm =200 GeV T. G. Dedovich & M.V. Tokarev JINR, Dubna  Motivations.
Unsupervised Learning. Supervised learning vs. unsupervised learning.
CS654: Digital Image Analysis
Quantitative analysis of 2D gels Generalities. Applications Mutant / wild type Physiological conditions Tissue specific expression Disease / normal state.
Project 11: Determining the Intrinsic Dimensionality of a Distribution Okke Formsma, Nicolas Roussis and Per Løwenborg.
Proton Test Beam Experimental Program Overall objective: Study response of modified monochrome DC Plasma Display Panels to low energy proton beam. Energy.
CHAN Siu Lung, Daniel CHAN Wai Kin, Ken CHOW Chin Hung, Victor KOON Ping Yin, Bob Fast Algorithms for Projected Clustering.
Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.
1 Kernel Machines A relatively new learning methodology (1992) derived from statistical learning theory. Became famous when it gave accuracy comparable.
V4 – Video Tracker for Extremely Hard Night Conditions
Image Representation and Description – Representation Schemes
Unsupervised Learning: Clustering
Unsupervised Learning: Clustering
Clustering MacKay - Chapter 20.
Clustering Data Streams
Clustering CSC 600: Data Mining Class 21.
Compressive Coded Aperture Video Reconstruction
Real-Time Soft Shadows with Adaptive Light Source Sampling
WAVELET VIDEO PROCESSING TECHNOLOGY
SRAM Yield Rate Optimization EE201C Final Project
A modified hyperplane clustering algorithm allows for efficient and accurate clustering of extremely large datasets Ashok Sharma, Robert Podolsky, Jieping.
Clustering and Segmentation
Non-Linear Models Tractable non-linearity Intractable non-linearity
Data Mining K-means Algorithm
Convex Hull R.L. Graham’s Algorithm Computer Graphics.
Traffic Simulator Calibration
Color: Readings: Ch 6: color spaces color histograms
CS Digital Image Processing Lecture 9. Wavelet Transform
Learning With Dynamic Group Sparsity
MLP Based Feedback System for Gas Valve Control in a Madison Symmetric Torus Andrew Seltzman Dec 14, 2010.
K-means and Hierarchical Clustering
AIM: Clustering the Data together
Color: Readings: Ch 6: color spaces color histograms
Haim Kaplan and Uri Zwick
KAIST CS LAB Oh Jong-Hoon
Problem Definition Input: Output: Requirement:
Clustering 77B Recommender Systems
Data Mining – Chapter 4 Cluster Analysis Part 2
Fast and Exact K-Means Clustering
Outline Texture modeling - continued Julesz ensemble.
An Adaptive Nearest Neighbor Classification Algorithm for Data Streams
Text Categorization Berlin Chen 2003 Reference:
BIRCH: Balanced Iterative Reducing and Clustering Using Hierarchies
GLOBAL POLARIZATION OF QUARKS IN NON-CENTRAL A+A COLLISIONS
Multi-Information Based GCPs Selection Method
Unsupervised Learning: Clustering
EM Algorithm and its Applications
BIRCH: Balanced Iterative Reducing and Clustering using Hierarchies
Detecting Digital Forgeries using Blind Noise Estimation
Presentation transcript:

Image Processing for Physical Data Xuanxuan Su May 31, 2002

Outline Background System Implementation Evaluation Physical experimental image data Pre-processing method Correlation computing System Implementation Evaluation

Image & Time-of-Flight Spectrometer Time-Resolved Images 128 x 128 Pixels 730 Hz Digital Acquisition 500,000 – 1,000,000 Frames Mass-Resolved Energies & Angular Distributions Time-Resolved Waveforms Digital Scope Acquisition Mass-Resolved Energies Distributions

Momentum Image Momentum POLARIZATION AXIS

Real Space Correlation Images Correlation Approach Real Space Correlation Images AVERAGE IMAGE CORRELATION IMAGE POLARIZATION AXIS 1 24 - 15o (= Dj) Angle Sectors 30 - 0.66 eV (= DE) Energy Sectors

Image Data For each experiment 500,000 ~ 1,000,000 frames 8G ~ 16G uncompressed data 5M ~ 150M compressed data Pixels are sparse

Challenge Previous work Low accuracy Computational resource is limited Data compression Correlation of sectors Low accuracy Computational resource is limited Large data set can’t fit in memory More than 3 hours for 600 sectors correlation

Applied Technologies Clustering Correlation Sampling

Clustering Pre-processing method Represent a cluster of points by their centroid Can be used to achieve data compression 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

K-Means Clustering Algorithm Simply and fast Randomly choose k cluster centers Assign each data to the closest cluster center Recompute the cluster centers using the current cluster member until a stop criteria is met Simply and fast Sensitive to initial seed selection

Incremental Clustering Algorithm: Assign the first data item to a cluster For next data item, either assign it to one existing cluster or a new cluster Repeat step 2 until all the data items are clustered Advantage Small space requirement Non-iterative

Correlation Coefficients A measure of linear association The formula

Sampling Calculate correlation Estimate the accuracy of approximation Image sampling Problem: the number of samples that have a good estimation of correlation Estimate the accuracy of approximation Useful for evaluation Pixels sampling

System Implementation Pre-processing Incremental clustering method Spotlize Pre-define the radius of clusters

System Implementation (con’t) Progressive Correlation Computing Pyramidal grids Algorithm Compute the correlation in a low resolution, find the most correlated grids Divide the corresponding grids into smaller grids Repeat step 1 & 2 until a stop criteria is met Increase accuracy have to multi-scan data set

Evaluation Run time Accuracy of correlation Spotlized images vs. original images Choose sample pixels

Future Work Avoid multi-scan data set Find a number of sampling images so that the data can fit in memory and have high accuracy Investigate other association measure methods