logo
科言猫学术研究的AI总结
language
手机端手机端
  • Phone Feature微信小程序
简体中文简体中文
notice消息通知
博客博客
delete
arrow
返回

Double Filtering Using Short and Long Quantized Projections

delete2026-01-01
delete0
PRE
AI
N
Naoya Higuchi
Y
Yasunobu Imamura
T
Takeshi Shinohara *
K
Kouichi Hirata
T
Tetsuji Kuboyama
DOI：10.1007/978-3-032-06069-3_35delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
本文提出了一种基于两阶段过滤策略的快速且内存高效的近似最近邻（ANN）搜索系统的实用实现，该策略使用短和长量化投影。所提出的系统基于我们团队最近开发的方法，并针对SISAP 2025索引挑战的Task 1进行优化，利用公开可用的数据集和评估协议。所提出的索引方法，称为双过滤，使用两种类型的量化降维投影：由1位量化派生的短二进制草图，以及用于精细过滤的较长投影。两者均通过对原始高维向量进行降维并量化结果获得。为满足挑战的硬件限制（16 GB RAM和8 CPU核心），我们调整了草图宽度、投影维度等参数。与针对批处理和吞吐量优化的系统不同，我们的方法在在线设置中运行，其中每个查询按顺序独立处理。我们关注每查询响应延迟，测量平均时间和变异性，这使得系统非常适合资源受限下的实时或交互式应用。
Keyword:
Approximate Nearest Neighbor Search
Double Filtering
Quantized Projections
Binary Sketching
Memory-Constrained Indexing
Online Query Processing
Low-Latency Retrieval

期刊

S
SIMILARITY SEARCH AND APPLICATIONS, SISAP 2025
IF:
0
论文数:
38
被引数:
0

机构

Sojo University 封面图
Sojo University
学者数:
719
论文数: 590
被引数: 577
K
Kyushu Institute of Technology
学者数:
2.8K
论文数: 2.4K
被引数: 2.1K
Gakushuin University 封面图
Gakushuin University
学者数:
692
论文数: 622
被引数: 594
学者 查看更多机构
引用论文

引用论文

Fast Filtering for Nearest Neighbor Search by Sketch Enumeration Without Using Matching
errLecture Notes in Computer Science
IF0
err2019-01-01
err0
PREAI
errHiguchi,Naoya; Imamura,Yasunobu; Kuboyama,Tetsuji; Hirata,Kouichi; Shinohara,Takeshi
err分享
err收藏
Nearest Neighbor Search using Sketches as Quantized Images of Dimension Reduction
errProceedings of the 7th International Conference on Pattern Recognition Applications and Methods
IF0
err2018-01-01
err0
PREAI
errHiguchi,Naoya; Imamura,Yasunobu; Kuboyama,Tetsuji; Hirata,Kouichi; Shinohara,Takeshi
err分享
err收藏
Annealing by Increasing Resampling
errLecture Notes in Computer Science
IF0
err2020-01-01
err0
PREAI
errHiguchi,Naoya; Imamura,Yasunobu; Shinohara,Takeshi; Hirata,Kouichi; Kuboyama,Tetsuji
err分享
err收藏
On Dimension Reduction Mappings for Approximate Retrieval of Multi-dimensional Data
errLecture Notes in Computer Science
IF0
err2002-01-01
err0
PREAI
errShinohara,Takeshi; Ishizaka,Hiroki
err分享
err收藏
Fast Filtering for Similarity Search Using Conjunctive Enumeration of Sketches in Order of Hamming Distance
errProceedings of the 13th International Conference on Pattern Recognition Applications and Methods
IF0
err2024-01-01
err0
PREAI
errHiguchi,Naoya; Imamura,Yasunobu; Mic,Vladimir; Shinohara,Takeshi; Hirata,Kouichi; Kuboyama,Tetsuji
err分享
err收藏
Nearest-neighbor Search from Large Datasets using Narrow Sketches
err
IF0
err2022-01-01
err0
PREAI
errNaoya Higuchi; Yasunobu Imamura; Vladimir Mic; Takeshi Shinohara; Kouichi Hirata; Tetsuji Kuboyama
err分享
err收藏
Spherical hashing
err2012 IEEE Conference on Computer Vision and Pattern Recognition
IF0
err2012-06-01
err0
PREAI
errJae-Pil Heo; Youngwoon Lee; Junfeng He; Shih-Fu Chang; Sung-Eui Yoon
err分享
err收藏
Fast Nearest Neighbor Search with Narrow 16-bit Sketch
errProceedings of the 8th International Conference on Pattern Recognition Applications and Methods
IF0
err2019-01-01
err0
PREAI
errHiguchi,Naoya; Imamura,Yasunobu; Kuboyama,Tetsuji; Hirata,Kouichi; Shinohara,Takeshi
err分享
err收藏
没有更多内容