Robust and efficient 2D Skeleton Shape Representation. using Shock Graphs
|
|
- Annabella Franklin
- 5 years ago
- Views:
Transcription
1 1/19 Robust and efficient 2D Skeleton Shape Representation using Shock Graphs Chung, In Young Lee, Kang Eui 1. Introduction An important approach to representing the structural shape of a plane region is to reduce it to a graph. This reduction may be accomplished by obtaining the skeleton of the region via a thinning (or skeletonizing) algorithm. There have been lots of algorithms on obtaining skeleton. However, there are some drawbacks in the performance and time complexities of these algorithms [1]. There has recently been significant interest in using representations based on abstractions of Blum s skeleton into a graph for qualitative shape matching. The application of these techniques to large databases of shapes hinges on the availability of numerical algorithms for computing the medial axis. Unfortunately, this computation can be extremely subtle [2]. Approaches based on Voronoi techniques preserve topology, but heuristic pruning measures are introduced to remove unwanted edges. Methods based on Euclidean distance functions can localize skeletal points accurately, but often at the cost of altering the object s topology [3]. The new algorithm for computing subpixel skeletons which is robust and accurate, has low computational complexity, and preserves topology has been proposed by P. Dimitrov, C. Phillips and K. Siddiqi. The key idea is to measure the net outward flux of a vector field per unit area, and to detect locations where a conservation of energy principle is violated. This is done in conjunction with a thinning process applied in a rectangular lattice. However, there are, also, some disadvantages in this algorithm [2]. In this project, we attempt to modify and advance this algorithm and define a new one using Shock Graphs. In this report, we implement the new method proposed by P. Dimitrov, C. Phillips and K. Siddiqi and compare its result with that of Blum s method
2 2/19 2. Approach and Work Performed A. Blum s method In recent years there has been significant interest in using graph-based abstractions of Blum s skeleton for qualitative shape recognition [4]. The application of such methods to large image databases hinges on the availability of robust and efficient algorithms for computing the medial axis, or approximations to it. Blum proposed that the skeleton of a region may be defined via the medial axis transformation (MAT). The MAT of a region R with border B is as follows. For each point P in R, we find its closest neighbor in B. If p has more than one of closest dep on the definition of a distance. The MAT of a region has an intuitive definition based on the so-called prairie fire concept. Consider an image region as a prairie of uniform, dry grass and suppose that a fire is lit along ints border. All fire fronts will advance into the region at the same speed. The MAT of the region is the set of points reached by more than one fire front at the same time [1]. Following figure shows the resulted skeleton image using Blum s method. (a) Original image
3 3/19 (b) Resulted Skeleton image using Blum s method Figure 1. (a) shows the original image and the bottom one (b) shows the resulted image. B. New method a. Euclidean Distance Transformation (EDT) The Euclidean distance between the points p and q with their coordinates ( x, y), ( s, t), respectively, is defined as [1] D 2 ( p, q) = [( x s) + ( y t ) 2 ] 1 2 b. Computing Vector Field. Consider Blum s grassfire flow C = N t acting on a 2D closed curve C, such that each point on its boundary is moving with unit speed in the direction of the inward normal N. This formulation leads to a Hamilton-Jacobi equation on the Euclidean distance function to the initial curve [12]. In physics, such equations are typically solved by looking at the evolution of the phase space of the equivalent Hamiltonian system. Since Hamiltonian systems are conservative, the locus of skeletal points coincides with locations where a conservation of energy principle is violated. This loss of energy can be used to formulate a natural criterion for detecting singularities of the distance function.
4 4/19 More specifically, let D be the Euclidean distance function to the initial curve C 0. The magnitude of its gradient D is identical to 1 in its smooth regime. With q = ( x, y), p = ( Dx, Dy), the Hamiltonian system is given by H H p = = ( 0, 0), q = = ( Dx, Dy) q p with an associated Hamiltonian function H = 1 D x + D ) [12]. It is ( y straightforward to show that all Hamiltonian systems are conservative and hence divergence free. Conversely, when trajectories of the system intersect, a conservation of energy principle is violated. This suggests a natural approach for detecting the skeleton: compute the divergence of the gradient vector field q and detect locations where it is not zero [2]. 1 Figure 2. Computed vector field
5 5/19 c. Computing Divergence (Flux) The divergence is defined as the net outward flux per unit area, as the area about the point shrinks to zero: div( q ) lim Δa 0 L < q, N) dl Δa Here Δ a is the area, L is its bounding contour and N is the outward normal at each point on the contour. Via the divergence theorem div ( q ) da = < q, N > a L In other words, the integral of the divergence of the vector field within a finite area gives the net outward flux through the contour which bounds it. Locations where the flux is negative, and hence energy is lost, correspond to sinks or skeletal points of the interior. Similarly, locations where the flux is positive correspond to sources or skeletal points of the exterior [2]. dl
6 6/19 Figure 3. Computed Flux
7 7/19 d. Thinning Some definitions Removable point; A point can be removed if and only if its 3x3 neighborhood graph, with cycles of length 3 removed, is a tree. A straightforward way of determining whether or not a graph is a tree is to check that its Euler characteristic V E (the number of vertices minus the number of edges) is identical to P Figure 4. Example of a tree End point; A point could be an point of a 1 pixel thick digital curve if, in a 3x3 neighborhood, it has a single neighbor, or it has two neighbors, both of which are 4- adjacent to one another. P P Figure 5. Example of an point The thinning process can be made very efficient by observing that a point within the object which does not have at least one background point as an immediate neighbor cannot be removed, since this would create a hole. Therefore, the only potentially removable points are on the border of the object. Once a border point is removed, only
8 8/19 its neighbors may become removable. This suggests the implementation of the thinning process using a heap [2]. Algorithm FOR each border point P IF (P is removable) Insert(P,Heap) with Flux(P) END {For} WHILE (Heap.size>0) P=MaxHeapExtract(Heap) IF (P is removable) IF P is not an point Flux(P)>T remove(p, Heap) FOR each neighbor, Q of P IF (Q is removable) Insert(Q, Heap) END {FOR} ELSE Mark P as a Skeletal Point END {WHILE} Algorithm 1. Thinning algorithm
9 9/19 (a) Original image (b) Resulted subtle Skeleton image using divergence (Threshold = -0.3) (c) Resulted Skeleton image using new algorithm Figure 6. Original and Resulted Skeleton image
10 10/19 3. Results (a) Resulted Skeleton image using Blum s method (b) Resulted Skeleton image using new algorithm Figure 7. Comparison of the skeleton images using Blum s and new method Figure 7 shows the results of the skeleton images. As can be seen in the figure 7 a), some edges are lost and some topology has been changed. Red rectangle which located in the left upper side of the image (a) represents the change in the topology. The right representation of the topology is shown in the image (b). Also, the red box in the right side of the image (b) shows unfinished edge and this is modified in the new algorithm. However, in the result of the new algorithm, there is also incorrect result and that is unfinished edge which is located in the ear part of the rabbit.
11 11/19 4. Discussion The essential idea of the new algorithm for skeletonizing is to combine a divergence computation on the gradient vector field of the Euclidean distance function with a thinning process that preserves topology. The identification of points and branch points allows the result to be interpreted as a graph. The digital skeleton is then shifted to be within arbitrary precision of the true skeleton. However,, whereas results of this algorithm are good, there is one problem that should be solved. That is choice of the threshold is not obvious. 5. References [1] Rafael C. Gonzalez, Richard E. Woods, Digital Image Processing, 2E, Prentice Hall. [2] K. Siddiqi, A. Shokoufandeh, S. J. Dickinson, and S. W. Zucker, Shock graphs and shape matching. International Journal of Computer Vision, 35(1):13 32, [3] R. L. Ogniewicz. Discrete Voronoi Skeletons. Hartung-Gorre, [4] T.-L. Liu, D. Geiger, and R. V. Kohn. Representation and self-similarity of shapes. In Sixth International Conference on Computer Vision, [5] P. Dimitrov, C. Phillips and K. Siddiqi, Robust and Efficient Skeletal Graphs, Proc. Computer Vision and Pattern Recognition Conf., Vol. 1, 2000,
12 12/19 Appix I. Source Code -Main routine clear all, close all; [FileName,PathName] = uigetfile('*.*','select image file'); I=imread([PathName '/' FileName]); %Change the type of I into double for computation I=double(I); %Calculate the size of input image [Ys Xs]=size(I); %Change the max of the input image into 255 if max(max(i))==1 I=255.*I; %Show the input image imshow(i); reply = input('which represents the background? White[1] or Black[0]: ','s'); close all; if isempty(reply) reply = '0'; if reply=='0' I=xor(I,ones(Ys,Xs));
13 13/19 [D L]=bwdist(I); sigma=0.5; kernel_size=[3,3]; G=fspecial('gaussian',kernel_size,sigma); SD=imfilter(D,G); TOL=[0 1]; SD1 = imadjust(sd,stretchlim(sd,tol),[]); figure; subplot(1,2,1); imshow(double(d)); title('original Image') subplot(1,2,2); imshow(sd); title('smothed Image'); xlabel(['kernel size = ' num2str(kernel_size(1)) 'x' num2str(kernel_size(2)) ' with sigma = ' num2str(sigma)]) [r c]=ind2sub([ys Xs], L); deldx=zeros(ys,xs); deldy=zeros(ys,xs); [X Y]=meshgrid(1:1:Xs,1:1:Ys); for i=1:1:ys for j=1:1:xs if SD(i,j) ~= 0 deldx(i,j)=-1*(c(i,j)-j)/sd(i,j); deldy(i,j)=-1*(r(i,j)-i)/sd(i,j);
14 14/19 figure; contour(x,y,sd1), hold on, quiver(x,y,deldx,deldy); FluxP=zeros(Ys,Xs); FluxP=divergence(X,Y,delDx,delDy); figure; surface(fluxp); Result=255.*ones(Ys,Xs); for i=1:ys for j=1:xs if I(i,j)==0 Result(i,j)=128; for i=1:ys for j=1:xs if FluxP(i,j) < -0.3 Result(i,j)=0; else %do nothing figure; imshow(uint8(result)); wewewe
15 15/19 % Proposition 1 A 2D digital point P can be removed if and % only if its 3x3 neighborhood graph, with cycles of length 3 % removed, is a tree. % % A straightforward way of determining whether or not a % graph is a tree is to check that its Euler characteristic % V - E (the number of vertices minus the number of % edges) is identical to 1. % Proposition 2 A point P could be an point of a 1 pixel % thick digital curve if, in a 3x3 neighborhood, it has a single % neighbor, or it has two neighbors, both of which are 4-adjacent % to one another. %Algorithm % For each border point P % if (P is removable) % insert(p, Heap) with FluxP Heap = struct('flux',0,'y',0,'x',0); flag=0; for i=2:ys-1 for j=2:xs-1 if Result(i,j)==0 if (Result(i-1,j-1)==1) (Result(i-1,j)==255) (Result(i-1,j+1)==255) (Result(i,j-1)==255) (Result(i,j+1)==255) (Result(i+1,j-1)==255) (Result(i+1,j)==255) (Result(i+1,j+1)==255) temp=result(i-1:i+1,j-1:j+1); eul=bweuler(temp,8); if eul==1 if flag==0 Heap_size=size(Heap); Heap(1,Heap_size(2)).flux=FluxP(i,j);
16 16/19 Heap(1,Heap_size(2)).y=i; Heap(1,Heap_size(2)).x=j; flag=1; else Heap_size=size(Heap); Heap(1,Heap_size(2)+1).flux=FluxP(i,j); Heap(1,Heap_size(2)+1).y=i; Heap(1,Heap_size(2)+1).x=j; % Proposition 2 A point P could be an point of a 1 pixel thick digital % curve if, in a 3x3 neighborhood, it has a single neighbor, or it has two % neighbors, both of which are 4-adjacent to one another. T = -0.5; offset=[-1-1; -1 0; -1 1; 0-1;0 1; 1-1; 1 0; 1 1]; skeletal=struct('y',0,'x',0); count=0; while size(heap,2) > 1 [a,b]=max([heap.flux]); Ycoord=[Heap(b).y]; Xcoord=[Heap(b).x]; if (Result(Ycoord-1,Xcoord-1)==255) (Result(Ycoord-1,Xcoord)==255) (Result(Ycoord-1,Xcoord+1)==255) (Result(Ycoord,Xcoord-1)==255) (Result(Ycoord,Xcoord+1)==255) (Result(Ycoord+1,Xcoord-1)==255) (Result(Ycoord+1,Xcoord)==255) (Result(Ycoord+1,Xcoord+1)==255) temp=result(ycoord-1:ycoord+1,xcoord-1:xcoord+1); eul=bweuler(temp,8); if eul==1 if ~ispoint(ycoord,xcoord,result) FluxP(Ycoord,Xcoord) > T
17 17/19 tempheap=[heap(1,1:b-1) Heap(1,b+1:size(Heap,2))]; Heap=tempHeap; for i=1:8 temp=result(ycoord+offset(i,1)- 1:Ycoord+offset(i,1)+1,Xcoord+offset(i,1)-1:Xcoord+offset(i,2)+1); eul=bweuler(temp,8); if eul==1 Heap_size=size(Heap); Heap(1,Heap_size(2)+1).flux=FluxP(Ycoord+offset(i,1),Xcoord+offset(i,1)); Heap(1,Heap_size(2)+1).y=Ycoord+offset(i,1); Heap(1,Heap_size(2)+1).x=Xcoord+offset(i,1); else skeletalsize=size(skeletal); skeletal(1,skeletalsize(2)+1).y=ycoord; skeletal(1,skeletalsize(2)+1).x=xcoord; tempheap=[heap(1,1:b-1) Heap(1,b+1:size(Heap,2))]; Heap=tempHeap; skeletalresult=255.*ones(ys,xs); for i=2:size(skeletal,2) tempx=[skeletal(i).x]; tempy=[skeletal(i).y]; skeletalresult(tempy,tempx)=0; figure; imshow(uint8(skeletalresult));
18 18/19 -Sub routine function eval=ispoint(y,x,im) % Proposition 2 A point P could be an point of a 1 pixel thick digital % curve if, in a 3x3 neighborhood, it has a single neighbor, or it has two % neighbors, both of which are 4-adjacent to one another. eval=0; offset=[-1-1; -1 0; -1 1; 0-1;0 1; 1-1; 1 0; 1 1]; sum=0; for i=1:8 temp=im(y+offset(i,1),x+offset(i,2)); sum=sum+temp; if sum==255*1 eval=1; if sum==255*2 j=1; for i=1:8 temp=im(y+offset(i,1),x+offset(i,2)); tempx(j)=x+offset(i,2); tempy(j)=y+offset(i,1); j=j+1; if (abs(tempx(1)-tempx(2))+abs(tempy(1)-tempy(2)))==1 eval=1; return;
19 19/19 Contribution Distribution Chung, In Young Lee, Kang Eui Literature Review 40% 60% Testing 50% 50% Matlab Programming 40% 60% Report Composition 50% 50% Project Presentation 70% 30% Overall 50% 50% Chung, In Young Signature Date Lee, Kang Eui Signature Date
Robust and Efficient Skeletal Graphs
Robust and Efficient Skeletal Graphs Pavel Dimitrov Carlos Phillips McGill University School of Computer Science & Center for Intelligent Machines pdimit,carlos,siddiqi @cim.mcgill.ca Kaleem Siddiqi Abstract
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 informationDivergence-Based Medial Surfaces
Divergence-Based Medial Surfaces Sylvain Bouix and Kaleem Siddiqi McGill University School of Computer Science & Center for Intelligent Machines 3480 University Street Montreal, QC H3A 2A7, Canada {sbouix,siddiqi}@cim.mcgill.ca
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 informationMorphological Image Processing
Morphological Image Processing Morphology Identification, analysis, and description of the structure of the smallest unit of words Theory and technique for the analysis and processing of geometric structures
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 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 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 informationTHE skeletal abstraction of two-dimensional (2-D) and
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 15, NO. 4, APRIL 2006 877 Correcting Curvature-Density Effects in the Hamilton Jacobi Skeleton Andrea Torsello and Edwin R. Hancock Abstract The Hamilton Jacobi
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 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 informationThis is a repository copy of Correcting curvature-density effects in the Hamilton-Jacobi skeleton.
This is a repository copy of Correcting curvature-density effects in the Hamilton-Jacobi skeleton. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/1997/ Article: Hancock,
More informationIntroduction. Computer Vision & Digital Image Processing. Preview. Basic Concepts from Set Theory
Introduction Computer Vision & Digital Image Processing Morphological Image Processing I Morphology a branch of biology concerned with the form and structure of plants and animals Mathematical morphology
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 informationSkeleton Extraction via Anisotropic Heat Flow
DIREKOGLU ET AL.: SKELETON EXTRACTION VIA ANISOTROPIC HEAT FLOW 1 Skeleton Extraction via Anisotropic Heat Flow Cem Direkoglu cem.direkoglu@scss.tcd.ie Rozenn Dahyot rozenn.dahyot@scss.tcd.ie Michael Manzke
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 informationMathematical Morphology and Distance Transforms. Robin Strand
Mathematical Morphology and Distance Transforms Robin Strand robin.strand@it.uu.se Morphology Form and structure Mathematical framework used for: Pre-processing Noise filtering, shape simplification,...
More informationEECS490: Digital Image Processing. Lecture #17
Lecture #17 Morphology & set operations on images Structuring elements Erosion and dilation Opening and closing Morphological image processing, boundary extraction, region filling Connectivity: convex
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 informationA skeletal measure of 2D shape similarity
Computer Vision and Image Understanding 95 (2004) 1 29 www.elsevier.com/locate/cviu A skeletal measure of 2D shape similarity Andrea Torsello * and Edwin R. Hancock Department of Computer Science, University
More informationSkeletonization by Gradient Regularization and diffusion
Seletonization by Gradient Regularization and diffusion F. Le Bourgeois H. Emptoz LIRIS INSA de Lyon, Villeurbanne France {Franc.lebourgeois,Hubert.emptoz}@liris.cnrs.fr Abstract This paper describes a
More informationSaarland University Faculty of Natural Sciences and Technology I Department of Computer Science Bachelor s Program in Computer Science
Saarland University Faculty of Natural Sciences and Technology I Department of Computer Science Bachelor s Program in Computer Science Bachelor s Thesis Hamilton-Jacobi Skeletonisation in Image Processing
More informationSubset Warping: Rubber Sheeting with Cuts
Subset Warping: Rubber Sheeting with Cuts Pierre Landau and Eric Schwartz February 14, 1994 Correspondence should be sent to: Eric Schwartz Department of Cognitive and Neural Systems Boston University
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 informationInternational Journal of Advance Engineering and Research Development. Applications of Set Theory in Digital Image Processing
Scientific Journal of Impact Factor (SJIF): 4.72 International Journal of Advance Engineering and Research Development Volume 4, Issue 11, November -2017 Applications of Set Theory in Digital Image Processing
More informationEDGE DETECTION-APPLICATION OF (FIRST AND SECOND) ORDER DERIVATIVE IN IMAGE PROCESSING
Diyala Journal of Engineering Sciences Second Engineering Scientific Conference College of Engineering University of Diyala 16-17 December. 2015, pp. 430-440 ISSN 1999-8716 Printed in Iraq EDGE DETECTION-APPLICATION
More informationA New Method for Skeleton Pruning
A New Method for Skeleton Pruning Laura Alejandra Pinilla-Buitrago, José Fco. Martínez-Trinidad, and J.A. Carrasco-Ochoa Instituto Nacional de Astrofísica, Óptica y Electrónica Departamento de Ciencias
More informationChapter 15 Vector Calculus
Chapter 15 Vector Calculus 151 Vector Fields 152 Line Integrals 153 Fundamental Theorem and Independence of Path 153 Conservative Fields and Potential Functions 154 Green s Theorem 155 urface Integrals
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 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 informationDetection of Edges Using Mathematical Morphological Operators
OPEN TRANSACTIONS ON INFORMATION PROCESSING Volume 1, Number 1, MAY 2014 OPEN TRANSACTIONS ON INFORMATION PROCESSING Detection of Edges Using Mathematical Morphological Operators Suman Rani*, Deepti Bansal,
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 informationEfficient 3D Binary Image Skeletonization
Efficient 3D Binary Image Skeletonization Son Tran and Liwen Shih Computer Engineering, University of Houston - Clear Lake (UHCL) shih@uhcl.edu Abstract Image Skeletonization promises to be a powerful
More informationShape Matching using Skeleton Context for Automated Bow Echo Detection
Shape Matching using Skeleton Context for Automated Bow Echo Detection Mohammad Mahdi Kamani, Farshid Farhat, Stephen Wistar, and James Z. Wang The Pennsylvania State University Accuweather Inc. Abstract
More informationOn Khalimsky Topology and Applications on the Digital Image Segmentation
Applied Mathematical Sciences, Vol. 9, 25, no. 74, 3687-37 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ams.25.53227 On Khalimsky Topology and Applications on the Digital Image Segmentation M.
More informationweighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces.
weighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces. joint work with (S. Osher, R. Fedkiw and M. Kang) Desired properties for surface reconstruction:
More informationProf. Fanny Ficuciello Robotics for Bioengineering Visual Servoing
Visual servoing vision allows a robotic system to obtain geometrical and qualitative information on the surrounding environment high level control motion planning (look-and-move visual grasping) low level
More informationGeodesic-based Skeleton Smoothing
Geodesic-based Skeleton Smoothing Porawat Visutsak and Korakot Prachumrak Abstract Skeleton is at the main interest of 3D character animation. The most common techniques for skeleton computing are based
More informationMath 52 Final Exam March 16, 2009
Math 52 Final Exam March 16, 2009 Name : Section Leader: Josh Lan Xiannan (Circle one) Genauer Huang Li Section Time: 10:00 11:00 1:15 2:15 (Circle one) This is a closed-book, closed-notes exam. No calculators
More informationA Statistical Consistency Check for the Space Carving Algorithm.
A Statistical Consistency Check for the Space Carving Algorithm. A. Broadhurst and R. Cipolla Dept. of Engineering, Univ. of Cambridge, Cambridge, CB2 1PZ aeb29 cipolla @eng.cam.ac.uk Abstract This paper
More informationLecture 4: Image Processing
Lecture 4: Image Processing Definitions Many graphics techniques that operate only on images Image processing: operations that take images as input, produce images as output In its most general form, an
More informationRevealing Significant Medial Structure in Polyhedral Meshes
Revealing Significant Medial Structure in Polyhedral Meshes Svetlana Stolpner Kaleem Siddiqi Department of Computer Science, Centre for Intelligent Machines McGill University Montréal, QC, H3A 2A7, Canada
More informationRESEARCH ON OPTIMIZATION OF IMAGE USING SKELETONIZATION TECHNIQUE WITH ADVANCED ALGORITHM
881 RESEARCH ON OPTIMIZATION OF IMAGE USING SKELETONIZATION TECHNIQUE WITH ADVANCED ALGORITHM Sarita Jain 1 Sumit Rana 2 Department of CSE 1 Department of CSE 2 Geeta Engineering College 1, Panipat, India
More informationEdge linking. Two types of approaches. This process needs to be able to bridge gaps in detected edges due to the reason mentioned above
Edge linking Edge detection rarely finds the entire set of edges in an image. Normally there are breaks due to noise, non-uniform illumination, etc. If we want to obtain region boundaries (for segmentation)
More informationGray Skeletons and Segmentation of Shapes
Gray Skeletons and Segmentation of Shapes Jayant Shah Mathematics Department, Northeastern University, Boston MA 02115 email: shah@neu.edu 1 Introduction Abstract Noise presents a major difficulty in implementing
More informationBinary Shape Characterization using Morphological Boundary Class Distribution Functions
Binary Shape Characterization using Morphological Boundary Class Distribution Functions Marcin Iwanowski Institute of Control and Industrial Electronics, Warsaw University of Technology, ul.koszykowa 75,
More informationFixed Topology Skeletons
Fixed Topology Skeletons In Proc. CVPR 2000, pp. 10-17 Polina Golland and W. Eric. L. Grimson Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139, USA {polina,welg}@ai.mit.edu
More information= f (a, b) + (hf x + kf y ) (a,b) +
Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals
More informationMorphological Image Processing GUI using MATLAB
Trends Journal of Sciences Research (2015) 2(3):90-94 http://www.tjsr.org Morphological Image Processing GUI using MATLAB INTRODUCTION A digital image is a representation of twodimensional images as a
More informationISTHMUS BASED ORDER INDEPENDENT SEQUENTIAL THINNING
Proceedings of the IASTED International Conference Signal Processing, Pattern Recognition and Applications (SPPRA 2012) June 18-20, 2012 Crete, Greece ISTHMUS BASED ORDER INDEPENDENT SEQUENTIAL THINNING
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 informationSupplementary Materials for
advances.sciencemag.org/cgi/content/full/4/1/eaao7005/dc1 Supplementary Materials for Computational discovery of extremal microstructure families The PDF file includes: Desai Chen, Mélina Skouras, Bo Zhu,
More informationVariational Methods II
Mathematical Foundations of Computer Graphics and Vision Variational Methods II Luca Ballan Institute of Visual Computing Last Lecture If we have a topological vector space with an inner product and functionals
More informationSkeleton Pruning by Contour Partitioning with Discrete Curve Evolution
TO APPEAR IN IEEE PAMI Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution Xiang Bai, Longin Jan Latecki, Wen-Yu Liu, Abstract In this paper, we introduce a new skeleton pruning method
More information(Refer Slide Time 00:17) Welcome to the course on Digital Image Processing. (Refer Slide Time 00:22)
Digital Image Processing Prof. P. K. Biswas Department of Electronics and Electrical Communications Engineering Indian Institute of Technology, Kharagpur Module Number 01 Lecture Number 02 Application
More informationCOMPUTER VISION > OPTICAL FLOW UTRECHT UNIVERSITY RONALD POPPE
COMPUTER VISION 2017-2018 > OPTICAL FLOW UTRECHT UNIVERSITY RONALD POPPE OUTLINE Optical flow Lucas-Kanade Horn-Schunck Applications of optical flow Optical flow tracking Histograms of oriented flow Assignment
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More information18.02 Final Exam. y = 0
No books, notes or calculators. 5 problems, 50 points. 8.0 Final Exam Useful formula: cos (θ) = ( + cos(θ)) Problem. (0 points) a) (5 pts.) Find the equation in the form Ax + By + z = D of the plane P
More informationUnderstanding Tracking and StroMotion of Soccer Ball
Understanding Tracking and StroMotion of Soccer Ball Nhat H. Nguyen Master Student 205 Witherspoon Hall Charlotte, NC 28223 704 656 2021 rich.uncc@gmail.com ABSTRACT Soccer requires rapid ball movements.
More informationMatching Hierarchical Structures for Shape Recognition
Matching Hierarchical Structures for Shape Recognition Andrea Torsello Submitted for the degree of Doctor of Philosophy Department of Computer Science May 2004 Abstract In this thesis we aim to develop
More informationEdge detection. Winter in Kraków photographed by Marcin Ryczek
Edge detection Winter in Kraków photographed by Marcin Ryczek Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, edges carry most of the semantic and shape information
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 informationTHE skeleton is important for object representation and
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 29, NO. 3, MARCH 2007 1 Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution Xiang Bai, Longin Jan Latecki, Member,
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 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 informationChapter 11 Arc Extraction and Segmentation
Chapter 11 Arc Extraction and Segmentation 11.1 Introduction edge detection: labels each pixel as edge or no edge additional properties of edge: direction, gradient magnitude, contrast edge grouping: edge
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 informationShape Matching and Object Recognition
Shape Matching and Object Recognition Title:Matching Hierarchical Structures using Association Graphs Authors: Pelillo, Siddiqi, and Zucker Publication: IEEE PAMI Vol. 21, No. 11 Year: 1999 URL: http://www.dsi.unive.it/~pelillo/papers/
More informationUnstructured Mesh Generation for Implicit Moving Geometries and Level Set Applications
Unstructured Mesh Generation for Implicit Moving Geometries and Level Set Applications Per-Olof Persson (persson@mit.edu) Department of Mathematics Massachusetts Institute of Technology http://www.mit.edu/
More informationDr. Allen Back. Aug. 27, 2014
Dr. Allen Back Aug. 27, 2014 Math 2220 Preliminaries (2+ classes) Differentiation (12 classes) Multiple Integrals (9 classes) Vector Integrals (15 classes) Math 2220 Preliminaries (2+ classes) Differentiation
More informationFiltering Images. Contents
Image Processing and Data Visualization with MATLAB Filtering Images Hansrudi Noser June 8-9, 010 UZH, Multimedia and Robotics Summer School Noise Smoothing Filters Sigmoid Filters Gradient Filters Contents
More informationLecture 7: Most Common Edge Detectors
#1 Lecture 7: Most Common Edge Detectors Saad Bedros sbedros@umn.edu Edge Detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the
More informationThe Divergence Theorem
The Divergence Theorem MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Summer 2011 Green s Theorem Revisited Green s Theorem: M(x, y) dx + N(x, y) dy = C R ( N x M ) da y y x Green
More informationComparison between Various Edge Detection Methods on Satellite Image
Comparison between Various Edge Detection Methods on Satellite Image H.S. Bhadauria 1, Annapurna Singh 2, Anuj Kumar 3 Govind Ballabh Pant Engineering College ( Pauri garhwal),computer Science and Engineering
More informationIntegrating Intensity and Texture in Markov Random Fields Segmentation. Amer Dawoud and Anton Netchaev. {amer.dawoud*,
Integrating Intensity and Texture in Markov Random Fields Segmentation Amer Dawoud and Anton Netchaev {amer.dawoud*, anton.netchaev}@usm.edu School of Computing, University of Southern Mississippi 118
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
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 informationEdge detection. Winter in Kraków photographed by Marcin Ryczek
Edge detection Winter in Kraków photographed by Marcin Ryczek Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image
More informationAn Image Curvature Microscope
An Jean-Michel MOREL Joint work with Adina CIOMAGA and Pascal MONASSE Centre de Mathématiques et de Leurs Applications, Ecole Normale Supérieure de Cachan Séminaire Jean Serra - 70 ans April 2, 2010 Jean-Michel
More informationOn the isomorphism between the medial axis and a dual of the Delaunay graph
Downloaded from orbit.dtu.dk on: Dec 17, 217 On the isomorphism between the medial axis and a dual of the Delaunay graph Sharma, Ojaswa; Anton, François; Mioc, Darka Published in: Sixth International Symposium
More informationCS534: Introduction to Computer Vision Edges and Contours. Ahmed Elgammal Dept. of Computer Science Rutgers University
CS534: Introduction to Computer Vision Edges and Contours Ahmed Elgammal Dept. of Computer Science Rutgers University Outlines What makes an edge? Gradient-based edge detection Edge Operators Laplacian
More informationMedial Features for Superpixel Segmentation
Medial Features for Superpixel Segmentation David Engel Luciano Spinello Rudolph Triebel Roland Siegwart Heinrich H. Bülthoff Cristóbal Curio Max Planck Institute for Biological Cybernetics Spemannstr.
More informationAutomatic Logo Detection and Removal
Automatic Logo Detection and Removal Miriam Cha, Pooya Khorrami and Matthew Wagner Electrical and Computer Engineering Carnegie Mellon University Pittsburgh, PA 15213 {mcha,pkhorrami,mwagner}@ece.cmu.edu
More informationFingerprint Verification applying Invariant Moments
Fingerprint Verification applying Invariant Moments J. Leon, G Sanchez, G. Aguilar. L. Toscano. H. Perez, J. M. Ramirez National Polytechnic Institute SEPI ESIME CULHUACAN Mexico City, Mexico National
More informationCPSC 695. Geometric Algorithms in Biometrics. Dr. Marina L. Gavrilova
CPSC 695 Geometric Algorithms in Biometrics Dr. Marina L. Gavrilova Biometric goals Verify users Identify users Synthesis - recently Biometric identifiers Courtesy of Bromba GmbH Classification of identifiers
More informationImage Processing. Bilkent University. CS554 Computer Vision Pinar Duygulu
Image Processing CS 554 Computer Vision Pinar Duygulu Bilkent University Today Image Formation Point and Blob Processing Binary Image Processing Readings: Gonzalez & Woods, Ch. 3 Slides are adapted from
More informationEdge detection. Goal: Identify sudden. an image. Ideal: artist s line drawing. object-level knowledge)
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded in the edges More compact than pixels Ideal: artist
More informationAn Image Curvature Microscope
An Jean-Michel MOREL Joint work with Adina CIOMAGA and Pascal MONASSE Centre de Mathématiques et de Leurs Applications, Ecole Normale Supérieure de Cachan Séminaire Jean Serra - 70 ans April 2, 2010 Jean-Michel
More informationSmall-scale objects extraction in digital images
102 Int'l Conf. IP, Comp. Vision, and Pattern Recognition IPCV'15 Small-scale objects extraction in digital images V. Volkov 1,2 S. Bobylev 1 1 Radioengineering Dept., The Bonch-Bruevich State Telecommunications
More informationFast marching methods
1 Fast marching methods Lecture 3 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 Metric discretization 2 Approach I:
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 informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More informationSilhouette-based Multiple-View Camera Calibration
Silhouette-based Multiple-View Camera Calibration Prashant Ramanathan, Eckehard Steinbach, and Bernd Girod Information Systems Laboratory, Electrical Engineering Department, Stanford University Stanford,
More informationγ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set
γ 1 γ 3 γ γ 3 γ γ 1 R (a) an unbounded Yin set (b) a bounded Yin set Fig..1: Jordan curve representation of a connected Yin set M R. A shaded region represents M and the dashed curves its boundary M that
More informationAn explicit feature control approach in structural topology optimization
th World Congress on Structural and Multidisciplinary Optimisation 07 th -2 th, June 205, Sydney Australia An explicit feature control approach in structural topology optimization Weisheng Zhang, Xu Guo
More informationMorphological Image Processing
Morphological Image Processing Ranga Rodrigo October 9, 29 Outline Contents Preliminaries 2 Dilation and Erosion 3 2. Dilation.............................................. 3 2.2 Erosion..............................................
More informationSTATISTICS AND ANALYSIS OF SHAPE
Control and Cybernetics vol. 36 (2007) No. 2 Book review: STATISTICS AND ANALYSIS OF SHAPE by H. Krim, A. Yezzi, Jr., eds. There are numerous definitions of a notion of shape of an object. These definitions
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 03 Image Processing Basics 13/01/28 http://www.ee.unlv.edu/~b1morris/ecg782/
More informationProf. Feng Liu. Winter /15/2019
Prof. Feng Liu Winter 2019 http://www.cs.pdx.edu/~fliu/courses/cs410/ 01/15/2019 Last Time Filter 2 Today More on Filter Feature Detection 3 Filter Re-cap noisy image naïve denoising Gaussian blur better
More informationSnakes reparameterization for noisy images segmentation and targets tracking
Snakes reparameterization for noisy images segmentation and targets tracking Idrissi Sidi Yassine, Samir Belfkih. Lycée Tawfik Elhakim Zawiya de Noaceur, route de Marrakech, Casablanca, maroc. Laboratoire
More information