Faster R-CNN Features for Instance Search
Image representations derived from pre-trained Convolutional Neural Networks (CNNs) have become the new state of the art in computer vision tasks such as instance retrieval. This work explores the suitability for instance retrieval of image- and region-wise representations pooled from an object detection CNN such as Faster R-CNN. We take advantage of the object proposals learned by a Region Proposal Network (RPN) and their associated CNN features to build an instance search pipeline composed of a first filtering stage followed by a spatial reranking. We further investigate the suitability of Faster R-CNN features when the network is fine-tuned for the same objects one wants to retrieve. We assess the performance of our proposed system with the Oxford Buildings 5k, Paris Buildings 6k and a subset of TRECVid Instance Search 2013, achieving competitive results.
Code (3)
Tasks
Instance Searchobject-detectionObject DetectionRegion ProposalRerankingRetrievalMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Instance-aware Semantic Segmentation via Multi-task Network Cascades
Semantic segmentation research has recently witnessed rapid progress, but many leading methods are unable to identify object instances. In this paper, we present Multi-task Network Cascades for instance-aware semantic se…
Multi-Human Parsingobject-detectionObject DetectionSegmentation+1Deep Structured Instance Graph for Distilling Object Detectors
Effectively structuring deep knowledge plays a pivotal role in transfer from teacher to student, especially in semantic vision tasks. In this paper, we present a simple knowledge structure to exploit and encode informati…
Instance SegmentationKnowledge DistillationObjectobject-detection+3MP-Boost: Minipatch Boosting via Adaptive Feature and Observation Sampling
Boosting methods are among the best general-purpose and off-the-shelf machine learning approaches, gaining widespread popularity. In this paper, we seek to develop a boosting method that yields comparable accuracy to pop…
Binary ClassificationReinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks
Failure-Directed Search (FDS) is a significant complete generic search algorithm used in Constraint Programming (CP) to efficiently explore the search space, proven particularly effective on scheduling problems. This pap…
Reinforcement LearningPointINS: Point-based Instance Segmentation
In this paper, we explore the mask representation in instance segmentation with Point-of-Interest (PoI) features. Differentiating multiple potential instances within a single PoI feature is challenging because learning a…
Instance SegmentationObject DetectionRepresentation LearningSegmentation+1