Phase Congruency Detects Corners and Edges Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.

Slides:



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

Feature extraction: Corners
Feature Detection. Description Localization More Points Robust to occlusion Works with less texture More Repeatable Robust detection Precise localization.
Scale & Affine Invariant Interest Point Detectors Mikolajczyk & Schmid presented by Dustin Lennon.
Shapelets Correlated with Surface Normals Produce Surfaces Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
Boundary Detection - Edges Boundaries of objects –Usually different materials/orientations, intensity changes.
CSE 473/573 Computer Vision and Image Processing (CVIP)
Interest points CSE P 576 Ali Farhadi Many slides from Steve Seitz, Larry Zitnick.
TP14 - Local features: detection and description Computer Vision, FCUP, 2014 Miguel Coimbra Slides by Prof. Kristen Grauman.
Dan Zhang Supervisor: Prof. Y. Y. Tang 11 th PGDay.
Matching with Invariant Features
Edge and Corner Detection Reading: Chapter 8 (skip 8.1) Goal: Identify sudden changes (discontinuities) in an image This is where most shape information.
Feature extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
Announcements Mailing list: –you should have received messages Project 1 out today (due in two weeks)
Ensemble Tracking Shai Avidan IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE February 2007.
Lecture 4: Feature matching
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2005 with a lot of slides stolen from Steve Seitz and.
Edge Detection Today’s reading Forsyth, chapters 8, 15.1
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)
Edge Detection Today’s readings Cipolla and Gee –supplemental: Forsyth, chapter 9Forsyth Watt, From Sandlot ScienceSandlot Science.
Smart Traveller with Visual Translator for OCR and Face Recognition LYU0203 FYP.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
1 Image Features Hao Jiang Sept Image Matching 2.
CS4670: Computer Vision Kavita Bala Lecture 7: Harris Corner Detection.
Distinctive Image Features from Scale-Invariant Keypoints David G. Lowe – IJCV 2004 Brien Flewelling CPSC 643 Presentation 1.
Computational Photography: Image Processing Jinxiang Chai.
Scale-Invariant Feature Transform (SIFT) Jinxiang Chai.
MASKS © 2004 Invitation to 3D vision Lecture 3 Image Primitives andCorrespondence.
05 - Feature Detection Overview Feature Detection –Intensity Extrema –Blob Detection –Corner Detection Feature Descriptors Feature Matching Conclusion.
Phase: An Important Low-Level Image Invariant Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
Advanced Computer Vision Chapter 4 Feature Detection and Matching Presented by: 傅楸善 & 許承偉
Local invariant features Cordelia Schmid INRIA, Grenoble.
Reporter: Fei-Fei Chen. Wide-baseline matching Object recognition Texture recognition Scene classification Robot wandering Motion tracking.
Discrete Images (Chapter 7) Fourier Transform on discrete and bounded domains. Given an image: 1.Zero boundary condition 2.Periodic boundary condition.
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
Correspondence-Free Determination of the Affine Fundamental Matrix (Tue) Young Ki Baik, Computer Vision Lab.
EDGE DETECTION IN COMPUTER VISION SYSTEMS PRESENTATION BY : ATUL CHOPRA JUNE EE-6358 COMPUTER VISION UNIVERSITY OF TEXAS AT ARLINGTON.
CSE 185 Introduction to Computer Vision Local Invariant Features.
CSCE 643 Computer Vision: Extractions of Image Features Jinxiang Chai.
Local invariant features Cordelia Schmid INRIA, Grenoble.
Harris Corner Detector & Scale Invariant Feature Transform (SIFT)
Autonomous Robots Vision © Manfred Huber 2014.
Features, Feature descriptors, Matching Jana Kosecka George Mason University.
A Tutorial on using SIFT Presented by Jimmy Huff (Slightly modified by Josiah Yoder for Winter )
Lecture 10: Lines from Edges, Interest Points, Binary Operations CAP 5415: Computer Vision Fall 2006.
CS654: Digital Image Analysis
Course 5 Edge Detection. Image Features: local, meaningful, detectable parts of an image. edge corner texture … Edges: Edges points, or simply edges,
Lecture 04 Edge Detection Lecture 04 Edge Detection Mata kuliah: T Computer Vision Tahun: 2010.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Digital Image Processing CSC331
CSE 185 Introduction to Computer Vision Local Invariant Features.
MASKS © 2004 Invitation to 3D vision Lecture 3 Image Primitives andCorrespondence.
SIFT.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
SIFT Scale-Invariant Feature Transform David Lowe
Interest Points EE/CSE 576 Linda Shapiro.
Distinctive Image Features from Scale-Invariant Keypoints
TP12 - Local features: detection and description
Local features: detection and description May 11th, 2017
Image Primitives and Correspondence
CAP 5415 Computer Vision Fall 2012 Dr. Mubarak Shah Lecture-5
From a presentation by Jimmy Huff Modified by Josiah Yoder
Presented by :- Vishal Vijayshankar Mishra
Aim of the project Take your image Submit it to the search engine
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
SIFT.
Feature Detection .
Edge Detection Today’s readings Cipolla and Gee Watt,
Corner Detection COMP 4900C Winter 2008.
Presentation transcript:

Phase Congruency Detects Corners and Edges Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia

Why We Want Corners Advances in reconstruction algorithms have renewed our interest in, and reliance on, the detection of feature points or ‘corners’. Pollefeys’ castle

What’s the Problem? Current corner detectors do not work reliably with images of varying lighting and contrast. Localization of features can be inaccurate and depends on the scale of analysis.

Harris Operator Form the gradient covariance matrix where and are image gradients in x and y A corner occurs when eigenvalues are similar and large. Corner strength is given by (k = 0.04) Note that R has units (intensity gradient) 4

Test imageFourth root of Harris corner strength (Max value is ~1.5x10 10 ) The Harris operator is very sensitive to local contrast

Harris corners,  = 1Harris corners,  = 7 The location of Harris corners is sensitive to scale

Gradient based operators are sensitive to illumination variations and do not localize accurately or consistently. As a consequence, successful 3D reconstruction from matched corner points requires extensive outlier removal and the application of robust estimation techniques.

Gradient based operators are sensitive to illumination variations and do not localize accurately or consistently. As a consequence, successful 3D reconstruction from matched corner points requires extensive outlier removal and the application of robust estimation techniques. To minimize these problems we need a feature operator that is maximally invariant to illumination and scale.

Features are Perceived at Points of Phase Congruency The Fourier components are all in phase at the point of the step in the square wave, and at the peaks and troughs of the triangular wave. This property is stable over scale. Don’t think of features in terms of derivatives! Think of features in terms of local frequency components.

Phase Congruency Models a Wide Range of Feature Types A continuum of feature types from step to line can be obtained by varying the phase offset. Sharpness is controlled by amplitude decay. phase offset amplitude decay with frequency

Congruency of Phase at any Angle Produces a Feature Canny Interpolation of a step to a line by varying from 0 at the top to at the bottom A gradient based operator will not correctly locate non-step features. The location will also be scale dependent.

Measuring Phase Congruency Polar diagram of local Fourier components at a location x plotted head to tail: Amplitude Phase Local Energy Phase Congruency is the ratio x

Canny edge map A gradient based operator merely marks points of maximum gradient. Note the doubled response around the sphere and the confused torus boundary. Failure of a gradient operator on a simple synthetic image… Section A-A Section B-B

Feature classifications Phase Congruency edge map Test grating

Implementation Local frequency information is obtained by applying quadrature pairs of log-Gabor filters over six orientations and 3-4 scales (typically). cosine Gabor sine Gabor

Implementation Local frequency information is obtained by applying quadrature pairs of log-Gabor filters over six orientations and 3-4 scales (typically). Phase Congruency values are calculated for every orientation - how do we combine this information?

where PC x and PC y are the x and y components of Phase Congruency for each orientation. The minimum and maximum singular values correspond to the minimum and maximum moments of Phase Congruency. Detecting Corners and Edges At each point in the image compute the Phase Congruency covariance matrix.

The magnitude of the maximum moment, M, gives an indication of the significance of the feature. If the minimum moment, m, is also large we have an indication that the feature has a strong 2D component and can be classified as a corner. The principal axis, about which the moment is minimized, provides information about the orientation of the feature. m M

Comparison with Harris Operator The minimum and maximum values of the Phase Congruency singular values/moments are bounded to the range 0-1 and are dimensionless. This provides invariance to illumination and contrast. Phase Congruency moment values can be used directly to determine feature significance. Typically a threshold of can be used. Eigenvalues/Singular values of a gradient covariance matrix are unbounded and have units (gradient) 4 - the cause of the difficulties with the Harris operator.

Edge strength - given by magnitude of maximum Phase Congruency moment. Corner strength - given by magnitude of minimum Phase Congruency moment.

Phase Congruency corners thresholded at 0.4

Image with strong shadows Fourth root of Harris corner strength (max value ~1.25x10 10 )

Phase Congruency edge strength (max possible value = 1.0) Phase Congruency corner strength (max possible value = 1.0)

Phase Congruency corners thresholded at 0.4 Harris corners thresholded at 10 8 (max corner strength ~1.25x10 10 )

Conclusions Gradient based operators are sensitive to illumination variations and do not localize accurately or consistently.

Conclusions Gradient based operators are sensitive to illumination variations and do not localize accurately or consistently. Phase Congruency allows a wide range of feature types to be detected within the framework of a single model.

Conclusions Gradient based operators are sensitive to illumination variations and do not localize accurately or consistently. Phase Congruency allows a wide range of feature types to be detected within the framework of a single model. Phase Congruency is a dimensionless quantity, invariant to contrast and scale. Features can be tracked over extended sequences more reliably.

Conclusions Gradient based operators are sensitive to illumination variations and do not localize accurately or consistently. Phase Congruency allows a wide range of feature types to be detected within the framework of a single model. Phase Congruency is a dimensionless quantity, invariant to contrast and scale. Features can be tracked over extended sequences more reliably. The Phase Congruency corner map is a strict subset of the edge map. This simplifies the integration of data computed from edge and corner information.

Conclusions Gradient based operators are sensitive to illumination variations and do not localize accurately or consistently. Phase Congruency allows a wide range of feature types to be detected within the framework of a single model. Phase Congruency is a dimensionless quantity, invariant to contrast and scale. Features can be tracked over extended sequences more reliably. The Phase Congruency corner map is a strict subset of the edge map. This simplifies the integration of data computed from edge and corner information. Current work is directed at using phase data at feature points as signature vectors for matching.