Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.

Slides:



Advertisements
Similar presentations
電腦視覺 Computer and Robot Vision I
Advertisements

Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Segmentation (2): edge detection
1Ellen L. Walker Edges Humans easily understand “line drawings” as pictures.
Lecture 5 Hough transform and RANSAC
EE663 Image Processing Edge Detection 5 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
CS 376b Introduction to Computer Vision 04 / 11 / 2008 Instructor: Michael Eckmann.
Segmentation Divide the image into segments. Each segment:
GENERALIZED HOUGH TRANSFORM. Recap on classical Hough Transform 1.In detecting lines – The parameters  and  were found out relative to the origin (0,0)
Edges and Lines Readings: Chapter 10:
Fitting a Model to Data Reading: 15.1,
CS 376b Introduction to Computer Vision 04 / 14 / 2008 Instructor: Michael Eckmann.
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.
1 Lines and Arcs Segmentation In some image sets, lines, curves, and circular arcs are more useful than regions or helpful in addition to regions. Lines.
כמה מהתעשייה? מבנה הקורס השתנה 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.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Machine Vision for Robots
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
Digital Image Processing Lecture 20: Representation & Description
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
ENT 273 Object Recognition and Feature Detection Hema C.R.
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.
Intelligent Vision Systems ENT 496 Object Shape Identification and Representation Hema C.R. Lecture 7.
Digital Image Processing CCS331 Relationships of Pixel 1.
Joonas Vanninen Antonio Palomino Alarcos.  One of the objectives of biomedical image analysis  The characteristics of the regions are examined later.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Chapter 10 Image Segmentation.
Course 9 Texture. Definition: Texture is repeating patterns of local variations in image intensity, which is too fine to be distinguished. Texture evokes.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
CS654: Digital Image Analysis Lecture 25: Hough Transform Slide credits: Guillermo Sapiro, Mubarak Shah, Derek Hoiem.
Computer and Robot Vision II Chapter 20 Accuracy Presented by: 傅楸善 & 王林農 指導教授 : 傅楸善 博士.
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.
Image Segmentation Image segmentation (segmentace obrazu)
Edges and Lines Readings: Chapter 10:
1 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Digital Image Processing CSC331
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Chapter 11 Representation and.
 After an image has been segmented into regions by methods such as those discussed in image segmentation chapter, the segmented pixels usually are represented.
Sheng-Fang Huang Chapter 11 part I.  After the image is segmented into regions, how to represent and describe these regions? ◦ In terms of its external.
Materi 09 Analisis Citra dan Visi Komputer Representasi and Deskripsi 1.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Image Representation and Description – Representation Schemes
Computer and Robot Vision I
Digital Image Processing Lecture 20: Representation & Description
Engineering Geometry Engineering geometry is the basic geometric elements and forms used in engineering design. Engineering and technical graphics are.
Mean Shift Segmentation
Fitting Curve Models to Edges
Computer and Robot Vision I
Computer and Robot Vision I
CONTOURING By Ashish V. Deshpande Electrical Engineering Department
Computer and Robot Vision I
Computer and Robot Vision I
Computer and Robot Vision I
Computer and Robot Vision I
Computer and Robot Vision I
Finding Line and Curve Segments from Edge Images
Computer and Robot Vision I
Computer and Robot Vision I
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Presentation transcript:

Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C. Computer and Robot Vision I Chapter 11 Arc Extraction and Segmentation Presented by: 傅楸善 & 何育哲 指導教授 : 傅楸善 博士

DC & CV Lab. CSIE NTU 11.1 Introduction edge detection: labels each pixel as edge or no edge additional properties of edge: direction, gradient magnitude, contrast edge grouping: edge pixels in same region boundary grouped together edge detector: typically produces short linear disjointed edge segments

DC & CV Lab. CSIE NTU 11.1 Introduction each edge segment: has an orientation and a position edge segments: of little use until aggregated into extended edges global edge aggregation: upon proximity, relative orientation, contrast, … local edge aggregation: extends edges by seeking compatible neighbor edges

DC & CV Lab. CSIE NTU 11.1 Introduction global methods: can incorporate domain knowledge into cost functions global methods: more robust to noisy edge data global methods: bought at expense of relatively high computational cost aggregation into extended edges and parametric description: new research area extended edges: like other curves can be described at multiple scales

DC & CV Lab. CSIE NTU 11.1 Introduction Fig. 3.18(a)

DC & CV Lab. CSIE NTU 11.1 Introduction Fig. 3.18(b)

DC & CV Lab. CSIE NTU 11.2 Extracting Boundary Pixels from a Segmented Image after segmentation/ connected components: region boundary may be extracted border algorithm: to extract all region boundaries in left-right, top-bottom

DC & CV Lab. CSIE NTU Concepts and Data Structures input image: symbolic image whose pixel values denote region labels current regions: borders partially scanned but not yet output past regions: completely scanned and their borders output

DC & CV Lab. CSIE NTU Concepts and Data Structures future regions: not yet been reached by the scan at most 2 * number_of_columns region labels may be active at a time hash table: used to allow rapid access to chains of a region each chain: linked list of pixel positions grow- able from beginning to end

DC & CV Lab. CSIE NTU Border-Tracking Algorithm

DC & CV Lab. CSIE NTU Border-Tracking Algorithm

DC & CV Lab. CSIE NTU 11.3 Linking One-Pixel-Wide Edges or Lines segments: may consist of line, endpoint, corner, junctions

DC & CV Lab. CSIE NTU 11.3 Linking One-Pixel-Wide Edges or Lines

DC & CV Lab. CSIE NTU 11.3 Linking One-Pixel-Wide Edges or Lines algorithm to track segments like these has to be concerned with starting a new segment adding an interior pixel to a segment ending a segment finding a junction finding a corner

DC & CV Lab. CSIE NTU 11.3 Linking One-Pixel-Wide Edges or Lines segments: lists of edge points representing straight or curved lines pixeltype: isolated, starting, interior, ending, junction, corner

DC & CV Lab. CSIE NTU 11.3 Linking One-Pixel-Wide Edges or Lines

DC & CV Lab. CSIE NTU 11.4 Edge and Line Linking Using Directional Information edge linking: labeled pixels with similar enough directions form chains edge linking chains identified as arc segment with good fit to curvelike line

DC & CV Lab. CSIE NTU Take a Break

DC & CV Lab. CSIE NTU 11.5 Segmentation of Arcs into Simple Segments extracted digital arc: sequence of row-column pairs 4-neighbor or 8-neighbor arc segmentation: partitions extracted digital arc to fit straight/ curved line endpoints of subsequences: corner points or dominant points

DC & CV Lab. CSIE NTU 11.5 Segmentation of Arcs into Simple Segments basis for partitioning process identication of all locations with sufficiently high curvature (high change in tangent angle to length) enclosed by subsequences fitting different straight lines or curves

DC & CV Lab. CSIE NTU 11.5 Segmentation of Arcs into Simple Segments simple arc segment: straight-line or curved- arc segment techniques: from iterative endpoint fitting, splitting to using tangent angle deflection, prominence, or high curvature as basis of segmentation

DC & CV Lab. CSIE NTU Iterative Endpoint Fit and Split one distance threshold d* pixel with farthest distance to line AC is B and distance ≥ d* then split

DC & CV Lab. CSIE NTU Iterative Endpoint Fit and Split

DC & CV Lab. CSIE NTU Tangential Angle Deflection another approach: identify locations where two line segments meet exterior angle between two line segments: change in angular orientation

DC & CV Lab. CSIE NTU Tangential Angle Deflection

DC & CV Lab. CSIE NTU Tangential Angle Deflection caution: spatial quantization at small distances can completely mask direction

DC & CV Lab. CSIE NTU Uniform Bounded-Error Approximation segment arc sequence into maximal pieces whose points deviate ≤ given amount optimal algorithms: excessive computational complexity

DC & CV Lab. CSIE NTU Uniform Bounded-Error Approximation

DC & CV Lab. CSIE NTU Breakpoint Optimization after initial segmentation: shift breakpoints to produce better segmentation first: shift odd final point i.e. even beginning point then: shift even final point i.e. odd beginning point

DC & CV Lab. CSIE NTU Split and Merge first: split arc into segments with error sufficiently small then: merge successive segments if resulting segment sufficiently small error third: try to adjust breakpoints to obtain better segmentation repeat: until all three steps produce no further change

DC & CV Lab. CSIE NTU Isodata Segmentation iterative isodata line-fit clustering procedure: determines line-fit parameter then each point assigned to cluster whose line fit closest to the point

DC & CV Lab. CSIE NTU Curvature geometry of circular arc segment defined by and

DC & CV Lab. CSIE NTU Curvature

DC & CV Lab. CSIE NTU Curvature : curve represented parametrically, : arc length going from to

DC & CV Lab. CSIE NTU Curvature

DC & CV Lab. CSIE NTU Curvature : unit length tangent vector at measured clockwise from column axis

DC & CV Lab. CSIE NTU Curvature : unit normal vector at

DC & CV Lab. CSIE NTU Curvature : curvature defined at point of arc length s along curve : change of arc length : change in tangent angle

DC & CV Lab. CSIE NTU Curvature natural curve breaks: curvature maxima and minima curvature passes: through zero local shape changes from convex to concave surface elliptic: when limb in line drawing is convex surface hyperbolic: when its limb is concave

DC & CV Lab. CSIE NTU Curvature surface parabolic: wherever curvature of limb zero cusp singularities of projection: occur only within hyperbolic surface

DC & CV Lab. CSIE NTU Curvature Nalwa, A Guided Tour of Computer Vision, Fig. 4.14

DC & CV Lab. CSIE NTU 11.6 Hough Transform Hough transform: method for detecting straight lines and curves on images Hough transform: template matching

DC & CV Lab. CSIE NTU Hough Transform Technique The Hough transform algorithm requires an accumulator array whose dimension corresponds to the number of unknown parameters in the equation of the family of curves being sought.

DC & CV Lab. CSIE NTU Finding Straight-Line Segments : for straight lines does not work for vertical lines : slope, : intercept : where and used : perpendicular distance from the line to the origin : the angle the perpendicular makes with the x-axis

DC & CV Lab. CSIE NTU Finding Straight-Line Segments

DC & CV Lab. CSIE NTU Finding Straight-Line Segments use, and, to determine if point falls into cell an accumulator array quantized in this fashion

DC & CV Lab. CSIE NTU Finding Straight-Line Segments

DC & CV Lab. CSIE NTU Finding Straight-Line Segments Fig. 7.18(a) Fig. 7.18(b) Fig. 7.18(c) Fig. 7.18(d) Gonzalez and Woods Digital Image Processing Fig Fig. 7.19(a) Fig. 7.19(b) Fig. 7.19(c) Fig. 7.19(d) Gonzalez and Woods Digital Image Processing Fig. 7.19

DC & CV Lab. CSIE NTU Finding Straight-Line Segments Fig. 7.18(a) Fig. 7.18(b) Fig. 7.18(c) Fig. 7.18(d) Gonzalez and Woods Digital Image Processing Fig Fig. 7.19(a) Fig. 7.19(b) Fig. 7.19(c) Fig. 7.19(d) Gonzalez and Woods Digital Image Processing Fig. 7.19

DC & CV Lab. CSIE NTU Finding Circles : row : column : row-coordinate of the center : column-coordinate of the center : radius : implicit equation for a circle

DC & CV Lab. CSIE NTU Finding Circles circles represented by equations:

DC & CV Lab. CSIE NTU Finding Circles

DC & CV Lab. CSIE NTU Extensions generalized Hough transform: to arbitrary shapes specified by boundary points

DC & CV Lab. CSIE NTU Variations Burns line finder: to find straight lines in complex images of outdoor scenes Burns line finder: uses Hough transform and connected components algorithm

DC & CV Lab. CSIE NTU A Bayesian Approach to the Hough Transform : some fixed number related to function of resolution cell size set of pixels potentially participating in line :

DC & CV Lab. CSIE NTU Take a Break

DC & CV Lab. CSIE NTU 11.7 Line Fitting procedure for least-squares tting of line to observed noisy values : unknown values before noise perturbation : noisy observed values : line where points lie

DC & CV Lab. CSIE NTU 11.7 Line Fitting model for : : independent and identically distributed with mean 0 and variance

DC & CV Lab. CSIE NTU 11.7 Line Fitting

DC & CV Lab. CSIE NTU Variance of the Fitted Parameters randomness of observed data points in noise: leads to parameter randomness

DC & CV Lab. CSIE NTU Principal-Axis Curve Fit principal-axis curve fit generalization of line- fitting idea

DC & CV Lab. CSIE NTU 11.8 Region-of-Support Determination region of support too large: fine features smoothed out region of support too small: many corner points or dominant points produced

DC & CV Lab. CSIE NTU 11.9 Robust Line Fitting robust line fitting: fit insensitive to a few outlier points least-squares formulation first, then modify it to make it robust

DC & CV Lab. CSIE NTU Least-Squares Curve Fitting different approaches and solving methods as follows

DC & CV Lab. CSIE NTU Gradient Descent

DC & CV Lab. CSIE NTU Newton Method

DC & CV Lab. CSIE NTU Second-Order Approximation to Curve Fitting oblique view of a torus exhibiting folds, cusps, and T-junctions folds, cusps, and T-junctions: canonical singularities of surface projections

DC & CV Lab. CSIE NTU Second-Order Approximation to Curve Fitting ==Nalwa, A Guided Tour of Computer Vision, Fig. 4.15==

DC & CV Lab. CSIE NTU Fitting to a Circle r: row c: column : center of circle R: radius circle represented by:

DC & CV Lab. CSIE NTU Variance of the Fitted Parameters

DC & CV Lab. CSIE NTU Fitting to a Conic conic sections: by intersecting a cone with a plane conic sections: can be circle, ellipse, parabola, hyperbola

DC & CV Lab. CSIE NTU Fitting to a Conic Jain, Machine Vision, Fig. 6.8

DC & CV Lab. CSIE NTU Fitting to a Conic r: row c: column a, b, A, B, C: coefficients conic represented by:

DC & CV Lab. CSIE NTU Fitting to an Ellipse the most common conic fitting: fit to an ellipse

DC & CV Lab. CSIE NTU Bayesian Fitting equal-weight least-squares fit: suitable when all observed points noisy Bayesian fitting: some observed data points not noisy

DC & CV Lab. CSIE NTU Uniform Error Estimation uniform error estimation appropriate: if all points in observed arc reliable edge detection purpose: encode and describe information in economical form

DC & CV Lab. CSIE NTU Uniform Error Estimation Nalwa, A Guided Tour of Computer Vision, Fig. 3.1

DC & CV Lab. CSIE NTU Take a Break