Generalised Hough accumulator space compactification by superimposed

作者: Julian R. Ullmann

DOI: 10.1016/0167-8655(90)90041-Y

关键词: Generalised Hough transformAccumulator (cryptography)Hough transformMathematicsCompactification (mathematics)Execution timeCombinatoricsAlgorithmEdge detectionImage processingHash function

摘要: Abstract For recognising shifted and rotated images we use a small number, b , of n × Hough accumulator spaces instead single N space, such that bn 3 . The projection from the space to is via hash functions. Economy achieved at cost unreliability, which has been investigated experimentally.

参考文章(8)
Jayasooriah, R. M. Colomb, A clause indexing system for PROLOG based on superimposed coding Australian Computer Journal archive. ,vol. 18, pp. 18- 25 ,(2000)
C.S. Roberts, Partial-match retrieval via the method of superimposed codes Proceedings of the IEEE. ,vol. 67, pp. 1624- 1642 ,(1979) , 10.1109/PROC.1979.11543
John L. Pfaltz, William J. Berman, Edgar M. Cagley, Partial-match retrieval using indexed descriptor files Communications of The ACM. ,vol. 23, pp. 522- 528 ,(1980) , 10.1145/359007.359013
Berra, Soon Myoung Chung, Hachem, Computer Architecture for a Surrogate File to a Very Large Data/Knowledge Base IEEE Computer. ,vol. 20, pp. 25- 32 ,(1987) , 10.1109/MC.1987.1663506
Chris Faloutsos, Access methods for text ACM Computing Surveys. ,vol. 17, pp. 49- 74 ,(1985) , 10.1145/4078.4080
Dennis G. Severance, Guy M. Lohman, Differential files: their application to the maintenance of large databases ACM Transactions on Database Systems. ,vol. 1, pp. 256- 267 ,(1976) , 10.1145/320473.320484
Dana Harry Ballard, Christopher M Brown, None, Computer vision ,(1982)