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.

Slides:



Advertisements
Similar presentations
0 - 1 © 2007 Texas Instruments Inc, Content developed in partnership with Tel-Aviv University From MATLAB ® and Simulink ® to Real Time with TI DSPs Dual.
Advertisements

Object Recognition from Local Scale-Invariant Features David G. Lowe Presented by Ashley L. Kapron.
Computer Graphics- SCC 342
Hough Transforms CSE 6367 – Computer Vision Vassilis Athitsos University of Texas at Arlington.
DTU Informatics Introduction to Medical Image Analysis Rasmus R. Paulsen DTU Informatics TexPoint fonts.
Viewing & Clipping In 2D. 2 of 44 Contents Windowing Concepts Clipping –Introduction –Brute Force –Cohen-Sutherland Clipping Algorithm Area Clipping –Sutherland-Hodgman.
Digital Image Processing
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
Image Segmentation Region growing & Contour following Hyeun-gu Choi Advisor: Dr. Harvey Rhody Center for Imaging Science.
2. Voronoi Diagram 2.1 Definiton Given a finite set S of points in the plane , each point X of  defines a subset S X of S consisting of the points of.
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.
Biomedical Image Analysis Rangaraj M. Rangayyan Ch. 5 Detection of Regions of Interest: Sections , Presentation March 3rd 2005 Jukka Parviainen.
Lecture 5 Hough transform and RANSAC
1 Model Fitting Hao Jiang Computer Science Department Oct 6, 2009.
CS 376b Introduction to Computer Vision 04 / 11 / 2008 Instructor: Michael Eckmann.
Accumulator Array at A(1,2) –for y = ax + b we apply 1,2, to x, y, resulting in b = 2 – 1a at B(2,4) –for y = ax + b we apply 2,4, to x, y, resulting.
Color a* b* Brightness L* Texture Original Image Features Feature combination E D 22 Boundary Processing Textons A B C A B C 22 Region Processing.
CS 376b Introduction to Computer Vision 04 / 14 / 2008 Instructor: Michael Eckmann.
Stockman MSU/CSE Fall 2009 Finding region boundaries.
Hough Transform. Detecting Lines Hough transform detects lines in images Equation of line is: y = mx + b or Hough transform uses an array called accumulator.
© 2010 Cengage Learning Engineering. All Rights Reserved.
0 - 1 © 2007 Texas Instruments Inc, Content developed in partnership with Tel-Aviv University From MATLAB ® and Simulink ® to Real Time with TI DSPs Video.
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.
0 - 1 © 2007 Texas Instruments Inc, Content developed in partnership with Tel-Aviv University From MATLAB ® and Simulink ® to Real Time with TI DSPs Echo.
Hough Transform (Section 10.2) CS474/67. Edge Linking and Boundary Detection Edge detection does not yield connected boundaries. Edge linking and boundary.
0 - 1 © 2007 Texas Instruments Inc, Content developed in partnership with Tel-Aviv University From MATLAB ® and Simulink ® to Real Time with TI DSPs Amplitude.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
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.
Edge Linking & Boundary Detection
Hough Transform : A preliminary study Indranil Das HEP Devn., SINP.
© by Yu Hen Hu 1 ECE533 Digital Image Processing Image Segmentation.
Generalized Hough Transform
0 - 1 © 2007 Texas Instruments Inc, Content developed in partnership with Tel-Aviv University From MATLAB ® and Simulink ® to Real Time with TI DSPs Edge.
Chapter 10, Part II Edge Linking and Boundary Detection The methods discussed in the previous section yield pixels lying only on edges. This section.
Digital Image Processing & Pattern Analysis (CSCE 563) Image Segmentation Prof. Amr Goneid Department of Computer Science & Engineering The American University.
Programming & Applications Chin-Sung Lin Eleanor Roosevelt High School.
Lecture 08 Detecting Shape Using Hough Transform Lecture 08 Detecting Shape Using Hough Transform Mata kuliah: T Computer Vision Tahun: 2010.
Computer Graphics Chapter 6 Andreas Savva. 2 Interactive Graphics Graphics provides one of the most natural means of communicating with a computer. Interactive.
HOUGH TRANSFORM. Introduced in 1962 by Paul Hough pronounced like “tough” according to orm.html.
Edge Detection and Geometric Primitive Extraction Jinxiang Chai.
0 - 1 © 2007 Texas Instruments Inc, Content developed in partnership with Tel-Aviv University From MATLAB ® and Simulink ® to Real Time with TI DSPs Spectrum.
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.
The Hough Transform for Vertical Object Recognition in 3D Images Generated from Airborne Lidar Data Christopher Parrish ECE533 Project December 2006.
Course 8 Contours. Def: edge list ---- ordered set of edge point or fragments. Def: contour ---- an edge list or expression that is used to represent.
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
Hough transform and geometric transform
Image Segmentation Image segmentation (segmentace obrazu)
1 Mathematic Morphology used to extract image components that are useful in the representation and description of region shape, such as boundaries extraction.
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
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.
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.
Fitting: Voting and the Hough Transform
Detection of discontinuity using
Fitting: The Hough transform
Polygon Filling Algorithms
Fitting Curve Models to Edges
Image Processing, Leture #12
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.
Finding Basic Shapes Hough Transforms
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Presentation transcript:

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 Shapes in Images using the Hough Transform

Slide 2 © 2007 Texas Instruments Inc, Outline Detecting Straight Lines Detecting Straight Lanes

Slide 3 © 2007 Texas Instruments Inc, The Straight Line For each point ( x,y ) in the line the following equation applies: Therefore: (x 1,y 1 ) (x 2,y 2 )

Slide 4 © 2007 Texas Instruments Inc, Multiple Lines over a single point Each pair (m,b) defines a distinct straight line containing the point ( x,y ) (x,y) y=m 1 x+b 1 y=m 2 x+b 2 y=m 3 x+b 3 y=m 4 x+b 4

Slide 5 © 2007 Texas Instruments Inc, The Parameter Plane Each point in the (x,y) space(image plane) is mapped to a straight line in the (m.b) space (parameter plane). A straight line in the (x,y) space (image plane) is mapped to the intersection point of the lines corresponding to its points, in the (m.b) space (parameter plane). b =-mx 1 +y 1 b =-mx 2 +y 2 (x 1,y 1 ) (x 2,y 2 ) (x 3,y 3 ) b =-mx 3 +y 3

Slide 6 © 2007 Texas Instruments Inc, Dealing with digital pictures A line formed by M (N) pixels in the image space will be mapped to the intersection point of M (N) lines in the parameters space, where each line corresponds to a pixel in the image space. The number of lines intersecting in a single point in the parameter space represents the length of the original line in the image space. N pixels M pixels N lines M lines Image Plane Parameter Plane

Slide 7 © 2007 Texas Instruments Inc, The Accumulator Concept The (m.b) space (parameter plane) is subdivided in cells. Each pixel (x,y) in the original image vote in the (m,b) space for each line passing through it. The votes are summed in an Accumulator b b max m b min m min m max b1b1 m1m1 N Corresponds to a straight line y=m 1 x+b 1 of N pixels length

Slide 8 © 2007 Texas Instruments Inc, Using Polar Coordinates (x 1,y 1 ) (x 2,y 2 ) r θ For each point ( x,y ) in the line the following equation applies: In particular:

Slide 9 © 2007 Texas Instruments Inc, The Motivation for Polar Coordinates x = r r Vertical lines cannot be mapped to the (m,b) space, since: Vertical lines can be described using polar coordinates :

Slide 10 © 2007 Texas Instruments Inc, Hough Transform - The ( r, θ) Space (x 1,y 1 ) (x 2,y 2 ) (x 3,y 3 ) r=x 2 cosθ+y 2 sinθ r=x 1 cosθ+y 1 sinθ r=x 3 cosθ+y 3 sinθ (x 4,y 4 ) r=x 4 cosθ+y 4 sinθ Hough Transform - Each point in the (x,y) space is mapped to a sinusoid in the ( r, θ) space. Sinusoids corresponding to collinear points in the (x,y) space intersect at a common point in the ( r, θ) space.

Slide 11 © 2007 Texas Instruments Inc, Accumulators in the ( r, θ) Plane θ θmax r θ min r min r max θ 1θ 1 r1r1 N Corresponds to the straight line r 1 =xcosθ 1 +xsinθ 1 of N pixels length

Slide 12 © 2007 Texas Instruments Inc, The Region of Interest (ROI) The ROI is the area in the original image, where lines need to be detected. The ROI for the picture above is: x max x min y max y min r max

Slide 13 © 2007 Texas Instruments Inc, Longest Line Detection Edge Detection Hough Transfom Draw Line Input Image Output Image Binary Image Longest Line (r m,θ m ) + Find Max. Accumulator Array Hough Algorithm The line is reconstructed using the equation: r m =xcosθ m +ysinθ m (Calculated for the values of (x,y) that “voted” for the accumulator cell (r m, θ m ).

Slide 14 © 2007 Texas Instruments Inc, Line Detection Model

Slide 15 © 2007 Texas Instruments Inc, The Hough Algorithm

Slide 16 © 2007 Texas Instruments Inc, Line Drawing & Image Construction

Slide 17 © 2007 Texas Instruments Inc, Line Detection - Hands-On Simulation Implementation using the DSK6416

Slide 18 © 2007 Texas Instruments Inc, Simulation Image File MATLAB ® Display Line Detection

Slide 19 © 2007 Texas Instruments Inc, DSK6416 Image File MATLAB Display Line Detection Script RGB to Grayscale RTDX Real Time Implementation

Slide 20 © 2007 Texas Instruments Inc, From Line to Lane 1.Find two longest lines in the picture 2.Draw Polygon

Slide 21 © 2007 Texas Instruments Inc, Lane Detection Hough Transfom Draw Lane Input Image Output Image Binary Image + Find 2 Max. Accumulator Array Hough Algorithm Enhanced Edge Detection (r,θ) Correction Determine ROI Two Longest Lines (r m,θ m ) / (r n,θ n ) Two lines are reconstructed using the equation: r m =xcosθ m +ysinθ m (Calculated for the values of (x,y) that “voted” for the two maximum values in the accumulator cell. A polygon is constructed connecting those lines

Slide 22 © 2007 Texas Instruments Inc, Enhanced Edge Detection An histogram-based thresholding edge detection method enables the identification of areas where pixels change from light to dark or dark to light, which might indicate lane edges. Edge Detection Histogram Based Threshold ≥ ROI Logical AND Binary Image

Slide 23 © 2007 Texas Instruments Inc, Edge Detection Only Edge Detection with Histogram Based Thresholding Why Enhanced Edge Detection?

Slide 24 © 2007 Texas Instruments Inc, No Correction (r,θ) Correction The Need for (r,θ) Correction Misdetection of the longest lines

Slide 25 © 2007 Texas Instruments Inc, (r,θ) Correction If the lane position given by the Hough Transform block changes abruptly with respect to its values in the previous frame, the Rho Theta Correction subsystem discards the current position and keeps the previous position. Maximum allowable variation in E and F with respect to previous values are:

Slide 26 © 2007 Texas Instruments Inc, Lane Detection Model

Slide 27 © 2007 Texas Instruments Inc, Enhanced Edge Detection

Slide 28 © 2007 Texas Instruments Inc, The Hough Algorithm

Slide 29 © 2007 Texas Instruments Inc, Lane Drawing

Slide 30 © 2007 Texas Instruments Inc, Lane Detection - Hands-On Simulation Implementation using the DM6437 DVDP