Digital Image Processing Fundamentals

Similar documents
CoE4TN4 Image Processing

Topic 6 Representation and Description

Chapter 11 Representation & Description

Boundary descriptors. Representation REPRESENTATION & DESCRIPTION. Descriptors. Moore boundary tracking

EECS490: Digital Image Processing. Lecture #23

Lecture 8 Object Descriptors

Lecture 18 Representation and description I. 2. Boundary descriptors

Practical Image and Video Processing Using MATLAB

Image representation. 1. Introduction

Ulrik Söderström 21 Feb Representation and description

Morphological Image Processing

Geometry Vocabulary. acute angle-an angle measuring less than 90 degrees

EECS490: Digital Image Processing. Lecture #17

Feature description. IE PŁ M. Strzelecki, P. Strumiłło

Morphological Image Processing

9 length of contour = no. of horizontal and vertical components + ( 2 no. of diagonal components) diameter of boundary B

Lecture 10: Image Descriptors and Representation

EE 584 MACHINE VISION

Chapter 11 Representation & Description

CS443: Digital Imaging and Multimedia Binary Image Analysis. Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University

09/11/2017. Morphological image processing. Morphological image processing. Morphological image processing. Morphological image processing (binary)

Digital Image Processing

Digital Image Processing Chapter 11: Image Description and Representation

- Low-level image processing Image enhancement, restoration, transformation

Image Processing, Analysis and Machine Vision

Digital Image Processing

Biomedical Image Analysis. Mathematical Morphology

Machine vision. Summary # 6: Shape descriptors

Mathematical Morphology and Distance Transforms. Robin Strand

morphology on binary images

Review for the Final

COMPUTER AND ROBOT VISION

Morphological Image Processing

Lecture 7: Morphological Image Processing

4 Parametrization of closed curves and surfaces


CS534 Introduction to Computer Vision Binary Image Analysis. Ahmed Elgammal Dept. of Computer Science Rutgers University

GDL Toolbox 2 Reference Manual

Course Number: Course Title: Geometry

International Journal of Advance Engineering and Research Development. Applications of Set Theory in Digital Image Processing

ECEN 447 Digital Image Processing

Chapter 3. Sukhwinder Singh

A Comprehensive Introduction to SolidWorks 2011

Introduction. Computer Vision & Digital Image Processing. Preview. Basic Concepts from Set Theory

C E N T E R A T H O U S T O N S C H O O L of H E A L T H I N F O R M A T I O N S C I E N C E S. Image Operations II

SUPPLEMENTARY FILE S1: 3D AIRWAY TUBE RECONSTRUCTION AND CELL-BASED MECHANICAL MODEL. RELATED TO FIGURE 1, FIGURE 7, AND STAR METHODS.

Examination in Image Processing

Physically-Based Modeling and Animation. University of Missouri at Columbia

Detection of Edges Using Mathematical Morphological Operators

3D Modeling Parametric Curves & Surfaces

Morphological Image Processing

3D Modeling Parametric Curves & Surfaces. Shandong University Spring 2013

Morphological Image Processing

Fundamentals of Digital Image Processing

HOUGH TRANSFORM CS 6350 C V

Lecture notes: Object modeling

Rational Numbers: Graphing: The Coordinate Plane

Elementary Planar Geometry

Curriki Geometry Glossary

Solid Modelling. Graphics Systems / Computer Graphics and Interfaces COLLEGE OF ENGINEERING UNIVERSITY OF PORTO

Shape representation by skeletonization. Shape. Shape. modular machine vision system. Feature extraction shape representation. Shape representation

CSG obj. oper3. obj1 obj2 obj3. obj5. obj4

Lecture 6: Multimedia Information Retrieval Dr. Jian Zhang

Problem definition Image acquisition Image segmentation Connected component analysis. Machine vision systems - 1

Computer Vision. Image Segmentation. 10. Segmentation. Computer Engineering, Sejong University. Dongil Han

EE795: Computer Vision and Intelligent Systems

Albert M. Vossepoel. Center for Image Processing

03 Vector Graphics. Multimedia Systems. 2D and 3D Graphics, Transformations

Lecture 17: Solid Modeling.... a cubit on the one side, and a cubit on the other side Exodus 26:13

3 Polygonal Modeling. Getting Started with Maya 103

ECG782: Multidimensional Digital Signal Processing

CSCI 4620/8626. Coordinate Reference Frames

Introduction to Medical Imaging (5XSA0)

Basic Algorithms for Digital Image Analysis: a course

Finger Print Analysis and Matching Daniel Novák

CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS

S206E Lecture 3, 5/15/2017, Rhino 2D drawing an overview

Image Processing Fundamentals. Nicolas Vazquez Principal Software Engineer National Instruments

EXAM SOLUTIONS. Image Processing and Computer Vision Course 2D1421 Monday, 13 th of March 2006,

Anno accademico 2006/2007. Davide Migliore

COMP_4190 Artificial Intelligence Computer Vision. Computer Vision. Levels of Abstraction. Digital Images

Number/Computation. addend Any number being added. digit Any one of the ten symbols: 0, 1, 2, 3, 4, 5, 6, 7, 8, or 9

Morphological track 1

CITS 4402 Computer Vision

ECG782: Multidimensional Digital Signal Processing

Lecture 4, 5/27/2017, Rhino Interface an overview

Chapter 3 Image Registration. Chapter 3 Image Registration

Hierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach

PRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES

Edge and local feature detection - 2. Importance of edge detection in computer vision

Skeletonization and its applications. Dept. Image Processing & Computer Graphics University of Szeged, Hungary

ECG782: Multidimensional Digital Signal Processing

Binary Image Processing. Introduction to Computer Vision CSE 152 Lecture 5

Extracting Layers and Recognizing Features for Automatic Map Understanding. Yao-Yi Chiang

Fractals: Self-Similarity and Fractal Dimension Math 198, Spring 2013

Processing of binary images

RESEARCH ON OPTIMIZATION OF IMAGE USING SKELETONIZATION TECHNIQUE WITH ADVANCED ALGORITHM

Lecture 14 Shape. ch. 9, sec. 1-8, of Machine Vision by Wesley E. Snyder & Hairong Qi. Spring (CMU RI) : BioE 2630 (Pitt)

Introduction to ANSYS DesignModeler

Skeletonization and its applications. Skeletonization

Transcription:

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 geometrical transformations useful for object recognition? Generally, in object recognition the images (and the object that we try to recognize) have been translated, rotated, scaled or mirrored. Therefore, it is important to have a representation that is not altered by geometrical transformations. 2. What is the difference between internal and external object representation? The external object representation describes the 2-D objects using the objects contour and its features (e.g. boundary length, curvature, signature, Fourier descriptors). This method is directly connected to edge and line detection. They are quite popular because they produce compact shape representations. The external representation describes the region occupied by the object on the image plane. This method is linked to the region segmentation techniques. The resulting representation schemes are called internal representations. Some segmentation techniques (e.g. region splitting) lead directly to object representation schemes (quadtrees). Region features (e.g. area, moments, skeletons) have been used extensively in object recognition applications. 7.2 Chain codes 1. Which are the advantages of the difference chain code? The difference chain code represents direction differences. Therefore, it is rotation invariant (at least for angles that are multiples of ð/2 for 4-connected chains) as opposed to chain code that is translation invariant only. 2. Does the use of chain code compress the description information of an object contour? Chain codes provide a good compression of boundary description, because each chain code element can be coded with 2 bits only (for a 4-connected chain code), instead of the 2 bytes required for the storage of the coordinates (x, y) of each boundary pixel. 3. Can Papert's turtle produce a chain code? Papert's turtle can be easily modified to produce a 4-connected chain code of a contour of an object.

7.3 Polygonal approximations 1. Which are the advantages and disadvantages of the splitting and merge methods? Splitting algorithm can detect bend points (those pixels that the curve changes orientation) in a curve and use them in its representation. Sometimes, this algorithm may have heavy computational complexity. The primary disadvantage of the merge techniques is that polygon vertices do not coincide with curve inflection points. This disadvantage is a serious problem when the curves to be represented are close to linear piecewise models. 2. How is the splitting method modified in the case of a closed curve? In case of a closed curve, the start and end points x 1, x N are chosen to lie on two opposite remote parts of the curve. These points split the curve into two parts. The splitting algorithm can be applied to the two parts independently. 7.4 Fourier descriptors 1. What happens to the Fourier descriptors if the object boundary is rotated? A rotation of the curve coordinates by angle è results in a phase shift of the transform coefficients by an equal amount. 2. What happens to the Fourier descriptors if the image is translated? A translation in curve coordinates affects only the term Z(0) of the representation. 3. What problems are caused by the orthogonal sampling and the 8-connected chain code to the Fourier descriptors? The above-mentioned properties are valid for uniformly sampled curves. This is not the case if the 8-connected neighborhood is used for curve following, because the sampling intervals may be 1 or 2. Phase information is affected particularly by non-uniform curve sampling. Thus, if 8-connected curve traversing is used on a rectangular grid, only the transform magnitude possesses reliable information. 7.5 Quadtrees 1. What is the relation between image segmentation and quadtrees? Apart from the binary region representation, the quadtrees have been used for region segmentation (Chapter 6) in region splitting algorithms. 2. What are the advantages of the quadtrees? Image representation through quadtrees demands (generally) less memory for its representation and storage.

7.6 Pyramids 1. Why do we lose details at the higher pyramid levels? The mapping function from each level to the next is a low-pass operator. Additionally subsampling occurs from each level to the next. Therefore, high frequencies (and image details) are gradually suppressed. 2. Where are the pyramids used in image processing? We use pyramids when we want to start image analysis from rough object characteristics and to move gradually to object details. Pyramidal techniques are quite popular for image analysis and compression applications, because they offer abstraction from image details. Binary image pyramids can be used in multiresolution edge detection and region segmentation. 3. What are the advantages of the contour following in multiple resolution levels? In the contour following we may have edges that are broken and regions that are disjoint at the bottom of the pyramid but may join at intermediate pyramid levels. Therefore, edge following can benefit from a multiresolution approach. 7.7 Shape features 1. What is the meaning of the curvature magnitude? Curvature magnitude is a curve feature that denotes its corners. In the corners the curvature magnitude becomes quite large or infinite. 2. What are the major and minor axes of an object? The major axis is the straight line joining the two object points lying furthest apart from each other. The minor axis is perpendicular to the maximal axis. 3. What is the meaning of the Euler number? The Euler number is an important topological descriptor. It is defined as E=C-H where C is the number of connected components of object X and H is the number of its holes. 7.8 Moment descriptors 1. What is the orientation of a circle? Object orientation è is the angle between the major axis of the object and axis x. However, the major axis of a circle can not be uniquely defined because any diameter of the circle can be considered as major axis. Thus, the circle doesn t have orientation.

2. What is the centre of gravity of a square? The centre of gravity of square is the intersection of its diagonals. 7.9 Thinning algorithms 1. What demands do we have from a thinning algorithm? Thinning algorithms satisfy the following two constraints: They maintain connectivity at each iteration. They do not remove border pixels that may cause discontinuities. They do not shorten the end of thinned shape limbs. Therefore, they do not remove border pixels. 7.10 Mathematical morphology 1. What are the properties of erosion? Erosion increases the black regions and decreases the white ones. 2. What are the properties of dilation? Erosion increases the white regions and decreases the black ones. 3. What are the properties of opening? Opening cuts the narrow isthmuses, compresses the small islands and smoothes the contours. 4. What are the properties of closing? Closing blocks the narrow canals, the small holes and the thin bays of the object. 7.12 Skeletons 1. Can we use a skeleton for object recognition? Skeletons have found extensive applications in biological shape description, pattern recognition, industrial inspection, quantitative metallography and image coding. 2. Is the skeleton sensitive to noise? Skeleton is very sensitive to boundary noise and inside the object.

7.13 Shape decomposition 1. Which are the disadvantages of shape decomposition? One disadvantage of morphological shape decomposition is that it is susceptible to boundary noise. Another disadvantage is that the representation produced is not close to human shape perception if the object consists of unions, intersections and differences of various geometrical primitives. Combining morphological techniques with constructive solid geometry (CSG) can alleviate this disadvantage. The resulting representation scheme is called morphological shape representation. 2. When shape decomposition remains unalterable in rotation? In order for the shape decomposition to remain unaffected by rotation, the structure element should also be unaffected by rotation. Thus, the structure element should be a circle.