Filters








827 Hits in 6.2 sec

On the uniqueness of the representation of a convex polygon by its Hough transform

Dimitrios Ioannou, Edward T. Dugan, Andrew F. Laine
1996 Pattern Recognition Letters  
In this paper we prove the uniqueness of the representation of a convex n-gon (bounded or unbounded for n >/5, bounded for n >/3) by the peaks of its Hough Transform.  ...  Any bounded convex polygon is uniquely determined by the peaks of its Hough Transform. Proof. Obviously the n sides of the n-gon give n peaks in the Hough space (n straight lines).  ...  We also showed that a convex polygon with more than five sides is uniquely determined by the peaks it gives in the Hough space.  ... 
doi:10.1016/0167-8655(96)00098-0 fatcat:qfazgmdt5naf5hl65ciudofnr4

DOCUMENT IMAGE REGISTRATION FOR IMPOSED LAYER EXTRACTION

Surabhi Narayan, Sahana D Gowda
2017 ICTACT Journal on Image and Video Processing  
A convex polygon is constructed around the content of the input and the template image using convex hull.  ...  Each vertex of the input convex polygon is subjected to transformation for the permutable combinations of rotation and scaling. Translation is handled by tight crop.  ...  ACKNOWLEDGEMENT The authors acknowledge the support provided by VTU.  ... 
doi:10.21917/ijivp.2017.0205 fatcat:p5ns7tedc5egjf2k2ks7zsehxy

Page 3385 of Mathematical Reviews Vol. , Issue 91F [page]

1991 Mathematical Reviews  
In general, it is known that to determine whether a set of line segments admits a simple circuit is NP-complete.  ...  Because the Hough transform is a particular case of the discrete Radon transform, all of the algorithms are presented for computing the Radon transform of gray-level images.” 91f:68210 68U10 60G60 Hall  ... 

Extended Standard Hough Transform for analytical line recognition

Abdoulaye Sere, Oumarou Sie, Eric Andres
2012 2012 6th International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT)  
This paper presents a new method which extends the Standard Hough Transform for the recognition of naive or standard line in a noisy picture.  ...  The proposed idea conserves the power of the Standard Hough Transform particularly a limited size of the parameter space and the recognition of vertical lines.  ...  Standard Hough Transform Theorem 1 : 1 The dual of a segment is an area limited by the dual of its extremities Proof: Let us prove that.  ... 
doi:10.1109/setit.2012.6481950 fatcat:o4472dorgzde7abywgclhvkhf4

Extended Standard Hough Transform for Analytical Line Recognition

Abdoulaye SERE, Oumarou SIE, Eric ANDRES
2013 International Journal of Advanced Computer Science and Applications  
This paper presents a new method which extends the Standard Hough Transform for the recognition of naive or standard line in a noisy picture.  ...  The proposed idea conserves the power of the Standard Hough Transform particularly a limited size of the parameter space and the recognition of vertical lines.  ...  Standard Hough Transform Theorem 1 : 1 The dual of a segment is an area limited by the dual of its extremities Proof: Let us prove that.  ... 
doi:10.14569/ijacsa.2013.040339 fatcat:yf2upu5qfrh7jflgixa5zsh2nu

A parallel algorithm for determining two-dimensional object positions using incomplete information about their boundaries

Amir A. Amini, Terry E. Weymouth, David J. Anderson
1989 Pattern Recognition  
Each edge streak votes for a single hypothesis; it may also take part in the formation of other hypotheses. A poll of the votes determined the stronger hypotheses.  ...  In this paper a parallel algorithm is presented that can specify the location of objects from edge streaks produced by an edge operator.  ...  In fact, it is easy to prove that a polygon is convex if and only if this is true for all such consecutive vectors.  ... 
doi:10.1016/0031-3203(89)90034-4 fatcat:bemqb4k5pnf6tc734iurpoo5z4

Convex hulls, occluding contours, aspect graphs and the Hough transform

M. Wright, A. Fitzgibbon, P.J. Giblin, R.B. Fisher
1996 Image and Vision Computing  
The Hough transform is a standard technique for finding features such as lines in images.  ...  Using this knowledge we present an algorithm to construct convex hulls of arbitrary 2D shapes with smooth and polygonal boundaries as well as isolated point sets.  ...  tell if it is occluded by another part of the object.  ... 
doi:10.1016/0262-8856(96)01100-6 fatcat:pema7dqn65d2pei5avk5n4dvte

Convex Hulls, Occluding Contours, Aspect Graphs and the Hough Transform

M Wright, AW Fitzgibbon, RB Fisher
1995 Procedings of the British Machine Vision Conference 1995  
The Hough transform is a standard technique for finding features such as lines in images.  ...  Using this knowledge we present an algorithm to construct convex hulls of arbitrary 2D shapes with smooth and polygonal boundaries as well as isolated point sets.  ...  tell if it is occluded by another part of the object.  ... 
doi:10.5244/c.9.49 dblp:conf/bmvc/WrightFF95 fatcat:joqsr65tincjhont7wye4xk4lu

Research on an Improved Segmentation Recognition Algorithm of Overlapping Agaricus bisporus

Shuzhen Yang, Bowen Ni, Wanhe Du, Tao Yu
2022 Sensors  
The accurate identification of overlapping Agaricus bisporus in a factory environment is one of the challenges faced by automated picking.  ...  Then, the binary image is filtered and morphologically processed, and the contour of the overlapping Agaricus bisporus area is obtained by edge detection in the Canny operator, the convex hull and concave  ...  and Hough circular transformation method.  ... 
doi:10.3390/s22103946 pmid:35632359 pmcid:PMC9146322 fatcat:ljeirbqm25c55eog2ynjt3avpy

Automated search for livestock enclosures of rectangular shape in remotely sensed imagery

Igor Zingman, Dietmar Saupe, Karsten Lambers, Lorenzo Bruzzone
2013 Image and Signal Processing for Remote Sensing XIX  
They are grouped into parameterized linear segments by means of a local Hough transform. To identify appropriate configurations of linear segments we define convexity and angle constraints.  ...  The search for appropriate configurations is efficiently performed on a graph. Its nodes represent linear segments and edges encode the above constraints.  ...  It was also supported by the DFG Research Training Group GK-1042 "Explorative Analysis and Visualization of Large Information Spaces."  ... 
doi:10.1117/12.2027704 fatcat:53ftlwpctze4bidtwjvhghkt4e

Unsupervised clustering in Hough space for identification of partially occluded objects

O. Yanez-Suarez, M.R. Azimi-Sadjadi
1999 IEEE Transactions on Pattern Analysis and Machine Intelligence  
The contour of each relevant object in the analyzed scene is modeled with an approximating polygon whose edges are then projected into the Hough space.  ...  polygonal approximation.  ...  ACKNOWLEDGMENTS The data for this study was provided by Schuller, Inc., Denver, Colorado. The authors would like to especially thank Dr.  ... 
doi:10.1109/34.790436 fatcat:3lzmsafngfcwxbkhw4iyanc33a

Unsupervised, Fast and Precise Recognition of Digital Arcs in Noisy Images [chapter]

Thanh Phuong Nguyen, Bertrand Kerautret, Isabelle Debled-Rennesson, Jacques-Olivier Lachaud
2010 Lecture Notes in Computer Science  
Its accuracy is dependent on the correct evaluation of the amount of noise, which was set by the user in this former version.  ...  We evaluate the performance of this algorithm and we compare it with standard arc and circle detection methods based on extensions of the Hough transform.  ...  It can process indifferently perfect images, or damaged by a uniformly distributed or variable noise. In addition, it is more efficient than traditional and improved methods based on Hough transform.  ... 
doi:10.1007/978-3-642-15910-7_7 fatcat:wbanncgcbjfpnb3qzukpjkckpu

Automatic drawing for traffic marking with MMS LIDAR intensity

G. Takahashi, H. Takeda, Y. Shimano
2014 ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
The key idea in this method is extracting lines using a Hough transform strategically focused on changes in local reflection intensity along scan lines.  ...  ) Generating a Triangulated Irregular Network (TIN) from higher intensity points; (3) Deleting arcs by length and generating outline polygons on the TIN; (4) Generating buffers from the outline polygons  ...  TIN, generating buffers from the outline polygon, and extracting lines from TIN nodes by a Hough transform.  ... 
doi:10.5194/isprsannals-ii-5-363-2014 fatcat:gf3i4kowzrfrrgx5nx3uzl3pwy

Translation, Rotation and Scaling Invariant 2D Shape Matching Based on Filter Matching

Fábio Kawaoka Takase, Marcos de Sales Guerra Tsuzuki
2009 IFAC Proceedings Volumes  
It is invariant under translation, rotation and scaling transformations of the images being compared. The method is based on the matched filter usage.  ...  At the core of image interpretation is the recognition of known patterns in the image. In this article, an algorithm for two-dimensional shape matching is presented.  ...  Hough Transform The Hough transform proposed by Derek et al. (1992) , is a method for detecting curves by exploiting the duality between points on a curve and parameters of that curve by using a voting  ... 
doi:10.3182/20090603-3-ru-2001.0123 fatcat:ong6pzxa45covbsg2tmje6qiry

Saliency Detection Algorithm under Complex Background

Xin Pang
2015 Journal of Information and Computational Science  
Secondly, the barcode border is located by using line Snake algorithm, and the four vertices of the barcode are fitted. Finally, the barcode is rectified by using transmission shift.  ...  Firstly, the region which contains "Ltype" barcode border is selected by analyzing the features of each region.  ...  If 5 . 0 ) ( > i E D , the convex side i E is judged as a real edge. Through detecting convex polygonal region whether or not exists "L-type" solid side will determine the final bar code region.  ... 
doi:10.12733/jics20105232 fatcat:tnmf6wiqa5a5viporboxgujd2y
« Previous Showing results 1 — 15 out of 827 results