🏆 Finalist — NIH Data Sharing Index (“S-Index”) Challenge
Demo corpus. Scores are computed on a select set of biomedical paper/datasets and may be inaccurate for papers outside this corpus — DataRank relies on network effects that improve with scale. We aim to expand this into a fully open resource pending additional funding.

Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks

IEEE Transactions on Pattern Analysis and Machine Intelligence(2017)10.1109/tpami.2016.2577031Source: DataRank Database

Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks is a research paper published in IEEE Transactions on Pattern Analysis and Machine Intelligence (2017). On theSindex it has a DataRank of 1.6. It has been cited 53,338 times. Its calibrated FAIR score is 61/100.

N/A
1.6DataRank · unranked
1.6
53338 citations · base score 10.9
Cite:
datarank_citation_only_1hop_v6· scope data_onlyMethodology

Abstract

State-of-the-art object detection networks depend on region proposal algorithms to hypothesize object locations. Advances like SPPnet [1] and Fast R-CNN [2] have reduced the running time of these detection networks, exposing region proposal computation as a bottleneck. In this work, we introduce a Region Proposal Network (RPN) that shares full-image convolutional features with the detection network, thus enabling nearly cost-free region proposals. An RPN is a fully convolutional network that simultaneously predicts object bounds and objectness scores at each position. The RPN is trained end-to-end to generate high-quality region proposals, which are used by Fast R-CNN for detection. We further merge RPN and Fast R-CNN into a single network by sharing their convolutional features-using the recently popular terminology of neural networks with 'attention' mechanisms, the RPN component tells the unified network where to look. For the very deep VGG-16 model [3] , our detection system has a frame rate of 5 fps (including all steps) on a GPU, while achieving state-of-the-art object detection accuracy on PASCAL VOC 2007, 2012, and MS COCO datasets with only 300 proposals per image. In ILSVRC and COCO 2015 competitions, Faster R-CNN and RPN are the foundations of the 1st-place winning entries in several tracks. Code has been made publicly available.

Data sources & pipeline
Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring
Enrichment:Pending

FAIR Checklist

Context only (not used in score)
Findable (1/2)
  • Has DOI
Accessible (0/2)
    Interoperable (0/2)
      Reusable (0/3)

        FAIR checklist signals are shown for context only and do not affect DataRank scoring.

        61FAIR score
        F Findable
        100
        A Accessible
        70
        I Interoperable
        50
        R Reusable
        25
        Top 9% by FAIRdeterministic✓ full text read

        Calibrated FAIR score — a parallel quality metric, independent of the DataRank citation score. See the full evaluation →

        DataRank Breakdown

        Base Score 100%Citation Network 0%

        Base Score Contribution

        1.6

        From this paper's citation signal

        Citation Network Contribution

        0

        Citation network not refreshed for this result

        This paper's DataRank is currently driven only by its base citation score. Citation network data was not refreshed for this result.

        Learn more about DataRank methodology →
        Why this DataRank?

        DataRank blends this paper's own citation count with the influence of the papers that cite it. Here, roughly 100% comes from its base citations and 0% from the citation network.

        Base score B(p)
        log1p(citation_count) — grows sub-linearly, so a paper with 1,000 citations is not 10× a paper with 100.
        Network N(p)
        Σ over citers of log1p(Cq) ÷ max(outdegreeq, 1). Being cited by a highly-cited paper with few references counts most.
        Damping factor d = 0.85
        DataRank = (1−d)·B(p) + d·N(p) — the two cards above are each already multiplied by their share.
        Self-citations excluded
        Citers sharing any OpenAlex author ID with this paper are filtered out before the network sum.

        Citers are pulled from OpenAlex sorted by cited_by_count:descand capped per paper, so when the cap binds we keep the highest-signal references and the score is reproducible across reruns.

        Read the full methodology →

        Authors (4)

        Kaiming HeORCID,Ross Girshick,Jian SunORCID,Shaoqing Ren

        Related Papers (10)

        Mask R-CNN
        N/A
        1.5DataRank · unranked
        2017 IEEE International Conference on Computer Vision (ICCV)(2017)
        co-cited
        10.1109/iccv.2017.322
        Lecture Notes in Computer Science(2020)
        co-cited
        10.1007/978-3-030-58452-8_13
        2014 IEEE Conference on Computer Vision and Pattern Recognition(2014)
        co-cited
        10.1109/cvpr.2014.81
        2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)(2017)
        co-cited
        10.1109/cvpr.2017.106
        Fast R-CNN
        N/A
        1.5DataRank · unranked
        2015 IEEE International Conference on Computer Vision (ICCV)(2015)
        co-cited
        10.1109/iccv.2015.169
        IEEE Transactions on Pattern Analysis and Machine Intelligence(2021)
        co-citedsame journal
        10.1109/tpami.2019.2956516
        IEEE Transactions on Pattern Analysis and Machine Intelligence(2015)
        co-citedsame journal
        10.1109/tpami.2015.2389824
        International Journal of Computer Vision(2015)
        co-cited
        10.1007/s11263-015-0816-y
        Communications of the ACM(2017)
        co-cited
        10.1145/3065386
        Generative adversarial networks
        N/A
        1.4DataRank · unranked
        Communications of the ACM(2020)
        co-cited
        10.1145/3422622