M. Elena Martinez-Perez, Alun D. Hughes, Simon A. Thom, Anil A. Bharath, Kim H. Parker Medical Image Analysis 11 (2007) 47–61 黃銘哲 2010/11/9 1.

Slides:



Advertisements
Similar presentations
Feature extraction: Corners
Advertisements

Scale & Affine Invariant Interest Point Detectors Mikolajczyk & Schmid presented by Dustin Lennon.
QR Code Recognition Based On Image Processing
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
Neusoft Group Ltd. Medical Systems Centerline detection of (cardiac) vessels in CT images Martin Korevaar Supervisors: Shengjun Wang Han van Triest Yan.
Computer Vision Lecture 16: Texture
Edge Detection. Our goal is to extract a “line drawing” representation from an image Useful for recognition: edges contain shape information –invariance.
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
Chapter 10 Image Segmentation.
© 2004 by Davi GeigerComputer Vision January 2004 L1.1 Image Measurements and Detection.
January 19, 2006Computer Vision © 2006 Davi GeigerLecture 1.1 Image Measurements and Detection Davi Geiger
Edge detection. Edge Detection in Images Finding the contour of objects in a scene.
EE663 Image Processing Edge Detection 2 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
© 2002 by Davi GeigerComputer Vision September 2002 L1.1 Feature Detection.
Canny Edge Detector1 1)Smooth image with a Gaussian optimizes the trade-off between noise filtering and edge localization 2)Compute the Gradient magnitude.
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering
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
Feature extraction: Corners and blobs
Segmentation (Section 10.2)
Chapter 10 Image Segmentation.
Quantification of collagen orientation in 3D engineered tissue
Scale Invariant Feature Transform (SIFT)
Filters and Edges. Zebra convolved with Leopard.
Blob detection.
Edge Detection Today’s readings Cipolla and Gee –supplemental: Forsyth, chapter 9Forsyth Watt, From Sandlot ScienceSandlot Science.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
CS4670: Computer Vision Kavita Bala Lecture 7: Harris Corner Detection.
1 An Implementation Sanun Srisuk of EdgeFlow.
Chapter 10: Image Segmentation
Computer vision.
05 - Feature Detection Overview Feature Detection –Intensity Extrema –Blob Detection –Corner Detection Feature Descriptors Feature Matching Conclusion.
Advanced Computer Vision Chapter 4 Feature Detection and Matching Presented by: 傅楸善 & 許承偉
1/20 Obtaining Shape from Scanning Electron Microscope Using Hopfield Neural Network Yuji Iwahori 1, Haruki Kawanaka 1, Shinji Fukui 2 and Kenji Funahashi.
Edges. Edge detection schemes can be grouped in three classes: –Gradient operators: Robert, Sobel, Prewitt, and Laplacian (3x3 and 5x5 masks) –Surface.
Joonas Vanninen Antonio Palomino Alarcos.  One of the objectives of biomedical image analysis  The characteristics of the regions are examined later.
G52IVG, School of Computer Science, University of Nottingham 1 Edge Detection and Image Segmentation.
A Segmentation Algorithm Using Dyadic Wavelet Transform and the Discrete Dynamic Contour Bernard Chiu University of Waterloo.
CSC508 Convolution Operators. CSC508 Convolution Arguably the most fundamental operation of computer vision It’s a neighborhood operator –Similar to the.
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?
Introduction to Related Papers of Vessel Segmentation Methods Advisor : Ku-Yaw Chang Student : Wei-Lu Lin 2015/1/7.
A Tutorial on using SIFT Presented by Jimmy Huff (Slightly modified by Josiah Yoder for Winter )
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.
Computer Vision Image Features Instructor: Dr. Sherif Sami Lecture 4.
Instructor: Mircea Nicolescu Lecture 7
Image Features (I) Dr. Chang Shu COMP 4900C Winter 2008.
Instructor: Mircea Nicolescu Lecture 10 CS 485 / 685 Computer Vision.
MASKS © 2004 Invitation to 3D vision Lecture 3 Image Primitives andCorrespondence.
Keypoint extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
Edges Edges = jumps in brightness/color Brightness jumps marked in white.
Edge Detection slides taken and adapted from public websites:
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering Northern Arizona University.
CS262: Computer Vision Lect 09: SIFT Descriptors
Distinctive Image Features from Scale-Invariant Keypoints
CS 4501: Introduction to Computer Vision Sparse Feature Detectors: Harris Corner, Difference of Gaussian Connelly Barnes Slides from Jason Lawrence, Fei.
Introduction Computer vision is the analysis of digital images
Corners and Interest Points
Brain Hemorrhage Detection and Classification Steps
Introduction Computer vision is the analysis of digital images
Dr. Chang Shu COMP 4900C Winter 2008
Computer Vision Lecture 16: Texture II
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
Extract Object Boundaries in Noisy Images
Detection of salient points
Edge Detection Today’s readings Cipolla and Gee Watt,
Introduction Computer vision is the analysis of digital images
Canny Edge Detector Smooth image with a Gaussian
Presentation transcript:

M. Elena Martinez-Perez, Alun D. Hughes, Simon A. Thom, Anil A. Bharath, Kim H. Parker Medical Image Analysis 11 (2007) 47–61 黃銘哲 2010/11/9 1

Outline 1.Introduction 2.Method 3.Result 4.Validation 5.Conclusions 2

Introduction The eye is a window to the retinal vascular system which is uniquely accessible for the non-invasive, in vivo study of a continuous vascular bed in humans. Retinal blood vessels have been shown to change in diameter, branching angles or tortuosity, as a result of a disease, such as : Hypertension diabetes mellitus retinopathy of prematurity (ROP) 3

Introduction Green band is chosen in the present work because it is known to show the improved visibility of the retinal blood vessels. 4

Multiscale Retinal blood vessels have a range of different sizes. Multiscale techniques have been developed to provide a way to isolate information about objects in an image by looking for geometric features at different scales. 5

Multiscale The effect of convolving an image with a Gaussian kernel is to suppress most of the structures in the image with a characteristic length less than s. 6

Feature extraction Gradient magnitude - The magnitude of the gradient represents the slope of the image intensity for a particular value of the scale parameter s. 7

Feature extraction Principal curvature - Since vessels appear as ridge-like structures in the images, we look for pixels where the intensity image has a local maximum in the direction for which the gradient of the image undergoes the largest change (largest concavity). 8

Feature extraction The second derivative information is derived from the Hessian of the intensity image I(x,y): The eigenvalues, λ + and λ -, where we take λ + ≥ λ -, measure convexity and concavity in the corresponding eigendirections. 9

Feature extraction 10

Feature extraction In order to analyse both red-free and fluorescein images with the same algorithm, we define λ 1 = min(|λ + |, |λ - |) and λ 2 = max(|λ + |, |λ - |). The maximum eigenvalue, λ 2, corresponds to the maximum principal curvature of the Hessian tensor, which we will refer to as maximum principal curvature. 11

Multiscale integration This might be expected, particularly for maximum principal curvature, since the vessels are approximately cylindrical so that the total amount of blood in the light path corresponding to each pixel is larger in large vessels. Vessels with diameter d ≈ 2s are most strongly detected when the scale factor is s, we normalised each feature along scales by d and then kept the local maxima over scales: 12

Multiscale integration 13

Region growing The region growing algorithm we use is based on an iterative relaxation technique, using: Histograms of the extracted features, primarily upon the maximum principal curvature κ. The classification of the eight-neighbouring pixels 14

Region growing In first stage, classes grow initially in regions with low gradient magnitude, γ, allowing a relatively broad and fast classification while suppressing classification in the edge regions where the gradients are large. In second stage, the classification constraint is relaxed and classes grow based solely upon κ to allow the definition of borders between regions. 15

Region growing 16

Result 17

Comparison with average diameter 18

Conclusions MS doesn’t perform better than other method. However, we concluded that an analysis of true and false positive rate values does not give us the information needed about the accuracy of segmenting vessels when geometric measurements such as vessel widths are of interest. And from the third validation, we conclude that the approach presented gives comparable estimates of diameter and branching angles in both red-free and fluorescein image. 19