1 Hough Transform. 2 A Technique to Isolate Features of a Particular Shape within an Image The classical Hough transform is most commonly used for the.

Slides:



Advertisements
Similar presentations
Fitting: The Hough transform. Voting schemes Let each feature vote for all the models that are compatible with it Hopefully the noise features will not.
Advertisements

Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
Hough Transform Reading Watt, An edge is not a line... How can we detect lines ?
Segmentation (2): edge detection
Hough Transform Jeremy Wyatt. The story so far We know how to find edges by convolving with the derivative of a Gaussian filter in two directions We then.
Fitting: The Hough transform
Lecture 5 Hough transform and RANSAC
0 - 1 © 2007 Texas Instruments Inc, Content developed in partnership with Tel-Aviv University From MATLAB ® and Simulink ® to Real Time with TI DSPs Detecting.
1 Model Fitting Hao Jiang Computer Science Department Oct 6, 2009.
CS 376b Introduction to Computer Vision 04 / 11 / 2008 Instructor: Michael Eckmann.
Announcements Mailing list: –you should have received messages Project 1 out today (due in two weeks)
GENERALIZED HOUGH TRANSFORM. Recap on classical Hough Transform 1.In detecting lines – The parameters  and  were found out relative to the origin (0,0)
Object Recognition A wise robot sees as much as he ought, not as much as he can Search for objects that are important lamps outlets wall corners doors.
Edge Detection Today’s reading Forsyth, chapters 8, 15.1
Parallel Processing – Final Project Performed by:Nitsan Mane Jonathan Distler PP9.
Fitting a Model to Data Reading: 15.1,
CS 376b Introduction to Computer Vision 04 / 14 / 2008 Instructor: Michael Eckmann.
Edge Detection Today’s readings Cipolla and Gee –supplemental: Forsyth, chapter 9Forsyth Watt, From Sandlot ScienceSandlot Science.
Fitting: The Hough transform
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
Hough Transform (Section 10.2) CS474/67. Edge Linking and Boundary Detection Edge detection does not yield connected boundaries. Edge linking and boundary.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean Hall 5409 T-R 10:30am – 11:50am.
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
FEATURE EXTRACTION FOR JAVA CHARACTER RECOGNITION Rudy Adipranata, Liliana, Meiliana Indrawijaya, Gregorius Satia Budhi Informatics Department, Petra Christian.
Hough Transform on the GPU Presented by Javier Garcia November 29, 2010.
Computer Vision More Image Features Hyunki Hong School of Integrative Engineering.
Edge Linking & Boundary Detection
Segmentation Course web page: vision.cis.udel.edu/~cv May 7, 2003  Lecture 31.
Fitting: The Hough transform. Voting schemes Let each feature vote for all the models that are compatible with it Hopefully the noise features will not.
HOUGH TRANSFORM Presentation by Sumit Tandon
HOUGH TRANSFORM & Line Fitting Introduction  HT performed after Edge Detection  It is a technique to isolate the curves of a given shape / shapes.
Hough Transform : A preliminary study Indranil Das HEP Devn., SINP.
Object Detection 01 – Advance Hough Transformation JJCAO.
Generalized Hough Transform
Edges. Edge detection schemes can be grouped in three classes: –Gradient operators: Robert, Sobel, Prewitt, and Laplacian (3x3 and 5x5 masks) –Surface.
Lecture 08 Detecting Shape Using Hough Transform Lecture 08 Detecting Shape Using Hough Transform Mata kuliah: T Computer Vision Tahun: 2010.
CS654: Digital Image Analysis Lecture 25: Hough Transform Slide credits: Guillermo Sapiro, Mubarak Shah, Derek Hoiem.
HOUGH TRANSFORM. Introduced in 1962 by Paul Hough pronounced like “tough” according to orm.html.
Fitting: The Hough transform
Edge Detection and Geometric Primitive Extraction Jinxiang Chai.
Session 2 – Hough Transformation Ashay Tejwani. Video Processing In the last session we saw that an image can be represented by an array of RGB values.
Fitting Thursday, Sept 24 Kristen Grauman UT-Austin.
Object Detection 01 – Basic Hough Transformation JJCAO.
Hough Transform Procedure to find a shape in an image Shape can be described in parametric form Shapes in image correspond to a family of parametric solutions.
CSE 185 Introduction to Computer Vision Feature Matching.
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
Image Segmentation Image segmentation (segmentace obrazu)
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
Hough Transform. Introduction The Hough Transform is a general technique for extracting geometrical primitives from e.g. edge data Performed after Edge.
Detecting Image Features: Corner. Corners Given an image, denote the image gradient. C is symmetric with two positive eigenvalues. The eigenvalues give.
Hough Transform CS 691 E Spring Outline Hough transform Homography Reading: FP Chapter 15.1 (text) Some slides from Lazebnik.
Object Recognition. Segmentation –Roughly speaking, segmentation is to partition the images into meaningful parts that are relatively homogenous in certain.
: Chapter 13: Finding Basic Shapes 1 Montri Karnjanadecha ac.th/~montri Image Processing.
HOUGH TRANSFORM.
Fitting: Voting and the Hough Transform
Line Fitting James Hayes.
Detection of discontinuity using
Fitting: The Hough transform
Fitting Curve Models to Edges
Image Processing, Leture #12
ECE 692 – Advanced Topics in Computer Vision
Hough Transform COMP 4900C Winter 2008.
Hough Transform.
Morphological Operators
Outline Announcement Perceptual organization, grouping, and segmentation Hough transform Read Chapter 17 of the textbook File: week14-m.ppt.
Edge Detection Today’s readings Cipolla and Gee Watt,
Finding Basic Shapes Hough Transforms
CSE 185 Introduction to Computer Vision
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Presentation transcript:

1 Hough Transform

2 A Technique to Isolate Features of a Particular Shape within an Image The classical Hough transform is most commonly used for the detection of regular curves such as: lines, circles, ellipses, etc Because: The desired features be specified in some parametric form

Voting schemes 3 Let each feature vote for all the models that are compatible with it Hopefully the noise features will not vote consistently for any single model Missing data doesn’t matter as long as there are enough features remaining to agree on a good model

Properties 4 Can tolerate noise and gaps in edge image Look for solutions in a parameter space Classical Hough transform Detect simple shape Line detection Circle detection

Hough transform 5 An early type of voting scheme General outline: Discretize parameter space into bins For each feature point in the image, put a vote in every bin in the parameter space that could have generated this point Find bins that have the most votes

Hough Transform شنبه زاده 6 Instead of going directly for the solution (as in template matching), we can use a voting scheme. Each possible point (edge) votes in the parameter space of a line. A line can be specified uniquely by two parameters m and n. y = m.x + n Parameter space of 2 dimensions (m and n).

7 y x b m m0m0 b0b0 Hough spaceimage space Connection between image (x,y) and Hough (m,b) spaces A line in the image corresponds to a point in Hough space To go from image space to Hough space: - given a set of points (x,y), find all (m,b) such that y = mx + b Finding lines in an image A line in the image corresponds to a point in Hough space

8 Where is the line that contains both (x 0, y 0 ) and (x 1, y 1 )?

9 It is the intersection of the lines b = –x 0 m + y 0 and b = – x 1 m + y 1

10 Equation of Line: Find: Consider point: Image Space Parameter space also called Hough Space Parameter Space

11 Algorithm: Quantize Parameter Space Create Accumulator Array Set For each image edge increment: If lies on the line: Find local maxima in Parameter Space

شنبه زاده 12 Problem with m-n parameter space. Both m and n can get very large [-∞, ∞]. How do we address this problem?

13 An alternative parameter space is polar coordinates. We use ( ρ, θ ) space to represent a line. ρ = x.cos( θ ) + y.sin( θ ) Points in picture sinusoids in parameter space Points in parameter space lines in picture Sinusoids corresponding to co-linear points intersect at an unique point

14 Example: Line: 0.6x + 0.4y = 2.4 Sinusoids intersect at:ρ = 2.4, θ =

شنبه زاده 15 Let ρ= [−R, R] and θ= [0,pi ) For each edge point (xi, yi ), calculate: θ ‘ = xi cos θ ‘+ yi sin θ Accumulator: A(ρ, θ) = A(ρ, θ) + 1 Threshold the accumulator values to get parameters for detected lines Threshold at A(ρ, θ) = 30 Threshold at A(ρ, θ) = 20 Threshold at A(ρ, θ) = 15

Example 16

Hough Transform Example with breaks in lines 17

Hough Transform Example with 1% salt and pepper noise 18

The Hough transform of the line is simply: a point at coordinate (ρ,θ) 19

A family of lines passing through a common point 20

The Hough transform of the family of curves passing through the three points results in the set of three parametric curves. These three curves cross at a single point corresponding to the dashed line passing through the collinear points. 21

22

23

24

25

Example 26

27

28 Theta = 45º = rad r = (1√2) / 2 = Theta: 0 to 3.14 (rad) Tokens Votes Brightest point = 20 votes

29 Brightest point = 6 votes

30 Noise Lowers the Peaks

31 Noise Increases the Votes in Spurious Accumulator Elements

( e) Straight dashed line ( f) Hough transform of dashed line 32

33

34 Edges need not be connected Complete object need not be visible Key Idea: Edges VOTE for the possible model Advantages

35 1)Exponential time and memory increase with the increase of the parameter numbers. 2) Sampling of parameter space is difficult. 3) Similar shapes might produce peaks in the Hough Space (wide ellipses might interfere with lines) Problems with HT

A city scene where the buildings are obstructed in fog 36

To find the true edges of the buildings 37

Hough transform can detect some of the straight lines representing building edges within the obstructed region The histogram equalizedhistogram equalized accumulator space شنبه زاده 38

De-Houghed image set the relative threshold to 70% 39

Relative Threshold 50% 40

Street information is not available 41

Hough line detector is able to recover some of this information 42

شنبه زاده 43 Hough Transform By MATLAB I = imread('circuit.tif'); BW = edge(I,'canny'); [H,T,R] = hough(BW); P = houghpeaks(H,12,'threshold',ceil(0.3*max(H(:)))); lines = houghlines(BW,T,R,P,'FillGap',5,'MinLength',7);

شنبه زاده 44

Hough transform for circles 45

Hough transform for circles 46

47

Implementation of the Hough transform for circles 48

شنبه زاده 49

شنبه زاده 50

آلگوريتم زير را از صفحه 206 کتاب استخراج ويژگی های تصوير مطالعه نموده و برای يک تصوير چهره عنبيه را مشخص سازيد. 51

Hough transform for ellipses 52

Circles are very important in shape detection since many objects have a circular shape. However, because of the camera’s viewpoint, circles do not always look like circles in images. We can define the mapping between the circle and an ellipse by a similarity transformation. 53

54

با توجه به وجود 5 پارامتربرای محاسبات اگر 100 حالت برای هر کدام از آنها وجود داشته باشد، حافظه مورد نياز برای ذخيره سازی را محاسبه نماييد. 55

56

57

58

59