9 length of contour = no. of horizontal and vertical components + ( 2 no. of diagonal components) diameter of boundary B
|
|
- William Abraham Harvey
- 5 years ago
- Views:
Transcription
1 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 diameter of boundary B - Diam (B max[d(p,p ] i, j i j where D : distance measure p i, p j : points on boundary - value and orientation of diameter : useful descriptors curvature - the rate of change of slope - approximately difference between the slopes of adjacent boundary segments useful descriptor of curvature - in clockwise direction 9 the change in slope at p : nonnegative vertex point p : part of convex segment 9 the change in slope at p : negative vertex point p : part of concave segment - ranges in the change of slope 9 p : part of a nearby straight segment if the change < : corner point if the change > Shape Numbers Shape number - the first difference of smallest magnitude Order n - the no. of digits in its representation - n : even for a closed boundary 8
2 Eccentricity (9u, ÁÑu of boundary - ratio of major to minor axis - Major axis (straight-line segment joining the two points farthest from each other - Minor axis (perpendicular to the major axis For unique shape number Alignment the chain-code grid with the basic rectangle ex. fig
3 8..3 Fourier Descriptor fig N-point digital boundary in x y-plane - Starting point ( x, y, sequence ( x, y,,( x N, yn counterclockwise - Coordinates x ( k xk, y ( k yk s ( k [ x( k, y( k] for k,,,, N- complex number s ( k x( k jy( k advantage : -D -D problem DFT of s(k N - a( u N k s( kexp[ jπuk / N] : Fourier descriptors of boundary - IDFT of a(u s( k N u - approximation to s(k M u a( uexp[ jπuk / N] sˆ( k a( uexp[ jπuk / N] for k,,,, N- that is, a( u for u > M - low-freq. Components : determine global shape high-freq. Components : account for fine detail
4 the smaller M the more detail : lost on boundary ex. fig. 8.5 A few Fourier descriptor - capture the gross essence of boundary : valuable property - used as the basis for differentiating between distinct boundary shape ( chap. 9 : detail Change of boundary : translation, rotation, scaling simple transformation on the descriptors - rotation 9 multiplying the point by e 9 rotated sequence : s ( k e N Fourier descriptor ar ( u N jθ jθ k s( kexp[ jθ ][ jπuk / N] jθ ( for u,,,, N- a u e 9 rotation : coeffs. X multiplicative constant table 8. jθ e some basic properties of Fourier descriptor
5 8..4 Moments shape of boundary segments - described quantitatively by using moments fig. 8.6 (a segment of boundary (b represented as a -D function g(r of variance r - amplitude histogram of g p ( v i, i,,, k v i : random variable where k : number of discrete amplitude increment - n-th moment of v about its mean ( v n where k i ( v m i m k i n p( v i v i i v p( : mean - : variance m: mean - generally, only the first few moments : required to difference between distinct shapes alternatives - normaliation of g(r to unit area - (r : measures the spread of curve about mean
6 3 (r : measures its symmetry with reference to the mean description task reduce -D function - moments : the most popular method 9 advantages : straight-forward implementation physical interpretation of boundary shape insensitive to rotation sie normaliation : achieved by scaling the range of r 8.3 Regional Descriptors 8.3. Some simple Descriptors - area : no. of pixels contained within its boundary - perimeter : length of boundary applied in the case that sie of object : invariant or in measuring compactness of a region ( perimeter / area : no. dimension 9 min. for a disk-shaped region 9 insensitive to rotation - principal axes of region - eigenvectors of covariance matrix obtained by using the pixels within region - two eigenvectors 9 point in the directions of maximal region spread 9 orthogonal each other - degree of spread : measured by the corresponding eigenvalues - principal spread and direction of region 9 described by the largest eigenvalues and its corresponding eigenvector - insensitive to rotation - depend on scale change (eigenvalue : changed 9 alternative : ratio of the large to the small eigenvalues descriptor (insensitive to scale change 8.3. Topological Descriptors : useful for global description topology - a study of properties of figure that are unaffected by any deformation, as long as there is no 3
7 tearing or joining of figure (called rubber-sheet distortions - ex. fig region with two holes 9 if topological descriptor : no. of holes not affected by a stretching or rotation transformation 9 if region is torn or folded no. of holes : changed another topological property : no. of connected components - connected component of a set 9 a subset of maximal sie such that any two of its points : joined by a connected curve lying entirely within the subset fig connected components Euler number E - E C H where C : no. of connected components H : no. of holes - topological property fig
8 (a E C H (b E C H Polygon network - no. of vertices, edges, and face : W, Q, F - Euler formular W Q F C H E fig vertices, edges, faces connected region, 3 holes 7 3 Topological property : rather general Texture Texture - measure of properties such as smoothness, coarseness, and regularity - three principal approach 9 statistical, structural, spectral Statistical approach 5
9 : smooth, coarse, graining and so on : characterie Moment of histogram : the simplest approach describing texture - p ( i for i,,, L : histogram where i : discrete image intensity - moment of about the mean ( n where L i ( m i m L n p( p( i i i 9 u, u Variance σ ( : the second moment - important factor in texture description - measure of gray level contrast 9 descriptor of relative smoothness - measure R σ ( 9 for area of constant intensity ( σ ( 9 for large values of σ ( Third moment : measure of skewness ( Mºb of histogram Fourth moment : measure of relative flatness i Fifth and higher moments : not so easily related to histogram shape - provide further quantitative discrimination of texture content Problem - no information regarding the relative position of pixels with respect to each other P : position operator A : k k matrix whose element a ij is the no. of times that points with gray level i occur relative to points with gray level j with i, j k ex.,, 3 6
10 an image p : one pixel to the right and one pixel to the left j a ij : x x fá i õ i } i ý e j i M MNm pixel 4 A 3 ex. a 3 : } i ýá E ý Sie of A : determined by the no. of distinct gray level in the input image - intensities : should requantied into a few gray level bands in order to keep the sie of A manageable n : total no. of point pairs in image that satisfy P ( in ex. n6 C A n : called gray level co-occurrence matrix - ij c : estimate of the joint prob. that a pair of points satisfying P will have values i, ( j - presence of texture pattern 9 detected by choosing an appropriate position operator analysis of C matrix - a set of descriptors useful for this purpose max. prob. max( c : an indication of the strongest response to P i, j ij Element difference moment of order k i j ( i j : relative low value when the high values of C are near the main diagonal, k c ij because the differences (i - j are smaller there 3 Inverse element difference moment of order k k cij /( i j, i j : apposite effect of i 4 Entropy j i j c log : measure of randomness, achieving its highest value when all elements of C ij c ij 7
11 are equal 5 Uniformity i j c ij : the lowest value when ij c s are all equal basic idea - characterie the content of C via these descriptors use of these descriptor - teach a system representative descriptor value or a set of different texture - unknown region 9 its descriptor : matched with those stored in the system memory Structural approach Rewritten S as Fig. 8. symbol - a : a circle - a meaning of circles to the right 9 assigned to a string of the form aaa. - rule S as : generation of fig. 8. (b some new rules - S as, S ba, A ca, A c, A bs, S a 9 b : circle down 8
12 9 c : circle to the left - string 9 aaas aaaba aaabca aaabccbs aaabccbaa 3 3 matrix of circles in fig. 8. (c basic idea - simple texture primitive more complex texture patterns by some rules that limit the no. of possible arrangements of primitives(s 3 Spectral approach Three features of the Fourier spectrum that are useful for texture descriptions prominent peaks in the spectrum : principal direction of the texture patterns location of peaks in the spectrum : fundamental spatial period of patterns 3 eliminating any periodic components via filtering : leaves non-periodic image elements Polar form spectrum - S ( r, θ : spectrum function, r, θ : variable - -D function 9 S θ (r : variable r for fixed θ 9 r (θ S : variable θ for fixed r More global description π - S( r Sθ ( r θ R - S( θ S r ( θ : R : radius of a circle r A pair of value : S (r, S(θ - constitute a spectral-energy description of texture for an entire image - descriptor of these functions 9 mean, variance of both the amplitude and axial variations 9 distance between the mean and the highest value of the function ex. fig
13 8.3.4 Moments moment of order (p q for function f (x, y m p q pq x y f x, y ( dxdy for p, q,,, uniqueness theorem - if f (x, y 9 piecewise continuous and 9 nonero values only in a finite part of the xy-plane moments of all orders : exist the moment sequence ( m pq is uniquely determined by f (x, y - conversely, ( m pq uniquely determines f (x, y central moments
14 p q pq ( x x ( y y f ( x, y - where dxdy m m x and - for digital images pq x y m y m p q ( x x ( y y f ( x, y - the central moments of order up to 3,,, 3,,, - in summary, m m ym 3 3 m 3 xm 3 m x m ym xm y m m xm m xm ym x m m ym 3 m 3 3ym y m - normalied central moments pq pq γ p q where γ for p q, 3, a set of seven invariant moments - derived from the second and third moments φ φ ( 4 φ 3 ( 3 3 (3 3 φ 4 ( 3 ( 3 φ ( 3 ( [( (3 ] (3 3( [3( 3 ( 3 ]
15 ( ( 4 ] ( [( ( φ ( (3 ] (3 [( ( 3 ( φ ] ( [3( 3 3 ex.fig. 8.4 table 8.
Lecture 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 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 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 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 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 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 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 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 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 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 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 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 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 information- Low-level image processing Image enhancement, restoration, transformation
() Representation and Description - Low-level image processing enhancement, restoration, transformation Enhancement Enhanced Restoration/ Transformation Restored/ Transformed - Mid-level image processing
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 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 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 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 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 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 informationECEN 447 Digital Image Processing
ECEN 447 Digital Image Processing Lecture 8: Segmentation and Description Ulisses Braga-Neto ECE Department Texas A&M University Image Segmentation and Description Image segmentation and description are
More informationECE 176 Digital Image Processing Handout #14 Pamela Cosman 4/29/05 TEXTURE ANALYSIS
ECE 176 Digital Image Processing Handout #14 Pamela Cosman 4/29/ TEXTURE ANALYSIS Texture analysis is covered very briefly in Gonzalez and Woods, pages 66 671. This handout is intended to supplement that
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 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 informationFeature extraction. Bi-Histogram Binarization Entropy. What is texture Texture primitives. Filter banks 2D Fourier Transform Wavlet maxima points
Feature extraction Bi-Histogram Binarization Entropy What is texture Texture primitives Filter banks 2D Fourier Transform Wavlet maxima points Edge detection Image gradient Mask operators Feature space
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 informationLecture 14 Shape. ch. 9, sec. 1-8, of Machine Vision by Wesley E. Snyder & Hairong Qi. Spring (CMU RI) : BioE 2630 (Pitt)
Lecture 14 Shape ch. 9, sec. 1-8, 12-14 of Machine Vision by Wesley E. Snyder & Hairong Qi Spring 2018 16-725 (CMU RI) : BioE 2630 (Pitt) Dr. John Galeotti The content of these slides by John Galeotti,
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 informationFeature Detectors and Descriptors: Corners, Lines, etc.
Feature Detectors and Descriptors: Corners, Lines, etc. Edges vs. Corners Edges = maxima in intensity gradient Edges vs. Corners Corners = lots of variation in direction of gradient in a small neighborhood
More informationSchedule for Rest of Semester
Schedule for Rest of Semester Date Lecture Topic 11/20 24 Texture 11/27 25 Review of Statistics & Linear Algebra, Eigenvectors 11/29 26 Eigenvector expansions, Pattern Recognition 12/4 27 Cameras & calibration
More informationComputer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.
Announcements Edge and Corner Detection HW3 assigned CSE252A Lecture 13 Efficient Implementation Both, the Box filter and the Gaussian filter are separable: First convolve each row of input image I with
More informationSegmentation and Grouping
Segmentation and Grouping How and what do we see? Fundamental Problems ' Focus of attention, or grouping ' What subsets of pixels do we consider as possible objects? ' All connected subsets? ' Representation
More informationTexture Analysis. Selim Aksoy Department of Computer Engineering Bilkent University
Texture Analysis Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr Texture An important approach to image description is to quantify its texture content. Texture
More informationTexture. Frequency Descriptors. Frequency Descriptors. Frequency Descriptors. Frequency Descriptors. Frequency Descriptors
Texture The most fundamental question is: How can we measure texture, i.e., how can we quantitatively distinguish between different textures? Of course it is not enough to look at the intensity of individual
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 informationIntensity Transformations and Spatial Filtering
77 Chapter 3 Intensity Transformations and Spatial Filtering Spatial domain refers to the image plane itself, and image processing methods in this category are based on direct manipulation of pixels in
More informationLecture 8: Fitting. Tuesday, Sept 25
Lecture 8: Fitting Tuesday, Sept 25 Announcements, schedule Grad student extensions Due end of term Data sets, suggestions Reminder: Midterm Tuesday 10/9 Problem set 2 out Thursday, due 10/11 Outline Review
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 informationChapter 3: Intensity Transformations and Spatial Filtering
Chapter 3: Intensity Transformations and Spatial Filtering 3.1 Background 3.2 Some basic intensity transformation functions 3.3 Histogram processing 3.4 Fundamentals of spatial filtering 3.5 Smoothing
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 informationMPEG-7 Visual shape descriptors
MPEG-7 Visual shape descriptors Miroslaw Bober presented by Peter Tylka Seminar on scientific soft skills 22.3.2012 Presentation Outline Presentation Outline Introduction to problem Shape spectrum - 3D
More informationShape Modeling and Geometry Processing
252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry
More informationINTENSITY TRANSFORMATION AND SPATIAL FILTERING
1 INTENSITY TRANSFORMATION AND SPATIAL FILTERING Lecture 3 Image Domains 2 Spatial domain Refers to the image plane itself Image processing methods are based and directly applied to image pixels Transform
More informationMatching and Recognition in 3D. Based on slides by Tom Funkhouser and Misha Kazhdan
Matching and Recognition in 3D Based on slides by Tom Funkhouser and Misha Kazhdan From 2D to 3D: Some Things Easier No occlusion (but sometimes missing data instead) Segmenting objects often simpler From
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 informationBinary Image Processing. Introduction to Computer Vision CSE 152 Lecture 5
Binary Image Processing CSE 152 Lecture 5 Announcements Homework 2 is due Apr 25, 11:59 PM Reading: Szeliski, Chapter 3 Image processing, Section 3.3 More neighborhood operators Binary System Summary 1.
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 informationDigital Image Processing
Digital Image Processing Third Edition Rafael C. Gonzalez University of Tennessee Richard E. Woods MedData Interactive PEARSON Prentice Hall Pearson Education International Contents Preface xv Acknowledgments
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 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 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 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 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 informationExamination in Image Processing
Umeå University, TFE Ulrik Söderström 203-03-27 Examination in Image Processing Time for examination: 4.00 20.00 Please try to extend the answers as much as possible. Do not answer in a single sentence.
More informationDigital Image Processing. Lecture # 15 Image Segmentation & Texture
Digital Image Processing Lecture # 15 Image Segmentation & Texture 1 Image Segmentation Image Segmentation Group similar components (such as, pixels in an image, image frames in a video) Applications:
More informationAutoregressive and Random Field Texture Models
1 Autoregressive and Random Field Texture Models Wei-Ta Chu 2008/11/6 Random Field 2 Think of a textured image as a 2D array of random numbers. The pixel intensity at each location is a random variable.
More informationChapter 11 Image Processing
Chapter Image Processing Low-level Image Processing Operates directly on a stored image to improve or enhance it. Stored image consists of a two-dimensional array of pixels (picture elements): Origin (0,
More informationBasic relations between pixels (Chapter 2)
Basic relations between pixels (Chapter 2) Lecture 3 Basic Relationships Between Pixels Definitions: f(x,y): digital image Pixels: q, p (p,q f) A subset of pixels of f(x,y): S A typology of relations:
More informationCourse Number: Course Title: Geometry
Course Number: 1206310 Course Title: Geometry RELATED GLOSSARY TERM DEFINITIONS (89) Altitude The perpendicular distance from the top of a geometric figure to its opposite side. Angle Two rays or two line
More informationGlossary of dictionary terms in the AP geometry units
Glossary of dictionary terms in the AP geometry units affine linear equation: an equation in which both sides are sums of terms that are either a number times y or a number times x or just a number [SlL2-D5]
More informationAnnouncements. Binary Image Processing. Binary System Summary. Histogram-based Segmentation. How do we select a Threshold?
Announcements Binary Image Processing Homework is due Apr 24, :59 PM Homework 2 will be assigned this week Reading: Chapter 3 Image processing CSE 52 Lecture 8 Binary System Summary. Acquire images and
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 informationBiometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)
Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) References: [1] http://homepages.inf.ed.ac.uk/rbf/hipr2/index.htm [2] http://www.cs.wisc.edu/~dyer/cs540/notes/vision.html
More informationCSE 152 Lecture 7. Intro Computer Vision
Introduction to Computer Vision CSE 152 Lecture 7 Binary Tracking for Robot Control Binary System Summary 1. Acquire images and binarize (tresholding, color labels, etc.). 2. Possibly clean up image using
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 informationThree Dimensional Geometry. Linear Programming
Three Dimensional Geometry Linear Programming A plane is determined uniquely if any one of the following is known: The normal to the plane and its distance from the origin is given, i.e. equation of a
More informationImage retrieval based on region shape similarity
Image retrieval based on region shape similarity Cheng Chang Liu Wenyin Hongjiang Zhang Microsoft Research China, 49 Zhichun Road, Beijing 8, China {wyliu, hjzhang}@microsoft.com ABSTRACT This paper presents
More informationAnalysis of Binary Images
Analysis of Binary Images Introduction to Computer Vision CSE 52 Lecture 7 CSE52, Spr 07 The appearance of colors Color appearance is strongly affected by (at least): Spectrum of lighting striking the
More informationFeature Descriptors. CS 510 Lecture #21 April 29 th, 2013
Feature Descriptors CS 510 Lecture #21 April 29 th, 2013 Programming Assignment #4 Due two weeks from today Any questions? How is it going? Where are we? We have two umbrella schemes for object recognition
More informationCSCI 4620/8626. Coordinate Reference Frames
CSCI 4620/8626 Computer Graphics Graphics Output Primitives Last update: 2014-02-03 Coordinate Reference Frames To describe a picture, the world-coordinate reference frame (2D or 3D) must be selected.
More informationComputer Graphics. The Two-Dimensional Viewing. Somsak Walairacht, Computer Engineering, KMITL
Computer Graphics Chapter 6 The Two-Dimensional Viewing Somsak Walairacht, Computer Engineering, KMITL Outline The Two-Dimensional Viewing Pipeline The Clipping Window Normalization and Viewport Transformations
More informationSUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS
SUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS Cognitive Robotics Original: David G. Lowe, 004 Summary: Coen van Leeuwen, s1460919 Abstract: This article presents a method to extract
More informationLocal Features: Detection, Description & Matching
Local Features: Detection, Description & Matching Lecture 08 Computer Vision Material Citations Dr George Stockman Professor Emeritus, Michigan State University Dr David Lowe Professor, University of British
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 informationPrincipal Component Analysis (PCA) is a most practicable. statistical technique. Its application plays a major role in many
CHAPTER 3 PRINCIPAL COMPONENT ANALYSIS ON EIGENFACES 2D AND 3D MODEL 3.1 INTRODUCTION Principal Component Analysis (PCA) is a most practicable statistical technique. Its application plays a major role
More informationCS534 Introduction to Computer Vision Binary Image Analysis. Ahmed Elgammal Dept. of Computer Science Rutgers University
CS534 Introduction to Computer Vision Binary Image Analysis Ahmed Elgammal Dept. of Computer Science Rutgers University Outlines A Simple Machine Vision System Image segmentation by thresholding Digital
More information04 - Normal Estimation, Curves
04 - Normal Estimation, Curves Acknowledgements: Olga Sorkine-Hornung Normal Estimation Implicit Surface Reconstruction Implicit function from point clouds Need consistently oriented normals < 0 0 > 0
More informationLecture 4: Spatial Domain Transformations
# Lecture 4: Spatial Domain Transformations Saad J Bedros sbedros@umn.edu Reminder 2 nd Quiz on the manipulator Part is this Fri, April 7 205, :5 AM to :0 PM Open Book, Open Notes, Focus on the material
More informationWe are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors
We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists 3,500 108,000 1.7 M Open access books available International authors and editors Downloads Our
More informationLecture 2.2 Cubic Splines
Lecture. Cubic Splines Cubic Spline The equation for a single parametric cubic spline segment is given by 4 i t Bit t t t i (..) where t and t are the parameter values at the beginning and end of the segment.
More informationInteractive Math Glossary Terms and Definitions
Terms and Definitions Absolute Value the magnitude of a number, or the distance from 0 on a real number line Addend any number or quantity being added addend + addend = sum Additive Property of Area the
More informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 04 130131 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Histogram Equalization Image Filtering Linear
More informationUNIT 2 GRAPHIC PRIMITIVES
UNIT 2 GRAPHIC PRIMITIVES Structure Page Nos. 2.1 Introduction 46 2.2 Objectives 46 2.3 Points and Lines 46 2.4 Line Generation Algorithms 48 2.4.1 DDA Algorithm 49 2.4.2 Bresenhams Line Generation Algorithm
More informationSIFT - scale-invariant feature transform Konrad Schindler
SIFT - scale-invariant feature transform Konrad Schindler Institute of Geodesy and Photogrammetry Invariant interest points Goal match points between images with very different scale, orientation, projective
More informationBSB663 Image Processing Pinar Duygulu. Slides are adapted from Selim Aksoy
BSB663 Image Processing Pinar Duygulu Slides are adapted from Selim Aksoy Image matching Image matching is a fundamental aspect of many problems in computer vision. Object or scene recognition Solving
More informationGreedy Routing with Guaranteed Delivery Using Ricci Flow
Greedy Routing with Guaranteed Delivery Using Ricci Flow Jie Gao Stony Brook University Joint work with Rik Sarkar, Xiaotian Yin, Wei Zeng, Feng Luo, Xianfeng David Gu Greedy Routing Assign coordinatesto
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 informationCHAPTER 3 IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN
CHAPTER 3 IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN CHAPTER 3: IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN Principal objective: to process an image so that the result is more suitable than the original image
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: Edge Detection
#1 Lecture 6: Edge Detection Saad J Bedros sbedros@umn.edu Review From Last Lecture Options for Image Representation Introduced the concept of different representation or transformation Fourier Transform
More informationImage Processing Fundamentals. Nicolas Vazquez Principal Software Engineer National Instruments
Image Processing Fundamentals Nicolas Vazquez Principal Software Engineer National Instruments Agenda Objectives and Motivations Enhancing Images Checking for Presence Locating Parts Measuring Features
More informationMATH 2023 Multivariable Calculus
MATH 2023 Multivariable Calculus Problem Sets Note: Problems with asterisks represent supplementary informations. You may want to read their solutions if you like, but you don t need to work on them. Set
More informationMAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS
MAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS MAT203 covers essentially the same material as MAT201, but is more in depth and theoretical. Exam problems are often more sophisticated in scope and difficulty
More informationSUPPLEMENTARY FILE S1: 3D AIRWAY TUBE RECONSTRUCTION AND CELL-BASED MECHANICAL MODEL. RELATED TO FIGURE 1, FIGURE 7, AND STAR METHODS.
SUPPLEMENTARY FILE S1: 3D AIRWAY TUBE RECONSTRUCTION AND CELL-BASED MECHANICAL MODEL. RELATED TO FIGURE 1, FIGURE 7, AND STAR METHODS. 1. 3D AIRWAY TUBE RECONSTRUCTION. RELATED TO FIGURE 1 AND STAR METHODS
More informationIMAGING. Images are stored by capturing the binary data using some electronic devices (SENSORS)
IMAGING Film photography Digital photography Images are stored by capturing the binary data using some electronic devices (SENSORS) Sensors: Charge Coupled Device (CCD) Photo multiplier tube (PMT) The
More informationCOMP_4190 Artificial Intelligence Computer Vision. Computer Vision. Levels of Abstraction. Digital Images
COMP_49 Artificial Intelligence Computer Vision Jacky Baltes Department of Computer Science University of Manitoba Winnipeg, Manitoba Canada, RT N jacky@cs.umanitoba.ca http://www.cs.umanitoba.ca/~jacky
More informationImage Acquisition + Histograms
Image Processing - Lesson 1 Image Acquisition + Histograms Image Characteristics Image Acquisition Image Digitization Sampling Quantization Histograms Histogram Equalization What is an Image? An image
More informationCS 664 Slides #11 Image Segmentation. Prof. Dan Huttenlocher Fall 2003
CS 664 Slides #11 Image Segmentation Prof. Dan Huttenlocher Fall 2003 Image Segmentation Find regions of image that are coherent Dual of edge detection Regions vs. boundaries Related to clustering problems
More informationTexture. Texture is a description of the spatial arrangement of color or intensities in an image or a selected region of an image.
Texture Texture is a description of the spatial arrangement of color or intensities in an image or a selected region of an image. Structural approach: a set of texels in some regular or repeated pattern
More informationData Representation in Visualisation
Data Representation in Visualisation Visualisation Lecture 4 Taku Komura Institute for Perception, Action & Behaviour School of Informatics Taku Komura Data Representation 1 Data Representation We have
More information