MODEL PROFILE · 模型档案

deformable-detr-DocLayNet

Aryn · deformable-detr-DocLayNet

Deformable DEtection TRansformer (DETR), trained on DocLayNet (including 80k annotated pages in 11 classes). The DETR model is an encoder-decoder transformer with a convolutional backbone. Two heads are added on top of the decoder outputs in order to perform object detection: a linear layer for the class labels and a MLP (multi-layer perceptron) for the bounding boxes. The model uses so-called object queries to detect objects in an image. Each object query looks for a particular object in the image. For COCO, the number of object queries is set to 100. The model is trained using a "bipartite matching loss": one compares the predicted classes + bounding boxes of each of the N = 100 object queries to the ground truth annotations, padded up to the same length N (so if an image only contains 4 objects, 96 annotations will just have a "no object" as class and "no bounding box" as bounding box). The Hungarian matching algorithm is used to create an optimal one-to-one mapping between each of the N queries and each of the N annotations. Next, standard cross-entropy (for the classes) and a linear combination of the L1 and generalized IoU loss (for the bounding boxes) are used to optimize the parameters of the model.

译文排队中,当前展示来源原文。

目标检测license:apache-2.0
上下文窗口来源未披露
输入 → 输出图像 → 待核验
模型权重待核验
档案更新时间2026/10/30 22:20:26
OVERVIEW

模型介绍

Deformable DEtection TRansformer (DETR), trained on DocLayNet (including 80k annotated pages in 11 classes). The DETR model is an encoder-decoder transformer with a convolutional backbone. Two heads are added on top of the decoder outputs in order to perform object detection: a linear layer for the class labels and a MLP (multi-layer perceptron) for the bounding boxes. The model uses so-called object queries to detect objects in an image. Each object query looks for a particular object in the image. For COCO, the number of object queries is set to 100. The model is trained using a "bipartite matching loss": one compares the predicted classes + bounding boxes of each of the N = 100 object queries to the ground truth annotations, padded up to the same length N (so if an image only contains 4 objects, 96 annotations will just have a "no object" as class and "no bounding box" as bounding box). The Hungarian matching algorithm is used to create an optimal one-to-one mapping between each of the N queries and each of the N annotations. Next, standard cross-entropy (for the classes) and a linear combination of the L1 and generalized IoU loss (for the bounding boxes) are used to optimize the parameters of the model.

主要特点

特点摘要待依据来源补齐,不凭模型名称推断能力。

局限与注意事项

暂无足够来源支持具体缺点结论。请重点验证实际任务表现、时延、数据政策、许可与版本生命周期。

PRICING & COST

来源报价与费用分析

同一模型在不同渠道、地区和配置下可能采用不同价格。下表独立保留各渠道报价,不将渠道价格视为厂商官方统一价格。

来源 / 渠道输入输出计费单位采集时间
暂未取得可核验报价,请查阅来源渠道。

按月估算基础 Token 费用

—

预估不包含缓存优惠、阶梯定价、多模态附加费用、网络检索、税费及推理额外输出。

INDEPENDENT BENCHMARKS

公开评测与运行配置

暂无已采集的可核验公开评分。模型未上榜不代表能力较低。

查看完整已收录榜单 →

常见问题

开放权重是否代表可以免费商用?

不一定。应核对具体版本许可证、商用门槛和使用政策。自部署还会产生算力和维护成本。

这些价格是实时结算价格吗?

不是实时结算价格,而是带采集时间的来源报价快照。请到对应渠道核对当前版本、区域、折扣和计费方式。

资料来源与可追溯记录

许可证:apache-2.0。模型介绍与第三方评测均以原来源的具体版本和方法为准。