Pixel Clustering and Hyperspectral Image Segmentation for Ocean Colour Remote Sensing Xuexing Zeng 1, Jinchang Ren 1, David Mckee 2 Samantha Lavender 3.

Slides:



Advertisements
Similar presentations
Clustering Clustering of data is a method by which large sets of data is grouped into clusters of smaller sets of similar data. The example below demonstrates.
Advertisements

Original Figures for "Molecular Classification of Cancer: Class Discovery and Class Prediction by Gene Expression Monitoring"
Carolina Galleguillos, Brian McFee, Serge Belongie, Gert Lanckriet Computer Science and Engineering Department Electrical and Computer Engineering Department.
Image classification in natural scenes: Are a few selective spectral channels sufficient?
K Means Clustering , Nearest Cluster and Gaussian Mixture
Clustering Clustering of data is a method by which large sets of data is grouped into clusters of smaller sets of similar data. The example below demonstrates.
Adaptive Resonance Theory (ART) networks perform completely unsupervised learning. Their competitive learning algorithm is similar to the first (unsupervised)
Color Image Processing
Face Recognition in Hyperspectral Images Z. Pan, G. Healey, M. Prasad and B. Tromberg University of California Published at IEEE Trans. on PAMI Vol 25,
Segmentation into Planar Patches for Recovery of Unmodeled Objects Kok-Lim Low COMP Computer Vision 4/26/2000.
Ai-Mei Huang and Truong Nguyen Video Processing LabECE Dept, UCSD, La Jolla, CA This paper appears in: Image Processing, ICIP IEEE International.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Distinguishing Photographic Images and Photorealistic Computer Graphics Using Visual Vocabulary on Local Image Edges Rong Zhang,Rand-Ding Wang, and Tian-Tsong.
Feature Screening Concept: A greedy feature selection method. Rank features and discard those whose ranking criterions are below the threshold. Problem:
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
APPLICATION OF K-MEANS CLUSTERING The Matlab function “kmeans()” was used for clustering The parameters to the function were : 1. The matrix of entire.
Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
Digital Imaging and Remote Sensing Laboratory Real-World Stepwise Spectral Unmixing Daniel Newland Dr. John Schott Digital Imaging and Remote Sensing Laboratory.
INTRODUCTION Problem: Damage condition of residential areas are more concerned than that of natural areas in post-hurricane damage assessment. Recognition.
Image Segmentation by Clustering using Moments by, Dhiraj Sakumalla.
Spectral contrast enhancement
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
Hyperspectral Imaging Alex Chen 1, Meiching Fong 1, Zhong Hu 1, Andrea Bertozzi 1, Jean-Michel Morel 2 1 Department of Mathematics, UCLA 2 ENS Cachan,
New Segmentation Methods Advisor : 丁建均 Jian-Jiun Ding Presenter : 蔡佳豪 Chia-Hao Tsai Date: Digital Image and Signal Processing Lab Graduate Institute.
Prakash Chockalingam Clemson University Non-Rigid Multi-Modal Object Tracking Using Gaussian Mixture Models Committee Members Dr Stan Birchfield (chair)
Blue: Histogram of normalised deviation from “true” value; Red: Gaussian fit to histogram Presented at ESA Hyperspectral Workshop 2010, March 16-19, Frascati,
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Image Segmentation Seminar III Xiaofeng Fan. Today ’ s Presentation Problem Definition Problem Definition Approach Approach Segmentation Methods Segmentation.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
Digital Image Processing CSC331
Resolution A sensor's various resolutions are very important characteristics. These resolution categories include: spatial spectral temporal radiometric.
Assessing Biodiversity of Phytoplankton Communities from Optical Remote Sensing Rick A. Reynolds, Dariusz Stramski, and Julia Uitz Scripps Institution.
Fuzzy Entropy based feature selection for classification of hyperspectral data Mahesh Pal Department of Civil Engineering National Institute of Technology.
Chapter 21 R(x) Algorithm a) Anomaly Detection b) Matched Filter.
Digital Image Processing CCS331 Relationships of Pixel 1.
G52IVG, School of Computer Science, University of Nottingham 1 Edge Detection and Image Segmentation.
Color Image Segmentation Speaker: Deng Huipeng 25th Oct , 2007.
Multi-Agent Behaviour Segmentation via Spectral Clustering Dr Bálint Takács, Simon Butler, Dr Yiannis Demiris Intelligent Systems and Networks Group Electrical.
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
The Dirichlet Labeling Process for Functional Data Analysis XuanLong Nguyen & Alan E. Gelfand Duke University Machine Learning Group Presented by Lu Ren.
Pixel Connectivity Pixel connectivity is a central concept of both edge- and region- based approaches to segmentation The notation of pixel connectivity.
Map of the Great Divide Basin, Wyoming, created using a neural network and used to find likely fossil beds See:
CS654: Digital Image Analysis
CVPR2013 Poster Detecting and Naming Actors in Movies using Generative Appearance Models.
Supplementary Slides. More experimental results MPHSM already push out many irrelevant images Query image QHDM result, 4 of 36 ground truth found ANMRR=
Demosaicking for Multispectral Filter Array (MSFA)
Database Management Systems, R. Ramakrishnan 1 Algorithms for clustering large datasets in arbitrary metric spaces.
Geospatial Data Mining at University of Texas at Dallas Dr. Bhavani Thuraisingham (Computer Science) Dr. Latifur Khan (Computer Science) Dr. Fang Qiu (GIS)
Evaluation of Image Segmentation algorithms By Dr. Rajeev Srivastava.
Image Segmentation Nitin Rane. Image Segmentation Introduction Thresholding Region Splitting Region Labeling Statistical Region Description Application.
Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.
May 2003 SUT Color image segmentation – an innovative approach Amin Fazel May 2003 Sharif University of Technology Course Presentation base on a paper.
Unsupervised Classification
Shadow Detection in Remotely Sensed Images Based on Self-Adaptive Feature Selection Jiahang Liu, Tao Fang, and Deren Li IEEE TRANSACTIONS ON GEOSCIENCE.
ITK. Ch 9 Segmentation Confidence Connected Isolated Connected Confidence Connected in Vector Images Jin-ju Yang.
Machine Vision ENT 273 Lecture 4 Hema C.R.
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Color Image Processing
Color Image Processing
Clustering and Segmentation
DIGITAL SIGNAL PROCESSING
Color Image Processing
Amin Zehtabian, Hassan Ghassemian CONCLUSION & FUTURE WORKS
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
What Is Spectral Imaging? An Introduction
Hu Li Moments for Low Resolution Thermal Face Recognition
Color Image Processing
Image Information Extraction
Color Image Processing
Image Segmentation.
Presentation transcript:

Pixel Clustering and Hyperspectral Image Segmentation for Ocean Colour Remote Sensing Xuexing Zeng 1, Jinchang Ren 1, David Mckee 2 Samantha Lavender 3 and Stephen Marshall 1 1 CeSIP, Department of Electronic & Electrical Engineering University of Strathclyde, Glasgow, G1, 1XW, U.K 2 Department of Physics, University of Strathclyde, Glasgow, G4 0NG, U.K 3 ARGANS Limited, 19 Research Way, Plymouth, PL6 8BT, U.K

Ocean Colour Remote Sensing using Hyperspectral Imaging Marine Spectral Reflectance Ocean colour is the measurement of spectral distribution of radiance (or reflectance) upwelling from the ocean in the visible regime.

Ocean Colour Remote Sensing using Hyperspectral Imaging To measure phytoplankton from space and evaluate impacts of 1.Cyanobacteria on human health 2.Coccolithophore on Fisheries 3.Hurricane Floyd on natural disasters Also to measure sea surface temperature and water depth.

Hyperspectral Pixel Clustering and Image Segmentation for Ocean Colour Remote Sensing Region growing is proposed to classify Ocean hyperspectral dataset whilst maintain the spatial consistency. Good classification results can be obtained by simply adjusting one key parameter to specify the pixel similarity. Another parameter: size threshold is used to filter small regions as post- processing.

Algorithm Let I represents N bands hyperspectral image, and I n represents one of band Image with size w by h. Let S represents seed and S ij represents one of seed with coordinates i and j. Step 1: Generate one w by h zero matrix J as initial output. Step 2: Select uniformly distributed seed pixels S ij. seed pixels S ij

Algorithm Step 3: The region will grow from the first seed S 11 by adding its 4-connected neighbours that is most similar with mean value vector. Note that one of neighbour of S ij contains N pixels that can be represented by 1 by N vector. The initial mean value vector is just the pixel vector corresponding to the first seed S 11. After each growing, the mean value vector will be updated by the new mean value vector re-calculated on all the added pixel vectors that include seed itself. For any grown region from S ij, let I n,pq represents the grown pixels of I n,, where p, q are coordinates, size represents the number of grown pixel of I n, and M represents mean value vector of I, M n represents mean value of grown pixels of I n respectively, and can be expressed as:

Step 4: When the growth stops, all the added pixel will be labelled on the output matrix J, and the next seed pixel that does not yet belong to any region will be chosen and start grow again until all the seeds are grown. Euclidean distance is used to measure the similarity between pixels. Let represents the pixel values vector of one neighbour of S ij, then the Euclidean distance E dist between neighbour and mean value vector can be expressed as: Algorithm If the Euclidean distance between M n and a n is smaller than the threshold, this neighbour is considered that it is similar with this grown region, and this neighbour will be added to this growing region.

Results of Segmentation Dataset description: The hyperspectral ocean dataset around U.K that collected on May, 2007 will be used for classification. This dataset include 9 bands with wavelengths: 412, 433, 488, 531, 547, 667, 678, 748 and 869 nm respectively. Each band image has size 1000 by 1000 pixels. For lower bands: band 1, 2 and 3, they represent data from spectral range of blue and green thus contain more information. Higher spectrum band: band 7 contains much less information than lower bands in the dataset we used. The first 3 bands will be used for this hyperspectral ocean dataset.

Results of Segmentation Band 1: wavelength = 412 nmBand 2: wavelength = 433 nm Band Samples

Band 3: wavelength = 488 nm Results of Segmentation Band 7: wavelength = 678 More Band Samples

Results of Segmentation Threshold = 0.05 Threshold = 0.03 Initial results from region growing

Results of Segmentation Threshold = 0.01 Threshold = Initial results from region growing

Results of Segmentation Threshold = Threshold = Initial results from region growing

After merge small region ( size threshold: 150) Results of Segmentation Threshold = 0.05 Threshold = 0.03

Results of Segmentation After merge small region ( size threshold: 150) Threshold = 0.01 Threshold = 0.005

Results of Segmentation After merge small region ( size threshold: 150) Threshold = Threshold = 0.001

The change of number of regions using different threshold and after merging the small region that contains few number of pixels. Results of Segmentation

Coloured Results: Only 20 regions represented by different colour are remained, by simply merging regions if the regions have similar mean values.

Conclusions Pixel clustering for hyperspectral Ocean image segmentation is presented using seeded region growing. With one key parameter, the segmented results can be adjusted to preserve more or less details in the segmented results. With a size threshold for post-processing, the results can be further refined. The results from the first three bands have suggested great potential of the proposed approach in ocean colour remote sensing. Further investigation includes evaluation of various similarity metrics and statistical analysis of each region.

Thank you for your attention! Any Questions?