La Parguera Hyperspectral Image size (250x239x118) using Hyperion sensor. INTEREST POINTS FOR HYPERSPECTRAL IMAGES Amit Mukherjee 1, Badrinath Roysam 1,

Slides:



Advertisements
Similar presentations
Distinctive Image Features from Scale-Invariant Keypoints
Advertisements

Feature Detection. Description Localization More Points Robust to occlusion Works with less texture More Repeatable Robust detection Precise localization.
Distinctive Image Features from Scale-Invariant Keypoints David Lowe.
CSCE 643 Computer Vision: Template Matching, Image Pyramids and Denoising Jinxiang Chai.
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
Features Induction Moravec Corner Detection
Outline Feature Extraction and Matching (for Larger Motion)
CSE 473/573 Computer Vision and Image Processing (CVIP)
Distinctive Image Features from Scale- Invariant Keypoints Mohammad-Amin Ahantab Technische Universität München, Germany.
Instructor: Mircea Nicolescu Lecture 15 CS 485 / 685 Computer Vision.
Content Based Image Retrieval
Lecture 6: Feature matching CS4670: Computer Vision Noah Snavely.
A Study of Approaches for Object Recognition
Distinctive Image Feature from Scale-Invariant KeyPoints
Feature extraction: Corners and blobs
Distinctive image features from scale-invariant keypoints. David G. Lowe, Int. Journal of Computer Vision, 60, 2 (2004), pp Presented by: Shalomi.
Scale Invariant Feature Transform (SIFT)
Automatic Matching of Multi-View Images
SIFT - The Scale Invariant Feature Transform Distinctive image features from scale-invariant keypoints. David G. Lowe, International Journal of Computer.
1 Invariant Local Feature for Object Recognition Presented by Wyman 2/05/2006.
776 Computer Vision Jan-Michael Frahm, Enrique Dunn Spring 2013.
Distinctive Image Features from Scale-Invariant Keypoints David G. Lowe – IJCV 2004 Brien Flewelling CPSC 643 Presentation 1.
Scale-Invariant Feature Transform (SIFT) Jinxiang Chai.
Overview Introduction to local features
Interest Point Descriptors
Distinctive Image Features from Scale-Invariant Keypoints By David G. Lowe, University of British Columbia Presented by: Tim Havinga, Joël van Neerbos.
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
Computer vision.
Bag of Visual Words for Image Representation & Visual Search Jianping Fan Dept of Computer Science UNC-Charlotte.
Top-points in Image Matching Bram Platel Evgenya Balmashnova Luc Florack Bart ter Haar Romeny.
Overview Harris interest points Comparing interest points (SSD, ZNCC, SIFT) Scale & affine invariant interest points Evaluation and comparison of different.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Lecture 06 06/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Reporter: Fei-Fei Chen. Wide-baseline matching Object recognition Texture recognition Scene classification Robot wandering Motion tracking.
Chapter 21 R(x) Algorithm a) Anomaly Detection b) Matched Filter.
776 Computer Vision Jan-Michael Frahm Fall SIFT-detector Problem: want to detect features at different scales (sizes) and with different orientations!
CVPR 2003 Tutorial Recognition and Matching Based on Local Invariant Features David Lowe Computer Science Department University of British Columbia.
A Study on the Effect of Spectral Signature Enhancement in Hyperspectral Image Unmixing UNDERGRADUATE RESEARCH Student: Ms. Enid Marie Alvira-Concepción.
CSCE 643 Computer Vision: Extractions of Image Features Jinxiang Chai.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Distinctive Image Features from Scale-Invariant Keypoints Ronnie Bajwa Sameer Pawar * * Adapted from slides found online by Michael Kowalski, Lehigh University.
Bart M. ter Haar Romeny.  Question: can top-points be used for object- retrieval tasks?
Harris Corner Detector & Scale Invariant Feature Transform (SIFT)
Distinctive Image Features from Scale-Invariant Keypoints David Lowe Presented by Tony X. Han March 11, 2008.
Feature extraction: Corners and blobs. Why extract features? Motivation: panorama stitching We have two images – how do we combine them?
A Tutorial on using SIFT Presented by Jimmy Huff (Slightly modified by Josiah Yoder for Winter )
Presented by David Lee 3/20/2006
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
Distinctive Image Features from Scale-Invariant Keypoints Presenter :JIA-HONG,DONG Advisor : Yen- Ting, Chen 1 David G. Lowe International Journal of Computer.
Blob detection.
The MATLAB Hyperspectral Image Analysis Toolbox
SIFT Scale-Invariant Feature Transform David Lowe
CS262: Computer Vision Lect 09: SIFT Descriptors
Interest Points EE/CSE 576 Linda Shapiro.
Distinctive Image Features from Scale-Invariant Keypoints
Scale Invariant Feature Transform (SIFT)
CS262 – Computer Vision Lect 08: SIFT Keypoint Detection
Marked Point Processes for Crowd Counting
CAP 5415 Computer Vision Fall 2012 Dr. Mubarak Shah Lecture-5
CSDD Features: Center-Surround Distribution Distance
From a presentation by Jimmy Huff Modified by Josiah Yoder
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
Efficient Receptive Field Tiling in Primate V1
SIFT SIFT is an carefully designed procedure with empirically determined parameters for the invariant and distinctive features.
Presented by Xu Miao April 20, 2005
Efficient Receptive Field Tiling in Primate V1
Presentation transcript:

La Parguera Hyperspectral Image size (250x239x118) using Hyperion sensor. INTEREST POINTS FOR HYPERSPECTRAL IMAGES Amit Mukherjee 1, Badrinath Roysam 1, Miguel Vélez-Reyes 2 1 Rensselaer Polytechnic Institute, 2 University of Puerto Rico at Mayaguez GOAL Earth Mover’s Distance Interest points illustration “ This work was supported in part by CenSSIS, the Center for Subsurface Sensing and Imaging Systems, under the Engineering Research Centers Program of the National Science Foundation (Award Number EEC )." ACKNOWLEDGEMENTS The idea of interest point detection is extended from monochromatic (grayscale) images to multi-spectral and hyper-spectral images, where the structural information is distributed over several bands or layers. RELEVANCE TO CENSSIS An attempt to extend/generalize the CenSSIS registration tool to hyperspectral images by computing stable interest points. References Lowe, “ Distinctive Image Featuresfrom Scale-Invariant Keypoints ”, International Journal of Computer Vision, Mikolajczyk et al. “ Scale and affine invariant interest point detectors ”. International Journal of Computer Vision, Volume 60, Number 1, Harris-Stephens, “ A Combined Corner and Edge Detector ”, In Proc. of the 4th Alvey Vision Conference, pp , Sept Rubner, Tomasi, et. al. “ The Earth Mover ’ s Distance as a Metric for Image Retrieval ”. International Journal of Computer Vision 40(2), 99 – 121, Stability of EMD in presence of noise The figure shows the stability of the EMD in retaining the rank-order of the distances between a group of spectra, as a function of the variance of additive noise added to each spectrum. The comparison with Euclidean, Spectral Angle Mapper (SAM) and Spectral information Divergence (SID) clearly shows that EMD is more consistent in handling noisy spectra. IP Detection Framework Hyperspectral image data Compaction of structural information (PCA projection) Scale space representation of the multiple projections using s-LOG filters Scale-Space Extrema Detection (Sub-Pixel and Sub-Scale Interpolation) Thresholds Interest points  Hyperspectral data is projected on the directions of top N principal directions (spanning highest N variances).  The normalized projections are fed to s-LOG filters which maps the data in where the spatial dimension is 2, is the number of projections used and indicate the positive real axis for scale.  The extrema in scale-space is detected, followed by subpixel and subscale interpolation using second order Taylor series expansion.  Empirical thresholds on the Gaussian curvature and the ratio of Principal curvatures along space give the interest points. s-LOG filters (splitted Laplacian of Gaussian filters) s-LOG are derived from a Laplacian of Gaussian with a variable width. Shown in (a) are positive and the negative coefficients in light and dark shades respectively of a LOG filter with 1 standard deviation. This filter is split into two parts based on the sign of the coefficients and then normalized to unit weights. Panel (b) shows s-LOG+ filter formed by using only the positive coefficients of LOG in 2D. (c) s-LOG- formed by using only the negative coefficients of LOG in 2D. These filters are applied on each layer of the projection. Two pixel vectors are formed by stacking the N responses of the s-LOG+ and s-LOG- at each pixel location. The spectral distance between these vectors (using the modified Earth Mover ’ s distance) give the response of the s-LOG filter at that pixel location. The EMD between two spectra and is defined in terms of an optimal flow which minimizes, Subject to and is some measure of dissimilarity between the bin and, and is the number of spectral bands. Then the Earth Mover ’ s distance between and for the optimal flow as Fast implementation of EMD for unequal total mass EMD is not a true metric when the sum total mass of the spectra are not equal. This overcome by moving the equilibrium point of mass transfer from zero to a finite value, which is the difference between the sum total mass of the spectra. The steps are shown in figure for sample spectra and. Also, the number of variables in the mass flow can be reduced to half by the operations shown in figure. Also, we use the EMD without normalization by the total flow, since this the total flow changes with the sum total mass. Spectral descriptors The structure of the spectral descriptor. (a) Shows the spatial and spectral structure of the descriptor. Spatially, it has a central region enclosed by eight radial regions as shown in part (a). The spectral dimension is binned and normalized. (b) Shows the overlapping weights that are used to sample the eight radial bins. The figure above shows Key point matching using Lowe [1] on each of the projections of the hyperspectral image. The figure in the left shows the repeatability performance of the interest points for different distance measure used in the s-LOG filters on the La Parguera dataset. The left column shows matching of top 100 strongest IPs while the right column shows the matching of top 200 strongest IPs. The interpolation in the top row is done independently in scale and space, while in the bottom row is done jointly. The results of matching IPS for independent and joint scale-space interpolation as compared to no interpolation. The distance measure used in the s- LOG implementation is the modified EMD. The results show that interpolation improves the % of matched IPs. Evaluation of spectral descriptors,: Shows the number of correct recalls for the number of possible matches when the top-N IPs were evaluated between the two images. The top row shows all those IPs that are matching in scale and space of the top-300 interest points using the proposed algorithm, while the bottom row shows all the top-300 IPs of La Parguera at 2002 (right) and La Parguera at 2003 (left). The IPs are overlaid on the RGB projection of the hyperspectral image. The circle around each IP indicates the scale at which it is detected.