Learning to Hash Similarity Preserving Hashing h(Statue of Liberty)= h(Napoleon)= h (Napoleon)= 10001010 01100001 011001Q1 flipped bit Should be very different Should be similar 0Q0 Li (http://cs.nju.edu.cn/lvj) Big Learning CS.NJU 11/79
Learning to Hash Similarity Preserving Hashing Li (http://cs.nju.edu.cn/lwj) Big Learning CS, NJU 11 / 79
Learning to Hash Reduce Dimensionality and Storage Cost Gist vector Binary reduction 10 million images 20 GB 160MB 口卡+得二4元互)Q0 Li (http://cs.nju.edu.cn/lwj) Big Leaming CS.NJU 12 /79
Learning to Hash Reduce Dimensionality and Storage Cost Li (http://cs.nju.edu.cn/lwj) Big Learning CS, NJU 12 / 79
Learning to Hash Querying Hamming distance: 。101101110,00101101la=3 。l11011,01011lg=1 Query Image Dataset ，30Q0 Li (http://cs.nju.edu.cn/lvj) Big Leaming CS.NJU 13/79
Learning to Hash Querying Hamming distance: ||01101110, 00101101||H = 3 ||11011, 01011||H = 1 Li (http://cs.nju.edu.cn/lwj) Big Learning CS, NJU 13 / 79
Learning to Hash Querying 是 口卡得三4元互Q0 Li (http://cs.nju.edu.cn/lwj) Big Leaming CS.NJU 14 /79
Learning to Hash Querying Li (http://cs.nju.edu.cn/lwj) Big Learning CS, NJU 14 / 79
Learning to Hash Querying 口卡得三4元互Q0 Li (http://cs.nju.edu.cn/lwj) Big Leaming CS.NJU 15 /79
Learning to Hash Querying Li (http://cs.nju.edu.cn/lwj) Big Learning CS, NJU 15 / 79