Hashing is an efficient method for nearest neighbor search in large-scale data space by embedding high-dimensional feature descriptors into a similarity preserving Hamming space with a low dimension. However, large-scale high-speed retrieval through binary code has a certain degree of reduction in retrieval accuracy compared to traditional retrieval methods... (read more)
PDFMETHOD | TYPE | |
---|---|---|
![]() |
Working Memory Models | |
![]() |
Convolutions |