无需标注数据,用标记点快速生成图像识别模型。
FLIM Networks with Bag of Feature Points
- 仅凭用户标记的特征点,直接生成卷积核权重,跳过传统训练。
- 在寄生虫检测任务中速度提升40%,精度接近顶级模型。
- 适合医学图像分析等标注成本高的场景。
卷积网络依赖大量图像标注,成本高昂。特征学习图像标记法(FLIM)通过在少数代表性图像的显著区域绘制标记点,直接估计编码器卷积核权重,无需传统优化过程。该编码器与自适应解码器构成完全无需反向传播的FLIM网络。先前研究已证明其在显著性目标检测中的有效性,且远轻于现有轻量级模型。本文重新审视FLIM显著性检测,提出更快的滤波器估计方法——FLIM-BoFP。相较于之前需在每层进行块聚类的FLIM-Cluster方法,FLIM-BoFP仅在输入层进行一次聚类,构建特征点集合,并将这些点映射到各编码层定义滤波器,大幅降低计算开销并增强位置控制。论文在光学显微镜寄生虫检测任务中评估了该方法在效率、性能和泛化能力上的优势,相比FLIM-Cluster及其他先进基线表现更优。
原文摘要 · Abstract (English)
Convolutional networks require extensive image annotation, which can be costly and time-consuming. Feature Learning from Image Markers (FLIM) tackles this challenge by estimating encoder filters (i.e., kernel weights) from user-drawn markers on discriminative regions of a few representative images without traditional optimization. Such an encoder combined with an adaptive decoder comprises a FLIM network fully trained without backpropagation. Prior research has demonstrated their effectiveness in Salient Object Detection (SOD), being significantly lighter than existing lightweight models. This study revisits FLIM SOD and introduces FLIM-Bag of Feature Points (FLIM-BoFP), a considerably faster filter estimation method. The previous approach, FLIM-Cluster, derives filters through patch clustering at each encoder's block, leading to computational overhead and reduced control over filter locations. FLIM-BoFP streamlines this process by performing a single clustering at the input block, creating a bag of feature points, and defining filters directly from mapped feature points across all blocks. The paper evaluates the benefits in efficiency, effectiveness, and generalization of FLIM-BoFP compared to FLIM-Cluster and other state-of-the-art baselines for parasite detection in optical microscopy images.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。