scispace - formally typeset
Search or ask a question

Showing papers on "Corner detection published in 1996"


Journal ArticleDOI
TL;DR: The corner detection scheme introduced in this paper can provide accurate information about the corners and accurately locate the templates in relation to the eye images and greatly reduce the processing time for the templates.

345 citations


Proceedings ArticleDOI
25 Aug 1996
TL;DR: A real-time wide-baseline stereo person tracking system which can self-calibrate itself from watching a moving person and can subsequently track people's head and hands with RIMS errors of 1-2 cm in translation and 2 degrees in rotation.
Abstract: We describe a method for estimation of 3D geometry from 2D blob features. Blob features are clusters of similar pixels in the image plane and can arise from similarity of color, texture, motion and other signal-based metrics. The motivation for considering such features comes from recent successes in real-time extraction and tracking of such blob features in complex cluttered scenes in which traditional feature finders fail, e.g. scenes containing moving people. We use nonlinear modeling and a combination of iterative and recursive estimation methods to recover 3D geometry from blob correspondences across multiple images. The 3D geometry includes the 3D shapes, translations, and orientations of blobs and the relative orientation of the cameras. Using this technique, we have developed a real-time wide-baseline stereo person tracking system which can self-calibrate itself from watching a moving person and can subsequently track people's head and hands with RIMS errors of 1-2 cm in translation and 2 degrees in rotation. The blob formulation is efficient and reliable, running at 20-30 Hz on a pair of SGI Indy R4400 workstations with no special hardware.

180 citations


Journal ArticleDOI
TL;DR: This paper presents an approach to feature detection based on a scale-interaction model that is responsive to short lines, line endings, corners and other such sharp changes in curvature.

153 citations


Journal ArticleDOI
TL;DR: The method makes use of a real-time implementation of a corner detector and tracker and reconstructs the image position of the desired fixation point from a cluster of corners detected on the object using the affine structure available from two or three views.
Abstract: We describe a novel method of obtaining a fixation point on a moving object for a real-time gaze control system. The method makes use of a real-time implementation of a corner detector and tracker and reconstructs the image position of the desired fixation point from a cluster of corners detected on the object using the affine structure available from two or three views. The method is fast, reliable, viewpoint invariant, and insensitive to occlusion and/or individual corner dropout or reappearance. We compare two- and three-dimensional forms of the algorithm, present results for the method in use with a high performance head/eye platform, and compare the results with two naive fixation methods.

117 citations


Journal ArticleDOI
TL;DR: This work proposes a corner detector based on the 2-D Hilbert transform, which can be numerically evaluated by a separable 1-D digital filter and a peak detector to localise the extrema in the filter output.

57 citations


Journal ArticleDOI
TL;DR: Application of the propsed method on the examples given in the literature shows that it is both minimal in computation time and accurate and stable in the detected position of corners.

54 citations


Proceedings Article
01 Jan 1996
TL;DR: A method is developed to improve the edge image by suppressing unwanted detail of a car image and increases the Edge Density Discrimination in a car number plate location and reduces the initial false detection rate to optimize the detection performance.
Abstract: In an automatic car number plate reading system, edge density can be used to successfully detect a number plate location for character recognition process due to the characteristics of the number plate. However the initial false detection rate will be increased along with the noise presented in a car image. A method is developed to improve the edge image by suppressing unwanted detail of a car image. It increases the Edge Density Discrimination in a car number plate location and reduces the initial false detection rate to optimize the detection performance.

32 citations


Journal ArticleDOI
Kil-jae Lee1, Zeungnam Bien1
TL;DR: A real-time gray-level corner detection problem is formulated as a pattern classification problem to determine whether a pixel belongs to the class of corners or not and the probability density function is estimated by means of fuzzy logic.

25 citations


Proceedings ArticleDOI
25 Aug 1996
TL;DR: The corner detection scheme introduced in this paper can provide accurate information about the corners and the execution time required for the whole procedure to extract the eye features is less than one second on a Sun workstation.
Abstract: In this paper, the head boundary is first located in a head-and-shoulders image. The approximate positions of the eyes are estimated by means of average anthropometric measures. Corners, the salient features of the eyes, are detected. The corner detection scheme introduced in this paper can provide accurate information about the corners. The shape of the eye is then extracted by a new scheme, based on snakes and on the deformable template. This new representation is in a form similar to snakes, but the energy functional to be minimised is based on some new energy terms and those terms used by the deformable template. A fast algorithm based on the greedy algorithm for active contour modelling is presented for the optimisation step. Experiments show that the execution time required for the whole procedure to extract the eye features is less than one second on a Sun workstation.

24 citations


01 Jan 1996
TL;DR: This thesis develops the 2D local energy feature detector based on a new, uni ed de nition of 2D image features that marks points of locally maximum 2D order in the phase domain representation of the image as 2Dimage features.
Abstract: Accurate detection and localization of two-dimensional (2D) image features (or `keypoints') is important for vision tasks such as structure from motion, stereo matching, and line labeling. 2D image features are ideal for these vision tasks because 2D image features are high in information and yet they occur sparsely in typical images. Several methods for the detection of 2D image features have already been developed. However, it is di cult to assess the performance of these methods because no one has produced an adequate de nition of corners that encompasses all types of 2D luminance variations that make up 2D image features. The fact that there does not exist a consensus on the de nition of 2D image features is not surprising given the confusion surrounding the de nition of 1D image features. The general perception of 1D image features has been that they correspond to `edges' in an image and so are points where the intensity gradient in some direction is a local maximum. The Sobel [68], Canny [7] and Marr-Hildreth [37] operators all use this model of 1D features, either implicitly or explicitly. However, other pro les in an image also make up valid 1D features, such as spike and roof pro les, as well as combinations of all these feature types. Spikes and roof pro les can also be found by looking for points where the rate of change of the intensity gradient is locally maximal, as Canny did in de ning a `roof-detector' in much the same manner that he developed his `edge-detector'. While this allows the detection of a wider variety of 1D features pro les, it comes no closer to the goal of unifying these di erent feature types to an encompassing de nition of 1D features. The introduction of the local energy model of image features by Morrone and Owens [45] in 1987 provided a uni ed de nition of 1D image features for the rst iii time. They postulated that image features correspond to points in an image where there is maximal phase congruency in the frequency domain representation of the image. That is, image features correspond to points of maximal order in the phase domain of the image signal. These points of maximal phase congruency correspond to step-edge, roof, and ramp intensity pro les, and combinations thereof. They also correspond to the Mach bands perceived by humans in trapezoidal feature pro les. This thesis extends the notion of phase congruency to 2D image features. As 1D image features correspond to points of maximal 1D order in the phase domain of the image signal, this thesis contends that 2D image features correspond to maximal 2D order in this domain. These points of maximal 2D phase congruency include all the di erent types of 2D image features, including grey-level corners, line terminations, blobs, and a variety of junctions. Early attempts at 2D feature detection were simple `corner detectors' based on a model of a grey-level corner in much the same way that early 1D feature detectors were based on a model of step-edges. Some recent attempts have included more complex models of 2D features, although this is basically a more complex a priori judgement of the types of luminance pro les that are to be labeled as 2D features. This thesis develops the 2D local energy feature detector based on a new, uni ed de nition of 2D image features that marks points of locally maximum 2D order in the phase domain representation of the image as 2D image features. The performance of an implementation of 2D local energy is assessed, and compared to several existing methods of 2D feature detection. This thesis also shows that in contrast to most other methods of 2D feature detection, 2D local energy is an idempotent operator. The extension of phase congruency to 2D image features also uni es the detection of image features. 1D and 2D image features correspond to 1D and 2D order in the phase domain representation of the image respectively. This de nition imposes a hierarchy of image features, with 2D image features being a subset of 1D image features. This ordering of image features has been implied ever since 1D features were used as candidate points for 2D feature detection by Kitchen [28] and others. Local energy enables the extraction of both 1D and 2D image features in a consistent manner; 2D image features are extracted from the 1D image features using the same iv operations that are used to extract 1D image features from the input image. The consistent approach to the detection of image features presented in this thesis allows the hierarchy of primitive image features to be naturally extended to higher order image features. These higher order image features can then also be extracted from higher order image data using the same hierarchical approach. This thesis shows how local energy can be naturally extended to the detection of 1D (surface) and higher order image features in 3D data sets. Results are presented for the detection of 1D image features in 3D confocal microscope images, showing superior performance to the 3D extension of the Sobel operator [74]. v Preface Some of the work in this thesis has already been published. Most of the work in Chapters 4 to 6 appears in a technical report in the Department of Computer Science [58], and a more concise version of this work is to appear in Image and Vision Computing [59]. I am the principal contributing author for both these papers. With the exception of the 3D surface detector described in Section 7.1, all of the work presented in this thesis|including algorithms and implementations|is my own. The surface detection work has been principally performed by Chris Pudney, with my contribution being to the general methodology of implementation and the optimizations with regard to performing the FFTs and applying the energy lters. Various forms of this work have been published in the Proceedings of ANZIIS'95 [53] and Proceedings of the International Computer Science Conference [54] with another paper on this work to appear in the Journal of Assisted Confocal Microscopy. vi Acknowledgements First of all I would like to thank my supervisor Robyn Owens for her constant support and guidance throughout my candidature. She ensured that I got o on the right foot and always knew where I was, and where I was going even when I didn't, particularly at the beginning of my studies. It was always reassuring to know that she would quickly understand any problems I was grappling with and o er helpful suggestions, although the speed she did this and its apparent ease to her were a little disconcerting. Robyn also strongly encouraged me to apply to travel to Switzerland to study at ETH Z urich which was both very bene cial to my studies and a fantastic time. I would like to thank UWA and ETH Z urich for supporting my stay in Switzerland. Thanks go to everyone in the Image Sciences (BIWI) group at ETH for making my stay educational and enjoyable. Olaf, Vreni, Martin, Markus and the lunch crew, Gaudenz, Friedrich, Wolfram, Tuomo, Olof, and Marjan made for an entertaining time. Extra special thanks go to the K ublers for making me feel like part of the family during my stay in Switzerland; Olaf and Guni for showing me the beautiful Swiss countryside while unsuccessfully trying to give me wanderschaden, Dani for risking the meat with an Aussie at his birthday party BBQ, and Flo for being such a great mate, for losing the Kiwi accent (eh?), and for nally getting his revenge for numerous dumpings at Triggs Beach by taking me snowboarding on a hard-as-rock glacier. I would also like to thank the non-resident member of the K ubler household, Gaudie, for his friendship and for introducing me to the outdoor cinema, and Roman for all the basketball. I have bene ted from many conversations with Mike Robbins, Peter Kovesi and vii Chris Pudney regarding local energy. Bruce Backman was a good sounding board for ideas and always provided a di erent perspective. Friedrich Heitger was very helpful with e-mail messages when I was trying to implement his work, and while I was at ETH taught me much of what I know about lter design. Olof Henricsson and I also had many interesting discussions regarding the use of low-level features after our weekly hit of tennis. Lachlan Partington and Chris Pudney provided valuable feedback through their careful reading of a late draft of this thesis. I also thank Chris for supplying both the output for Figure 4 and numerous tips on LATEX. I would like to thank the Department of Computer Science at The University of Western Australia and the Department of Education, Employment and Training for their support during this candidature. Thanks go to my family for their support of my studies, especially my parents who put me through school and then put up with me at home for most of my tertiary studies. I am forever endebted to mywife Karenza for her love and support throughout my studies and to her I give special thanks. viii

19 citations


Proceedings ArticleDOI
18 Jun 1996
TL;DR: This work introduces an effective technique for removing unwanted anisotropies from analytical gradient estimates, by measuring local intensity gradients in four directions rather than the more traditional two.
Abstract: The vast majority of corner and edge detectors measure image intensity gradients in order to estimate the positions and strengths of features. However, many of the most popular intensity gradient estimators are inherently and significantly anisotropic. In spite of this, few algorithms take the anisotropy into account, and so the set of features uncovered is typically sensitive to rotations of the image, compromising recognition, matching (e.g. stereo), and tracking. We introduce an effective technique for removing unwanted anisotropies from analytical gradient estimates, by measuring local intensity gradients in four directions rather than the more traditional two. In experiments using real image data, our algorithm reduces the gradient anisotropy associated with conventional analytical gradient estimates by up to 85%, yielding more consistent feature topologies.

Proceedings ArticleDOI
14 Oct 1996
TL;DR: A fast and effective edge-corner detection method, named the cellular vectorization method (CVM), which is particularly effective in hand line drawings containing imperfections, and is both a time-saving and versatile method for image detection based on edges and corners data.
Abstract: The locations of junctions, parallelism of lines and inclined angles of lines are difficult to be ascertained but essential in the geometrical transformation into objects from images. A fast and effective edge-corner detection method, named the cellular vectorization method (CVM), is proposed. This method is particularly effective in hand line drawings containing imperfections, such as unattached edges, misaligned junctions, overshoot junctions, and roughly parallel lines. All such defects can be detected and corrected. When in use, the CVM interprets hand line drawings directly and does away with filtering and thinning processes. Thus, the CVM is both a time-saving and versatile method for image detection based on edges and corners data. Experimental results are given to show the correctness and effectiveness of the proposed method.

Proceedings ArticleDOI
07 May 1996
TL;DR: Wavelets matched to features in an image can be used to detect and/or classify objects and are shown to be shift and scale insensitive and rotation insensitive to the number of discrete angles used for the projections.
Abstract: Wavelets matched to features in an image can be used to detect and/or classify objects. In this paper, image object features are generated by projecting the object at a finite number of angles. Wavelets matched to the projected object features in a training image are used to detect similar objects in test images. The detection is shown to be shift and scale insensitive and rotation insensitive to the number of discrete angles used for the projections.

Patent
20 Aug 1996
TL;DR: In this paper, a frame line recognition device was proposed to obtain a frameline recognition device of high reliability even when the frame line is thin or when a form is inclined concerning preprocessing device recognizing the frame lines in the form so as to segment an area where a character exists in the automatic recognition of the character entered in a picture including the frameline and characters such as a form.
Abstract: PURPOSE: To obtain a frame line recognition device of high reliability even when the frame line is thin or when a form is inclined concerning preprocessing device recognizing the frame line in the form so as to segment an area where a character exists in the automatic recognition of the character entered in a picture including the frame line and characters such as a form. CONSTITUTION: A corner detection means 102 extracts the corner feature point of the form frame line from a form picture binarized by an image scanner 101 binarizes and a constitution element extraction means 103 extracts the constitution element of the closing line (of letters T, +, L, etc.) from an attending corner and its peripheral corner feature points, a minimum rectangle recognition means 104 recognizes a minimum rectangle from the connection of the constitution element to output rectangle information, and a structure recognition means 105 generates the tree structure of a rectangle to connect and recognizes the structure of the frame line based on this tree structure to inform a character segmentation means 106 segmenting a character area of the structure.

Journal ArticleDOI
TL;DR: The high-precision inspection and alignment algorithms of surface mounting devices (SMDs) using fuzzy morphology give accurate parameters, and they can be applied to fast and accurate automatic surface mounting systems.
Abstract: The high-precision inspection and alignment algorithms of surface mounting devices (SMDs) using fuzzy morphology are proposed. After camera calibration is performed, the proposed inspection algorithm detects SMD lead defects such as bending and breaking using the ruler generated by fuzzy morphology. The SMD having no defects is tested to determine whether or not it is mounted correctly in the specified position. The proposed alignment algorithm accurately computes orientation and position using subpixel interpolation. It consists of two parts: the preprocessing and main processing parts, in which corner points and coarse orientation of an SMD are detected and interpolation is used to obtain final parameters with subpixel accuracy. The computer simulation with several sets of test images shows that the proposed algorithms give accurate parameters, and they can be applied to fast and accurate automatic surface mounting systems.