Scale Space and PDE methods in image analysis and processing. Arjan Kuijper
|
|
- Buddy Cobb
- 6 years ago
- Views:
Transcription
1 Scale Space and PDE methods in image analysis and processing Arjan Kuijper Fraunhofer Institute for Computer Graphics Research Interactive Graphics Systems Group, TU Darmstadt Fraunhoferstrasse 5, Darmstadt, Germany Tel.: +49 (0) Fax.: +49 (0) Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 1/24
2 Summary of the previous week The differential structure of images Differential image structure Isophotes and flow lines Coordinate systems and transformations First order gauge coordinates: (u,w) - system Gauge coordinate invariants: examples Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 2/24
3 Today 1 left over part The differential structure of images Second order structure Principal curvatures Shape index Third order image structure: T-junction detection Fourth order image structure: junction detection Scale invariance and natural coordinates Irreducible invariants Taken from B. M. ter Haar Romeny, Front-End Vision and Multi-scale Image Analysis, Dordrecht, Kluwer Academic Publishers, Chapter 6 Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 3/24
4 Second order structure At any point on the surface we can step into an infinite number of directions away from the point, and in each direction we can define a curvature. So in each point an infinite number of curvatures can be defined. When we smoothly change direction, there are two (opposite) directions where the curvature is maximal, and there are two (opposite) directions where the curvature is minimal. These directions are perpendicular to each other, and the extremal curvatures are called the principal curvatures. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 4/24
5 The Hessian matrix and principal curvatures The Hessian matrix is the gradient of the gradient vectorfield. The coefficients form the second order structure matrix. The Hessian matrix is square and symmetric, so we can bring it in diagonal form by calculating the Eigenvalues of the matrix and put these on the diagonal elements. 1 2 L xx L yy L 2 xx 4L 2 xy 2L xx L yy L 2 yy,0, 0, 1 2 L xx L yy L 2 xx 4L 2 xy 2L xx L yy L 2 yy These special values are the principal curvatures of that point of the surface. In the diagonal form the Hessian matrix is rotated in such a way, that the curvatures are maximal and minimal. The principal curvature directions are given by the Eigenvectors of the Hessian matrix. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 5/24
6 The shape index For the two principal curvatures the shape index is given by (k 1 k 2 ) shapeindex ª 2 p arctan k 1 +k 2 k 1 -k 2 k 1 k 2 shapeindex ª 2 p arctan -L xx - L yy L xx L xy 2-2 L xx L yy + L yy 2 The length of the vector defines how curved a shape is, definition of curvedness curvedness ª 1 1 k k 2 L xx 2L 2 xy L2 yy Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 6/24
7 Shape index The shape index runs from -1 (cup) via the shapes trough, rut (k 1 =0), and saddle rut to zero, the saddle, and the goes via saddle ridge, ridge (k 2 =0), and dome to the value of +1, the cap. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 7/24
8 Shape index Example: shape index and curvedness Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 8/24
9 Principal directions The principal curvature directions are given by the Eigenvectors of the Hessian matrix: L xx L yy L 2 xx 4L 2 xy 2L xx L yy L2 yy,1, 2L xy L xx L yy L 2 xx 4L 2 xy 2L xx L yy L2 yy,1 2L xy The local principal direction vectors form locally a frame. We orient the frame in such a way that the largest Eigenvalue (maximal principal curvature) is one direction, the minimal principal curvature direction is p/2 rotated clockwise. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 9/24
10 Principal directions Frames of the normalized principal curvature directions at a scale of 1 pixel. Green: maximal principal curvature direction; Red: minimal principal curvature direction. The principal curvatures have been employed in studies to the 2D and 3D structure of trabecular bone & blood vessels. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 10/24
11 Gaussian and mean curvature The Gaussian curvature K is defined as the product of the two principal curvatures. The Gaussian curvature is equal to the determinant of the Hessian matrix: L 2 xy L xx L yy Left: Gaussian curvature K for an MR image at a scale of 5 pixels. Middle: sign of K. Right: zerocrossings of K. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 11/24
12 Gaussian and mean curvature The mean curvature is defined as the arithmetic mean of the principal curvatures. The mean curvature is related to the trace of the Hessian matrix: 1 2 L xx L yy The directional derivatives of the principal curvatures in the direction of the principal directions are called the extremalities The product of the two extremalities is called the Gaussian extremality, a true local invariant. The boundaries of the regions where the Gaussian extremality changes sign, are the extremal lines. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 12/24
13 A rather complicated expression L 2 2 xy L xxx 2 2L xxx L xyy 3 L xxy 2 L xyy L xxx L xyy L xx L yy 2 2 L xxy 2L xy L xyy L yy 2L xxx L xxy L xy L xx L yy L xx 2L xx L xy L xyy L xxy L yy L xxy 2L 2 xy L 2 yy L yyy L 2 2 xy L yyy L 2 xx 4L 2 xy 2L xx L yy L 2 yy but useful for e.g. brain matching Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 13/24
14 Third order image structure: T-junction detection T-junctions in the intensity landscape of natural images occur typically at occlusion points. Occlusion points are those points where a contour ends or emerges because there is another object in front of the contour. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 14/24
15 Third order image structure: T-junction detection When we zoom in on the T-junction of an observed image and inspect locally the isophote structure at a T-junction, we see that at a T-junction the derivative of the isophote curvature k in the direction perpendicular to the isophotes is high. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 15/24
16 Third order image structure: T-junction detection When we study the curvature of the isophotes in the middle of the image, at the location of the T-junction, we see the isophote 'sweep' from highly curved to almost straight for decreasing intensity. So the geometric reasoning is the "the isophote curvature changes a lot when we traverse the image in the w direction". It seems to make sense to study 1 L2 x L y2 3 L xxy L 5 y L 4 x 2L 2 xy L x L xyy L xx L yy L 4 y 2L 2 xy L x L xxx 2L xyy L xx L yy L 2 x L 2 y 3L 2 xx 8L 2 xy L x L xxx L xyy 4L xx L yy 3L yy L 3 x L y 6L xy L xx L yy L x 2L xxy L yyy L x L y 3 6L xy L xx L yy L x L xxy L yyy 2 Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 16/24
17 Third order image structure: T-junction detection To avoid singularities at vanishing gradients through the division by L 2 x + L 2 y 3 6 = L w we use as our T-junction detector: t= k w L w 6 Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 17/24
18 Fourth order image structure: junction detection Yet another order higher: Find in a checkerboard the crossings where 4 edges meet. When we study the fourth order local image structure, we consider the fourth order polynomial terms from the local Taylor expansion. The main theorem of algebra states that a polynomial is fully described by its roots. How well all roots coincide, given by the discriminant, is a particular invariant condition. The discriminant of second order image structure is just the determinant of the Hessian matrix, i.e. the Gaussian curvature. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 18/24
19 Fourth order image structure: junction detection The forth order discriminant is slightly more complicated: Lxxxy 4 Lyyyy 2 Lxxxy 3 64 Lxyyy Lxxyy Lxyyy Lyyyy 12 Lxxxx Lxxxy Lxyyy 9 Lxxyy Lxyyy 2 15 Lxxyy 2 Lyyyy Lxxxx Lyyyy 2 6 Lxxxy 2 6 Lxxyy 2 Lxyyy 2 9 Lxxyy 3 Lyyyy Lxxxx Lxyyy 2 Lyyyy 9 Lxxxx Lxxyy Lyyyy 2 Lxxxx 54 Lxxyy 3 Lxyyy 2 81 Lxxyy 4 Lyyyy 54 Lxxxx Lxxyy Lxyyy 2 Lyyyy 18 Lxxxx Lxxyy 2 Lyyyy 2 Lxxxx 27 Lxyyy 4 Lxxxx Lyyyy 3 Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 19/24
20 Scale invariance and natural coordinates The dimensionless coordinate is termed the natural coordinate. This implies that the derivative operator in natural coordinates has a scaling factor: n n x`n Øsn x n Compare L w and the natural L w : Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 20/24
21 Irreducible invariants It has been shown by Hilbert that any invariant of finite order can be expressed as a polynomial function of a set of irreducible invariants. For e.g. scalar images these invariants form the fundamental set of image primitives in which all local intrinsic properties can be described. There are only a small number of irreducible invariants for low order. E.g. for 2D images up to second order there are only 5 of such irreducibles. One mechanism to find the irreducible set are gauge coordinates: Zeroth order First order Second order L Lw Lvv, Lvw, Lww Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 21/24
22 Tensors There are many ways to set up an irreducible basis. In tensor notation, tensor indices denote partial derivatives and run over the dimensions D L ii = i=x When indices come in pairs, summation over the dimensions is implied (the so-called Einstein summation convention, or contraction) Zeroth order L ii = L xx + L yy L First order Li Li (= Lx Lx + Ly Ly, the gradient) Second order Lii (= Lxx+ Ly y, the Laplacian) Li j L ji Li Li j L j (= Lxx Lx y 2 + Ly y 2, the 'deviation from flatness'), (= Lx 2 Lxx+ 2 Lx Ly Lx y+ Ly 2 Ly y, 'curvature') Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 22/24
23 Tensors Each of these irreducible invariants cannot be expressed in the others. Any invariant property to some finite order can be expressed as a combination of these irreducibles. Isophote curvature, a second order local invariant feature, is expressed as k=-l vv L w These irreducibles form a basis for the differential invariant structure. The set of 5 irreducible gray value invariants in 2D images has been exploited to classify local image structure for statistical object recognition. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 23/24
24 Summary Invariant differential feature detectors are special (mostly) polynomial combinations of image derivatives, which exhibit invariance under some chosen group of transformations. The derivatives are easily calculated from the image through the multi-scale Gaussian derivative kernels. The notion of invariance is crucial for geometric relevance; Non-invariant properties have no value in general feature detection tasks. A convenient paradigm to calculate features invariant under Euclidean coordinate transformations is the notion of gauge coordinates (v,w). Any combination of derivatives with respect to v and w is invariant under Euclidean transformations. The second order derivatives yield isophote and flow line curvature, cornerness; the third order derivatives gives T-junction detection in this framework, etc. Scale Space and PDE methods in image analysis and processing - Arjan Kuijper 24/24
Fraunhofer Institute for Computer Graphics Research Interactive Graphics Systems Group, TU Darmstadt Fraunhoferstrasse 5, Darmstadt, Germany
20-00-469 Scale Space and PDE methods in image analysis and processing Arjan Kuijper Fraunhofer Institute for Computer Graphics Research Interactive Graphics Systems Group, TU Darmstadt Fraunhoferstrasse
More informationOutline 7/2/201011/6/
Outline Pattern recognition in computer vision Background on the development of SIFT SIFT algorithm and some of its variations Computational considerations (SURF) Potential improvement Summary 01 2 Pattern
More informationLine, edge, blob and corner detection
Line, edge, blob and corner detection Dmitri Melnikov MTAT.03.260 Pattern Recognition and Image Analysis April 5, 2011 1 / 33 Outline 1 Introduction 2 Line detection 3 Edge detection 4 Blob detection 5
More informationScott Smith Advanced Image Processing March 15, Speeded-Up Robust Features SURF
Scott Smith Advanced Image Processing March 15, 2011 Speeded-Up Robust Features SURF Overview Why SURF? How SURF works Feature detection Scale Space Rotational invariance Feature vectors SURF vs Sift Assumptions
More informationEdge and corner detection
Edge and corner detection Prof. Stricker Doz. G. Bleser Computer Vision: Object and People Tracking Goals Where is the information in an image? How is an object characterized? How can I find measurements
More informationImage features. Image Features
Image features Image features, such as edges and interest points, provide rich information on the image content. They correspond to local regions in the image and are fundamental in many applications in
More informationProblems with template matching
Problems with template matching The template represents the object as we expect to find it in the image The object can indeed be scaled or rotated This technique requires a separate template for each scale
More informationBSB663 Image Processing Pinar Duygulu. Slides are adapted from Selim Aksoy
BSB663 Image Processing Pinar Duygulu Slides are adapted from Selim Aksoy Image matching Image matching is a fundamental aspect of many problems in computer vision. Object or scene recognition Solving
More informationImage Analysis - Lecture 5
Texture Segmentation Clustering Review Image Analysis - Lecture 5 Texture and Segmentation Magnus Oskarsson Lecture 5 Texture Segmentation Clustering Review Contents Texture Textons Filter Banks Gabor
More informationSegmentation and Grouping
Segmentation and Grouping How and what do we see? Fundamental Problems ' Focus of attention, or grouping ' What subsets of pixels do we consider as possible objects? ' All connected subsets? ' Representation
More informationScale Invariant Feature Transform by David Lowe
Scale Invariant Feature Transform by David Lowe Presented by: Jerry Chen Achal Dave Vaishaal Shankar Some slides from Jason Clemons Motivation Image Matching Correspondence Problem Desirable Feature Characteristics
More informationBiometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)
Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) References: [1] http://homepages.inf.ed.ac.uk/rbf/hipr2/index.htm [2] http://www.cs.wisc.edu/~dyer/cs540/notes/vision.html
More informationAugmented Reality VU. Computer Vision 3D Registration (2) Prof. Vincent Lepetit
Augmented Reality VU Computer Vision 3D Registration (2) Prof. Vincent Lepetit Feature Point-Based 3D Tracking Feature Points for 3D Tracking Much less ambiguous than edges; Point-to-point reprojection
More informationMinima, Maxima, Saddle points
Minima, Maxima, Saddle points Levent Kandiller Industrial Engineering Department Çankaya University, Turkey Minima, Maxima, Saddle points p./9 Scalar Functions Let us remember the properties for maxima,
More informationImage Processing. Image Features
Image Processing Image Features Preliminaries 2 What are Image Features? Anything. What they are used for? Some statements about image fragments (patches) recognition Search for similar patches matching
More informationEstimating normal vectors and curvatures by centroid weights
Computer Aided Geometric Design 21 (2004) 447 458 www.elsevier.com/locate/cagd Estimating normal vectors and curvatures by centroid weights Sheng-Gwo Chen, Jyh-Yang Wu Department of Mathematics, National
More information3.3 Optimizing Functions of Several Variables 3.4 Lagrange Multipliers
3.3 Optimizing Functions of Several Variables 3.4 Lagrange Multipliers Prof. Tesler Math 20C Fall 2018 Prof. Tesler 3.3 3.4 Optimization Math 20C / Fall 2018 1 / 56 Optimizing y = f (x) In Math 20A, we
More informationMotion Estimation and Optical Flow Tracking
Image Matching Image Retrieval Object Recognition Motion Estimation and Optical Flow Tracking Example: Mosiacing (Panorama) M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 2003 Example 3D Reconstruction
More informationVisual Tracking (1) Tracking of Feature Points and Planar Rigid Objects
Intelligent Control Systems Visual Tracking (1) Tracking of Feature Points and Planar Rigid Objects Shingo Kagami Graduate School of Information Sciences, Tohoku University swk(at)ic.is.tohoku.ac.jp http://www.ic.is.tohoku.ac.jp/ja/swk/
More informationCS 556: Computer Vision. Lecture 3
CS 556: Computer Vision Lecture 3 Prof. Sinisa Todorovic sinisa@eecs.oregonstate.edu Interest Points Harris corners Hessian points SIFT Difference-of-Gaussians SURF 2 Properties of Interest Points Locality
More informationLocal features: detection and description. Local invariant features
Local features: detection and description Local invariant features Detection of interest points Harris corner detection Scale invariant blob detection: LoG Description of local patches SIFT : Histograms
More informationImage matching. Announcements. Harder case. Even harder case. Project 1 Out today Help session at the end of class. by Diva Sian.
Announcements Project 1 Out today Help session at the end of class Image matching by Diva Sian by swashford Harder case Even harder case How the Afghan Girl was Identified by Her Iris Patterns Read the
More information2 Second Derivatives. As we have seen, a function f (x, y) of two variables has four different partial derivatives: f xx. f yx. f x y.
2 Second Derivatives As we have seen, a function f (x, y) of two variables has four different partial derivatives: (x, y), (x, y), f yx (x, y), (x, y) It is convenient to gather all four of these into
More informationModel-based segmentation and recognition from range data
Model-based segmentation and recognition from range data Jan Boehm Institute for Photogrammetry Universität Stuttgart Germany Keywords: range image, segmentation, object recognition, CAD ABSTRACT This
More informationWikipedia - Mysid
Wikipedia - Mysid Erik Brynjolfsson, MIT Filtering Edges Corners Feature points Also called interest points, key points, etc. Often described as local features. Szeliski 4.1 Slides from Rick Szeliski,
More informationSIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014
SIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014 SIFT SIFT: Scale Invariant Feature Transform; transform image
More informationHarder case. Image matching. Even harder case. Harder still? by Diva Sian. by swashford
Image matching Harder case by Diva Sian by Diva Sian by scgbt by swashford Even harder case Harder still? How the Afghan Girl was Identified by Her Iris Patterns Read the story NASA Mars Rover images Answer
More informationAn Efficient Single Chord-based Accumulation Technique (SCA) to Detect More Reliable Corners
An Efficient Single Chord-based Accumulation Technique (SCA) to Detect More Reliable Corners Mohammad Asiful Hossain, Abdul Kawsar Tushar, and Shofiullah Babor Computer Science and Engineering Department,
More informationCAP 5415 Computer Vision Fall 2012
CAP 5415 Computer Vision Fall 01 Dr. Mubarak Shah Univ. of Central Florida Office 47-F HEC Lecture-5 SIFT: David Lowe, UBC SIFT - Key Point Extraction Stands for scale invariant feature transform Patented
More informationHarder case. Image matching. Even harder case. Harder still? by Diva Sian. by swashford
Image matching Harder case by Diva Sian by Diva Sian by scgbt by swashford Even harder case Harder still? How the Afghan Girl was Identified by Her Iris Patterns Read the story NASA Mars Rover images Answer
More informationEdge and local feature detection - 2. Importance of edge detection in computer vision
Edge and local feature detection Gradient based edge detection Edge detection by function fitting Second derivative edge detectors Edge linking and the construction of the chain graph Edge and local feature
More informationSUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS
SUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS Cognitive Robotics Original: David G. Lowe, 004 Summary: Coen van Leeuwen, s1460919 Abstract: This article presents a method to extract
More informationThe differential structure of images Prof. Bart M. ter Haar Romeny, PhD
The differential structure of images Prof. Bart M. ter Haar Romeny, PhD Brainnetome Workshop 9-10 October 015, Beijing, China Init The 1-D Gaussian kernel: gauss[x_, Σ_ /; Σ > 0] := Σ 1 Π e - x Σ ; The
More informationFeature Detection. Raul Queiroz Feitosa. 3/30/2017 Feature Detection 1
Feature Detection Raul Queiroz Feitosa 3/30/2017 Feature Detection 1 Objetive This chapter discusses the correspondence problem and presents approaches to solve it. 3/30/2017 Feature Detection 2 Outline
More informationVisual Tracking (1) Pixel-intensity-based methods
Intelligent Control Systems Visual Tracking (1) Pixel-intensity-based methods Shingo Kagami Graduate School of Information Sciences, Tohoku University swk(at)ic.is.tohoku.ac.jp http://www.ic.is.tohoku.ac.jp/ja/swk/
More informationFiltering Images. Contents
Image Processing and Data Visualization with MATLAB Filtering Images Hansrudi Noser June 8-9, 010 UZH, Multimedia and Robotics Summer School Noise Smoothing Filters Sigmoid Filters Gradient Filters Contents
More informationLECTURE 18 - OPTIMIZATION
LECTURE 18 - OPTIMIZATION CHRIS JOHNSON Abstract. In this lecture we ll describe extend the optimization techniques you learned in your first semester calculus class to optimize functions of multiple variables.
More information(1) Given the following system of linear equations, which depends on a parameter a R, 3x y + 5z = 2 4x + y + (a 2 14)z = a + 2
(1 Given the following system of linear equations, which depends on a parameter a R, x + 2y 3z = 4 3x y + 5z = 2 4x + y + (a 2 14z = a + 2 (a Classify the system of equations depending on the values of
More informationDigital Image Processing Fundamentals
Ioannis Pitas Digital Image Processing Fundamentals Chapter 7 Shape Description Answers to the Chapter Questions Thessaloniki 1998 Chapter 7: Shape description 7.1 Introduction 1. Why is invariance to
More informationCS5670: Computer Vision
CS5670: Computer Vision Noah Snavely Lecture 4: Harris corner detection Szeliski: 4.1 Reading Announcements Project 1 (Hybrid Images) code due next Wednesday, Feb 14, by 11:59pm Artifacts due Friday, Feb
More informationEdge Detection. CS664 Computer Vision. 3. Edges. Several Causes of Edges. Detecting Edges. Finite Differences. The Gradient
Edge Detection CS664 Computer Vision. Edges Convert a gray or color image into set of curves Represented as binary image Capture properties of shapes Dan Huttenlocher Several Causes of Edges Sudden changes
More information9 length of contour = no. of horizontal and vertical components + ( 2 no. of diagonal components) diameter of boundary B
8. Boundary Descriptor 8.. Some Simple Descriptors length of contour : simplest descriptor - chain-coded curve 9 length of contour no. of horiontal and vertical components ( no. of diagonal components
More informationCHAPTER VIII SEGMENTATION USING REGION GROWING AND THRESHOLDING ALGORITHM
CHAPTER VIII SEGMENTATION USING REGION GROWING AND THRESHOLDING ALGORITHM 8.1 Algorithm Requirement The analysis of medical images often requires segmentation prior to visualization or quantification.
More informationOptimizations and Lagrange Multiplier Method
Introduction Applications Goal and Objectives Reflection Questions Once an objective of any real world application is well specified as a function of its control variables, which may subject to a certain
More informationSIFT: Scale Invariant Feature Transform
1 / 25 SIFT: Scale Invariant Feature Transform Ahmed Othman Systems Design Department University of Waterloo, Canada October, 23, 2012 2 / 25 1 SIFT Introduction Scale-space extrema detection Keypoint
More informationAutomatic Image Alignment (feature-based)
Automatic Image Alignment (feature-based) Mike Nese with a lot of slides stolen from Steve Seitz and Rick Szeliski 15-463: Computational Photography Alexei Efros, CMU, Fall 2006 Today s lecture Feature
More informationCorner Detection. Harvey Rhody Chester F. Carlson Center for Imaging Science Rochester Institute of Technology
Corner Detection Harvey Rhody Chester F. Carlson Center for Imaging Science Rochester Institute of Technology rhody@cis.rit.edu April 11, 2006 Abstract Corners and edges are two of the most important geometrical
More informationComputer Vision for HCI. Topics of This Lecture
Computer Vision for HCI Interest Points Topics of This Lecture Local Invariant Features Motivation Requirements, Invariances Keypoint Localization Features from Accelerated Segment Test (FAST) Harris Shi-Tomasi
More informationLocal invariant features
Local invariant features Tuesday, Oct 28 Kristen Grauman UT-Austin Today Some more Pset 2 results Pset 2 returned, pick up solutions Pset 3 is posted, due 11/11 Local invariant features Detection of interest
More informationTowards the completion of assignment 1
Towards the completion of assignment 1 What to do for calibration What to do for point matching What to do for tracking What to do for GUI COMPSCI 773 Feature Point Detection Why study feature point detection?
More informationLocal features: detection and description May 12 th, 2015
Local features: detection and description May 12 th, 2015 Yong Jae Lee UC Davis Announcements PS1 grades up on SmartSite PS1 stats: Mean: 83.26 Standard Dev: 28.51 PS2 deadline extended to Saturday, 11:59
More informationAutonomous Navigation for Flying Robots
Computer Vision Group Prof. Daniel Cremers Autonomous Navigation for Flying Robots Lecture 7.1: 2D Motion Estimation in Images Jürgen Sturm Technische Universität München 3D to 2D Perspective Projections
More informationCOMPARATIVE STUDY OF IMAGE EDGE DETECTION ALGORITHMS
COMPARATIVE STUDY OF IMAGE EDGE DETECTION ALGORITHMS Shubham Saini 1, Bhavesh Kasliwal 2, Shraey Bhatia 3 1 Student, School of Computing Science and Engineering, Vellore Institute of Technology, India,
More informationKeypoint detection. (image registration, panorama stitching, motion estimation + tracking, recognition )
Keypoint detection n n Many applications benefit from features localized in (x,y) (image registration, panorama stitching, motion estimation + tracking, recognition ) Edges well localized only in one direction
More informationLecture 14 Shape. ch. 9, sec. 1-8, of Machine Vision by Wesley E. Snyder & Hairong Qi. Spring (CMU RI) : BioE 2630 (Pitt)
Lecture 14 Shape ch. 9, sec. 1-8, 12-14 of Machine Vision by Wesley E. Snyder & Hairong Qi Spring 2018 16-725 (CMU RI) : BioE 2630 (Pitt) Dr. John Galeotti The content of these slides by John Galeotti,
More informationPatch-based Object Recognition. Basic Idea
Patch-based Object Recognition 1! Basic Idea Determine interest points in image Determine local image properties around interest points Use local image properties for object classification Example: Interest
More informationIdentify Curvilinear Structure Based on Oriented Phase Congruency in Live Cell Images
International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 3, Number 4 (2013), pp. 335-340 International Research Publications House http://www. irphouse.com /ijict.htm Identify
More informationImplementing the Scale Invariant Feature Transform(SIFT) Method
Implementing the Scale Invariant Feature Transform(SIFT) Method YU MENG and Dr. Bernard Tiddeman(supervisor) Department of Computer Science University of St. Andrews yumeng@dcs.st-and.ac.uk Abstract The
More informationLocal Feature Detectors
Local Feature Detectors Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr Slides adapted from Cordelia Schmid and David Lowe, CVPR 2003 Tutorial, Matthew Brown,
More informationEvaluation of the Influence of Feature Detectors and Photometric Descriptors in Object Recognition
Department of Numerical Analysis and Computer Science Evaluation of the Influence of Feature Detectors and Photometric Descriptors in Object Recognition Fredrik Furesjö and Henrik I. Christensen TRITA-NA-P0406
More informationLocal Features: Detection, Description & Matching
Local Features: Detection, Description & Matching Lecture 08 Computer Vision Material Citations Dr George Stockman Professor Emeritus, Michigan State University Dr David Lowe Professor, University of British
More informationFast and accurate automated cell boundary determination for fluorescence microscopy
Fast and accurate automated cell boundary determination for fluorescence microscopy Stephen Hugo Arce, Pei-Hsun Wu &, and Yiider Tseng Department of Chemical Engineering, University of Florida and National
More informationRequirements for region detection
Region detectors Requirements for region detection For region detection invariance transformations that should be considered are illumination changes, translation, rotation, scale and full affine transform
More informationSnakes, Active Contours, and Segmentation Introduction and Classical Active Contours Active Contours Without Edges
Level Sets & Snakes Snakes, Active Contours, and Segmentation Introduction and Classical Active Contours Active Contours Without Edges Scale Space and PDE methods in image analysis and processing - Arjan
More informationCS 565 Computer Vision. Nazar Khan PUCIT Lectures 15 and 16: Optic Flow
CS 565 Computer Vision Nazar Khan PUCIT Lectures 15 and 16: Optic Flow Introduction Basic Problem given: image sequence f(x, y, z), where (x, y) specifies the location and z denotes time wanted: displacement
More informationScale Invariant Feature Transform
Scale Invariant Feature Transform Why do we care about matching features? Camera calibration Stereo Tracking/SFM Image moiaicing Object/activity Recognition Objection representation and recognition Image
More informationLecture 7: Most Common Edge Detectors
#1 Lecture 7: Most Common Edge Detectors Saad Bedros sbedros@umn.edu Edge Detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the
More informationHand-Eye Calibration from Image Derivatives
Hand-Eye Calibration from Image Derivatives Abstract In this paper it is shown how to perform hand-eye calibration using only the normal flow field and knowledge about the motion of the hand. The proposed
More informationFeature Lines on Surfaces
Feature Lines on Surfaces How to Describe Shape-Conveying Lines? Image-space features Object-space features View-independent View-dependent [Flaxman 1805] a hand-drawn illustration by John Flaxman Image-Space
More informationImage key points detection and matching
Image key points detection and matching Mikhail V. Medvedev Technical Cybernetics and Computer Science Department Kazan National Research Technical University Kazan, Russia mmedv@mail.ru Mikhail P. Shleymovich
More informationImage Features. Work on project 1. All is Vanity, by C. Allan Gilbert,
Image Features Work on project 1 All is Vanity, by C. Allan Gilbert, 1873-1929 Feature extrac*on: Corners and blobs c Mo*va*on: Automa*c panoramas Credit: Ma9 Brown Why extract features? Mo*va*on: panorama
More informationHow and what do we see? Segmentation and Grouping. Fundamental Problems. Polyhedral objects. Reducing the combinatorics of pose estimation
Segmentation and Grouping Fundamental Problems ' Focus of attention, or grouping ' What subsets of piels do we consider as possible objects? ' All connected subsets? ' Representation ' How do we model
More informationAn Unbiased Detector of Curvilinear Structures
FG BV TU München Informatik IX An Unbiased Detector of Curvilinear Structures Carsten Steger Technical Report FGBV 96 03 July 1996 Forschungsgruppe Bildverstehen (FG BV), Informatik IX Technische Universität
More informationOther Linear Filters CS 211A
Other Linear Filters CS 211A Slides from Cornelia Fermüller and Marc Pollefeys Edge detection Convert a 2D image into a set of curves Extracts salient features of the scene More compact than pixels Origin
More informationKøbenhavns Universitet. Smoothing images creates corners Sporring, Jon; Olsen, Ole Fogh; Nielsen, Mads; Weickert, Joachim
university of copenhagen Københavns Universitet Smoothing images creates corners Sporring, Jon; Olsen, Ole Fogh; Nielsen, Mads; Weickert, Joachim Published in: Image and Vision Computing Publication date:
More informationLocal Image preprocessing (cont d)
Local Image preprocessing (cont d) 1 Outline - Edge detectors - Corner detectors - Reading: textbook 5.3.1-5.3.5 and 5.3.10 2 What are edges? Edges correspond to relevant features in the image. An edge
More informationIMAGE SEGMENTATION. Václav Hlaváč
IMAGE SEGMENTATION Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering, Department of Cybernetics Center for Machine Perception http://cmp.felk.cvut.cz/ hlavac, hlavac@fel.cvut.cz
More informationOBJECT RECOGNITION: OBTAINING 2-D RECONSTRUCTIONS FROM COLOR EDGES. G. Bellaire**, K. Talmi*, E. Oezguer *, and A. Koschan*
Proc. IEEE Symposium on Image Analysis and Interpretation, April 5-7, 1998, Tucson, Arizona, USA, pp. 192-197. OBJECT RECOGNITION: OBTAINING 2-D RECONSTRUCTIONS FROM COLOR EDGES G. Bellaire**, K. Talmi*,
More informationFeature Detectors and Descriptors: Corners, Lines, etc.
Feature Detectors and Descriptors: Corners, Lines, etc. Edges vs. Corners Edges = maxima in intensity gradient Edges vs. Corners Corners = lots of variation in direction of gradient in a small neighborhood
More informationScale Invariant Feature Transform
Why do we care about matching features? Scale Invariant Feature Transform Camera calibration Stereo Tracking/SFM Image moiaicing Object/activity Recognition Objection representation and recognition Automatic
More informationDigital Image Processing (CS/ECE 545) Lecture 5: Edge Detection (Part 2) & Corner Detection
Digital Image Processing (CS/ECE 545) Lecture 5: Edge Detection (Part 2) & Corner Detection Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Recall: Edge Detection Image processing
More informationBackground for Surface Integration
Background for urface Integration 1 urface Integrals We have seen in previous work how to define and compute line integrals in R 2. You should remember the basic surface integrals that we will need to
More informationPartial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives
In general, if f is a function of two variables x and y, suppose we let only x vary while keeping y fixed, say y = b, where b is a constant. By the definition of a derivative, we have Then we are really
More informationBioimage Informatics
Bioimage Informatics Lecture 13, Spring 2012 Bioimage Data Analysis (IV) Image Segmentation (part 2) Lecture 13 February 29, 2012 1 Outline Review: Steger s line/curve detection algorithm Intensity thresholding
More informationFeature Tracking and Optical Flow
Feature Tracking and Optical Flow Prof. D. Stricker Doz. G. Bleser Many slides adapted from James Hays, Derek Hoeim, Lana Lazebnik, Silvio Saverse, who 1 in turn adapted slides from Steve Seitz, Rick Szeliski,
More informationSIFT - scale-invariant feature transform Konrad Schindler
SIFT - scale-invariant feature transform Konrad Schindler Institute of Geodesy and Photogrammetry Invariant interest points Goal match points between images with very different scale, orientation, projective
More informationVisual Tracking (1) Feature Point Tracking and Block Matching
Intelligent Control Systems Visual Tracking (1) Feature Point Tracking and Block Matching Shingo Kagami Graduate School of Information Sciences, Tohoku University swk(at)ic.is.tohoku.ac.jp http://www.ic.is.tohoku.ac.jp/ja/swk/
More informationAnnouncements. Edges. Last Lecture. Gradients: Numerical Derivatives f(x) Edge Detection, Lines. Intro Computer Vision. CSE 152 Lecture 10
Announcements Assignment 2 due Tuesday, May 4. Edge Detection, Lines Midterm: Thursday, May 6. Introduction to Computer Vision CSE 152 Lecture 10 Edges Last Lecture 1. Object boundaries 2. Surface normal
More informationExploring Curve Fitting for Fingers in Egocentric Images
Exploring Curve Fitting for Fingers in Egocentric Images Akanksha Saran Robotics Institute, Carnegie Mellon University 16-811: Math Fundamentals for Robotics Final Project Report Email: asaran@andrew.cmu.edu
More informationImage Segmentation Image Thresholds Edge-detection Edge-detection, the 1 st derivative Edge-detection, the 2 nd derivative Horizontal Edges Vertical
Image Segmentation Image Thresholds Edge-detection Edge-detection, the 1 st derivative Edge-detection, the 2 nd derivative Horizontal Edges Vertical Edges Diagonal Edges Hough Transform 6.1 Image segmentation
More informationCITS 4402 Computer Vision
CITS 4402 Computer Vision Prof Ajmal Mian Lecture 12 3D Shape Analysis & Matching Overview of this lecture Revision of 3D shape acquisition techniques Representation of 3D data Applying 2D image techniques
More informationObject Detection by Point Feature Matching using Matlab
Object Detection by Point Feature Matching using Matlab 1 Faishal Badsha, 2 Rafiqul Islam, 3,* Mohammad Farhad Bulbul 1 Department of Mathematics and Statistics, Bangladesh University of Business and Technology,
More informationSchool of Computing University of Utah
School of Computing University of Utah Presentation Outline 1 2 3 4 Main paper to be discussed David G. Lowe, Distinctive Image Features from Scale-Invariant Keypoints, IJCV, 2004. How to find useful keypoints?
More informationPop Quiz 1 [10 mins]
Pop Quiz 1 [10 mins] 1. An audio signal makes 250 cycles in its span (or has a frequency of 250Hz). How many samples do you need, at a minimum, to sample it correctly? [1] 2. If the number of bits is reduced,
More informationData Analysis 3. Support Vector Machines. Jan Platoš October 30, 2017
Data Analysis 3 Support Vector Machines Jan Platoš October 30, 2017 Department of Computer Science Faculty of Electrical Engineering and Computer Science VŠB - Technical University of Ostrava Table of
More informationImage Analysis. Edge Detection
Image Analysis Edge Detection Christophoros Nikou cnikou@cs.uoi.gr Images taken from: Computer Vision course by Kristen Grauman, University of Texas at Austin (http://www.cs.utexas.edu/~grauman/courses/spring2011/index.html).
More informationCARTESIAN OVOIDS. A. Cartesian Ovoids in the case n o < n i
CARTESIAN OVOIDS The Cartesian ovoids are plane curves that have been first described by Rene Descartes (in 1637 AD) and represent the geometric locus of points that have the same linear combination of
More informationImage Segmentation and Registration
Image Segmentation and Registration Dr. Christine Tanner (tanner@vision.ee.ethz.ch) Computer Vision Laboratory, ETH Zürich Dr. Verena Kaynig, Machine Learning Laboratory, ETH Zürich Outline Segmentation
More informationCorner Detection. GV12/3072 Image Processing.
Corner Detection 1 Last Week 2 Outline Corners and point features Moravec operator Image structure tensor Harris corner detector Sub-pixel accuracy SUSAN FAST Example descriptor: SIFT 3 Point Features
More informationf xx (x, y) = 6 + 6x f xy (x, y) = 0 f yy (x, y) = y In general, the quantity that we re interested in is
1. Let f(x, y) = 5 + 3x 2 + 3y 2 + 2y 3 + x 3. (a) Final all critical points of f. (b) Use the second derivatives test to classify the critical points you found in (a) as a local maximum, local minimum,
More information