A Vertex Chain Code Approach for Image Recognition
|
|
- Denis Robertson
- 5 years ago
- Views:
Transcription
1 A Vertex Chain Code Approach for Image Recognition Abdel-Badeeh M. Salem, Adel A. Sewisy, Usama A. Elyan Faculty of Computer and Information Sciences, Assiut University, Assiut, Egypt, Abstract Shape-of-object representation has always been an important topic in image processing and pattern recognition. This work deals with representation of shape based on a new boundary chain code, and uses this chain code to recognize the object. Chain code techniques are widely used to represent an object because they preserve information and allow considerable data reduction. In this paper the vertex chain code (VCC) is presented, this chain code is based on E. Bribiesca for shapes composed of regular cells. Also, the paper discusses the capabilities of the VCC in recognizing objects, the results show that, the VCC recognizes images better than the classical methods. Keywords: Image processing, Pattern recognition, Computer vision, String edit distance. 1 Introduction The first approach for representing digital curves using chain code was introduced by Freeman in 1961 [4]. Classical methods for processing chains are referred to [5]. Freeman [5] states that in general, a coding scheme for line structures must satisfy three objectives: (1) it must faithfully preserve the information of interest; (2) it must permit compact storage and convenient for display; and (3) it must facilitate any required processing. Also the VCC comply with these three objects, and has some important differences. E. Bribiesca [1] states some important characteristics of the VCC: (1) The VCC is invariant under translation and rotation, and optionally may be invariant under starting point and mirroring transformation. (2) Using the VCC it is possible to represent shapes composed of triangular, rectangular, and hexagonal cells. (3) The chain elements represent real values not symbols such as other chain codes, are part of the shape, indicate the number of cell vertices of contour nodes, may be operated for extracting interesting shape properties. (4) Using the VCC it is possible to obtain relations between the bounding contour and interior of the shape. In this paper we will compute the chain code of an image using the classical methods and the VCC method. The images considered here are binary images with outer contour. In other words there are not any holes in the objects. Also, we will show how you can use these chain codes to recognize to the object. This paper is organized as follows. Section (2) presents a new method for extracting the contour of a binary image. Section (3) shows a simple example to compute the classical and the vertex chain code. Section (4) presents how you can use the string edit distance to compare your chains to measure the similarity between the images. Section (5) we use the χ 2 method to solve the scaling problem. Finally, Section (6)wegivesomeconclusions. 2 Boundary extraction The first step of the construction of the chain code is to extract the boundary of the image. Chains can represent the boundaries or contours of any discrete shape composed of regular cells. In the content of this work, the length l of each side of cells is considered equal to one. These chains represent closed boundaries. Thus, all chains are closed. Extracting the contour depends on the connectivity. In the content of this paper we use pixels with four-connectivity. The simplest contour following algorithms were presented by Papert [10] and Duda and Hart [9]. Thus using these algorithms it is possible to represent shape contours by only two states: left turn (represented by 1") and right turn (represented by 0"). The abovementioned process produces a chain composed of only binary elements. Figure (1) illustrates the contour following on an image composed of pixels. This contour was obtained according to the following algorithm: 1
2 Figure 4: Three simple binary images. Figure 1: Example of a contour following on a digital figure. Figure 2: Directions of the neighbors:(a) 4-connected; (b) 8-connected. Scan the picture until a figure cell is encountered. Then: If you are in a figure cell turn left and take a step. Ifyouareinagroundcellturnrightandtakea step. Terminate when you are within one cell of the starting point. In this paper we proposed a new algorithm to find the contour of a binary image and use this contour to obtain the chain code. Since we use pixels with 4-connectivity, the four neighbors of any point can be represented by directions as illustrated in figure (2a). To find the contour of a binary image we apply the following algorithm: Step 1. For all pixels with value 0 (black) in the image, set the pixel that has the direction 2 in 4-connected to 0. Figure 5: The three steps for finding the contour of the binary images shown in figure (4). represents Step 2 to find the contour of a binary image, and figure (5c) shows Step 3 of the algorithm. Note that, we can apply this algorithm to real images to obtain their contours. Figure (6) shows a tree (a) leaf and its contour (b). Also, the previous algorithm can apply to obtain the contour of the binary images even if these images with holes. Figure (7) shows the contour of an image with two holes. Step 2. In the new image (i.e., image obtained from Step 1), also, for all pixels with value 0, set the pixel that has the direction 1 in 4-connected to 0. Step 3. Remove the old pixels (in the original image) that have 8-connected as shown in figure (2b) and do not satisfy the conditions shown in figure (3). Example: if we apply the previous algorithm to the three images shown if figure (4), we will obtain the contour of the images as depicted in figure (5). Figure (5a) shows Step 1 of the algorithm, figure (5b) Figure 6: A tree leaf: (a) the original image; (b) contour of the image. 2
3 Figure 3: Four conditions to remove the old pixels. Figure 7: Image with two holes: (a) original image; (b) its contour. Figure 8: The classical and the vertex chain code: (a) a shape composed of pixels; (b) the same shape; (c) the elements of the classical chain code; (d) the elements of the VCC. 3 The classical and the vertex chain code Chains can represent the boundaries or contours of any image. The classical (Freeman) chain is defined as the direction of the object s contour from starting point [8], while an element of the VCC indicates the number of cell vertices, which in touch with the bounding contour of the shape in that element position [1]. Figure (8a) presents a shape composed of pixels with its directions. Figure (8b) shows the same shape with its VCC elements. Figure (8c) shows the classical chain code of the shape. Figure (8d) shows the VCC of the shape. Note that when we are using pixels; the VCC has only three different numbers of cell vertices for the bounding contour: 1, 2, and 3 [1]. The classical and the vertex chain code may be invariant under starting point and rotation by using the concept of the shape number. The shape number of the classical chain can be derived from the chain code by taking the difference of the elements of the chain code in counterclockwise direction to obtain the difference code, then rotate the digits of the difference code until the number is minimum to obtain the shape number. The shape number of the VCC can be obtained directly by rotating the digits of the chain until the number is minimum. The difference code of the classical chain code shown in figure (8c) is , and its shape number is Also, the shape number of the VCC shown in figure (8d) is Note that, the shape number is invariant under rotation. It means that, if the object is rotated with k Π 2 where k is an integer, the shape number is the same. 4 String edit distance and shape comparison String matching is one of the basic techniques in structural pattern recognition. In particular, string edit distance can be used to measure the similarity of objects which are represented in terms of strings. String edit distance is based on a set of edit operations, for example, the insertion, deletion, and substitution of individual symbols in a string. Often a cost is assigned to each edit operation to model its likelihood of occurrence. Given a set of edit operations together with their costs, the edit distance d(x, y) of two strings, x and y, is defined as the minimum cost taken over all sequences of edit operations that transform x into y. String edit distance has been successfully applied to a number of problems in pattern recognition, for example, two-dimensional shape recognition [3, 11, 2], symmetry analysis [6]. Let A be a finite alphabet of symbols, and ɛ denote the empty symbol. An edit operation is any of the following: a b, a ɛ, andɛ a, wherea, b A. Wecalla b a substitution, a ɛ a deletion, and ɛ a an insertion. If a = b then a b is called an identical substitution; otherwise it is termed non- 3
4 identical substitution. A cost function is a function that assigns a non-negative real number to each edit operation. We write c(a b),c(a ɛ), andc(ɛ a) to denote the cost of substitution a b, a ɛ deletion, and insertion ɛ a, respectively. The standard algorithm for computing d(x, y), wherex = x 1...x n and y = y 1...y m, is based on dynamic programming [7]. It computes the elements of a two-dimensional edit matrix D(i, j) of dimension (n +1) (m +1) using the following simple algorithm: Step 1. D(0, 0) = 0. Step 2. For j =1,..., m D(0,j)=D(0,j 1) + c(ɛ y j ). Step 3. For i =1,..., n D(i, 0) = D(i 1, 0) + c(x i ɛ). Step 4. For i =1,..., n For j =1,..., m D(i 1,j 1) + c(x i y i ) D(i, j) =min D(i 1,j)+c(x i ɛ). D(i, j 1) + c(ɛ y i ) It has been shown that d(x, y) =D(n, m). Furthermore, from the edit matrix the sequence of edit operations that transform x into y with minimum cost can be recovered. In order to illustrate the capabilities of the VCC, we present some results of shape comparison. Figure (9) shows simple three shapes composed of pixels. The chains of these shapes were obtained using the concepts of classical and the vertex chain code. Also, the difference code and the shape number of each shape are obtained. Table 1 presents the classical and the vertex chains of the shaps shown in figure (9). Now, how you compare these shape numbers (strings) to measure the similarity of the three images. We will use the string edit distance to measure the similarity of these three objects. Let d c (A, B) be the string edit distance between the classical shape numbers of image A and image B, d c (A, C), and d c (B,C) are the string edit distances between the classical shape numbers of image A and image C, and image B and image C, respectively. Moreover, let d v (A, B), d(a, C), and d(b,c) denote the string edit distances of the VCC for the same shapes in figure (9). Now, if we apply the previous algorithm to compute these distances, we note that d c (A, B) =10, d v (A, B) =4; d c (A, C) =12, d v (A, C) = 10; d c (B,C) =6, d v (B,C) =6. Where we assume that { 2, if a b =2 c(a b) = 1, otherwise. (1) (2) The cost of deletion c(a ɛ) =1,andthecostof insertion c(ɛ a) =1. Since image A is more similar to image B than it is to image C. Then the string edit distance between the shape numbers of image A and image B is the smallest number. From Eq. (1), we not that the VCC demonstrates that image A and B do form the most similar pair of images, since d v (A, B) is the smallest number. Also, image B and C are more similar than images A and C. On the other hand, the classical chain code cannot be used for discriminating between the images to determine their visual similarity. Now, we will use the string edit distance to solve a practical problem (recognition of tree leaves). Figure (10a) shows the stored leaves images and figure (10b) present the test image used. We note that, image F (test image) is more similar to image A than it is to image B, C, D, ande. d c (A, F ) = 140, d v (A, F ) = 27; d c (B,F) = 996, d v (B,F) = 996; d c (C, F ) = 138, d v (C, F ) = 166; d c (D, F) = 142, d v (D, F) = 162; d c (E,F) = 162, d v (E,F) = 165. (3) The calculated distances for the tree leaves are shown in Eq. (3). Using the VCC, we notice that image F is more similar to image A. The third example compares the classical and the vertex chain codes using images of airplanes. Figure (11a) shows the stored airplanes image used and figure (11b) shows a test image. We note that, image D (test image) is more similar to image A than it is to image B and image C. Also, the test image is more similar to image B than image C. d c (A, D) =30, d v (A, D) = 30; d c (B,D) = 170, d v (B,D) = 72; d c (C, D) = 146, d v (C, D) =98. (4) The calculated distances for the airplanes are shown in Eq. (4). Using the VCC, we notice that image D is far away from image B and C. Ascanbe seen, the VCC produces more realistic results. 5 Scaling problem The chain code is translation invariant and it is not scale invariant. Figure (12) shows how the chain code is varying if the shape is scaling. Nevertheless the shape code is not scale invariant. If the elements of the chain code are multiplied n times, the object will enlarge k times depending on n. But the shape number has not got this feature. On the other hand, if the chain code is transformed back from the shape number anyhow, then the chain code will be as original chain code. It means, that if you have some different chain codes of an object, you have to transform these into a shape number and back and the solution will be the same chain. 4
5 Figure 9: Three simple images. Table 1: The classical and the vertex chains for the shapes in figure (9). A B C The classical chain code The difference code The shape number The VCC The shape number Figure 10: Tree leaves images: (a) the stored images; (b) test image. 5
6 Figure 11: Airplanes images: (a) the stored images; (b) test image. Now the problem can be defined. Let two objects without holes f(x, y) and g(x, y). The classical chain code of image f is c f and the classical chain code of image g is c g. The question is the following: can the binary object f(x, y) be matched to the object g(x, y) with any scaling or rotation by k π 2, where k is an integer. 5.1 The χ 2 method The χ 2 testisacommonmethodtoverifyiftwogiven set of data belongs to the same of different distribution. Compute the original chain codes c f and c g. Then look on these codes as two random variables and the elements of these codes as samples of these random variables. Detail the random variable ξ with the c f and let the sample be (ξ 1,..., ξ m )withm elements. Detail the random variable η with c g as well. Let the sample be (η 1,..., η n )withn elements. Examine the homogenity of these variables with the χ 2 test, because if one of these chain codes differs only from the other chain code only in scaling, then they can be considered as two samples of one population. The set of the values of ξ and η is the set {0, 1, 2, 3}, because these are classical chain codes. Divide the values of ξ and η into four sets. Let v 0 is the number of 0" in ξ, v 1 is the number of 1" in ξ, v 2 is the number of 2" in ξ, andv 3 is the number of 3" in ξ. Also, let u 0, u 1, u 2,andu 3 are the number of 0", 1", 2", and 3" in η, respectively. Then the χ 2 is given by: χ 2 = m.n 3 R i (5) i=0 where { ( v i m R i = u i n )2 v i + u, if v i u i 0 i (6) 0, otherwise It can be proven that if m and n are large enough and the codes can be matched together anyhow, then Figure 12: Scaling problem: (a) a simple shape; (b) the shape after scaling; (c) the classical chain of the image in (a); (d) the classical chain of the image in (b). the distribution of test statistic χ 2 is approximately a χ 2 distribution with 4 degree-of-freedom. Example: the original chain code of the image in figure (12a) is andtheoriginalchain code of the image in figure (12b) is Now,letξ =(0, 0, 1, 1, 2, 3, 2, 3) and η =(0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3). Then: and So, the χ 2 is v 0 =2, u 0 =4; v 1 =2, u 1 =4; v 2 =2, u 2 =4; v 3 =2, u 3 =4; R 0 =0 R 1 =0 R 2 =0 R 3 =0 χ 2 =0 (7) From Eq. (7), we note that the χ 2 value is zero (i.e., figure (12b) is a scaling to figure (12a). From this 6
7 R 0 = R 1 = R 2 = R 3 = But the χ 2 between the VCC is where m = 431,n= 1008, χ 2 = (11) Figure 13: χ 2 of the fig leaf: (a) the fig leaf; (b) the fig leaf after scaling. examplewecanusetheχ 2 test to solve the scaling problem. Also, we can compute the χ 2 between Any two VCC. Where the χ 2 is given by χ 2 = m.n 3 R i (8) i=1 and the other notations (R i,v i, and u i )arethe same. The VCC of figure (12a) is ,andthe VCCoffigure(12b)is Now if we compute the χ 2, we will obtain where and χ 2 =3 (9) v 1 =5, u 1 =5; v 2 =2, u 2 = 10; v 3 =1, u 3 =1; R 1 = R 2 = R 3 = From Eq. (9), we note that the χ 2 of VCC shown in figure (12) is large. Which means the classical chain code gives better results in the scaling problem. Figure (13) show a practical example to solve the problem of scaling. Since we use a fig" leaf. The χ 2 between the classical chain codes of the fig" leaf is where m = 431,n= 1008, and χ 2 = (10) v 0 = 121, u 3 = 281; v 1 =94, u 1 = 223; v 2 = 121, u 2 = 218; v 3 =94, u 3 = 223; and v 1 = 125, u 1 = 135; v 2 = 185, u 2 = 742; v 3 = 121, u 3 = 131; R 1 = R 2 = R 3 = From Eqs. (10) and (11), we note that the classical chain code gives better results from the VCC. 6 Conclusion In this paper, a new method for extracting the contour of binary images is presented. The new method can apply to any binary image with or without holes. The extracted contour is used to derive the chain code of the image. The classical (Freeman) and a new chain code for shapes composed of finite number of cells is defined. The definition of the new chain code (termed vertex chain code, VCC) is valid for shapes composed of triangular, rectangular, and hexagonal cells. The VCC preserves information and allows considerable data reduction. This chain code is invariant under translation and rotation, and optionally, under starting point and mirroring transformation. To illustrate the capabilities of the VCC, we present some examples of shape comparison and image recognition for binary images of tree leaves and airplanes images. Where, we use the string edit distance to measure the similarity between the chain codes. The results demonstrate that the VCC recognizes the shapes better than the classical chain code. Finally, we use the χ 2 method to solve the problem of scaling. Since the chain code is not scale invariant. In the scaling problem the classical chain code gives better results. References [1] E. Bribiesca. A new chain code. Pattern Recognition, 32: ,
8 [2] H. Bunke and M. Zumbühl. Acquisition of 2D shape models from scenes with overlpping objects using string matching. Pattern Analysis and Applications, 2:2 9, [3] H. Bunke and U. Bühler. Applications of approximate string matching to 2D shape recognition. Pattern Recognition, 26: , [4] H. Freeman. On the encoding of arbitrary geometric configurations. IRE Trans. Electron. Comput. EC, 10: , [5] H. Freeman. Computer Processing of line drawing images. ACM Comput. Surveys, 6:57 97, [6] J. Llados, H. Bunke, and E. Marti. Finding rotational symmetries by cyclic string matching. Pattern Recognition Letters, 18: , [7] R. Wagner and M. Fischer. The string-to-string correction problem. Journal of the ACM, 21: , [8] R.C. Gonzales and R.E. Woods. Digital image processing, second edition. Addison-Wesley, [9] R.O. Duda and P.E. Hart. Pattern classification and scene analysis. Wiley, New York, [10] S. Papert. Uses of technology to enhance education. Technical Report 298, AI Lab, MIT, [11] S.W. Chen, S.T. Tung, C.Y. Fang, S. Cherng, and A. Jain. Extended attributed string matching for shape recognition. Computer Vision and Image Understanding, 70:36 50,
The Evolution and Trend of Chain Code Scheme
The Evolution and Trend of Chain Scheme 1 Lili Ayu Wulandhari, 2 Habibolah Haron Department of Modelling and Industrial Computing Faculty of Computer Science and Information Systems Universiti Teknologi
More informationClassification and Generation of 3D Discrete Curves
Applied Mathematical Sciences, Vol. 1, 2007, no. 57, 2805-2825 Classification and Generation of 3D Discrete Curves Ernesto Bribiesca Departamento de Ciencias de la Computación Instituto de Investigaciones
More informationCode Transformation of DF-Expression between Bintree and Quadtree
Code Transformation of DF-Expression between Bintree and Quadtree Chin-Chen Chang*, Chien-Fa Li*, and Yu-Chen Hu** *Department of Computer Science and Information Engineering, National Chung Cheng University
More informationPERFORMANCE ANALYSIS OF CHAIN CODE DESCRIPTOR FOR HAND SHAPE CLASSIFICATION
PERFORMANCE ANALYSIS OF CHAIN CODE DESCRIPTOR FOR HAND SHAPE CLASSIFICATION Kshama Fating 1 and Archana Ghotkar 2 1,2 Department of Computer Engineering, Pune Institute of Computer Technology, Pune, India
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 informationEdit Distance for Ordered Vector Sets: A Case of Study
Edit Distance for Ordered Vector Sets: A Case of Study Juan Ramón Rico-Juan and José M. Iñesta Departamento de Lenguajes y Sistemas Informáticos Universidad de Alicante, E-03071 Alicante, Spain {juanra,
More informationRobust Shape Retrieval Using Maximum Likelihood Theory
Robust Shape Retrieval Using Maximum Likelihood Theory Naif Alajlan 1, Paul Fieguth 2, and Mohamed Kamel 1 1 PAMI Lab, E & CE Dept., UW, Waterloo, ON, N2L 3G1, Canada. naif, mkamel@pami.uwaterloo.ca 2
More informationHowever, m pq is just an approximation of M pq. As it was pointed out by Lin [2], more precise approximation can be obtained by exact integration of t
FAST CALCULATION OF GEOMETRIC MOMENTS OF BINARY IMAGES Jan Flusser Institute of Information Theory and Automation Academy of Sciences of the Czech Republic Pod vodarenskou vez 4, 82 08 Prague 8, Czech
More informationDigital image processing
Digital image processing Morphological image analysis. Binary morphology operations Introduction The morphological transformations extract or modify the structure of the particles in an image. Such transformations
More informationHierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach
Hierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach O. El Badawy, M. S. Kamel Pattern Analysis and Machine Intelligence Laboratory, Department of Systems Design Engineering,
More informationCLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS
CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS B.Vanajakshi Department of Electronics & Communications Engg. Assoc.prof. Sri Viveka Institute of Technology Vijayawada, India E-mail:
More informationHeuristic Algorithm to Generate Modified Freeman Chain Code from Thinned Binary Image
Australian Journal of Basic and Applied Sciences, 5(11): 752-762, 2011 ISSN 1991-8178 Heuristic Algorithm to Generate Modified Freeman Chain Code from Thinned Binary Image 1 Haswadi Hasan, 2 Habibollah
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 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 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 informationROTATION INVARIANT TRANSFORMS IN TEXTURE FEATURE EXTRACTION
ROTATION INVARIANT TRANSFORMS IN TEXTURE FEATURE EXTRACTION GAVLASOVÁ ANDREA, MUDROVÁ MARTINA, PROCHÁZKA ALEŠ Prague Institute of Chemical Technology Department of Computing and Control Engineering Technická
More informationWhich n-venn diagrams can be drawn with convex k-gons?
Which n-venn diagrams can be drawn with convex k-gons? Jeremy Carroll Frank Ruskey Mark Weston Abstract We establish a new lower bound for the number of sides required for the component curves of simple
More information2 ATTILA FAZEKAS The tracking model of the robot car The schematic picture of the robot car can be seen on Fig.1. Figure 1. The main controlling task
NEW OPTICAL TRACKING METHODS FOR ROBOT CARS Attila Fazekas Debrecen Abstract. In this paper new methods are proposed for intelligent optical tracking of robot cars the important tools of CIM (Computer
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 informationOptimization of Bit Rate in Medical Image Compression
Optimization of Bit Rate in Medical Image Compression Dr.J.Subash Chandra Bose 1, Mrs.Yamini.J 2, P.Pushparaj 3, P.Naveenkumar 4, Arunkumar.M 5, J.Vinothkumar 6 Professor and Head, Department of CSE, Professional
More informationIdentifying Layout Classes for Mathematical Symbols Using Layout Context
Rochester Institute of Technology RIT Scholar Works Articles 2009 Identifying Layout Classes for Mathematical Symbols Using Layout Context Ling Ouyang Rochester Institute of Technology Richard Zanibbi
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 informationPattern recognition systems Lab 3 Hough Transform for line detection
Pattern recognition systems Lab 3 Hough Transform for line detection 1. Objectives The main objective of this laboratory session is to implement the Hough Transform for line detection from edge images.
More informationColor-Based Classification of Natural Rock Images Using Classifier Combinations
Color-Based Classification of Natural Rock Images Using Classifier Combinations Leena Lepistö, Iivari Kunttu, and Ari Visa Tampere University of Technology, Institute of Signal Processing, P.O. Box 553,
More informationUPEM Master 2 Informatique SIS. Digital Geometry. Topic 2: Digital topology: object boundaries and curves/surfaces. Yukiko Kenmochi.
UPEM Master 2 Informatique SIS Digital Geometry Topic 2: Digital topology: object boundaries and curves/surfaces Yukiko Kenmochi October 5, 2016 Digital Geometry : Topic 2 1/34 Opening Representations
More informationCPS 616 TRANSFORM-AND-CONQUER 7-1
CPS 616 TRANSFORM-AND-CONQUER 7-1 TRANSFORM AND CONQUER Group of techniques to solve a problem by first transforming the problem into one of: 1. a simpler/more convenient instance of the same problem (instance
More informationDirection-Length Code (DLC) To Represent Binary Objects
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 18, Issue 2, Ver. I (Mar-Apr. 2016), PP 29-35 www.iosrjournals.org Direction-Length Code (DLC) To Represent Binary
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 informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 02 130124 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Basics Image Formation Image Processing 3 Intelligent
More informationDocument Image Restoration Using Binary Morphological Filters. Jisheng Liang, Robert M. Haralick. Seattle, Washington Ihsin T.
Document Image Restoration Using Binary Morphological Filters Jisheng Liang, Robert M. Haralick University of Washington, Department of Electrical Engineering Seattle, Washington 98195 Ihsin T. Phillips
More informationObject Shape Recognition in Image for Machine Vision Application
Object Shape Recognition in Image for Machine Vision Application Mohd Firdaus Zakaria, Hoo Seng Choon, and Shahrel Azmin Suandi Abstract Vision is the most advanced of our senses, so it is not surprising
More informationInvariant Recognition of Hand-Drawn Pictograms Using HMMs with a Rotating Feature Extraction
Invariant Recognition of Hand-Drawn Pictograms Using HMMs with a Rotating Feature Extraction Stefan Müller, Gerhard Rigoll, Andreas Kosmala and Denis Mazurenok Department of Computer Science, Faculty of
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 informationA Genus Bound for Digital Image Boundaries
A Genus Bound for Digital Image Boundaries Lowell Abrams and Donniell E. Fishkind March 9, 2005 Abstract Shattuck and Leahy [4] conjectured and Abrams, Fishkind, and Priebe [1],[2] proved that the boundary
More informationTilings of the Euclidean plane
Tilings of the Euclidean plane Yan Der, Robin, Cécile January 9, 2017 Abstract This document gives a quick overview of a eld of mathematics which lies in the intersection of geometry and algebra : tilings.
More informationAccelerating Pattern Matching or HowMuchCanYouSlide?
Accelerating Pattern Matching or HowMuchCanYouSlide? Ofir Pele and Michael Werman School of Computer Science and Engineering The Hebrew University of Jerusalem {ofirpele,werman}@cs.huji.ac.il Abstract.
More informationSkeletonization Algorithm for Numeral Patterns
International Journal of Signal Processing, Image Processing and Pattern Recognition 63 Skeletonization Algorithm for Numeral Patterns Gupta Rakesh and Kaur Rajpreet Department. of CSE, SDDIET Barwala,
More informationSegmentation and Object Detection with Gabor Filters and Cumulative Histograms
Segmentation and Object Detection with Gabor Filters and Cumulative Histograms Tadayoshi SHIOYAMA, Haiyuan WU and Shigetomo MITANI Department of Mechanical and System Engineering Kyoto Institute of Technology
More informationCompressing 2-D Shapes using Concavity Trees
Compressing 2-D Shapes using Concavity Trees O. El Badawy 1 and M. S. Kamel 2 1 Dept. of Systems Design Engineering. 2 Dept. of Electrical and Computer Engineering. Pattern Analysis and Machine Intelligence
More informationMorphological Image Processing
Morphological Image Processing Binary image processing In binary images, we conventionally take background as black (0) and foreground objects as white (1 or 255) Morphology Figure 4.1 objects on a conveyor
More informationBinary Relations McGraw-Hill Education
Binary Relations A binary relation R from a set A to a set B is a subset of A X B Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B. We can also represent
More informationmorphology on binary images
morphology on binary images Ole-Johan Skrede 10.05.2017 INF2310 - Digital Image Processing Department of Informatics The Faculty of Mathematics and Natural Sciences University of Oslo After original slides
More informationA Connection between Network Coding and. Convolutional Codes
A Connection between Network Coding and 1 Convolutional Codes Christina Fragouli, Emina Soljanin christina.fragouli@epfl.ch, emina@lucent.com Abstract The min-cut, max-flow theorem states that a source
More informationAn Algorithm for Calculating Objects Shape Features in Binary Images
2017 2 nd International Conference on Artificial Intelligence and Engineering Applications (AIEA 2017) ISBN: 978-1-60595-485-1 An Algorithm for Calculating Objects Shape Features in Binary Images LIFENG
More informationDetection of a Single Hand Shape in the Foreground of Still Images
CS229 Project Final Report Detection of a Single Hand Shape in the Foreground of Still Images Toan Tran (dtoan@stanford.edu) 1. Introduction This paper is about an image detection system that can detect
More information1. INTRODUCTION. AMS Subject Classification. 68U10 Image Processing
ANALYSING THE NOISE SENSITIVITY OF SKELETONIZATION ALGORITHMS Attila Fazekas and András Hajdu Lajos Kossuth University 4010, Debrecen PO Box 12, Hungary Abstract. Many skeletonization algorithms have been
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 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 informationOn a fast discrete straight line segment detection
On a fast discrete straight line segment detection Ali Abdallah, Roberto Cardarelli, Giulio Aielli University of Rome Tor Vergata Abstract Detecting lines is one of the fundamental problems in image processing.
More informationSection 18-1: Graphical Representation of Linear Equations and Functions
Section 18-1: Graphical Representation of Linear Equations and Functions Prepare a table of solutions and locate the solutions on a coordinate system: f(x) = 2x 5 Learning Outcome 2 Write x + 3 = 5 as
More informationCONSTRUCTIONS OF QUADRILATERAL MESHES: A COMPARATIVE STUDY
South Bohemia Mathematical Letters Volume 24, (2016), No. 1, 43-48. CONSTRUCTIONS OF QUADRILATERAL MESHES: A COMPARATIVE STUDY PETRA SURYNKOVÁ abstrakt. Polygonal meshes represent important geometric structures
More informationTwo Image-Template Operations for Binary Image Processing. Hongchi Shi. Department of Computer Engineering and Computer Science
Two Image-Template Operations for Binary Image Processing Hongchi Shi Department of Computer Engineering and Computer Science Engineering Building West, Room 331 University of Missouri - Columbia Columbia,
More informationCorner Detection using Difference Chain Code as Curvature
Third International IEEE Conference on Signal-Image Technologies technologies and Internet-Based System Corner Detection using Difference Chain Code as Curvature Neeta Nain Vijay Laxmi Bhavitavya Bhadviya
More information1 Affine and Projective Coordinate Notation
CS348a: Computer Graphics Handout #9 Geometric Modeling Original Handout #9 Stanford University Tuesday, 3 November 992 Original Lecture #2: 6 October 992 Topics: Coordinates and Transformations Scribe:
More informationSlops and Distances for Regular Shape Image Recognition
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 5.258 IJCSMC,
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 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 informationLecture notes: Object modeling
Lecture notes: Object modeling One of the classic problems in computer vision is to construct a model of an object from an image of the object. An object model has the following general principles: Compact
More informationConnected components - 1
Connected Components Basic definitions Connectivity, Adjacency, Connected Components Background/Foreground, Boundaries Run-length encoding Component Labeling Recursive algorithm Two-scan algorithm Chain
More informationProcessing of binary images
Binary Image Processing Tuesday, 14/02/2017 ntonis rgyros e-mail: argyros@csd.uoc.gr 1 Today From gray level to binary images Processing of binary images Mathematical morphology 2 Computer Vision, Spring
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 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 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 informationConnectivity Preserving Digitization of Blurred Binary Images in 2D and 3D
Connectivity Preserving Digitization of Blurred Binary Images in 2D and 3D Peer Stelldinger a Ullrich Köthe a a Cognitive Systems Group, University of Hamburg, Vogt-Köln-Str. 30, D-22527 Hamburg, Germany
More informationGENERALIZING THE HOUGH TRANSFORM TO DETECT ARBITRARY SHAPES. D. H. Ballard Pattern Recognition Vol. 13 No
GENERALIZING THE HOUGH TRANSFORM TO DETECT ARBITRARY SHAPES D. H. Ballard Pattern Recognition Vol. 13 No. 2 1981 What is the generalized Hough (Huff) transform used for? Hough transform is a way of encoding
More informationUse of Chain Code Histogram Method to Quantify Airborne Particle Shapes
Aerosol Science and Technology ISSN: 0278-6826 (Print) 1521-7388 (Online) Journal homepage: http://www.tandfonline.com/loi/uast20 Use of Chain Code Histogram Method to Quantify Airborne Particle Shapes
More informationSolid Modelling. Graphics Systems / Computer Graphics and Interfaces COLLEGE OF ENGINEERING UNIVERSITY OF PORTO
Solid Modelling Graphics Systems / Computer Graphics and Interfaces 1 Solid Modelling In 2D, one set 2D line segments or curves does not necessarily form a closed area. In 3D, a collection of surfaces
More informationTAGUCHI TECHNIQUES FOR 2 k FRACTIONAL FACTORIAL EXPERIMENTS
Hacettepe Journal of Mathematics and Statistics Volume 4 (200), 8 9 TAGUCHI TECHNIQUES FOR 2 k FRACTIONAL FACTORIAL EXPERIMENTS Nazan Danacıoğlu and F.Zehra Muluk Received 0: 0: 200 : Accepted 14: 06:
More information2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into
2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into the viewport of the current application window. A pixel
More informationChapter 3 Numerical Methods
Chapter 3 Numerical Methods Part 1 3.1 Linearization and Optimization of Functions of Vectors 1 Problem Notation 2 Outline 3.1.1 Linearization 3.1.2 Optimization of Objective Functions 3.1.3 Constrained
More informationAN ALGORITHM USING WALSH TRANSFORMATION FOR COMPRESSING TYPESET DOCUMENTS Attila Fazekas and András Hajdu
AN ALGORITHM USING WALSH TRANSFORMATION FOR COMPRESSING TYPESET DOCUMENTS Attila Fazekas and András Hajdu fattila@math.klte.hu hajdua@math.klte.hu Lajos Kossuth University 4010, Debrecen PO Box 12, Hungary
More informationMORPHOLOGICAL BOUNDARY BASED SHAPE REPRESENTATION SCHEMES ON MOMENT INVARIANTS FOR CLASSIFICATION OF TEXTURES
International Journal of Computer Science and Communication Vol. 3, No. 1, January-June 2012, pp. 125-130 MORPHOLOGICAL BOUNDARY BASED SHAPE REPRESENTATION SCHEMES ON MOMENT INVARIANTS FOR CLASSIFICATION
More informationPATTERN CLASSIFICATION AND SCENE ANALYSIS
PATTERN CLASSIFICATION AND SCENE ANALYSIS RICHARD O. DUDA PETER E. HART Stanford Research Institute, Menlo Park, California A WILEY-INTERSCIENCE PUBLICATION JOHN WILEY & SONS New York Chichester Brisbane
More informationA Compressed Representation of Mid-Crack Code with Huffman Code
I.J. Image, Graphics and Signal Processing, 2015, 10, 11-18 Published Online September 2015 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijigsp.2015.10.02 A Compressed Representation of Mid-Crack
More information6. Concluding Remarks
[8] K. J. Supowit, The relative neighborhood graph with an application to minimum spanning trees, Tech. Rept., Department of Computer Science, University of Illinois, Urbana-Champaign, August 1980, also
More informationTexture Segmentation by Windowed Projection
Texture Segmentation by Windowed Projection 1, 2 Fan-Chen Tseng, 2 Ching-Chi Hsu, 2 Chiou-Shann Fuh 1 Department of Electronic Engineering National I-Lan Institute of Technology e-mail : fctseng@ccmail.ilantech.edu.tw
More informationPlanar Symmetry Detection by Random Sampling and Voting Process
Planar Symmetry Detection by Random Sampling and Voting Process Atsushi Imiya, Tomoki Ueno, and Iris Fermin Dept. of IIS, Chiba University, 1-33, Yayo-cho, Inage-ku, Chiba, 263-8522, Japan imiya@ics.tj.chiba-u.ac.jp
More informationcoding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight
Three-Dimensional Object Reconstruction from Layered Spatial Data Michael Dangl and Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image
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 informationColor Image Segmentation
Color Image Segmentation Yining Deng, B. S. Manjunath and Hyundoo Shin* Department of Electrical and Computer Engineering University of California, Santa Barbara, CA 93106-9560 *Samsung Electronics Inc.
More informationOn Skeletons Attached to Grey Scale Images. Institute for Studies in Theoretical Physics and Mathematics Tehran, Iran ABSTRACT
On Skeletons Attached to Grey Scale Images M. Karimi Behbahani, Arash Rafiey, 2 Mehrdad Shahshahani 3 Institute for Studies in Theoretical Physics and Mathematics Tehran, Iran ABSTRACT In [2], [3] and
More informationApplication of optimal sampling lattices on CT image reconstruction and segmentation or three dimensional printing
Application of optimal sampling lattices on CT image reconstruction and segmentation or three dimensional printing XIQIANG ZHENG Division of Health and Natural Sciences, Voorhees College, Denmark, SC 29042
More informationUNIT 3 EXPRESSIONS AND EQUATIONS Lesson 3: Creating Quadratic Equations in Two or More Variables
Guided Practice Example 1 Find the y-intercept and vertex of the function f(x) = 2x 2 + x + 3. Determine whether the vertex is a minimum or maximum point on the graph. 1. Determine the y-intercept. The
More informationDetection of objects in moving images and implementation of the purification algorithm on Analog CNN and DSP processors
Detection of objects in moving images and implementation of the purification algorithm on Analog CNN and DSP processors Emel Arslan 1, Zeynep Orman 2, Sabri Arik 2 1 Research and Application Center for
More informationGenerating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams
Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams Khalegh Mamakani and Frank Ruskey Dept. of Computer Science, University of Victoria, Canada. Abstract. An n-venn diagram consists
More informationL1 - Introduction. Contents. Introduction of CAD/CAM system Components of CAD/CAM systems Basic concepts of graphics programming
L1 - Introduction Contents Introduction of CAD/CAM system Components of CAD/CAM systems Basic concepts of graphics programming 1 Definitions Computer-Aided Design (CAD) The technology concerned with the
More informationSymbol Detection Using Region Adjacency Graphs and Integer Linear Programming
2009 10th International Conference on Document Analysis and Recognition Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming Pierre Le Bodic LRI UMR 8623 Using Université Paris-Sud
More informationTexture Segmentation and Classification in Biomedical Image Processing
Texture Segmentation and Classification in Biomedical Image Processing Aleš Procházka and Andrea Gavlasová Department of Computing and Control Engineering Institute of Chemical Technology in Prague Technická
More informationLecture 3.2 Methods for Structured Mesh Generation
Lecture 3.2 Methods for Structured Mesh Generation 1 There are several methods to develop the structured meshes: Algebraic methods, Interpolation methods, and methods based on solving partial differential
More informationDigital Image Fundamentals II
Digital Image Fundamentals II 1. Image modeling and representations 2. Pixels and Pixel relations 3. Arithmetic operations of images 4. Image geometry operation 5. Image processing with Matlab - Image
More informationSymmetry Based Semantic Analysis of Engineering Drawings
Symmetry Based Semantic Analysis of Engineering Drawings Thomas C. Henderson, Narong Boonsirisumpun, and Anshul Joshi University of Utah, SLC, UT, USA; tch at cs.utah.edu Abstract Engineering drawings
More informationDetermining Differences between Two Sets of Polygons
Determining Differences between Two Sets of Polygons MATEJ GOMBOŠI, BORUT ŽALIK Institute for Computer Science Faculty of Electrical Engineering and Computer Science, University of Maribor Smetanova 7,
More informationMirrors of reflections of regular maps
ISSN 1855-3966 (printed edn), ISSN 1855-3974 (electronic edn) ARS MATHEMATICA CONTEMPORANEA 15 (018) 347 354 https://doiorg/106493/1855-3974145911d (Also available at http://amc-journaleu) Mirrors of reflections
More informationMorphological track 1
Morphological track 1 Shapes Painting of living beings on cave walls at Lascaux [about 1500 th BC] L homme qui marche by Alberto Giacometti, 1948, NOUVELLES IMAGES Editor (1976) Les lutteurs by Honoré
More informationEdge Detection Using Morphological Method and Corner Detection Using Chain Code Algorithm
www.ijcsi.org 583 Edge Detection Using Morphological Method and Corner Detection Using Chain Code Algorithm Mr. Anjan Bikash Maity¹, Mr. Sandip Mandal² & Mr. Ranjan Podder³ 1. West Bengal University of
More informationIntroduction to Complex Analysis
Introduction to Complex Analysis George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 413 George Voutsadakis (LSSU) Complex Analysis October 2014 1 / 50 Outline
More informationThe packing problem: A divide and conquer algorithm on cellular automata
The packing problem: A divide and conquer algorithm on cellular automata Nicolas Bacquey Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen Université de Caen Basse-Normandie,
More informationMinimum-Area Rectangle Containing a Set of Points
Minimum-Area Rectangle Containing a Set of Points David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International
More informationTransformations Geometry
Transformations Geometry Preimage the original figure in the transformation of a figure in a plane. Image the new figure that results from the transformation of a figure in a plane. Example: If function
More informationMathematics and Symmetry: A Bridge to Understanding
Mathematics and Symmetry: A Bridge to Understanding Gail Kaplan Department of Mathematics Towson University Towson, Maryland 5, USA gkaplan@towson.edu Abstract This paper describes how to teach group theory
More information