Deep learning-based image matching methods play a crucial role in computer
vision, yet they often suffer from substantial computational demands. To tackle
this challenge, we present HCPM, an efficient and detector-free local
feature-matching method that employs hierarchical pruning to optimize the
matching pipeline. In contrast to recent detector-free methods that depend on
an exhaustive set of coarse-level candidates for matching, HCPM selectively
concentrates on a concise subset of informative candidates, resulting in fewer
computational candidates and enhanced matching efficiency. The method comprises
a self-pruning stage for selecting reliable candidates and an
interactive-pruning stage that identifies correlated patches at the coarse
level. Our results reveal that HCPM significantly surpasses existing methods in
terms of speed while maintaining high accuracy. The source code will be made
available upon publication.

基于深度学习的图像匹配方法在计算机视觉中发挥了重要作用，但往往需要大量的计算资源。为了解决这个问题，我们提出了一种高效且无需检测器的局部特征匹配方法 HCPM，通过分层修剪来优化匹配流程。与依赖于粗略级别候选集进行匹配的最新无检测器方法不同，HCPM 仅集中在一小部分有信息量的候选项上，从而减少计算要求并提高匹配效率。该方法包括自剪枝阶段以选择可靠的候选项，以及在粗略级别上识别相关补丁的交互式剪枝阶段。我们的结果表明，HCPM 在速度和高准确性方面显著超越现有方法。发布后，源代码将可供使用。

HCPM: 高效无检测器匹配的分层候选筛选

HCPM: Hierarchical Candidates Pruning for Efficient Detector-Free  Matching

Taxi services and product delivery services are instrumental for our modern
society. Thanks to the emergence of sharing economy, ride-sharing services such
as Uber, Didi, Lyft and Google's Waze Rider are becoming more ubiquitous and
grow into an integral part of our everyday lives. However, the efficiency of
these services are severely limited by the sub-optimal and imbalanced matching
between the supply and demand. We need a generalized framework and
corresponding efficient algorithms to address the efficient matching, and hence
optimize the performance of these markets. Existing studies for taxi and
delivery services are only applicable in scenarios of the one-sided market. In
contrast, this work investigates a highly generalized model for the taxi and
delivery services in the market economy (abbreviated as"taxi and delivery
market") that can be widely used in two-sided markets. Further, we present
efficient online and offline algorithms for different applications. We verify
our algorithm with theoretical analysis and trace-driven simulations under
realistic settings.

本研究探讨了在供需不平衡条件下，改进出租车和产品送货服务的匹配效率的一般性框架，提出了可适用于双边市场的高度通用的模型，并提出了有效的在线和离线算法。