Model overview
The Efficient LoFTR model was proposed in "Efficient LoFTR: Semi-Dense Local Feature Matching with Sparse-Like Speed" by Yifan Wang, Xingyi He, Sida Peng, Dongli Tan, and Xiaowei Zhou from Zhejiang University. This model presents a novel method for efficiently producing semi-dense matches across images, addressing the limitations of previous detector-free matchers like LoFTR, which suffered from low efficiency despite remarkable matching capabilities in challenging scenarios. Efficient LoFTR revisits design choices to improve both efficiency and accuracy. "We present a novel method for efficiently producing semi-dense matches across images. Previous detector-free matcher LOFTR has shown remarkable matching capability in handling large-viewpoint change and texture-poor scenarios but suffers from low efficiency. We revisit its design choices and derive multiple improvements for both efficiency and accuracy. One key observation is that performing the transformer over the entire feature map is redundant due to shared local information, therefore we propose an aggregated attention mechanism with adaptive token selection for efficiency. Furthermore, we find spatial variance exists in LoFTR's fine correlation module, which is adverse to matching accuracy. A novel two-stage correlation layer is proposed to achieve accurate subpixel correspondences for accuracy improvement. Our efficiency optimized model is ~2.5 faster than LoFTR which can even surpass state-of-the-art efficient sparse matching pipeline SuperPoint + LightGlue. Moreover, extensive experiments show that our method can achieve higher accuracy compared with competitive semi-dense matchers, with considerable efficiency benefits. This opens up exciting prospects for large-scale or latency-sensitive applications such as image retrieval and 3D reconstruction. Project page: https://zju3dv.github.io/efficientloftr/"
Key features
特点摘要待依据来源补齐，不凭模型名称推断能力。
Limitations & considerations
Sources are insufficient to establish specific limitations. Verify task performance, latency, data policies, licensing and version lifecycle.
Source prices & cost analysis
Prices vary by channel, region and configuration. Channel quotes are listed independently and are not treated as a single official provider price.
| Source / channel | Input | Output | Billing unit | Collected at |
|---|---|---|---|---|
| No verified prices yet. Check the source channel. | ||||
Estimate monthly base token costs
Estimates exclude cache discounts, tiered pricing, multimodal surcharges, web search, taxes and additional reasoning output.
Public benchmarks & run configuration
暂无已采集的可核验公开评分。模型未上榜不代表能力较低。
View full indexed rankings →Frequently asked questions
Do open weights permit free commercial use?
Not necessarily. Check the version license, commercial conditions and usage policies. Self-hosting incurs compute and maintenance costs.
Are these real-time billing prices?
These are timestamped source snapshots, not live billing prices. Check the channel for current versions, regions, discounts and billing methods.
Sources & traceability
许可证：apache-2.0。模型介绍与第三方评测均以原来源的具体版本和方法为准。