Randomized Hough Transform with minimal memory requirements

In this paper a modification of Randomized Hough Trans-form algorithm is proposed. It is focused on FPGA imple-mentation issues, mainly on memory minimization problem. Parameter space is discarded in consequence and a line-list is introduced instead. Lines could be chosen randomly from that list and processed further by pairing them to form a longer line, checking correctness and extending. Pairing is the crucial operation for such an algorithm but checking and extending seems to improve performance significantly, what has also been analyzed in the article.