SUMMARY PART I. Variance, 2, is directly a measure of roughness. A bounded measure of smoothness is
|
|
- Christian Berry
- 5 years ago
- Views:
Transcription
1 Digital Image Analsis SUMMARY PART I Fritz Albregtsen 4..6 Teture description of regions Remember: we estimate local properties (features) to be able to isolate regions which are similar in an image (segmentation), and possibl later identif these regions (classification), usuall with the final goal of object description One can describe the teture of a region b: smoothness, roughness, regularit, orientation... Problem: we want the local properties to be as local as possible Large region or window Precise estimate of features Imprecise estimate of location Small window Precise estimate of location Imprecise estimate t of feature values Using variance estimates Variance,, is directl a measure of roughness A bounded measure of smoothness is R is close to for homogenous areas R tends to as, roughness, increase. order statistics discussion. order statistics can separate two regions even if μ = μ, as long as The statistics of a piel (, ) is found in a local window Problems: Edges around objects are eaggerated Solution: use adaptive windows. order statistics does not describe geometr or contet Cannot discriminate between Solution: Calculate. order statistics with different resolutions, and obtain indirect information about. and higher order statistics. Simpl use. or higher order statistics. 3 4
2 GLCM Matri element P(i,j d,θ) in a GLCM is. order probabilit of changing from gralevel i to j when moving distance d in direction. Dimension of co-occurrence matri is GG (G = gra-levels in image) Reduce the number of gra-levels b re-quantization Choose a distance d and a direction In this eample, d= and = GLCM Usuall a good idea to reduce the number of (d,) variations evaluated Simple pairwise relations: P(d, ) = P t (d,8 ) P(d,45 ) = P t (d,5 ) P(d,9 ) = P t (d,7 ) P(d,35 ) = P t (d,35 ) Isotropic matri b averaging P(), { o, 45 o, 9 o, 35 o } Beware of differences in effective window size! Check all piel pairs with distance d and direction inside the window. Q(i,j d,) is the number of piel pairs where piel in the pair has piel value i and piel has piel value j. j An isotropic teture is equal in all directions If the teture has a clear orientation, we select according to this. 5 6 GLCM features Learning goals - teture A number of features are available (Haralick et al., ) Ma be seen as weight functions applied to probabilit matri: Weighting based on value of GLCM element Eample: Entrop W(i,j) = -log{p(i,j)} Weighting based on position in GLCM 5 Eample: 5 Inertia W(i,j) = (i-j) Understand what teture is, and the difference between first order and second order measures Understand the GLCM matri, and be able to describe algorithm Understand how we go from an image to a GLCM feature image Preprocessing, choosing d and, selecting some features that t are not too correlated There is no optimal teture features, it depends on the problem You should be able to discuss which feature will discriminate between two different tetures, t based on the distribution ib ti of their GLCM s. 7 8
3 Edge-based segmentation Thinning of edge in 33 neighborhood Two steps are needed:. Edge detection (to identif edgels -edge piels) - (Gradient, Laplacian, LoG, Cann filtering). Edge linking linking adjacent edgels into edges Local Processing magnitude of the gradient direction of the gradient vector edges in a predefined neighborhood are linked if both magnitude and direction criteria is satisfied Global Processing via Hough Transform Quantize the edge direction into 4-directions four (or eight) directions. If gradient magnitude G(,) >, inspect the two neighboring piels in the given direction. 3 If gradient magnitude of an of these 3 neighbors is higher than G(,), 4 mark kthe piel. 5 4 When all piels have been scanned, 6 7 delete or suppress the marked piels. Used iterativel in nonmaima suppression. 3 8-directions 9 Hough transform basic idea HT and polar representation of lines One point in (,) corresponds to a line in the (a,b)-plane (,)-space (a,b)-space Polar representation of lines
4 HT using the full gradient information Given a gradient magnitude image g(,) containing a line. Simple algorithm: for all g( i, i )>T do for all do = i cos + i sin find indees (m,n) corresponding to (ρ, θ) and increment A(m,n); Better algorithm if we have both The gradient magnitude g(,) And the gradient components g and g So we can compute gradient direction g g (, ) arctan The new algorithm: g for all g( i, i )>T do = i cos( g (,)) + i sin( g (,)) find indees (m, n) corresponding to (, g (,)), increment A(m,n); Hough transform for circles Acircleintheplane in -plane is given b ( c) c r So we have a 3D parameter space. Simple 3D accumulation procedure: set all A[ c, c,r]=; for ever (,) where g(,)>t for all c and c r=sqrt((- c ) +(- c ) ); A[ c, c,r] = A[ c, c,r]+; Better procedure? 3 4 Hough transform for ellipses A general ellipse in the -plane has 5 parameters: Position of centre ( c, c ), semi-aes (a,b), and orientation (θ). Thus, we have a 5D parameter space. For large images and full parameter resolution, straight forward HT ma easil overwhelm our computer! Reducing accumulator dimensionalit: - Pick piel pairs with opposite gradient directions - Midpoint of pair votes for centre of ellipse! - Reduces HT-accumulator from 5D to 3D. - Min and ma distance of piel pairs => b & a Reducing accumulator etent & resolution Using other tricks Learning goals - HT Understand the basic Hough Transform, and its limitations Understand that the normal representation is more general Be able to implement line detecting HT with accumulator matri Understand how this ma be improved b gradient direction information. Be able to implement simple HT for circles of given size, in order to find position of circular objects in image. Understand how this ma be improved. Understand simple HT to detect ellipses Understand how this ma be improved. Understand the basic random Hough transform. Do the eercises! 5 6
5 Shape representations vs. descriptors After the segmentation of an image, its regions or edges are represented and described in a manner appropriate for further processing. Shape representation: the was we store and represent the objects Perimeter (and all the methods based on perimeter) Interior (and all the methods ) Shape descriptors: recipes for features es characterizing acte ing object shape. The resulting feature values should be useful for discrimination between different object tpes. Chains Chains represent objects within the image or borders between an object and the background Object piel How do we define border piels? 4-neighbors 8-neighbors In which order do we check the neighbors? Chains represent the object piel, but not their spatial relationship directl. 8 Chain codes Start point & rotation Chain codes represent the boundar of a region Chain codes are formed b following the boundar in a given direction (e.g. clockwise) with 4-neighbors or 8-neighbors 3 A code is associated with each direction 3 A code is based on a starting 4 point, often the upper leftmost point of the object directional code 8-directional code The chain code depends on the starting point. It can be made invariant of start point b treating it as a circular/periodic sequence, and redefining the start point so that the resulting number is of minimum magnitude. We can also normalize for rotation b using the first difference of the chain code: (i.e., direction i changes between code elements) Code: 33 First difference (counterclockwise): To find first difference, look at the code and count counterclockwise directions. Treating the curve as circular, add the 3 for the first point. Minimum circular shift of first difference: This invariance is onl valid if the boundar itself is invariant i to rotation ti and scale. 9
6 Relative chain code Here, directions are defined in relation to a moving perspective. Eample: Orders given to a blind driver ("F, "B, "L, "R"). The directional code representing an section of the contour is relative to the directional code of the preceding section. 3 Wh is the relative code: R,F,F,R,F,R,R,L,L,R,R,F? 4 The absolute chain code for the triangles are 4,,7 and, 5, 3. The relative codes are 7, 7,. (Remember Forward is ) Invariant to rotation, as long as starting point remains the same. Start-point invariance b Minimum circular shift. Note: To find the first R, we look back to the end of the contour Note: rotate the code tbl table so thatt is forward from our position Recursive boundar splitting Draw straight line between contour points that are farthest apart. These two points are the initial breakpoints.. For each intermediate point:. Compute the point-to-line to distance 3. Find the point with the greatest distance from the line. 4. If this distance is greater than given threshold, we have a new breakpoint. 5. The previous line segment is replaced b two, and -4 above is repeated for each of them. The procedure is repeated until all contour points are within the threshold distance from a corresponding line segment. The resulting ordered set of breakpoints is then the set of vertices of a polgon approimating the original contour This is probabl the most frequentl used polgonization. Since it is recursive, the procedure is fairl slow. Recursive boundar splitting Draw line between initial breakpoints; boundar points farthest apart.. For each intermediate point:. If greatest distance from the line is lager than a given threshold, we have a new breakpoint. 3. The previous line segment is replaced b two line segments, and d - above is repeated for each of them. The procedure is repeated until all contour points are within the threshold distance from a corresponding line segment. The resulting ordered set of breakpoints is then the set of vertices of a polgon approimating the original contour. The set of breakpoints is a subset of the set of boundar points. 3 Sequential polgonization Start with an contour point as first breakpoint. Step through ordered sequence of contour points. Using previous breakpoint as the current origin, area between contour and approimating line is: Ai Ai i i i i, si i i Let previous point be new breakpoint if area deviation A per unit length s of approimating line segment eceeds a specified tolerance, T. If A i /s i < T, i is incremented and (A i, s i ) is recomputed. Otherwise, the previous point is stored as a new breakpoint, and the origin is moved to new breakpoint. This method is purel sequential and ver fast. Reference: K. Wall and P.E. Danielsson, A Fast Sequential Method for Polgonal Approimation of Digital Curves, Computer Vision, Graphics, and Image Processing, vol. 8, 984, pp
7 Sequential polgonization Signature representations = A signature is a D functional representation of a D boundar. It can be represented in several was. Simple choise: radius vs. angle: Ai i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i Invariant to translation. Not invariant to starting point, rotation or scaling. 5 6 Boundar segments from conve hull The boundar can be decomposed into segments. Useful to etract information from concave parts of the objects. Conve hull H of set S is the smallest conve set containing S. The set difference H-S is called the conve deficienc D. If we trace the boundar and identif the points where we go in and out of the conve deficienc, these points can represent important border points charaterizing the shape of the border. Border points are often nois, and smoothing can be applied first. Smooth the border b moving average of k boundar points. Use polgonal approimation to boundar. Simple algorithm to get conve hull from polgons. 7 Contour representation using D Fourier transform The coordinates (,) of these M points are Start then put into a comple vector s : s(k)=(k)+i(k), k[,m-] 7 We choose a direction (e.g. anti-clockwise) We view the -ais as the real ais and the -ais as the imaginar one for a sequence of comple numbers. The representation of the object contour is changed, but all the information is preserved. We have transformed the contour problem from D to D. = = s( ) 3 i s() i s(3) 3 3i s(4) 3 4i 8
8 Fourier-coefficients from f(k) We perform a D forward Fourier transform a( u) M M k iuk s( k)ep M M M k uk s( k) cos M uk isin, M u, M Comple coefficients a(u) are the Fourier representation of boundar. a() contains the center of mass of the object. Eclude a() as a feature for object recognition. a(), a(),...,a(m-) will describe the object in increasing detail. These depend on rotation, scaling and starting point of the contour. For object recognitions, use onl the N first coefficients (a(n), N<M) This corresponds to setting a(k)=, k>n- Fourier Smbol reconstruction Inverse Fourier transform gives an approimation to the original contour N ˆ( ) iuk s k a( u)ep, k, M k M We have onl used N features to reconstruct each component of s(k). ˆ( ) The number of points in the approimation is the same (M ), but the number of coefficients (features) used to reconstruct each point is smaller (N<M ). Use an even number of descriptors. The first -6 6 descriptors are found to be sufficient i for character description. The can be used as features for classification. The Fourier descriptors can be invariant to translation and rotation if the coordinate sstem is appropriatel chosen. All properties of D Fourier transform pairs (scaling, translation, rotation) can be applied. 9 3 Eamples from Trier et al. 996 Run Length Encoding of Objects Sequences of adjacent piels are represented as runs. Absolute notation of foreground in binar images: Run i = ;<row i, column i, runlength i >; Relative notation in gralevel images: ;(gralevel i, runlength i ); This is used as a lossless compression transform. Relative notation in binar images: Start value, length, length,, eol, Start value, length, length,, eol,eol. This is also useful for representation of image bit planes. RLE is found in TIFF, GIF, JPEG,, and in fa machines. 3 3
9 Topologic features Projections This is a group of invariant integer features Invariant to position, rotation, scaling, warping Features based on the object skeleton Number of terminations (one line from a point) Number of breakpoints or corners (two lines from a point) Number of branching points (three lines from a point) Number of crossings (> three lines from a point) Region with two holes Region features: Number of holes in the object (H) Number of components (C) Euler number, E = C - H Number of connected components number of holes Smmetr Regions with three connected components D horizontal projection of the region: p h( ) f (, ) D vertical projection of the region: p v ( ) f (, ) Can be made scale independent b using a fied number of bins and normalizing i the histograms. Radial projection in reference to centroid -> signature Moments Central moments Borrows ideas from phsics and statistics. For a given continuous intensit distribution g(, ) we define moments m pq b These are position invariant moments : where The total mass and the center of mass are given b For sampled (and bounded) intensit distributions f (, ) Amomentm m pq is of order p+q q. This moment is NOT invariant to position of object! 35 This corresponds to computing ordinar moments after having translated the object so that center of mass is in origo. Central moments are independent of position, but are not scaling or rotation invariant. What is for a binar object? 36
10 Object orientation - I Object orientation - II Orientation is defined as the angle, relative to the X-ais, of an ais through h the centre of mass that gives the lowest moment of inertia. Orientation θ relative to X-ais found b minimizing: I f, where the rotated coordinates are given b cos sin, sin cos The second order central moment of the object around the α-ais, epressed in terms of,, and the orientation angle θ of the object: cos sin f I, β Y θ α X Second order central moment around the α-ais: I cos sin f, Derivative w.r.t. Θ = => I f (, ) cos sin sin cos f (, ) cos sin f (, ) sin cos cos sin sin cos sin cos tan tan cos sin tan So the object orientation is given b: β Y θ α X We take the derivative of this epression with respect to the angle θ Set derivative equal to zero, and find a simple epression for θ : tan, where, if,, if Bounding bo - again Image-oriented bounding bo: The smallest rectangle around the object, having sides parallell to the edges of the image. Found b searching for min and ma and within the object (min, min, ma, ma) Object-oriented bounding bo: Smalles rectangle around the object, having one side parallell to the orientation of the object (). The transformation cos sin, cos sin is applied to all piels in the object (or its boundar). Then search for min, min, ma, ma What if we want scale-invariance? Changing the scale of f(,) b (,) gives a new image: f (, ) f /, / The transformed central moments p q q pq If =, scale-invariant central moments are given b the normalization: i pq p q pq,, p q ( ) pq 39 4
11 Moments as shape features The curse-of-dimensionalit The central moments are seldom used directl as shape descriptors. Major and minor ais are useful shape descriptors. Object orientation is normall not used directl, but to estimate rotation. The set of 7 Hu moments can be used as shape features. (Start with the first four, as the last half are often zero for simple objects). Also called peaking phenomenon. For a finite training sample size, the correct classification rate initiall increases when adding new features, attains a maimum and then begins to decrease. The implication is that: t For a high measurement compleit, we will need large amounts of training data in order to attain the best classification performance. => 5- samples per feature per class. Illustration from G.F. Hughes (968). Correct classification rate as function of feature dimensionalit, for different amounts of training data. Equal prior probabilities of the two classes is assumed. 4 4
SUMMARY PART I. Variance, 2, is directly a measure of roughness. A measure of smoothness is
Digital Image Analsis SUMMARY PART I Fritz Albregtsen 8..5 Teture description of regions Remember: we estimate local properties (features) to be able to isolate regions which are similar in an image (segmentation),
More informationSUMMARY PART I. What is texture? Uses for texture analysis. Computing texture images. Using variance estimates. INF 4300 Digital Image Analysis
INF 4 Digital Image Analysis SUMMARY PART I Fritz Albregtsen 4.. F 4.. INF 4 What is texture? Intuitively obvious, but no precise definition exists fine, coarse, grained, smooth etc Texture consists of
More informationFROM PIXELS TO REGIONS
Digital Image Analysis OBJECT REPRESENTATION FROM PIXELS TO REGIONS Fritz Albregtsen Today G & W Ch. 11.1 1 Representation Curriculum includes lecture notes. We cover the following: 11.1.1 Boundary following
More informationAnne Solberg
INF 4300 Digital Image Analysis OBJECT REPRESENTATION Anne Solberg 26.09.2012 26.09.2011 INF 4300 1 Today G & W Ch. 11.1 1 Representation Curriculum includes lecture notes. We cover the following: 11.1.1
More informationOBJECT DESCRIPTION - FEATURE EXTRACTION
INF 4300 Digital Image Analysis OBJECT DESCRIPTION - FEATURE EXTRACTION Fritz Albregtsen 1.10.011 F06 1.10.011 INF 4300 1 Today We go through G&W section 11. Boundary Descriptors G&W section 11.3 Regional
More informationLecture 10: Image Descriptors and Representation
I2200: Digital Image processing Lecture 10: Image Descriptors and Representation Prof. YingLi Tian Nov. 15, 2017 Department of Electrical Engineering The City College of New York The City University of
More informationLecture 18 Representation and description I. 2. Boundary descriptors
Lecture 18 Representation and description I 1. Boundary representation 2. Boundary descriptors What is representation What is representation After segmentation, we obtain binary image with interested regions
More informationIN5520 Digital Image Analysis. Two old exams. Practical information for any written exam Exam 4300/9305, Fritz Albregtsen
IN5520 Digital Image Analysis Two old exams Practical information for any written exam Exam 4300/9305, 2016 Exam 4300/9305, 2017 Fritz Albregtsen 27.11.2018 F13 27.11.18 IN 5520 1 Practical information
More informationBoundary descriptors. Representation REPRESENTATION & DESCRIPTION. Descriptors. Moore boundary tracking
Representation REPRESENTATION & DESCRIPTION After image segmentation the resulting collection of regions is usually represented and described in a form suitable for higher level processing. Most important
More informationCoE4TN4 Image Processing
CoE4TN4 Image Processing Chapter 11 Image Representation & Description Image Representation & Description After an image is segmented into regions, the regions are represented and described in a form suitable
More informationDigital Image Processing Chapter 11: Image Description and Representation
Digital Image Processing Chapter 11: Image Description and Representation Image Representation and Description? Objective: To represent and describe information embedded in an image in other forms that
More informationCS 335 Graphics and Multimedia. Geometric Warping
CS 335 Graphics and Multimedia Geometric Warping Geometric Image Operations Eample transformations Straightforward methods and their problems The affine transformation Transformation algorithms: Forward
More informationToday s class. Geometric objects and transformations. Informationsteknologi. Wednesday, November 7, 2007 Computer Graphics - Class 5 1
Toda s class Geometric objects and transformations Wednesda, November 7, 27 Computer Graphics - Class 5 Vector operations Review of vector operations needed for working in computer graphics adding two
More informationTopic 6 Representation and Description
Topic 6 Representation and Description Background Segmentation divides the image into regions Each region should be represented and described in a form suitable for further processing/decision-making Representation
More informationMachine vision. Summary # 6: Shape descriptors
Machine vision Summary # : Shape descriptors SHAPE DESCRIPTORS Objects in an image are a collection of pixels. In order to describe an object or distinguish between objects, we need to understand the properties
More informationEECS490: Digital Image Processing. Lecture #23
Lecture #23 Motion segmentation & motion tracking Boundary tracking Chain codes Minimum perimeter polygons Signatures Motion Segmentation P k Accumulative Difference Image Positive ADI Negative ADI (ADI)
More informationTEXTURE. Plan for today. Segmentation problems. What is segmentation? INF 4300 Digital Image Analysis. Why texture, and what is it?
INF 43 Digital Image Analysis TEXTURE Plan for today Why texture, and what is it? Statistical descriptors First order Second order Gray level co-occurrence matrices Fritz Albregtsen 8.9.21 Higher order
More informationPractical Image and Video Processing Using MATLAB
Practical Image and Video Processing Using MATLAB Chapter 18 Feature extraction and representation What will we learn? What is feature extraction and why is it a critical step in most computer vision and
More informationLecture 8 Object Descriptors
Lecture 8 Object Descriptors Azadeh Fakhrzadeh Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University 2 Reading instructions Chapter 11.1 11.4 in G-W Azadeh Fakhrzadeh
More informationEE 584 MACHINE VISION
EE 584 MACHINE VISION Binary Images Analysis Geometrical & Topological Properties Connectedness Binary Algorithms Morphology Binary Images Binary (two-valued; black/white) images gives better efficiency
More informationBasic Algorithms for Digital Image Analysis: a course
Institute of Informatics Eötvös Loránd University Budapest, Hungary Basic Algorithms for Digital Image Analysis: a course Dmitrij Csetverikov with help of Attila Lerch, Judit Verestóy, Zoltán Megyesi,
More informationChapter 11 Representation & Description
Chain Codes Chain codes are used to represent a boundary by a connected sequence of straight-line segments of specified length and direction. The direction of each segment is coded by using a numbering
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 informationFeature description. IE PŁ M. Strzelecki, P. Strumiłło
Feature description After an image has been segmented the detected region needs to be described (represented) in a form more suitable for further processing. Representation of an image region can be carried
More informationUNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences
UNIVERSITY OF OSLO Faculty of Mathematics and Natural Sciences Exam: INF 4300 / INF 9305 Digital image analysis Date: Thursday December 21, 2017 Exam hours: 09.00-13.00 (4 hours) Number of pages: 8 pages
More informationAn edge is not a line... Edge Detection. Finding lines in an image. Finding lines in an image. How can we detect lines?
Edge Detection An edge is not a line... original image Cann edge detector Compute image derivatives if gradient magnitude > τ and the value is a local maimum along gradient direction piel is an edge candidate
More informationGRAPHICS OUTPUT PRIMITIVES
CHAPTER 3 GRAPHICS OUTPUT PRIMITIVES LINE DRAWING ALGORITHMS DDA Line Algorithm Bresenham Line Algorithm Midpoint Circle Algorithm Midpoint Ellipse Algorithm CG - Chapter-3 LINE DRAWING Line drawing is
More informationImage representation. 1. Introduction
Image representation Introduction Representation schemes Chain codes Polygonal approximations The skeleton of a region Boundary descriptors Some simple descriptors Shape numbers Fourier descriptors Moments
More informationReteaching Golden Ratio
Name Date Class Golden Ratio INV 11 You have investigated fractals. Now ou will investigate the golden ratio. The Golden Ratio in Line Segments The golden ratio is the irrational number 1 5. c On the line
More informationContents Edge Linking and Boundary Detection
Contents Edge Linking and Boundar Detection 3 Edge Linking z Local processing link all points in a local neighbourhood (33, 55, etc.) that are considered to be similar similar response strength of a gradient
More informationChapter 11 Representation & Description
Chapter 11 Representation & Description The results of segmentation is a set of regions. Regions have then to be represented and described. Two main ways of representing a region: - external characteristics
More informationUlrik Söderström 21 Feb Representation and description
Ulrik Söderström ulrik.soderstrom@tfe.umu.se 2 Feb 207 Representation and description Representation and description Representation involves making object definitions more suitable for computer interpretations
More informationName Class Date. subtract 3 from each side. w 5z z 5 2 w p - 9 = = 15 + k = 10m. 10. n =
Reteaching Solving Equations To solve an equation that contains a variable, find all of the values of the variable that make the equation true. Use the equalit properties of real numbers and inverse operations
More informationCS443: Digital Imaging and Multimedia Binary Image Analysis. Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University
CS443: Digital Imaging and Multimedia Binary Image Analysis Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University Outlines A Simple Machine Vision System Image segmentation by thresholding
More informationScale Invariant Feature Transform (SIFT) CS 763 Ajit Rajwade
Scale Invariant Feature Transform (SIFT) CS 763 Ajit Rajwade What is SIFT? It is a technique for detecting salient stable feature points in an image. For ever such point it also provides a set of features
More informationComputer Graphics. Modelling in 2D. 2D primitives. Lines and Polylines. OpenGL polygon primitives. Special polygons
Computer Graphics Modelling in D Lecture School of EECS Queen Mar, Universit of London D primitives Digital line algorithms Digital circle algorithms Polgon filling CG - p.hao@qmul.ac.uk D primitives Line
More informationAnnouncements, schedule. Lecture 8: Fitting. Weighted graph representation. Outline. Segmentation by Graph Cuts. Images as graphs
Announcements, schedule Lecture 8: Fitting Tuesday, Sept 25 Grad student etensions Due of term Data sets, suggestions Reminder: Midterm Tuesday 10/9 Problem set 2 out Thursday, due 10/11 Outline Review
More informationIssues with Curve Detection Grouping (e.g., the Canny hysteresis thresholding procedure) Model tting They can be performed sequentially or simultaneou
an edge image, nd line or curve segments present Given the image. in Line and Curves Detection 1 Issues with Curve Detection Grouping (e.g., the Canny hysteresis thresholding procedure) Model tting They
More informationPhoto by Carl Warner
Photo b Carl Warner Photo b Carl Warner Photo b Carl Warner Fitting and Alignment Szeliski 6. Computer Vision CS 43, Brown James Has Acknowledgment: Man slides from Derek Hoiem and Grauman&Leibe 2008 AAAI
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 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 information(10) Image Segmentation
(0) Image Segmentation - Image analysis Low-level image processing: inputs and outputs are all images Mid-/High-level image processing: inputs are images; outputs are information or attributes of the images
More informationWheelchair Detection in a Calibrated Environment
Wheelchair Detection in a Calibrated Environment Ashish Mles Universit of Florida marcian@visto.com Dr. Niels Da Vitoria Lobo Universit of Central Florida niels@cs.ucf.edu Dr. Mubarak Shah Universit of
More informationHOUGH TRANSFORM. Plan for today. Introduction to HT. An image with linear structures. INF 4300 Digital Image Analysis
INF 4300 Digital Image Analysis HOUGH TRANSFORM Fritz Albregtsen 14.09.2011 Plan for today This lecture goes more in detail than G&W 10.2! Introduction to Hough transform Using gradient information to
More informationCAP 5415 Computer Vision Fall 2012
CAP 5415 Computer Vision Fall 2012 Hough Transform Lecture-18 Sections 4.2, 4.3 Fundamentals of Computer Vision Image Feature Extraction Edges (edge pixels) Sobel, Roberts, Prewit Laplacian of Gaussian
More informationComputer Graphics. Lecture 3 Graphics Output Primitives. Somsak Walairacht, Computer Engineering, KMITL
Computer Graphics Lecture 3 Graphics Output Primitives Somsa Walairacht, Computer Engineering, KMITL Outline Line Drawing Algorithms Circle-, Ellipse-Generating Algorithms Fill-Area Primitives Polgon Fill
More informationLecture 9 (4.2.07) Image Segmentation. Shahram Ebadollahi 4/4/ DIP ELEN E4830
Lecture 9 4..07 Image Segmentation Shahram Ebadollahi 4/4/007 1 DIP ELEN E4830 Lecture Outline Skeletonizaiton GSAT Watershed Algorithm Image Segmentation Introduction Edge detection and linking Thresholding
More informationBiomedical Image Analysis. Point, Edge and Line Detection
Biomedical Image Analysis Point, Edge and Line Detection Contents: Point and line detection Advanced edge detection: Canny Local/regional edge processing Global processing: Hough transform BMIA 15 V. Roth
More informationDigital Image Processing
Digital Image Processing Part 9: Representation and Description AASS Learning Systems Lab, Dep. Teknik Room T1209 (Fr, 11-12 o'clock) achim.lilienthal@oru.se Course Book Chapter 11 2011-05-17 Contents
More informationCOMPUTER AND ROBOT VISION
VOLUME COMPUTER AND ROBOT VISION Robert M. Haralick University of Washington Linda G. Shapiro University of Washington A^ ADDISON-WESLEY PUBLISHING COMPANY Reading, Massachusetts Menlo Park, California
More informationLecture 6: Multimedia Information Retrieval Dr. Jian Zhang
Lecture 6: Multimedia Information Retrieval Dr. Jian Zhang NICTA & CSE UNSW COMP9314 Advanced Database S1 2007 jzhang@cse.unsw.edu.au Reference Papers and Resources Papers: Colour spaces-perceptual, historical
More informationHOUGH TRANSFORM CS 6350 C V
HOUGH TRANSFORM CS 6350 C V HOUGH TRANSFORM The problem: Given a set of points in 2-D, find if a sub-set of these points, fall on a LINE. Hough Transform One powerful global method for detecting edges
More informationImage warping/morphing
Image warping/morphing Digital Visual Effects, Spring 2007 Yung-Yu Chuang 2007/3/20 with slides b Richard Szeliski, Steve Seitz, Tom Funkhouser and Aleei Efros Image warping Image formation B A Sampling
More informationExample 2: Straight Lines. Image Segmentation. Example 3: Lines and Circular Arcs. Example 1: Regions
Image Segmentation Image segmentation is the operation of partitioning an image into a collection of connected sets of pixels. 1. into regions, which usually cover the image Example : Straight Lines. into
More informationExample 1: Regions. Image Segmentation. Example 3: Lines and Circular Arcs. Example 2: Straight Lines. Region Segmentation: Segmentation Criteria
Image Segmentation Image segmentation is the operation of partitioning an image into a collection of connected sets of pixels. 1. into regions, which usually cover the image Example 1: Regions. into linear
More informationTwo Dimensional Viewing
Two Dimensional Viewing Dr. S.M. Malaek Assistant: M. Younesi Two Dimensional Viewing Basic Interactive Programming Basic Interactive Programming User controls contents, structure, and appearance of objects
More informationangle The figure formed by two lines with a common endpoint called a vertex. angle bisector The line that divides an angle into two equal parts.
A angle The figure formed b two lines with a common endpoint called a verte. verte angle angle bisector The line that divides an angle into two equal parts. circle A set of points that are all the same
More informationSTRAND I: Geometry and Trigonometry. UNIT 37 Further Transformations: Student Text Contents. Section Reflections. 37.
MEP Jamaica: STRN I UNIT 7 Further Transformations: Student Tet ontents STRN I: Geometr and Trigonometr Unit 7 Further Transformations Student Tet ontents Section 7. Reflections 7. Rotations 7. Translations
More informationWhat and Why Transformations?
2D transformations What and Wh Transformations? What? : The geometrical changes of an object from a current state to modified state. Changing an object s position (translation), orientation (rotation)
More informationTypes of Edges. Why Edge Detection? Types of Edges. Edge Detection. Gradient. Edge Detection
Why Edge Detection? How can an algorithm extract relevant information from an image that is enables the algorithm to recognize objects? The most important information for the interpretation of an image
More informationOutline. Advanced Digital Image Processing and Others. Importance of Segmentation (Cont.) Importance of Segmentation
Advanced Digital Image Processing and Others Xiaojun Qi -- REU Site Program in CVIP (7 Summer) Outline Segmentation Strategies and Data Structures Algorithms Overview K-Means Algorithm Hidden Markov Model
More informationModule 2, Section 2 Graphs of Trigonometric Functions
Principles of Mathematics Section, Introduction 5 Module, Section Graphs of Trigonometric Functions Introduction You have studied trigonometric ratios since Grade 9 Mathematics. In this module ou will
More informationCS F-07 Objects in 2D 1
CS420-2010F-07 Objects in 2D 1 07-0: Representing Polgons We want to represent a simple polgon Triangle, rectangle, square, etc Assume for the moment our game onl uses these simple shapes No curves for
More informationLast Time. Correct Transparent Shadow. Does Ray Tracing Simulate Physics? Does Ray Tracing Simulate Physics? Refraction and the Lifeguard Problem
Graphics Pipeline: Projective Last Time Shadows cast ra to light stop after first intersection Reflection & Refraction compute direction of recursive ra Recursive Ra Tracing maimum number of bounces OR
More informationAshish Negi Associate Professor, Department of Computer Science & Engineering, GBPEC, Pauri, Garhwal, Uttarakhand, India
Volume 7, Issue 1, Januar 2017 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Comparative Analsis
More informationMultimedia Information Retrieval
Multimedia Information Retrieval Prof Stefan Rüger Multimedia and Information Systems Knowledge Media Institute The Open University http://kmi.open.ac.uk/mmis Why content-based? Actually, what is content-based
More informationFitting a transformation: Feature-based alignment April 30 th, Yong Jae Lee UC Davis
Fitting a transformation: Feature-based alignment April 3 th, 25 Yong Jae Lee UC Davis Announcements PS2 out toda; due 5/5 Frida at :59 pm Color quantization with k-means Circle detection with the Hough
More informationInternational Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS)
International Association of Scientific Innovation and Research (IASIR) (An Association Unifing the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationCS4733 Class Notes, Computer Vision
CS4733 Class Notes, Computer Vision Sources for online computer vision tutorials and demos - http://www.dai.ed.ac.uk/hipr and Computer Vision resources online - http://www.dai.ed.ac.uk/cvonline Vision
More informationMulti-stable Perception. Necker Cube
Multi-stable Perception Necker Cube Spinning dancer illusion, Nobuuki Kaahara Fitting and Alignment Computer Vision Szeliski 6.1 James Has Acknowledgment: Man slides from Derek Hoiem, Lana Lazebnik, and
More informationReview for the Final
Review for the Final CS 635 Review (Topics Covered) Image Compression Lossless Coding Compression Huffman Interpixel RLE Lossy Quantization Discrete Cosine Transform JPEG CS 635 Review (Topics Covered)
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 informationAnnouncements. Recognition I. Optical Flow: Where do pixels move to? dy dt. I + y. I = x. di dt. dx dt. = t
Announcements I Introduction to Computer Vision CSE 152 Lecture 18 Assignment 4: Due Toda Assignment 5: Posted toda Read: Trucco & Verri, Chapter 10 on recognition Final Eam: Wed, 6/9/04, 11:30-2:30, WLH
More informationNONCONGRUENT EQUIDISSECTIONS OF THE PLANE
NONCONGRUENT EQUIDISSECTIONS OF THE PLANE D. FRETTLÖH Abstract. Nandakumar asked whether there is a tiling of the plane b pairwise non-congruent triangles of equal area and equal perimeter. Here a weaker
More informationChapter 3. Sukhwinder Singh
Chapter 3 Sukhwinder Singh PIXEL ADDRESSING AND OBJECT GEOMETRY Object descriptions are given in a world reference frame, chosen to suit a particular application, and input world coordinates are ultimately
More informationEdge detection. Gradient-based edge operators
Edge detection Gradient-based edge operators Prewitt Sobel Roberts Laplacian zero-crossings Canny edge detector Hough transform for detection of straight lines Circle Hough Transform Digital Image Processing:
More informationCS 157: Assignment 6
CS 7: Assignment Douglas R. Lanman 8 Ma Problem : Evaluating Conve Polgons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a conve
More informationGPR Objects Hyperbola Region Feature Extraction
Advances in Computational Sciences and Technolog ISSN 973-617 Volume 1, Number 5 (17) pp. 789-84 Research India Publications http://www.ripublication.com GPR Objects Hperbola Region Feature Etraction K.
More informationTransactions on Information and Communications Technologies vol 16, 1996 WIT Press, ISSN
Shape-invariant object detection with large scale changes John DeCatrel Department of Computer Science, Florida State University, Tallahassee, FL 32306-4019 EMail: decatrel@cs.fsu.edu Abstract This paper
More informationImage and Multidimensional Signal Processing
Image and Multidimensional Signal Processing Professor William Hoff Dept of Electrical Engineering &Computer Science http://inside.mines.edu/~whoff/ Representation and Description 2 Representation and
More information4 Parametrization of closed curves and surfaces
4 Parametrization of closed curves and surfaces Parametrically deformable models give rise to the question of obtaining parametrical descriptions of given pixel or voxel based object contours or surfaces,
More informationAnno accademico 2006/2007. Davide Migliore
Robotica Anno accademico 6/7 Davide Migliore migliore@elet.polimi.it Today What is a feature? Some useful information The world of features: Detectors Edges detection Corners/Points detection Descriptors?!?!?
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 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 informationChap 7, 2009 Spring Yeong Gil Shin
Three-Dimensional i Viewingi Chap 7, 29 Spring Yeong Gil Shin Viewing i Pipeline H d fi i d? How to define a window? How to project onto the window? Rendering "Create a picture (in a snthetic camera) Specification
More informationFeature Selection. Ardy Goshtasby Wright State University and Image Fusion Systems Research
Feature Selection Ardy Goshtasby Wright State University and Image Fusion Systems Research Image features Points Lines Regions Templates 2 Corners They are 1) locally unique and 2) rotationally invariant
More informationLecture 9: Hough Transform and Thresholding base Segmentation
#1 Lecture 9: Hough Transform and Thresholding base Segmentation Saad Bedros sbedros@umn.edu Hough Transform Robust method to find a shape in an image Shape can be described in parametric form A voting
More informationCHAPTER 2 TEXTURE CLASSIFICATION METHODS GRAY LEVEL CO-OCCURRENCE MATRIX AND TEXTURE UNIT
CHAPTER 2 TEXTURE CLASSIFICATION METHODS GRAY LEVEL CO-OCCURRENCE MATRIX AND TEXTURE UNIT 2.1 BRIEF OUTLINE The classification of digital imagery is to extract useful thematic information which is one
More informationA New Method for Representing and Matching Two-dimensional Shapes
A New Method for Representing and Matching Two-dimensional Shapes D.S. Guru and H.S. Nagendraswam Department of Studies in Computer Science, Universit of Msore, Manasagangothri, Msore-570006 Email: guruds@lcos.com,
More informationPARAMETRIC EQUATIONS AND POLAR COORDINATES
9 ARAMETRIC EQUATIONS AND OLAR COORDINATES So far we have described plane curves b giving as a function of f or as a function of t or b giving a relation between and that defines implicitl as a function
More information3.5 Rational Functions
0 Chapter Polnomial and Rational Functions Rational Functions For a rational function, find the domain and graph the function, identifing all of the asmptotes Solve applied problems involving rational
More informationMidterm Wed. Local features: detection and description. Today. Last time. Local features: main components. Goal: interest operator repeatability
Midterm Wed. Local features: detection and description Monday March 7 Prof. UT Austin Covers material up until 3/1 Solutions to practice eam handed out today Bring a 8.5 11 sheet of notes if you want Review
More informationImage Warping, mesh, and triangulation CSE399b, Spring 07 Computer Vision
http://grail.cs.washington.edu/projects/rotoscoping/ Image Warping, mesh, and triangulation CSE399b, Spring 7 Computer Vision Man of the slides from A. Efros. Parametric (global) warping Eamples of parametric
More informationDietrich Paulus Joachim Hornegger. Pattern Recognition of Images and Speech in C++
Dietrich Paulus Joachim Hornegger Pattern Recognition of Images and Speech in C++ To Dorothea, Belinda, and Dominik In the text we use the following names which are protected, trademarks owned by a company
More informationChapter 3 Image Registration. Chapter 3 Image Registration
Chapter 3 Image Registration Distributed Algorithms for Introduction (1) Definition: Image Registration Input: 2 images of the same scene but taken from different perspectives Goal: Identify transformation
More informationPerspective Projection Transformation
Perspective Projection Transformation Where does a point of a scene appear in an image?? p p Transformation in 3 steps:. scene coordinates => camera coordinates. projection of camera coordinates into image
More informationLecture 15: Segmentation (Edge Based, Hough Transform)
Lecture 15: Segmentation (Edge Based, Hough Transform) c Bryan S. Morse, Brigham Young University, 1998 000 Last modified on February 3, 000 at :00 PM Contents 15.1 Introduction..............................................
More informationUNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences
UNIVERSITY OF OSLO Faculty of Mathematics and Natural Sciences Exam: INF 43 / INF 935 Digital image analysis Date: Thursday December 4, 4 Exam hours: 4.3-8.3 (4 hours) Number of pages: 6 pages Enclosures:
More informationGeometric Image Transformations and Related Topics
Geometric Image Transformations and Related Topics 9 th Lesson on Image Processing Martina Mudrová 2004 Topics What will be the topic of the following lesson? Geometric image transformations Interpolation
More informationProblem definition Image acquisition Image segmentation Connected component analysis. Machine vision systems - 1
Machine vision systems Problem definition Image acquisition Image segmentation Connected component analysis Machine vision systems - 1 Problem definition Design a vision system to see a flat world Page
More information