RO EN
Combined Randomized-Local Hough Transform versus UpWrite Transform in stamp detection
Authors: Daniela Tondini
Keywords: Hough Transform, Randomized Hough Transform, Local Hough Transform, UpWrite Transform, stamp detection, fast algorithm.
– 0.24 Mb
Keywords: Hough Transform, Randomized Hough Transform, Local Hough Transform, UpWrite Transform, stamp detection, fast algorithm.
Abstract
The conventional Hough Transform used for detection of objects with known shape and size has proved its robustness. One typical task for this transform can be the detection of stamp(s) on an envelope. Unfortunately, the Hough Transform has an important drawback: the heavy computational effort and, as consequence, a big execution time. This paper introduces a variant of Hough Transform that speeds up the process. One important aid is given by a filtering step based on a fast analysis of a rough deformation model. This method is a combination of Randomized and Local Hough Transform. Experiments were made comparing the modified Hough Transform approach with the UpWrite Transform and they proved that the first approach preserves the quality of the Hough Transform results at a higher speed.Daniela Tondini,
MET Department,
University of Teramo, Italy,
E-mail:
MET Department,
University of Teramo, Italy,
E-mail:
Fulltext
– 0.24 Mb
Contents
- Polynomial time algorithm for solving cyclic games
- Gray Code for Cayley Permutations
- Quasi-stability of a vector trajectorial problem with non-linear partial criteria
- Finite fields and cryptology
- Mobile Communications World: Security Implementations Aspects - A State of the Art
- Combined Randomized-Local Hough Transform versus UpWrite Transform in stamp detection
- Lower Bounds and Semi On-line Multiprocessor Scheduling
