Genetic Algorithms for Free-Form Surface Matching
|
|
- Giles French
- 6 years ago
- Views:
Transcription
1 Genetic Algorithms for Free-Form Surface Matching K. Brunnström and A. J. Stoddart y Dept. of Electronic and Electrical Engineering University of Surrey Guildford, Surrey GU2 5XH, UK Abstract The free-form surface matching problem is important in several practical applications, such as reverse engineering. An accurate, robust and fast solution is, therefore, of great significance. Recently genetic algorithms have attracted great interest for their ability to robustly solve hard optimization problems. In this work we investigate the performance of such an approach for finding the initial guess of the transformation, a translation and a rotation, between the object and the model surface. This would be followed by a local gradient descent method such as ICP to refine the estimate. Promising results are demonstrated on accurate real data. 1. Introduction The free-form surface matching problem remains a difficult problem. Apart from being interesting in its own right, there are a number of direct applications. These include inspection and recognition of free-form surfaces from dense depth data. In these problems correspondences need to be established between models and the data. For example in reverse engineering processes range data is acquired by a range scanner. Separate views need to be registered and fused [11]. The registration is usually based on gradientdescent e.g. the iterative closest point (ICP) algorithm. To find the right solution the user must input an initial guess. For these applications an accurate, robust and fast solution is of vital importance. The problem of matching two free-form surfaces can be cast as a search or an optimization problem. This leads to a 6 dimensional optimization problem with many local extrema. Hence, a gradient-descent method would most likely S & T Datakonsulter AB, Box 24183, S Stockholm, Sweden Tel: , Fax: , kjell.brunnstrom@st.se y Tel: ext. 3012, Fax: , A.Stoddart@ee.surrey.ac.uk fail, when nothing is known about where the global optimum is located. Recently genetic algorithms have attracted attention as a powerful tool for optimization problems. Also, in the Computer Vision community a growing number of applications of these techniques can be seen. Recently, [7] used a genetic algorithm for registration of 3D images in a medical application. Cross and Hancock[5] reports fast convergence with a genetic search based on Hamming distance. However, to the best of our knowledge we know of no earlier use of genetic algorithms for matching free-form surfaces. In this paper we will present a simple algorithm applied to this problem. The problem we address is as follows. Suppose there is some detailed surface model of an object and this object is imaged using a range sensor giving 3D information, then we are seeking the transformation that will bring the model and the data into correspondence. In a single view the object is only partly imaged and the image may contain measurements of other objects. Of course the model may be the same object imaged from another view. We do not address the problem of accurate registration. Algorithms based on gradient descent, or iterative closest point already exist [3]. They can accurately register two surface datasets given an initial guess reasonably close to the actual solution. They typically require a user supplied initial guess. This paper presents a method that could automatically supply this guess. In some sense the free-form surface matching problem is a special case of the general model based object recognition problem. Many algorithms have been proposed for object recognition, but only a few are appropriate for freeform surfaces. In particular we do not wish to make overly restrictive assumptions such as convexity or the absence of clutter. On the other hand the algorithm presented in this paper will not be suited to matching objects composed of simple surfaces such as planes, cylinders and spheres. We would recommend use of other methods that extract such features and performing matching based on them. 1
2 There are very few algorithms on the market that convincingly address the problem of free-form surface matching without an initial guess. One algorithm that apparently does solve the problem is based on a multi stage algorithm of some complexity [1]. It requires in the region of 30 minutes to compute a solution. Besl s survey article [2] on free-form surface matching convincingly specifies the problem. It cites 111 other articles almost none of which actually address the general freeform matching problem. Those that do, assume that reliable features (e.g. zero crossings of curvature) can be extracted. We make no such assumption. This paper, which is a shortened version of the technical report[4], is organized as follows. First we present the genetic algorithm for free-form surface matching, assuming that the reader is familiar with how a genetic algorithm is working in general. For such a description see e.g. Goldberg [6]. We then describe our experiments and results. Finally we conclude with a discussion. 2. The genetic algorithm To use a genetic algorithm for solving our problem, it must be formulated in a suitable way. First we need to convert the continuous problem of free-form surface matching to discrete form. This is done by randomly sampling the model surface to a sufficient density, and randomly sampling the scene surface to some other density. We now pose the problem as a point matching problem. We wish to label (associate) each point in the scene with a point from the model, or a null label. Because the points are randomly chosen we do not expect an exact match. However, when sampled to a sufficient density we hope to match to a relatively close point. We also need a way to measure fitness of the chromosomes. The chromosomes represents an assignment of model points to scene points. The fitness function used will be described in detail below. It is based on a function that counts the number of good matches, by using the translational and rotational invariants such as relative orientation of surface normals and relative distances between points. Finally, we must decide on when a suitable result has been obtained. The fitness function measures the number of good matches. Ideally when all points are correctly matched, it will correspond to the number of scene points. However, due to the random sampling, noise and occlusion this cannot be achieved in practise. Furthermore, there is no way from within the genetic algorithm to check whether we have found the right solution or not. In the field of GA s the choice of termination is still an open question. We have investigated three different approaches: the optimization is stopped when a certain percentage of the total number of correct matches have been found; the maximum fitness has not increased for a fixed number of generations; or it is terminated after a certain number of generations. There are a few free parameters that need to be selected. The number is small compared to many other methods 1. The parameters are: population size i.e. the number of chromosomes; the crossover probability; the mutation probability; the stopping criteria; and one parameter in the fitness function, which we call the temperature. The problem of selecting parameters for the GA s is an open question. They are usually chosen heuristically based on experience of the user community. This has guided us in our choice of parameters The fitness function A genetic algorithm needs a cost function or fitness function to be defined for a given problem. In this Section we develop a fitness function appropriate for the free-form surface matching problem. Because the fitness must measure match quality in correspondence space it is designed to be invariant to translation or rotation of either the scene or model. It should be robust in the presence of clutter as well. Because of the random sampling we can never achieve an exact match but there will usually be reasonably good approximate matches. The quality of the best match will be a function of the average spacing between the randomly selected points on the surface. In genetic algorithms the choice of a fitness function needs careful consideration. The convergence of the algorithm depends crucially on relative sizes of this over solution space. A choice we make is to build up a cost that has some meaning, in particular we aim to find an intermediate quality measure Q which counts the number of good matches. This will then be transformed into f which will be the fitness passed to the GA. We suppose that the M model points are labeled by = 1::M and the N scene points are labeled by i or j = 1::N. If scene point i takes on label this is denoted by i. We denote a joint labeling of all objects by the set f1; 2; ::: N g. As a shorthand we define the multi-index ~ = f1; 2; ::: N g. Now suppose that we choose 2 points i; j from the scene surface. They will contain 4 vectors (2 positions and 2 normal vectors) of information between them, i.e. ~r i ; ^n i ; ~r j ; ^n j. There are 10 independent parameters and 4 invariants under rigid translation and rotation. We are interested in features that remain invariant to rotation and translation. The most obvious is the length of the vector ~v ij from point i to point j, i.e. ~v ij ~r j? ~r i. Pairwise relative orientation is also an invariant. Finally, there will be a twist angle between the 1 Their exact values will be given together with the presentation of the results. 2
3 two normals representing the extent to which they are out of plane. Thus the four invariants are k~v ij k = k~r j? ~r i k (1) cos( ij ) = ^n j ~v ij (2) cos( ji ) = ^n i ~v ji (3) cos( ij ) = ( ^nj d ~v ij ) ( ^ni d ~v ij ) (4) Now consider two model points and two scene points. We wish to define a pairwise match quality Q( i ; j ) which will be a product over four terms. The first term q d ( i ; j ) can then be expressed as q d ( i ; j ) = exp? [k~v i j k? k~v ij k] For a perfect match this returns 1, and decays as a Gaussian with standard deviation. Clearly must be related to measurement noise and sampling density. We expect the sampling density to dominate here, and we use a simple probabilistic model to determine. We do not tune. Figure 1. Range data of a rabbit from a Cyberware range scanner taken from different viewing directions, rotated around one axis. Suppose we have M points randomly distributed on the model surface. Given an arbitrary scene point how far will it be to the nearest model point (when correctly registered)? For an infinite plane the closest distance between points will be a random variable following the Poisson distribution [9]. The expected value of closest distance can be calculated to be?( 2 3 )p. Where is the density of points on the surface, which we estimate to be the area of the surface divided by the number of randomly sampled points. This agrees well with the empirical average closest distance. The angular quality measure is defined as q n ( i ; j ) = e? ( i ; j?ij )2+( j ; i?ji)2+( i; j?ij )2 2 2 (6) As the normal is a derivative quantity we assume that the error will be dominated by the measurement error and not the random sampling process. This is true on gently varying (5) surfaces, but not those with many small details. We select the parameter from an estimate of the typical error in a surface normal. Standard methods exist for this [10] and we use a value for = 20 throughout this paper. We have not tested other values. Finally we obtain the pairwise quality measure we require Q( i ; j ) = e d ( i ; j )e n ( i ; j ) (7) This quantity is equal to 1 for a perfect match and degrades to zero. From this expression we can form a total quality measure for a particular match by summing up all the pairwise relations for that match i.e. Q( i ) = X j6=i Q( i ; j ) (8) This measure will range between 0 to N? 1. We can now build up from this a global match quality Q(~) = s 2 XX i j<i Q( i ; j ) = s X i Q( i ) (9) If all N matches are correct then this will give (approximately) N. Thus far we have designed a heuristic measure of match quality with an easy intuitive definition. The next step, also heuristic, is to design a fitness function that is appropriate for the GA. We choose the following Q(~) f (~) = exp (10) T The form of the expression and the parameter T (temperature) are intended to bear a close resemblance to the formalism of the simulated annealing method of optimization. We believe that this is a good form for the fitness function. Evolutionary pressure in GA s is exerted by the ratio of costs, and the exponential form of the fitness ensures that each gain of T correct matches is accompanied by an increase in fitness of a factor e = 2:718. A few values of T were tested, with decreasing performance for T < 1 and no real improvement for values T > 1, so we have used the value 1 throughout this work Finding the transformation The result of the GA is a good labeling ~, but we actually want a transformation, a translation and a rotation, which takes the object data set into the model. When the genetic algorithm are stopped, the chromosome of the best scoring individual will contain both good and bad matches. If we can pick out the subset that just contain good matches we could use a standard method to find the transformation. This could indeed be done by looking at the point-wise matching 3
4 score Q( i ), Equation 8. If this is close to N?1 we can use it for calculating the transformation. In this work we have simply been using a threshold, typically set to about 30% of N. The transformation is then found by least-squares fitting, which is solved using a SVD-based based method [8] Complexity The core computation is the fitness function which is evaluated for each individual in the population, to determine its relative strength. As can be seen by equation 9, this computation will be of O(N 2 ). Consider the situation that we have a population of L individuals and the algorithm is stopped after G generations. This will give an overall complexity of O(GLN 2 ). (g) (h) (i) (g) (h) (i) Figure 3. High precision 3D data of a cow produced by Viewpoint Animation Engineering. d)-f) Shows the result when using the above described set of parameters, except that the number of labels for the GA have been doubled (M = 200) to reflect that the model surface has double the area. g)-i) The result when using N = 100 and M = 400. (j) (k) (l) Figure 2. High precision 3D data of a bust of Beethoven produced by Viewpoint Animation Engineering. 3. Experiments and Results We will here present a few experiments illustrating the strengths and weaknesses of the presented approach to freeform surface matching. It should be stressed that our objective is not accurate registration, rather it is to develop a technique to find an approximate pose. The parameters of the algorithm have been kept constant throughout the experiments. In one case the number of points has been increased to obtain a better match. Both results are presented. In the standard case the population has consists of 50 individuals, each having 50 points i.e. M = 50 (see Section 2.1). The genetic algorithm searches for matches among 100 label points i.e. N = 100. The crossover probability was 90% and the mutation rate 1% per label. The temperature has been fixed at 1:0. In all cases the GA was run for 1000 generations. The GA specific parameters have been obtained by testing a few values around those given in Goldberg s book about GA s and selecting the set with the fastest convergence for a particular example. The computation time in the examples with these parameters is about 2 minutes on a AlphaStation 250. In the first example, Figure 1, an image of a rabbit obtained by a laser range finder, Cyberware, have been used. The scene, 1(a), and the model, 1(b), have been taken from different directions, with a more than 50% overlap, 1(c). The resulting transformation applied to the scene is shown in Figure 1(d), and in 1(e) and 1(f) it is shown together with the model from two different viewing directions. The data was used in Turk and Levoy [11] and made available by ftp. It has been registered with an ICP based algorithm starting from a user supplied initial position. The ICP transformation is given as comparison to the GA computed transformation in the table of Figure 5(a). As can be seen there are good agreement between the values computed by the two methods. In the next example, Figure 2, we have been using 3D data of a bust of Beethoven. The object or the scene is shown in Figure 2(a). The model is a translated and rotated version of the object, Figure 2(b). This data was produced by Viewpoint Animation Engineering using point measurements of high accuracy. The two data sets are shown together in Figure 2(c). Applying the computed transformation to the object, the result can be seen in Figures 2(d)-(f). The table in Figure 5(b) gives the computed transformation and the errors in these parameters. In Figure 3 the model is a cow 2, 3(b). The scene, 3(a), has been generated by cutting out half the cow from head to tail and then adding a rotation and a translation to its position. The match in the first example has been obtained by 2 This data comes from Viewpoint Animation Engineering as well. 4
5 using the same parameters as above, except that we have increased the number of labels (M = 200) to reflect the fact that the size of the model is double that of the object. The transformation found was not very good, Figure 3(d)- (f) and 5(c)(Estimate 1). This is improved considerably, Figure 3(g)-(i) and 5(c)(Estimate 2), by increasing the number of points (N = 100) on the object surface as well as the number of labels points on the model surface (M = 400). In the final example, Figure 4 and 5(d), the front legs of the cow above have been cutout and rotated relative to each other. A rather surprising solution is found, even though we expected the algorithm to have problems in this case. The points around the cylindrical part of the body will dominate the solution, which make the algorithm stuck in a local optimum. in the field of Genetic Algorithms suggest that small modifications can significantly improve their performance. On the other hand almost all optimization algorithms benefit from the inclusion of domain-specific knowledge into the basic algorithm. This we have not yet done, but seems likely to lead to a much more efficient algorithm. Work is in progress on these points. Parameter x t y t z t xr yr zr a) ICP estimate Estimate b) True Estimate c) True Estimate Estimate d) True Estimate Figure 5. The computed transformation for the example shown in Figure 1, 2, 3 and 4. The first three columns represent the computed translation. The next three the rotation axis and the last the rotation angle. a) Result for the example in Figure 1 b) Figure 2 c) Figure 3 d) Figure 4 References Figure 4. High precision 3D data of a cow produced by Viewpoint Animation Engineering. The scene and model are cut out pieces from the front leg region of the cow. Note the near cylindrical shape of most of the data. 4. Discussion We have in this paper presented a simple approach, with promising results, based on genetic algorithm, for finding the initial guess for the free-form matching problem. The basic steps of the algorithm are: 1) Randomly sampling the object and model surface. 2) Search for a solution with a genetic algorithm. 3) Calculating the transformation from the matched points. Our goal is to find a pose in the close vicinity of the global optimum. Usually the fitness function has many local optima. We use a stochastic search technique that can in principle locate the global optimum to any desired probability. In this sense it resembles Simulated Annealing. Naturally there is a tradeoff between the success rate and the resources allocated. On the datasets we studied we obtain good results in 2-10 minutes on a workstation. The results fall short of the performance that would be desired in practical applications such as multi view fusion of range images. However we believe that there is considerable scope for refinement of the algorithm. Recent advances [1] R. Bergevin, D. Laurendeau, and D. Poussart. Registering range view of multipart objects. IEEE Trans. Pattern Analysis and Machine Intell., 61(1):1 16, Jan [2] P. Besl. The free-form surface matching problem. In H. Freeman, editor, Machine Vision for Three-Dimensional Scenes, pages Academic, New York, [3] P. Besl and N. McKay. A method for registration of 3-d shapes. IEEE Trans. Pattern Analysis and Machine Intell., 14(2): , [4] K. Brunnström and A. J. Stoddart. Genetic algorithms for free-form surface matching. Technical Report ISRN KTH/NA/P--95/19--SE, Dept. of Numerical Analysis and Computing Science, KTH (Royal Institute of Technology), Oct [5] A. Cross and E. Hancock. Genetic search for structural matching. In R. Cipolla, editor, Proc. 4th European Conference on Computer Vision, volume 1064 of Lecture Notes in Computer Science, pages , Cambridge, United Kingdom, Apr Springer Verlag, New York. [6] D. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, Mass., [7] J.-J. Jacq and C. Roux. Registration of 3-d images by genetic optimization. Pattern Recognition, 16(8): , [8] K. Kanatani. Analysis of 3-d rotation fitting. IEEE Trans. Pattern Analysis and Machine Intell., 16(5): , [9] A. Papoulis. Probability, Random Variables, and Stochastic Processes. McGraw-Hill, Inc., Singapore, [10] A. J. Stoddart, J. Illingworth, and T. Windeatt. Optimal parameter selection for derivative estimation in range images. Image and Vision Computing, 13(8): , [11] G. Turk and M. Levoy. Zippered polygon meshes from range images. In Proc. SIGGRAPH 94, In Computer Graphics Proceedings, Annual Conference Series, pages , Orlando, Florida,
Multi-Scale Free-Form Surface Description
Multi-Scale Free-Form Surface Description Farzin Mokhtarian, Nasser Khalili and Peter Yuen Centre for Vision Speech and Signal Processing Dept. of Electronic and Electrical Engineering University of Surrey,
More informationRange Image Registration with Edge Detection in Spherical Coordinates
Range Image Registration with Edge Detection in Spherical Coordinates Olcay Sertel 1 and Cem Ünsalan2 Computer Vision Research Laboratory 1 Department of Computer Engineering 2 Department of Electrical
More informationSubspace Clustering with Global Dimension Minimization And Application to Motion Segmentation
Subspace Clustering with Global Dimension Minimization And Application to Motion Segmentation Bryan Poling University of Minnesota Joint work with Gilad Lerman University of Minnesota The Problem of Subspace
More informationCurvature Estimation on Smoothed 3-D Meshes
Curvature Estimation on Smoothed 3-D Meshes Peter Yuen, Nasser Khalili and Farzin Mokhtarian Centre for Vision, Speech and Signal Processing School of Electronic Engineering, Information Technology and
More informationCRF Based Point Cloud Segmentation Jonathan Nation
CRF Based Point Cloud Segmentation Jonathan Nation jsnation@stanford.edu 1. INTRODUCTION The goal of the project is to use the recently proposed fully connected conditional random field (CRF) model to
More informationStructured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov
Structured Light II Johannes Köhler Johannes.koehler@dfki.de Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov Introduction Previous lecture: Structured Light I Active Scanning Camera/emitter
More informationGenerating 3D Meshes from Range Data
Princeton University COS598B Lectures on 3D Modeling Generating 3D Meshes from Range Data Robert Kalnins Robert Osada Overview Range Images Optical Scanners Error sources and solutions Range Surfaces Mesh
More information3D Computer Vision. Structured Light II. Prof. Didier Stricker. Kaiserlautern University.
3D Computer Vision Structured Light II Prof. Didier Stricker Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche Intelligenz http://av.dfki.de 1 Introduction
More informationTopological Machining Fixture Layout Synthesis Using Genetic Algorithms
Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Necmettin Kaya Uludag University, Mechanical Eng. Department, Bursa, Turkey Ferruh Öztürk Uludag University, Mechanical Eng. Department,
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 12 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationAccurate 3D Face and Body Modeling from a Single Fixed Kinect
Accurate 3D Face and Body Modeling from a Single Fixed Kinect Ruizhe Wang*, Matthias Hernandez*, Jongmoo Choi, Gérard Medioni Computer Vision Lab, IRIS University of Southern California Abstract In this
More informationSurface Registration. Gianpaolo Palma
Surface Registration Gianpaolo Palma The problem 3D scanning generates multiple range images Each contain 3D points for different parts of the model in the local coordinates of the scanner Find a rigid
More informationScan Matching. Pieter Abbeel UC Berkeley EECS. Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics
Scan Matching Pieter Abbeel UC Berkeley EECS Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics Scan Matching Overview Problem statement: Given a scan and a map, or a scan and a scan,
More informationChapter 3 Image Registration. Chapter 3 Image Registration
Chapter 3 Image Registration Distributed Algorithms for Introduction (1) Definition: Image Registration Input: 2 images of the same scene but taken from different perspectives Goal: Identify transformation
More information10701 Machine Learning. Clustering
171 Machine Learning Clustering What is Clustering? Organizing data into clusters such that there is high intra-cluster similarity low inter-cluster similarity Informally, finding natural groupings among
More informationReconstruction of complete 3D object model from multi-view range images.
Header for SPIE use Reconstruction of complete 3D object model from multi-view range images. Yi-Ping Hung *, Chu-Song Chen, Ing-Bor Hsieh, Chiou-Shann Fuh Institute of Information Science, Academia Sinica,
More informationModel-based segmentation and recognition from range data
Model-based segmentation and recognition from range data Jan Boehm Institute for Photogrammetry Universität Stuttgart Germany Keywords: range image, segmentation, object recognition, CAD ABSTRACT This
More informationSUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS
SUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS Cognitive Robotics Original: David G. Lowe, 004 Summary: Coen van Leeuwen, s1460919 Abstract: This article presents a method to extract
More informationDepartment of Electrical Engineering, Keio University Hiyoshi Kouhoku-ku Yokohama 223, Japan
Shape Modeling from Multiple View Images Using GAs Satoshi KIRIHARA and Hideo SAITO Department of Electrical Engineering, Keio University 3-14-1 Hiyoshi Kouhoku-ku Yokohama 223, Japan TEL +81-45-563-1141
More information1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra
Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation
More informationRecognizing Objects by Matching Oriented Points
Submitted to IEEE Computer Vision and Pattern Recognition, CVPR 97 Recognizing Objects by Matching Oriented Points Andrew Edie Johnson and Martial Hebert The Robotics Institute, Carnegie Mellon University
More informationFree-form 3D object reconstruction from range images. C. Schütz, T. Jost, H. Hügli
Free-form 3D object reconstruction from range images C. Schütz, T. Jost, H. Hügli Institute for Microtechnology University of Neuchatel, rue Breguet 2 CH-2000 Neuchatel, Switzerland email: christian.schutz@imt.unine.ch
More informationTowards Automatic Recognition of Fonts using Genetic Approach
Towards Automatic Recognition of Fonts using Genetic Approach M. SARFRAZ Department of Information and Computer Science King Fahd University of Petroleum and Minerals KFUPM # 1510, Dhahran 31261, Saudi
More informationFast Image Registration via Joint Gradient Maximization: Application to Multi-Modal Data
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Fast Image Registration via Joint Gradient Maximization: Application to Multi-Modal Data Xue Mei, Fatih Porikli TR-19 September Abstract We
More informationApplication of a Genetic Algorithm to a Scheduling Assignement Problem
Application of a Genetic Algorithm to a Scheduling Assignement Problem Amândio Marques a and Francisco Morgado b a CISUC - Center of Informatics and Systems of University of Coimbra, 3030 Coimbra, Portugal
More informationFEATURE-BASED REGISTRATION OF RANGE IMAGES IN DOMESTIC ENVIRONMENTS
FEATURE-BASED REGISTRATION OF RANGE IMAGES IN DOMESTIC ENVIRONMENTS Michael Wünstel, Thomas Röfer Technologie-Zentrum Informatik (TZI) Universität Bremen Postfach 330 440, D-28334 Bremen {wuenstel, roefer}@informatik.uni-bremen.de
More informationCorrespondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov
Shape Matching & Correspondence CS 468 Geometry Processing Algorithms Maks Ovsjanikov Wednesday, October 27 th 2010 Overall Goal Given two shapes, find correspondences between them. Overall Goal Given
More informationData Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University
Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Search & Optimization Search and Optimization method deals with
More informationRobust Point Matching for Two-Dimensional Nonrigid Shapes
Robust Point Matching for Two-Dimensional Nonrigid Shapes Yefeng Zheng and David Doermann Language and Media Processing Laboratory Institute for Advanced Computer Studies University of Maryland, College
More informationBayesian Methods in Vision: MAP Estimation, MRFs, Optimization
Bayesian Methods in Vision: MAP Estimation, MRFs, Optimization CS 650: Computer Vision Bryan S. Morse Optimization Approaches to Vision / Image Processing Recurring theme: Cast vision problem as an optimization
More informationThe Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
More informationINFO0948 Fitting and Shape Matching
INFO0948 Fitting and Shape Matching Renaud Detry University of Liège, Belgium Updated March 31, 2015 1 / 33 These slides are based on the following book: D. Forsyth and J. Ponce. Computer vision: a modern
More informationREAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN
REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION Nedim TUTKUN nedimtutkun@gmail.com Outlines Unconstrained Optimization Ackley s Function GA Approach for Ackley s Function Nonlinear Programming Penalty
More informationImage correspondences and structure from motion
Image correspondences and structure from motion http://graphics.cs.cmu.edu/courses/15-463 15-463, 15-663, 15-862 Computational Photography Fall 2017, Lecture 20 Course announcements Homework 5 posted.
More informationIntensity Augmented ICP for Registration of Laser Scanner Point Clouds
Intensity Augmented ICP for Registration of Laser Scanner Point Clouds Bharat Lohani* and Sandeep Sashidharan *Department of Civil Engineering, IIT Kanpur Email: blohani@iitk.ac.in. Abstract While using
More informationSIMULTANEOUS REGISTRATION OF MULTIPLE VIEWS OF A 3D OBJECT Helmut Pottmann a, Stefan Leopoldseder a, Michael Hofer a
SIMULTANEOUS REGISTRATION OF MULTIPLE VIEWS OF A 3D OBJECT Helmut Pottmann a, Stefan Leopoldseder a, Michael Hofer a a Institute of Geometry, Vienna University of Technology, Wiedner Hauptstr. 8 10, A
More informationA Method of Automated Landmark Generation for Automated 3D PDM Construction
A Method of Automated Landmark Generation for Automated 3D PDM Construction A. D. Brett and C. J. Taylor Department of Medical Biophysics University of Manchester Manchester M13 9PT, Uk adb@sv1.smb.man.ac.uk
More informationA Multi-Resolution ICP with Heuristic Closest Point Search for Fast and Robust 3D Registration of Range Images
A Multi-Resolution ICP with Heuristic Closest Point Search for Fast and Robust 3D Registration of Range Images Timothée Jost and Heinz Hügli Institute of Microtechnology, University of Neuchâtel, Breguet
More informationStochastic Optimization for Rigid Point Set Registration
Stochastic Optimization for Rigid Point Set Registration Chavdar Papazov and Darius Burschka Machine Vision and Perception Group (MVP) Department of Computer Science Technische Universität München, Germany
More informationRegistration of Dynamic Range Images
Registration of Dynamic Range Images Tan-Chi Ho 1,2 Jung-Hong Chuang 1 Wen-Wei Lin 2 Song-Sun Lin 2 1 Department of Computer Science National Chiao-Tung University 2 Department of Applied Mathematics National
More informationStructured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov
Structured Light II Johannes Köhler Johannes.koehler@dfki.de Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov Introduction Previous lecture: Structured Light I Active Scanning Camera/emitter
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 17 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationProbabilistic Matching for 3D Scan Registration
Probabilistic Matching for 3D Scan Registration Dirk Hähnel Wolfram Burgard Department of Computer Science, University of Freiburg, 79110 Freiburg, Germany Abstract In this paper we consider the problem
More informationFall 09, Homework 5
5-38 Fall 09, Homework 5 Due: Wednesday, November 8th, beginning of the class You can work in a group of up to two people. This group does not need to be the same group as for the other homeworks. You
More informationObject Modeling from Multiple Images Using Genetic Algorithms. Hideo SAITO and Masayuki MORI. Department of Electrical Engineering, Keio University
Object Modeling from Multiple Images Using Genetic Algorithms Hideo SAITO and Masayuki MORI Department of Electrical Engineering, Keio University E-mail: saito@ozawa.elec.keio.ac.jp Abstract This paper
More informationPHOTOGRAMMETRIC TECHNIQUE FOR TEETH OCCLUSION ANALYSIS IN DENTISTRY
PHOTOGRAMMETRIC TECHNIQUE FOR TEETH OCCLUSION ANALYSIS IN DENTISTRY V. A. Knyaz a, *, S. Yu. Zheltov a, a State Research Institute of Aviation System (GosNIIAS), 539 Moscow, Russia (knyaz,zhl)@gosniias.ru
More informationRecognizing Deformable Shapes. Salvador Ruiz Correa Ph.D. UW EE
Recognizing Deformable Shapes Salvador Ruiz Correa Ph.D. UW EE Input 3-D Object Goal We are interested in developing algorithms for recognizing and classifying deformable object shapes from range data.
More informationA Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices
A Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices Yaser Alkhalifah Roger L. Wainwright Department of Mathematical Department of Mathematical and Computer Sciences and Computer
More information1 Lab 5: Particle Swarm Optimization
1 Lab 5: Particle Swarm Optimization This laboratory requires the following: (The development tools are installed in GR B0 01 already): C development tools (gcc, make, etc.) Webots simulation software
More informationTracking of Human Body using Multiple Predictors
Tracking of Human Body using Multiple Predictors Rui M Jesus 1, Arnaldo J Abrantes 1, and Jorge S Marques 2 1 Instituto Superior de Engenharia de Lisboa, Postfach 351-218317001, Rua Conselheiro Emído Navarro,
More informationA VARIANT OF POINT-TO-PLANE REGISTRATION INCLUDING CYCLE MINIMIZATION
A VARIANT OF POINT-TO-PLANE REGISTRATION INCLUDING CYCLE MINIMIZATION Carles Matabosch a, Elisabet Batlle a, David Fofi b and Joaquim Salvi a a Institut d Informatica i Aplicacions, University of Girona
More informationGenetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem
etic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem R. O. Oladele Department of Computer Science University of Ilorin P.M.B. 1515, Ilorin, NIGERIA
More informationRecognizing Deformable Shapes. Salvador Ruiz Correa (CSE/EE576 Computer Vision I)
Recognizing Deformable Shapes Salvador Ruiz Correa (CSE/EE576 Computer Vision I) Input 3-D Object Goal We are interested in developing algorithms for recognizing and classifying deformable object shapes
More informationMixture Models and EM
Mixture Models and EM Goal: Introduction to probabilistic mixture models and the expectationmaximization (EM) algorithm. Motivation: simultaneous fitting of multiple model instances unsupervised clustering
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 OPTIMIZATION OF MACHINING PROCESS AND MACHINING ECONOMICS In a manufacturing industry, machining process is to shape the metal parts by removing unwanted material. During the
More informationChapter 14 Global Search Algorithms
Chapter 14 Global Search Algorithms An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Introduction We discuss various search methods that attempts to search throughout the entire feasible set.
More informationHYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS
HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS NABEEL AL-MILLI Financial and Business Administration and Computer Science Department Zarqa University College Al-Balqa'
More informationShape and Appearance from Images and Range Data
SIGGRAPH 2000 Course on 3D Photography Shape and Appearance from Images and Range Data Brian Curless University of Washington Overview Range images vs. point clouds Registration Reconstruction from point
More informationRigid ICP registration with Kinect
Rigid ICP registration with Kinect Students: Yoni Choukroun, Elie Semmel Advisor: Yonathan Aflalo 1 Overview.p.3 Development of the project..p.3 Papers p.4 Project algorithm..p.6 Result of the whole body.p.7
More informationImpact Crater Detection on Mars Digital Elevation and Image Model
Impact Crater Detection on Mars Digital Elevation and Image Model Mert Değirmenci Department of Computer Engineering, Middle East Technical University, Turkey mert.degirmenci@ceng.metu.edu.tr Shatlyk Ashyralyyev
More informationShape fitting and non convex data analysis
Shape fitting and non convex data analysis Petra Surynková, Zbyněk Šír Faculty of Mathematics and Physics, Charles University in Prague Sokolovská 83, 186 7 Praha 8, Czech Republic email: petra.surynkova@mff.cuni.cz,
More informationAll images are degraded
Lecture 7 Image Relaxation: Restoration and Feature Extraction ch. 6 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
More informationImage Features: Local Descriptors. Sanja Fidler CSC420: Intro to Image Understanding 1/ 58
Image Features: Local Descriptors Sanja Fidler CSC420: Intro to Image Understanding 1/ 58 [Source: K. Grauman] Sanja Fidler CSC420: Intro to Image Understanding 2/ 58 Local Features Detection: Identify
More informationDEVELOPMENT OF POSITION MEASUREMENT SYSTEM FOR CONSTRUCTION PILE USING LASER RANGE FINDER
S17- DEVELOPMENT OF POSITION MEASUREMENT SYSTEM FOR CONSTRUCTION PILE USING LASER RANGE FINDER Fumihiro Inoue 1 *, Takeshi Sasaki, Xiangqi Huang 3, and Hideki Hashimoto 4 1 Technica Research Institute,
More informationV.Petridis, S. Kazarlis and A. Papaikonomou
Proceedings of IJCNN 93, p.p. 276-279, Oct. 993, Nagoya, Japan. A GENETIC ALGORITHM FOR TRAINING RECURRENT NEURAL NETWORKS V.Petridis, S. Kazarlis and A. Papaikonomou Dept. of Electrical Eng. Faculty of
More informationNonrigid Surface Modelling. and Fast Recovery. Department of Computer Science and Engineering. Committee: Prof. Leo J. Jia and Prof. K. H.
Nonrigid Surface Modelling and Fast Recovery Zhu Jianke Supervisor: Prof. Michael R. Lyu Committee: Prof. Leo J. Jia and Prof. K. H. Wong Department of Computer Science and Engineering May 11, 2007 1 2
More informationA Survey of Light Source Detection Methods
A Survey of Light Source Detection Methods Nathan Funk University of Alberta Mini-Project for CMPUT 603 November 30, 2003 Abstract This paper provides an overview of the most prominent techniques for light
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 informationSurface Registration from Range Image Fusion
Surface Registration from Range Image Fusion Carles Matabosch, Joaquim Salvi, Xavier Pinsach and Rafael Garcia Institut d informàtica i Aplicacions Universitat de Girona 17071 Girona, Spain Email: (cmatabos,qsalvi,xpinsach,rafa)@eia.udg.es
More informationPerformance Characterization in Computer Vision
Performance Characterization in Computer Vision Robert M. Haralick University of Washington Seattle WA 98195 Abstract Computer vision algorithms axe composed of different sub-algorithms often applied in
More informationColoring 3-Colorable Graphs
Coloring -Colorable Graphs Charles Jin April, 015 1 Introduction Graph coloring in general is an etremely easy-to-understand yet powerful tool. It has wide-ranging applications from register allocation
More informationLandmark Detection on 3D Face Scans by Facial Model Registration
Landmark Detection on 3D Face Scans by Facial Model Registration Tristan Whitmarsh 1, Remco C. Veltkamp 2, Michela Spagnuolo 1 Simone Marini 1, Frank ter Haar 2 1 IMATI-CNR, Genoa, Italy 2 Dept. Computer
More informationLATEST TRENDS on APPLIED MATHEMATICS, SIMULATION, MODELLING
3D surface reconstruction of objects by using stereoscopic viewing Baki Koyuncu, Kurtuluş Küllü bkoyuncu@ankara.edu.tr kkullu@eng.ankara.edu.tr Computer Engineering Department, Ankara University, Ankara,
More information1 Lab + Hwk 5: Particle Swarm Optimization
1 Lab + Hwk 5: Particle Swarm Optimization This laboratory requires the following equipment: C programming tools (gcc, make), already installed in GR B001 Webots simulation software Webots User Guide Webots
More informationHomework 4: Clustering, Recommenders, Dim. Reduction, ML and Graph Mining (due November 19 th, 2014, 2:30pm, in class hard-copy please)
Virginia Tech. Computer Science CS 5614 (Big) Data Management Systems Fall 2014, Prakash Homework 4: Clustering, Recommenders, Dim. Reduction, ML and Graph Mining (due November 19 th, 2014, 2:30pm, in
More informationA NEW FEATURE BASED IMAGE REGISTRATION ALGORITHM INTRODUCTION
A NEW FEATURE BASED IMAGE REGISTRATION ALGORITHM Karthik Krish Stuart Heinrich Wesley E. Snyder Halil Cakir Siamak Khorram North Carolina State University Raleigh, 27695 kkrish@ncsu.edu sbheinri@ncsu.edu
More informationLecture 4. Convexity Robust cost functions Optimizing non-convex functions. 3B1B Optimization Michaelmas 2017 A. Zisserman
Lecture 4 3B1B Optimization Michaelmas 2017 A. Zisserman Convexity Robust cost functions Optimizing non-convex functions grid search branch and bound simulated annealing evolutionary optimization The Optimization
More informationUsing Augmented Measurements to Improve the Convergence of ICP. Jacopo Serafin and Giorgio Grisetti
Jacopo Serafin and Giorgio Grisetti Point Cloud Registration We want to find the rotation and the translation that maximize the overlap between two point clouds Page 2 Point Cloud Registration We want
More informationAlgorithms for 3D Isometric Shape Correspondence
Algorithms for 3D Isometric Shape Correspondence Yusuf Sahillioğlu Computer Eng. Dept., Koç University, Istanbul, Turkey (PhD) Computer Eng. Dept., METU, Ankara, Turkey (Asst. Prof.) 2 / 53 Problem Definition
More informationThe Detection of Faces in Color Images: EE368 Project Report
The Detection of Faces in Color Images: EE368 Project Report Angela Chau, Ezinne Oji, Jeff Walters Dept. of Electrical Engineering Stanford University Stanford, CA 9435 angichau,ezinne,jwalt@stanford.edu
More informationLearning-based Neuroimage Registration
Learning-based Neuroimage Registration Leonid Teverovskiy and Yanxi Liu 1 October 2004 CMU-CALD-04-108, CMU-RI-TR-04-59 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Abstract
More informationMachine Learning. Topic 5: Linear Discriminants. Bryan Pardo, EECS 349 Machine Learning, 2013
Machine Learning Topic 5: Linear Discriminants Bryan Pardo, EECS 349 Machine Learning, 2013 Thanks to Mark Cartwright for his extensive contributions to these slides Thanks to Alpaydin, Bishop, and Duda/Hart/Stork
More informationScanning Real World Objects without Worries 3D Reconstruction
Scanning Real World Objects without Worries 3D Reconstruction 1. Overview Feng Li 308262 Kuan Tian 308263 This document is written for the 3D reconstruction part in the course Scanning real world objects
More informationSTRUCTURAL ICP ALGORITHM FOR POSE ESTIMATION BASED ON LOCAL FEATURES
STRUCTURAL ICP ALGORITHM FOR POSE ESTIMATION BASED ON LOCAL FEATURES Marco A. Chavarria, Gerald Sommer Cognitive Systems Group. Christian-Albrechts-University of Kiel, D-2498 Kiel, Germany {mc,gs}@ks.informatik.uni-kiel.de
More informationAn Approach for Reduction of Rain Streaks from a Single Image
An Approach for Reduction of Rain Streaks from a Single Image Vijayakumar Majjagi 1, Netravati U M 2 1 4 th Semester, M. Tech, Digital Electronics, Department of Electronics and Communication G M Institute
More informationUncertainties: Representation and Propagation & Line Extraction from Range data
41 Uncertainties: Representation and Propagation & Line Extraction from Range data 42 Uncertainty Representation Section 4.1.3 of the book Sensing in the real world is always uncertain How can uncertainty
More informationToward Part-based Document Image Decoding
2012 10th IAPR International Workshop on Document Analysis Systems Toward Part-based Document Image Decoding Wang Song, Seiichi Uchida Kyushu University, Fukuoka, Japan wangsong@human.ait.kyushu-u.ac.jp,
More information3D Perception. CS 4495 Computer Vision K. Hawkins. CS 4495 Computer Vision. 3D Perception. Kelsey Hawkins Robotics
CS 4495 Computer Vision Kelsey Hawkins Robotics Motivation What do animals, people, and robots want to do with vision? Detect and recognize objects/landmarks Find location of objects with respect to themselves
More informationA Genetic Algorithm for Minimum Tetrahedralization of a Convex Polyhedron
A Genetic Algorithm for Minimum Tetrahedralization of a Convex Polyhedron Kiat-Choong Chen Ian Hsieh Cao An Wang Abstract A minimum tetrahedralization of a convex polyhedron is a partition of the convex
More informationShape Descriptor using Polar Plot for Shape Recognition.
Shape Descriptor using Polar Plot for Shape Recognition. Brijesh Pillai ECE Graduate Student, Clemson University bpillai@clemson.edu Abstract : This paper presents my work on computing shape models that
More informationImage Comparison on the Base of a Combinatorial Matching Algorithm
Image Comparison on the Base of a Combinatorial Matching Algorithm Benjamin Drayer Department of Computer Science, University of Freiburg Abstract. In this paper we compare images based on the constellation
More informationHOUGH TRANSFORM CS 6350 C V
HOUGH TRANSFORM CS 6350 C V HOUGH TRANSFORM The problem: Given a set of points in 2-D, find if a sub-set of these points, fall on a LINE. Hough Transform One powerful global method for detecting edges
More informationTriangular Mesh Segmentation Based On Surface Normal
ACCV2002: The 5th Asian Conference on Computer Vision, 23--25 January 2002, Melbourne, Australia. Triangular Mesh Segmentation Based On Surface Normal Dong Hwan Kim School of Electrical Eng. Seoul Nat
More informationGENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM
Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain
More informationCHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM
20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:
More informationISSN: [Keswani* et al., 7(1): January, 2018] Impact Factor: 4.116
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY AUTOMATIC TEST CASE GENERATION FOR PERFORMANCE ENHANCEMENT OF SOFTWARE THROUGH GENETIC ALGORITHM AND RANDOM TESTING Bright Keswani,
More informationRandom Search Report An objective look at random search performance for 4 problem sets
Random Search Report An objective look at random search performance for 4 problem sets Dudon Wai Georgia Institute of Technology CS 7641: Machine Learning Atlanta, GA dwai3@gatech.edu Abstract: This report
More informationGrasp Recognition using a 3D Articulated Model and Infrared Images
Grasp Recognition using a 3D Articulated Model and Infrared Images Koichi Ogawara Institute of Industrial Science, Univ. of Tokyo, Tokyo, Japan Jun Takamatsu Institute of Industrial Science, Univ. of Tokyo,
More informationA motivated definition of exploitation and exploration
A motivated definition of exploitation and exploration Bart Naudts and Adriaan Schippers Technical report 02-99 at the University of Antwerp, Belgium. 1 INTRODUCTION The terms exploration and exploitation
More informationMAXIMUM LIKELIHOOD ESTIMATION USING ACCELERATED GENETIC ALGORITHMS
In: Journal of Applied Statistical Science Volume 18, Number 3, pp. 1 7 ISSN: 1067-5817 c 2011 Nova Science Publishers, Inc. MAXIMUM LIKELIHOOD ESTIMATION USING ACCELERATED GENETIC ALGORITHMS Füsun Akman
More information