FAQ
1. Are challenge participants required to reveal all details of their methods?
Entires to ILSVRC2015 can be either "open" or "closed." Teams submitting "open" entries will be expected to reveal most details of their method (special exceptions may be made for pending publications). Teams may choose to submit a "closed" entry, and are then not required to provide any details beyond an abstract. The motivation for introducing this division is to allow greater participation from industrial teams that may be unable to reveal algorithmic details while also allocating more time at the ICCV15 ImageNet and MS COCO Visual Recognition Challenges Joint Workshop to teams that are able to give more detailed presentations. Participants are strongly encouraged to submit "open" entires if possible.
2. Can additional images or annotations be used in the competition?
Entires submitted to ILSVRC2015 will be divided into two tracks: "provided data" track (entries only using ILSVRC2015 images and annotations from any aforementioned tasks in both main competitions and taster competitions -- different from ILSVRC 2014), and "external data" track (entries using any outside images or annotations). Any team that is unsure which track their entry belongs to should contact the organizers ASAP. Additional clarifications will be posted here as needed.
3. Is there still image classification task?
There will be no more classification task on the ILSVRC 2012 classification/localization dataset, instead teams have to submit results in the localization format (meaning both class labels and bounding boxes). If they choose to do so, they can return the full image as their guess for the object bounding box. If teams are still only interested in image level classification problem, they can participate the scene classification challenge.
4. How many entries can each team submit per competition?
Participants who have investigated several algorithms may submit one result per algorithm (up to 5 algorithms). Changes in algorithm parameters do not constitute a different algorithm (following the procedure used in PASCAL VOC).
<math xmlns="http://www.w3.org/1998/Math/MathML" display="block">
<mi>e</mi>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mi>n</mi>
</mfrac>
<mo>⋅<!-- â‹… --></mo>
<munder>
<mo>∑<!-- ∑ --></mo>
<mi>k</mi>
</munder>
<mi>m</mi>
<mi>i</mi>
<msub>
<mi>n</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>i</mi>
</mrow>
</msub>
<mi>m</mi>
<mi>i</mi>
<msub>
<mi>n</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>m</mi>
</mrow>
</msub>
<mi>m</mi>
<mi>a</mi>
<mi>x</mi>
<mo fence="false" stretchy="false">{</mo>
<mi>d</mi>
<mo stretchy="false">(</mo>
<msub>
<mi>c</mi>
<mi>i</mi>
</msub>
<mo>,</mo>
<msub>
<mi>C</mi>
<mi>k</mi>
</msub>
<mo stretchy="false">)</mo>
<mo>,</mo>
<mi>f</mi>
<mo stretchy="false">(</mo>
<msub>
<mi>b</mi>
<mi>i</mi>
</msub>
<mo>,</mo>
<msub>
<mi>B</mi>
<mrow class="MJX-TeXAtom-ORD">
<mi>k</mi>
<mi>m</mi>
</mrow>
</msub>
<mo stretchy="false">)</mo>
<mo fence="false" stretchy="false">}</mo>
</math>
lsum (i/n, k, rootsof (min,min[m],max[d(c,C[k]),f(b,B[km])]));