Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
Using this analysis, we propose two algorithms for the decomposition and segmentation of binary images into rectangular blocks. A combination of these methods ...
The decomposition of binary images using rectangular blocks of foreground pixels as primitives is considered. Based on this type of decomposition, a fast ...
Block decomposition and segmentation for fast Hough transform evaluation · S. Perantonis, B. Gatos, N. Papamarkos · Published in Pattern Recognition 1 May 1999 ...
Bibliographic details on Block decomposition and segmentation for fast Hough transform evaluation.
The decomposition and segmentation of binary images using rectangular blocks of foreground pixels as primitives is discussed and two algorithms related to ...
Block decomposition and segmentation for fast Hough transform evaluation ... Based on this type of decomposition, a fast method for evaluating the Hough transform ...
Papamarkos, "Block decomposition and segmentation for fast Hough transform evaluation", Pattern Recognition, vol. 32(5), pp. 811-824,. 1999. [5] B. Gatos, N ...
Based on this type of decomposition, a fast method for evaluating the Hough transform is introduced. A complexity analysis of the proposed block Hough transform ...
Aug 28, 2024 · Block decomposition and segmentation for fast Hough transform evaluation, PR(32), No. 5, May 1999, pp. 811-824. Elsevier DOI BibRef 9905 · Pan ...
Under the guidance of the matching framework based on generalized Hough transform, we present a new fast image matching algorithm. It originates from the ...