• Competitive Quantization for Approximate Nearest Neighbor Search 

      Ozan, Ezgi Can; Kiranyaz, Serkan; Gabbouj, Moncef ( IEEE Computer Society , 2016 , Article)
      In this study, we propose a novel vector quantization algorithm for Approximate Nearest Neighbor (ANN) search, based on a joint competitive learning strategy and hence called as competitive quantization (CompQ). CompQ is ...
    • K-Subspaces Quantization for Approximate Nearest Neighbor Search 

      Ozan E.C.; Kiranyaz, Mustafa Serkan; Gabbouj M. ( IEEE Computer Society , 2016 , Article)
      Approximate Nearest Neighbor (ANN) search has become a popular approach for performing fast and efficient retrieval on very large-scale datasets in recent years, as the size and dimension of data grow continuously. In this ...