Arbitrary shape detection by genetic algorithms.

Wang Tong.Thesis submitted in: June 2004.Thesis (M.Phil.)--Chinese University of Hong Kong, 2005.Includes bibliographical references (leaves 64-69).Abstracts in English and Chinese.ABSTRACT --- p.I摘要 --- p.IVACKNOWLEDGMENTS --- p.VITABLE OF CONTENTS --- p.VIIILIST OF FIGURES --- p.XIIVChapter CHAPTER 1 --- INTRODUCTION --- p.1Chapter 1.1 --- Hough Transform --- p.2Chapter 1.2 --- Template Matching --- p.3Chapter 1.3 --- Genetic Algorithms --- p.4Chapter 1.4 --- Outline of the Thesis --- p.6Chapter CHAPTER 2 --- HOUGH TRANSFORM AND ITS COMMON VARIANTS --- p.7Chapter 2.1 --- Hough Transform --- p.7Chapter 2.1.1 --- What is Hough Transform --- p.7Chapter 2.1.2 --- Parameter Space --- p.7Chapter 2.1.3 --- Accumulator Array --- p.9Chapter 2.2 --- Gradient-based Hough Transform --- p.10Chapter 2.2.1 --- Direction of Gradient --- p.11Chapter 2.2.2 --- Accumulator Array --- p.14Chapter 2.2.3 --- Peaks in the accumulator array --- p.16Chapter 2.2.4 --- Performance of Gradient-based Hough Transform --- p.18Chapter 2.3 --- Generalized Hough Transform (GHT) --- p.19Chapter 2.3.1 --- What Is GHT --- p.19Chapter 2.3.2 --- R-table of GHT --- p.20Chapter 2.3.3 --- GHT Procedure --- p.21Chapter 2.3.4 --- Analysis --- p.24Chapter 2.4 --- Edge Detection --- p.25Chapter 2.4.1 --- Gradient-Based Method --- p.25Chapter 2.4.2 --- Laplacian of Gaussian --- p.29Chapter 2.4.3 --- Canny edge detection --- p.30Chapter CHAPTER 3 --- PROBABILISTIC MODELS --- p.33Chapter 3.1 --- Randomized Hough Transform (RHT) --- p.33Chapter 3.1.1 --- Basics of the RHT --- p.33Chapter 3.1.2 --- RHT algorithm --- p.34Chapter 3.1.3 --- Advantage of RHT --- p.37Chapter 3.2 --- Genetic Model --- p.37Chapter 3.2.1 --- Genetic algorithm mechanism --- p.38Chapter 3.2.2 --- A Genetic Algorithm for Primitive Extraction --- p.39Chapter CHAPTER 4 --- PROPOSED ARBITRARY SHAPE DETECTION --- p.42Chapter 4.1 --- Randomized Generalized Hough Transform --- p.42Chapter 4.1.1 --- R-table properties and the general notion of a shape --- p.42Chapter 4.1.2 --- Using pairs of edges --- p.44Chapter 4.1.3 --- Extend to Arbitrary shapes --- p.46Chapter 4.2 --- A Genetic algorithm with the Hausdorff distance --- p.47Chapter 4.2.1 --- Hausdorff distance --- p.47Chapter 4.2.2 --- Chromosome strings --- p.48Chapter 4.2.3 --- Discussion --- p.51Chapter CHAPTER 5 --- EXPERIMENTAL RESULTS AND COMPARISONS --- p.52Chapter 5.1 --- Primitive extraction --- p.53Chapter 5.2 --- Arbitrary Shape Detection --- p.54Chapter 5.3 --- Summary of the Experimental Results --- p.60Chapter CHAPTER 6 --- CONCLUSIONS --- p.62Chapter 6.1 --- Summary --- p.62Chapter 6.2 --- Future work --- p.63BIBLIOGRAPHY --- p.6

An effective trajectory-based algorithm for ball detection and tracking with application to the analysis of broadcast sports video

Ph.DDOCTOR OF PHILOSOPH

Robust approach to object recognition through fuzzy clustering and hough transform based methods

Object detection from two dimensional intensity images as well as three dimensional range images is considered. The emphasis is on the robust detection of shapes such as cylinders, spheres, cones, and planar surfaces, typically found in mechanical and manufacturing engineering applications. Based on the analyses of different HT methods, a novel method, called the Fast Randomized Hough Transform (FRHT) is proposed. The key idea of FRHT is to divide the original image into multiple regions and apply random sampling method to map data points in the image space into the parameter space or feature space, then obtain the parameters of true clusters. This results in the following characteristics, which are highly desirable in any method: high computation speed, low memory requirement, high result resolution and infinite parameter space. This project also considers use of fuzzy clustering techniques, such as Fuzzy C Quadric Shells (FCQS) clustering algorithm but combines the concept of noise prototype to form the Noise FCQS clustering algorithm that is robust against noise. Then a novel integrated clustering algorithm combining the advantages of FRHT and NFCQS methods is proposed. It is shown to be a robust clustering algorithm having the distinct advantages such as: the number of clusters need not be known in advance, the results are initialization independent, the detection accuracy is greatly improved, and the computation speed is very fast. Recent concepts from robust statistics, such as least trimmed squares estimation (LTS), minimum volume ellipsoid estimator (MVE) and the generalized MVE are also utilized to form a new robust algorithm called the generalized LTS for Quadric Surfaces (GLTS-QS) algorithm is developed. The experimental results indicate that the clustering method combining the FRHT and the GLTS-QS can improve clustering performance. Moreover, a new cluster validity method for circular clusters is proposed by considering the distribution of the points on the circular edge. Different methods for the computation of distance of a point from a cluster boundary, a common issue in all the range image clustering algorithms, are also discussed. The performance of all these algorithms is tested using various real and synthetic range and intensity images. The application of the robust clustering methods to the experimental granular flow research is also included

Implementation of a real time Hough transform using FPGA technology

This thesis is concerned with the modelling, design and implementation of efficient architectures for performing the Hough Transform (HT) on mega-pixel resolution real-time images using Field Programmable Gate Array (FPGA) technology. Although the HT has been around for many years and a number of algorithms have been developed it still remains a significant bottleneck in many image processing applications. Even though, the basic idea of the HT is to locate curves in an image that can be parameterized: e.g. straight lines, polynomials or circles, in a suitable parameter space, the research presented in this thesis will focus only on location of straight lines on binary images. The HT algorithm uses an accumulator array (accumulator bins) to detect the existence of a straight line on an image. As the image needs to be binarized, a novel generic synchronization circuit for windowing operations was designed to perform edge detection. An edge detection method of special interest, the canny method, is used and the design and implementation of it in hardware is achieved in this thesis. As each image pixel can be implemented independently, parallel processing can be performed. However, the main disadvantage of the HT is the large storage and computational requirements. This thesis presents new and state-of-the-art hardware implementations for the minimization of the computational cost, using the Hybrid-Logarithmic Number System (Hybrid-LNS) for calculating the HT for fixed bit-width architectures. It is shown that using the Hybrid-LNS the computational cost is minimized, while the precision of the HT algorithm is maintained. Advances in FPGA technology now make it possible to implement functions as the HT in reconfigurable fabrics. Methods for storing large arrays on FPGA’s are presented, where data from a 1024 x 1024 pixel camera at a rate of up to 25 frames per second are processed

Concepts, Design and Implementation of the ATLAS New Tracking (NEWT)

The track reconstruction of modern high energy physics experiments is a very complex task that puts stringent requirements onto the software realisation. The ATLAS track reconstruction software has been in the past dominated by a collection of individual packages, each of which incorporating a different intrinsic event data model, different data flow sequences and calibration data. Invoked by the Final Report of the Reconstruction Task Force, the ATLAS track reconstruction has undergone a major design revolution to ensure maintainability during the long lifetime of the ATLAS experiment and the flexibility needed for the startup phase. The entire software chain has been re-organised in modular components and a common Event Data Model has been deployed during the last three years. A complete new track reconstruction that concentrates on common tools aimed to be used by both ATLAS tracking devices, the Inner Detector and the Muon System, has been established. It has been already used during many large scale tests with data from Monte Carlo simulation and from detector commissioning projects such as the combined test beam 2004 and cosmic ray events. This document concentrates on the technical and conceptual details of the newly developed track reconstruction, also known as New Tracking

Research on a modifeied RANSAC and its applications to ellipse detection from a static image and motion detection from active stereo video sequences

制度:新 ; 報告番号:甲3091号 ; 学位の種類:博士(国際情報通信学) ; 授与年月日:2010/2/24 ; 早大学位記番号:新535

Pattern Recognition, Tracking and Vertex Reconstruction in Particle Detectors

The book describes methods of track and vertex resonstruction in particle detectors. The main topics are pattern recognition and statistical estimation of geometrical and physical properties of charged particles and of interaction and decay vertices