BETA Since not all the existing submissions are listed on the leaderboard, these rankings should not be considered as definitive. Soon equivalence classes (see equivalence notes) will be displayed as well.

Key to abbreviations

Detection Results: VOC2012

Competition "comp3" (train on VOC2012 data)

Average Precision (AP %)

 mean

aero
plane
bicycle

bird

boat

bottle

bus

car

cat

chair

cow

dining
table
dog

horse

motor
bike
person

potted
plant
sheep

sofa

train

tv/
monitor
submission
date
YOLOv248.869.561.637.628.218.863.253.265.627.544.435.961.457.966.963.816.852.839.565.446.22016-Dec-01
DENSE_BOX45.964.764.128.826.730.760.654.947.429.341.834.642.659.364.262.524.353.727.150.950.72015-Jul-07
NoC42.262.860.426.722.325.756.955.252.121.538.334.243.951.258.840.720.442.037.452.641.62015-Apr-26
HybridCodingApe40.961.852.024.624.820.257.144.553.617.433.038.342.848.859.435.722.840.339.551.149.52012-Sep-23
Data Decomposition and Distinctive Context40.955.058.122.518.833.957.654.542.620.240.329.337.154.658.351.614.744.832.151.741.02011-Oct-13
segDPM40.759.154.328.224.434.553.448.151.318.137.829.940.448.952.946.416.139.535.450.844.92014-Feb-24
Fisher with FLAIR40.661.752.027.924.018.956.545.353.415.534.636.342.348.457.936.624.340.638.049.849.02014-Jun-17
NYU-UCLA_Hierarchy40.656.355.923.420.327.256.648.153.823.332.933.439.253.056.943.614.337.939.452.643.72011-Oct-13
DPM-MKL39.159.654.521.921.632.152.549.340.819.135.228.937.250.949.946.115.639.335.648.942.82012-Sep-23
DPM-MK38.356.053.319.217.325.853.145.444.520.132.128.137.252.356.643.312.134.337.651.845.22011-Oct-13
NEC_STANFORD_OCP36.765.146.825.024.616.051.044.951.513.026.631.040.239.751.532.812.635.733.548.044.82012-Sep-23
Detector-Merging36.547.250.218.321.425.253.346.346.317.527.830.335.041.652.143.218.035.231.145.444.42012-Sep-23
MISSOURI_HOGLBP_MDPM_CONTEXT36.451.453.718.315.631.656.547.138.619.532.022.125.050.351.944.911.937.730.650.939.32012-Sep-23
NUS_Context_SVM36.251.452.920.115.826.953.045.637.615.336.025.132.650.455.836.812.337.630.548.141.02011-Oct-05
SelectiveSearchMonkey35.556.943.416.615.818.052.338.349.012.229.732.836.745.754.430.416.237.234.745.944.22011-Oct-13
CVC_DET34.145.449.815.716.026.354.644.835.116.831.323.626.045.649.642.214.530.528.545.740.02012-Sep-23
UOCTTI_LSVM_MDPM33.653.253.913.113.530.555.551.231.714.529.016.022.143.150.346.48.833.022.945.838.22011-Oct-12
TREE--MAX-POOLING32.943.851.713.712.727.351.543.732.918.327.318.523.145.248.642.911.632.427.547.039.32011-Oct-13
LCC-TREE-CODING32.441.151.713.711.927.352.141.732.917.627.318.523.145.248.641.911.632.427.544.238.32011-Oct-13
SVM-HOG31.547.551.714.212.627.351.844.225.317.830.218.116.946.950.943.09.531.223.644.322.12012-Sep-22
Configurable And-Or Tree Model29.550.247.07.93.824.847.242.831.217.524.210.021.343.546.437.57.926.421.543.136.72012-Sep-23
lSVM-Viewpoint20.942.543.75.44.818.128.636.624.212.620.64.517.515.238.27.91.723.27.141.025.72011-Oct-13
UOCTTI_WL-SSVM_GRAMMAR---------------49.2-----2011-Oct-12
CMIC-GS-DPM----13.326.4-41.5---12.2--41.6-8.331.4---2011-Oct-13
Geometric shape--3.8------------------2016-Jun-19
CMIC-Synthetic-DPM-40.447.8-11.423.748.940.923.511.925.5-10.942.038.740.77.530.4-38.434.82011-Oct-13
Struct_Det_CRF-37.142.62.0-16.043.838.617.010.37.72.41.534.341.138.41.514.75.335.427.12011-Oct-13

Key to Abbreviations

TitleMethodAffiliationContributorsDescriptionDate
Color_HOG based detector with BOW classifierCVC_DETComputer Vision Center BarcelonaFahad Khan, Camp Davesa, Joost van de Weijer, Rao Muhammad Anwer, Albert Gordo, Pep Gonfaus, Ramon Baldrich, Antonio LopezWe use our Color-HOG based part detector [1]. The detection results are combined with our CVC_CLS submission. References: 1. Fahad shahbaz khan, Rao Muhammad Anwer, Joost van de Weijer, Andrew D. Bagdanov, Maria Vanrell, Antonio M. Lopez. Color Attributes for Object Detection. In CVPR 2012. 2012-09-23 18:53:20
Dynamic And-Or Tree Learning For Object DetectionConfigurable And-Or Tree ModelSun Yat-Sen UniversityXiaolong Wang, Liang Lin, Lichao Huang, Xinhui Zhang, Zechao YangWe propose a novel hierarchical model for object detection, namely "And-Or tree", which is a configurable by introducing the “switch” variables (i.e. the or-nodes) accounting for intra-class object variance. This model comprises three layers: a batch of leaf-nodes in bottom for localizing object parts; the or-nodes for activating several leaf-nodes to specify a composition of parts; a root-node verifying object holistic distortion. For model training , a novel discriminative learning algorithm is proposed to explicitly determine the structural configuration (e.g., the production of leaf-nodes associated with the or-nodes) along with the optimization of multi-layer parameters. The response of model integrates the bottom-up testings via the leaf-nodes and or-nodes with the global verification via the root-node. In the implementation, we apply the histograms of gradients(HOG) as the image feature. Object detection is achieved by scanning the sub-windows over different scales and locations of the image. The final decisions are further rescored by a context model encoding the inter-object spatial interactions.2012-09-23 16:02:13
DenseBoxCNNDENSE_BOXBaidu IDLLichao HuangI train a VGG16-liked convolutional neural network to perform end-to-end object detection. This network can processes the full image and outputs multiple bounding boxes and class confidence score simultaneously. The training data used in this entry is VOC2012 trianval only. 2015-07-07 05:39:05
The DPM-MKL baselineDPM-MKLOxfordRoss Girshick, Andrea Vedaldi, Karen SimonyanThis method is similar to last year DPM-MKL entry. We updated several aspects of the implementation (e.g. th type of features). 2012-09-23 23:05:18
Detector_WeightingDetector-MergingUniversity of AmsterdamSezer Karaoglu, Fahad Shahbaz Khan, Koen van de Sande, Jan van Gemert, Rao Muhammad Anwer, , Jasper Uijlings, Camp Davesa, Joost van de Weijer, Theo Gevers, Cees Snoek We use a bounding box merging scheme that exploits the results from different independent detectors. Each detector results in a ranked list of BB, which is not directly comparable with other detectors. We merge the detectors with a weighting scheme based on hold-out performance. For input, we use the standard Felzenszwalb gray HOG detector [1] ; the color-HOG detector of CVC [2] which introduces color information within the part based detection framework; and a slightly improved version of the SelectiveSearch detector [3] by the UvA submitted to VOC 2011. [1] P. Felzenszwalb, R. Girshick, D. McAllester, D. Ramanan Object Detection with Discriminatively Trained Part Based Models. In TPAMI, Vol. 32, No. 9, Sep. 2010 [2] Fahad shahbaz khan, Rao Muhammad Anwer, Joost van de Weijer, Andrew D. Bagdanov, Maria Vanrell, Antonio M. Lopez. Color Attributes for Object Detection. In CVPR 2012. [3] Segmentation As Selective Search for Object Recognition Koen E. A. van de Sande, Jasper R. R. Uijlings, Theo Gevers, Arnold W. M. Smeulders. In ICCV, 2011 2012-09-23 22:51:19
Fisher with FLAIRFisher with FLAIRUniversity of AmsterdamKoen van de Sande, Cees Snoek, Arnold SmeuldersRun for our CVPR2014 paper "Fisher and VLAD with FLAIR", see http://koen.me/research/flair2014-06-17 11:47:29
Diamond Frame Bicycle RecognitionGeometric shapeNational Cheng Kung UniversityChung-Ping Young, Yen-Bor Lin, Kuan-Yu ChenBicycle of diamond frame detector for side-view image is proposed based on the observation that a bicycle consists of two wheels in the form of ellipse shapes and a frame in the form of two triangles. Through the design of geometric constraints on the relationship between the triangles and ellipses, the computation is fast comparing to the feature-based classifiers. Besides, the training process is unnecessary and only single image is required for our algorithm. The experimental results are also given in this paper to show the practicability and the performance of the proposed bicycle model and bicycle detection algorithm.2016-06-19 10:06:33
Hybrid Coding for Selective SearchHybridCodingApeksande@uva.nlKoen E. A. van de Sande Jasper R. R. Uijlings Cees G. M. Snoek Arnold W. M. SmeuldersWe have improved significantly over last years method from [1] with a hybrid bag-of-words using average and difference coding, a first in object detection. Briefly, the method of [1], instead of exhaustive search, which was dominant in the Pascal VOC 2010 and 2011 detection challenge, uses segmentation as a sampling strategy for selective search (cf. the ICCV paper). We use a small set of data-driven, class-independent, high quality object locations (coverage of 96-99% of all objects in the VOC2007 test set). Because we have only a limited number of locations to evaluate, this enables the use of more computationally expensive features, such as bag-of-words using average and difference coding strategies. While difference coding is an order of magnitude more expensive than average, we are still able to efficiently train a detection system for it due to several optimizations in the descriptor coding and the kernel classification runtime. As low-level features, we use new complementary color descriptors. Finally, the detection system is fused with classification scores found using most telling example selection from [2]. [1] "Segmentation as Selective Search for Object Recognition"; Koen E. A. van de Sande, Jasper R. R. Uijlings, Theo Gevers, Arnold W. M. Smeulders; 13th International Conference on Computer Vision, 2011. [2] "The Most Telling Window for Image Classification"; Jasper R. R. Uijlings, Koen E. A. van de Sande, Arnold W. M. Smeulders, Theo Gevers, Nicu Sebe, Cees G. M. Snoek; PASCAL VOC Challenge Workshop 2011 at ICCV, 2011.2012-09-23 21:01:35
HOGLBP with Mixture DPM and ContextMISSOURI_HOGLBP_MDPM_CONTEXTThe University of Missouri-ColumbiaGuang Chen, Miao Sun, Xutao Lv, Yan Li, Tony X. HanHOG-LBP features [1] are incorporated in the deformable part model [2]. Deformable model is further improved by using the learned multiple anchor positions so that the possible locations for each part are modeled as a mixture of Gaussian distribution. For part and root filters, PCA is adopted to denoise and accelerate the detection speed. We proposed a permutation matrix method to add the model symmetry constraints during the feature selection, which effectively takes advantage of the symmetry property existing in most of the object categories and avoids the overfitting. Contextual information including image class label estimation, segmentation estimation, color histogram of ROI, and objects location priors, and correlations between the object detectors are used to leverage the final detection results to a very large extent: there are lots of contextual information and correlational information among objects that can be used to boost the detection performance. For example, trains and buses are objects bearing some visual similarities. But none of the large objects can coexist in the same location. So detection scores are correlated and we use the inference on Bayesian networks to further improve the detection results. [1] Xiaoyu Wang, Tony X. Han and Shuicheng Yan, “An HOG-LBP Human Detector with Partial Occlusion Handling,” IEEE International Conference on Computer ICCV 2009), Kyoto, 2009. [2] Girshick, R. B. and Felzenszwalb, P. F. and McAllester, D. : Discriminatively Trained Deformable Part Models, Release 52012-09-23 21:27:16
Object-centric poolingNEC_STANFORD_OCPNEC Laboratories America and Stanford UniversityOlga Russakovsky Xiaoyu Wang Shenghuo Zhu Li Fei-Fei Yuanqing Lin Object-centric pooling (OCP) is a method which represents a bounding box by pooling the coded low-level descriptors on the foreground and background separately and then concatenating them (Russakovsky et al. ECCV 2012). This method exploits powerful classification features that have been developed in the past years. In this system, we used DHOG and LBP as low-level descriptors. We developed a discriminative LCC coding scheme in addition to traditional LCC coding. We make use of candidate bounding boxes (van de Sande et al. ICCV 2011).2012-09-23 22:47:43
Networks on Convolutional Feature MapsNoCMicrosoft ResearchShaoqing Ren, Kaiming He, Ross Girshick, Xiangyu Zhang, Jian SunThis entry is an implementation of the system described in “Object Detection Networks on Convolutional Feature Maps” (http://arxiv.org/abs/1504.06066). This model is trained on HoG feature only. Training data for this entry is voc 2012 trainval set. Selective Search is used for proposal.2015-04-26 09:47:29
SVM classifier using HOG?V2?SVM-HOGOrange Labs Beijing, France TelecomZhao FengOur object detection system is based on the Discriminatively Trained Deformable Part Models, Release 5. It is our first attempt for VOC challange. We do not make much modifications to the baseline system provided in http://people.cs.uchicago.edu/~rbg/latent/. The submitted results are obtained by applying post-processings of both bounding box prediction and contextual rescoring. 2012-09-22 20:06:39
YOLOv2YOLOv2University of WashingtonJoe Redmon, Ali FarhadiYOLOv2 runs a single detection network once on an image to detect objects. It predicts bounding boxes and objectness as well as class probabilities across a convolutional feature map. For more information see: http://pjreddie.com/darknet/yolo/2016-12-01 21:15:21
Synthetic Trainining for deformable parts modelCMIC-GS-DPMCairo Microsoft Innovation CenterDr. Motaz El-Saban , Osama Khalil, Mostafa Izz, Mohamed FathiWe introduce dataset augmentation using synthetic examples as a method for introducing novel variations not present in the original set. We make use of deformable parts-based model (Felzenszwalb et al 2010). We augment the training set with examples obtained by applying global scaling of the dataset examples. Global scaling includes no, up and down scaling with varying performance across different object classes. Technique selection is based upon performance on the validation set. The augmented dataset is then used to train parts-based detectors using HOG features (Dalal & Triggs 2006) and latent SVM. The resulting class models are applied on test images in a “sliding-window” fashion.2011-10-13 22:01:23
Synthetic Trainining for deformable parts modelCMIC-Synthetic-DPMCairo Microsoft Innovation CenterDr. Motaz El-Saban , Osama Khalil, Mostafa Izz, Mohamed FathiWe introduce dataset augmentation using synthetic examples as a method for introducing novel variations not present in the original set. We make use of deformable parts-based model (Felzenszwalb et al 2010). We augment the training set with examples obtained by relocating objects (having segmentation masks) to new backgrounds. New backgrounds used for relocation are selected using a set of techniques (no relocation, same image, “different” image or image with co-occurring objects). Performance of those techniques varies across classes according to the object class properties. For every class, we select the technique that achieves the highest AP on the validation set. The augmented dataset is then used to train parts-based detectors using HOG features (Dalal & Triggs 2006) and latent SVM. The resulting class models are applied on test images in a “sliding-window” fashion.2011-10-13 21:54:09
DPM with basic rescoringDPM-MKOxford VGGAndrea Vedaldi and Andrew ZissermanThis method uses a Deformable Part Model (our own implementation) to generate an initial (and very good) list of 100 candidate bounding boxes per image. These are then rescored by a multiple features model combining DPM scores with dense SP-BOW, geometry, and context. The SP-BOW model are dense SIFT features (vl_phow in VLFeat) quantized into 1200 visual words, 6x6 spatial layout, cell-by-cell l2 normalization after raising the entries to the 1/4 power (1/4-homogeneous Hellinger's kernel). The geometric model is a second order polynomial kernel on the bounding box coordinates. The context model is a second order polynomial kernels mixing the candidate DPM score with twenty scores obtained as the maximum response of the DPMs for the 20 classes in that image (like Felzenszwalb). A second context model is also added, using 20 scores from a state-of-the-art Fisher kernel image classifier (also on dense SIFT features), as described in Chatfileld et al. 2010. The SVM scores are passed through a sigmoid for standardization in the 0-1 interval; the sigmoid model is fitted to the truing data. The model is trained by means of a large scale linear SVM using the one-slack bundle formulation (aka SVM^perf). The solver hence uses retraining implicitly, and we make sure it reaches full convergence.2011-10-13 10:20:29
NLPR-DetectionData Decomposition and Distinctive ContextInstitute of Automation, Chinese Academy of SciencesJunge Zhang, Yinan Yu, Yongzhen Huang, Chong Wang, Weiqiang Ren, Jinchen Wu, Kaiqi Huang and Tieniu TanPart based model has achieved great success in recent years. To our understanding, the original deformable part based model has several limits: 1) the computational complexity is very large, especially when it is extended to enhanced models via multiple features, more mixtures or flexible part models. 2) The original part based model is not “deformable” enough. To tackle these problems, 1) we propose a data decomposition based feature representation scheme for part based model in an unsupervised manner. The submitted method takes about 1~2 seconds per image from PASCAL VOC datasets on average while keeping high performance. We learn the basis from samples without any label information. The specific label independent rule followed in the submitted methods can be adapted into other variants of part based model such as hierarchical model or flexible mixture models. 2) We found that, each part corresponds to multiple possible locations, which is not reflected in the original part-based model. Accordingly, we propose that the locations of parts should obey the multiple Gaussian distribution. Thus, for each part we learn its optimal locations by clustering which are used to update the original anchors of the part-based model. The proposed method above can more effectively describe the deformation (pose and location variety) of objects’ parts. 3) We rescored the initial results by our distinctive context model including global and local and intra-class context information. Besides, segmentation provides strong indication for object’s presence, therefore, the proposed segmentation aware semantic attribute is applied in the final reasoning which indeed shows promising performance. 2011-10-13 16:20:59
SVM classifier with LCC and tree codingLCC-TREE-CODINGUniversity of MissouriXiaoyu Wang Miao Sun Xutao Lv Shuai Tang Guang Chen Yan Li Tony X. HanA two layers cascade structure for object detection. The first layer employs deformable model to select possible candidates for the second layer. The later layer takes location and global context augmented with LBP feature to improve the accuracy. A bag of words model enhanced with spatial pyramid and local coordilate coding is used to model the global context information. A hierachical tree structure coding is used to take care of the intra-class variation for each detection window. Linear SVM is used for classification.2011-10-13 17:13:43
Context-SVM based submission for 3 tasksNUS_Context_SVMNational University of SingaporeZheng Song, Qiang Chen, Shuicheng YanClassification uses the BoW framework. Dense-SIFT, HOG^2, LBP and color moment features are extracted. We then use VQ and fisher vector for feature coding and SPM and Generalized Pyramid Matching(GPM) to generate image representations. Context-aware features are also extracted based on [1]. The classification models are learnt via kernel SVM. Then final classification scores are refined with kernel mapping[2]. Detection and segmentation results use the baseline of [3] using HOG and LBP feature. And then based on [1], we further learn context model and refine the detection results. The final segmentation result uses the learnt average masks for each detection component learnt using segmentation training set to substitute the rectangle detection boxes. [1] Zheng Song*, Qiang Chen*, Zhongyang Huang, Yang Hua, and Shuicheng Yan. Contextualizing Object Detection and Classification. [2] http://pascallin.ecs.soton.ac.uk/challenges/VOC/voc2010/workshop/nuspsl.pdf [3] http://people.cs.uchicago.edu/~pff/latent/ 2011-10-05 09:01:23
Latent Hierarchical LearningNYU-UCLA_HierarchyNYU and UCLAYuanhao Chen, Li Wan, Long Zhu, Rob Fergus, Alan YuilleBased on two recent publications: "Latent Hierarchical Structural Learning for Object Detection". Long Zhu, Yuanhao Chen, Alan Yuille, William Freeman. CVPR 2010. "Active Mask Hierarchies for Object Detection". Yuanhao Chen, Long Zhu, Alan Yuille. ECCV 2010 We present a latent hierarchical structural learning method for object detection. An object is represented by a mixture of hierarchical tree models where the nodes represent object parts. The nodes can move spatially to allow both local and global shape deformations. The image features are histograms of words (HOWs) and oriented gradients (HOGs) which enable rich appearance representation of both structured (eg, cat face) and textured (eg,cat body) image regions. Learning the hierarchical model is a latent SVM problem which can be solved by the incremental concave-convex procedure (iCCCP). Object detection is performed by scanning sub-windows using dynamic programming. The detections are rescored by a context model which encodes the correlations of 20 object classes by using both object detection and image classification. 2011-10-13 22:21:11
Selective Search Detection SystemSelectiveSearchMonkeyUniversity of Amsterdam and University of TrentoJasper R. R. Uijlings Koen E. A. van de Sande Arnold W. M. Smeulders Theo Gevers Nicu Sebe Cees SnoekBased on "Segmentation as Selective Search for Object Recognition"; Koen E. A. van de Sande, Jasper R. R. Uijlings, Theo Gevers, Arnold W. M. Smeulders; 13th International Conference on Computer Vision, 2011. Instead of exhaustive search, which was dominant in the Pascal VOC 2010 detection challenge, we use segmentation as a sampling strategy for selective search (cf. our ICCV paper). Like segmentation, we use the image structure to guide our sampling process. However, unlike segmentation, we propose to generate many approximate locations over few and precise object delineations, as the goal is to cover all object locations. Our sampling is diversified to deal with as many image conditions as possible. Specifically, we use a variety of hierarchical region grouping strategies by varying colour spaces and grouping criteria. This results in a small set of data-driven, class-indepent, high quality object locations (coverage of 96-99% of all objects in the VOC2007 test set). Because we have only a limited number of locations to evaluate, this enables the use of the more computationally expensive bag-of-words framework for classification. Our bag-of-words implementation uses densely sampled SIFT and ColorSIFT descriptors.2011-10-13 20:45:25
Structured Detection and Segmentation CRFStruct_Det_CRFOxford Brookes UniversityJonathan Warrell, Vibhav Vineet, Paul Sturgess, Philip TorrWe form a hierarchical CRF which jointly models a pool of candidate detections and the multiclass pixel segmentation of an image. Attractive and repulsive pairwise terms are allowed between detection nodes (cf Desai et al, ICCV 2009), which are integrated into a Pn-Potts based hierarchical segmentation energy (cf Ladicky et al, ECCV 2010). A cutting-plane algorithm is used to train the model, using approximate MAP inference. We form a joint loss which combines segmentation and detection components (i.e. paying a penalty both for each pixel incorrectly labelled, and each false detection node which is active in a solution), and use different weightings of this loss to train the model to perform detection and segmentation. The segmentation results thus make use of the bounding box annotations. The candidate detections are generated using the Felzenschwalb et al. CVPR 2008/2010 detector, and as features for segmentation we use textons, SIFT, LBPs and the detection response surfaces themselves.2011-10-13 03:27:02
SVM classifier with tree max-poolingTREE--MAX-POOLINGUniversity of MissouriXiaoyu Wang, Miao Sun, Xutao Lv, Shuai Tang, Guang Chen, Yan Li ,Tony X. HanA two layers cascade structure for object detection. The first layer employs deformable model to select possible candidates for the second layer. The later layer takes location and global context augmented with LBP feature to improve the accuracy. A bag of words model enhanced with spatial pyramid and local coordilate coding is used to model the global context information. A hierachical tree structure coding is used to take care of the intra-class variation for each detection window. Max-pooling is used for tree node assignment. Linear SVM is used for classification.2011-10-13 20:50:30
LSVM trained mixtures of deformable part modelsUOCTTI_LSVM_MDPMUniversity of ChicagoRoss Girshick (University of Chicago), Pedro Felzenszwalb (Brown), David McAllester (TTI-Chicago)Based on [1] http://people.cs.uchicago.edu/~pff/latent-release4 and [2] "Object Detection with Discriminatively Trained Part Based Models"; Pedro F. Felzenszwalb, Ross B. Girshick, David McAllester and Deva Ramanan; IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 32, No. 9, September 2010. This entry is a minor modification of our publicly available "voc-release4" object detection system [1]. The system uses latent SVM to train mixtures of deformable part models using HOG features [2]. Final detections are refined using a context rescoring mechanism [2]. We extended [1] to detect smaller objects by adding an extra high-resolution octave to the HOG feature pyramid. The HOG features in this extra octave are computed using 2x2 pixel cells. Additional bias parameters are learned to help calibrate scores from detections in the extra octave with the scores of detections above this octave. This entry is the same as UOCTTI_LSVM_MDPM from the 2010 competition. Detection results are reported for all 20 object classes to provide a baseline for the 2011 competition.2011-10-12 16:09:55
Person grammar model trained with WL-SSVMUOCTTI_WL-SSVM_GRAMMARUniversity of ChicagoRoss Girshick (University of Chicago), Pedro Felzenszwalb (Brown), David McAllester (TTI-Chicago)This entry is described in [1] "Object Detection with Grammar Models"; Ross B. Girshick, Pedro F. Felzenszwalb, David McAllester. Neural Information Processing Systems 2011 (to appear). We define a grammar model for detecting people and train the model’s parameters from bounding box annotations using a formalism that we call weak-label structural SVM (WL-SSVM). The person grammar uses a set of productions that represent varying degrees of visibility/occlusion. Object parts, such as the head and shoulder, are shared across all interpretations of object visibility. Each part is represented by a deformable mixture model that includes deformable subparts. An "occluder" part (itself a deformable mixture of parts) is used to capture the nontrivial appearance of the stuff that typically occludes people from below. We further refine detections using the context rescoring mechanism from the UOCTTI_LSVM_MDPM entry, using the results of that entry for the 19 non-person classes. 2011-10-12 16:13:33
Using viewpoint cues to improve object recognitionlSVM-ViewpointCornellJoshua Schwartz Noah Snavely Daniel HuttenlocherOur system is based on the Latent SVM framework of [1], including their context rescoring method. We train 6 component models with 8 parts. However, unlike [1], components are trained using a clustering based on an unsupervised estimation of 3D object viewpoint. In this sense, our approach is similar to the unsupervised approach in [2], which also seeks to estimate viewpoint, but our clustering is based on explicit reasoning about 3D geometry. Additionally, we add features based on estimated 3D scene geometry for context rescoring. Of note is the fact that a detection with our method gives rise to an explicit estimation of object viewpoint within a scene, rather than just a bounding box. [1] P. Felzenszwalb, R. Girshick, D. McAllester, and D. Ramanan. Object Detection with Discriminatively Trained Part Based Models. PAMI 2010 [2] C. Gu and X. Ren. Discriminative Mixture-of-Templates for Viewpoint Classification. ECCV 20102011-10-13 02:33:13
DPM that uses region segmentation featuressegDPMUofT, TTI-C, UCLASanja Fidler, Roozbeh Mottaghi, Allan Yuille, Raquel UrtasunDPM-style model that exploits bottom-up segmentation. We use CPMC to extract regions and CPMC-o2p to classify them. The output of the CPMC-o2p is then used as segmentation in our model. We propose a new model that blends between DPM (HOG appearance model) and segmentation. The model encourages each detection to fit tightly around a region. If there is no region, the detector will just go with the typical HOG score. In addition, we use context re-scoring based on object presence classifiers provided by NUS. Project page: http://www.cs.toronto.edu/~fidler/projects/segDPM.html2014-02-24 20:22:19