One Metric to Measure them All: Localisation Recall Precision (LRP) for Evaluating Visual Detection Tasks

The official implementation of the "LRP Error", which was proposed in the following publications.

One Metric to Measure them All: Localisation Recall Precision (LRP) for Evaluating Visual Detection Tasks,
Kemal Oksuz, Baris Can Cam, Sinan Kalkan, Emre Akbas,
IEEE Transaction on Pattern Analysis and Machine Intelligence, 2021. (publisher's page)

Localization Recall Precision (LRP): A New Performance Metric for Object Detection.
Kemal Oksuz, Baris Can Cam, Emre Akbas, Sinan Kalkan,
European Conference on Computer Vision, 2020.

This repository provides the implementation of LRP Error on the following evaluation apis:

• Official COCO api [1] to evaluate object detection, keypoint detection and instance segmentation
• Official COCO panoptic api [2] to evaluate panoptic segmentation
• Official LVIS api [3] to evaluate instance segmentation

For mmdetection COCO api [4] to evaluate object detection, keypoint detection and instance segmentation see this repository.

How to Cite

Please cite the following papers if you find our papers or repository useful. If you must cite only 1 paper, please prefer the TPAMI one.

@article{LRP_TPAMI, 
  title={One metric to measure them all: Localisation recall precision (LRP) for evaluating visual detection tasks}, 
  author={Oksuz, Kemal and Cam, Baris Can and Kalkan, Sinan and Akbas, Emre}, 
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence}, 
  year={2021}, 
  publisher={IEEE}
}

@inproceedings{LRP_ECCV, 
  title={Localization recall precision (LRP): A new performance metric for object detection}, 
  author={Oksuz, Kemal and Cam, Baris Can and Akbas, Emre and Kalkan, Sinan}, 
  booktitle={Proceedings of the European Conference on Computer Vision (ECCV)}, 
  pages={504--519}, 
  year={2018}
}

Contribution to the Repository

Any contribution to the repository is appreciated. In addition to the datasets and tasks we provide, if you implement LRP Error to evaluate the results of different datasets or different tasks, please follow the subdirectory-based structure of the repository and then make a pull request. Feel free to contact for any question.

Summary

In a nutshell, LRP Error (previously proposed only for object detection in [5])

• is an alternative to Average Precision (AP) for object detection, keypoint detection and instance segmentation
• is an alternative to Panoptic Quality (PQ) for panoptic segmentation
• can be extended to evaluate other visual detection tasks such as 3D object detection
• can be used to assign class-wise optimal thresholds for practical needs

A Brief Overview of the Paper

In our paper, we first define three important features for a performance measure to evaluate visual object detection tasks; then analyse AP, PQ and LRP based on these features. Finally, again based on these important features, we empirically demonstrate the drawbacks of AP and PQ, and discuss how LRP alleviates their drawbacks.

Important features for a performance measure

We identify three important features for a performance measure to evaluate visual object detection tasks as follows:

• Completeness: We call a performance measure ''complete'' if it precisely takes into account three most important performance aspects in a visual detection task, that are false positive rate, false negative rate and localisation error.

• Interpretability: Interpretability of a performance measure is related to its ability to provide insights on the strengths and weaknesses of the detector being evaluated.

• Practicality: Any issue that arises during practical use of a performance measure diminishes its practicality.

Intuition of LRP and Optimal LRP

LRP Error is defined as the ''average matching error'', where the ''total matching error'' between ground truth set and detection set is normalised by the ''maximum possible value of the total matching error'':

• Total Matching Error: The summation of errors from true positives (TP), false positives (FP) and false negatives (FN). Each TP contributes by its normalised localization error, and, each FP or FN contributes by 1.
• Maximum Possible Value of the Total Matching Error: Since each TP, FP and FN has a maximum error potential of 1, the maximum possible valur of the total matching error is simply the summation of numbers of TPs, FPs and FNs.
• Dividing Total Matching Error by Maximum Possible Value of the Total Matching Error yields LRP, and consequently LRP has a range of [0,1].

LRP can directly be used to evaluate panoptic segmentation since the conventional output of panoptic segmentation does not contain confidence scores. As for the outputs with confidence scores (e.g. the outputs of object detection, keypoint detection and instance segmentation), we define Optimal LRP (oLRP) as the minimum achievable LRP Error over the confidence scores. Accordingly, oLRP identifies the optimal configuration and the confidence score corresponding to oLRP is the ''LRP-Optimal Threshold''.

Therefore, LRP replaces PQ and oLRP replaces AP.

Comparison of LRP with AP and PQ

Comparison of oLRP with AP

• Completeness: While AP considers localisation quality of TPs loosely (i.e. only to validate TPs, thus not precisely); oLRP takes into account their localisation qualities precisely (compare the results Detector 1 and Detector 3 in the figure).

• Interpretability: While AP does not provide any insight on the detection performance, oLRP is interpretable with its components corresponding to performance aspects. (note that Detector 1 and Detector 2 have very different problems, but equal AP. The components of oLRP is able to address this problem.)

• Practicality: We identify three practical issues with AP: (i) AP is not suitable to evaluate outputs without confidence scores (e.g. panoptic segmentation), (ii) AP can not identify a threshold for practical usage of the detectors, and (iii) interpolating the PR curve can affect the performance of the classes with low number of examples.

Please see our paper for a more comprehensive analysis of AP (including COCO-style AP), and its theoretical and empirical comparisons with LRP.

Comparison of LRP with PQ

• Completeness: Both measures are complete.

• Interpretability: RQ component of PQ, defined as the F-measure, combines precision and recall (i.e. does not isolate errors); while LRP has a corresponding component for each performance aspect, and hence provides better interpretability.

• Practicality: We identify two issues of PQ related to practicality: (i) PQ is limited to panoptic segmentation, and (ii) PQ overpromotes classification error compared to localisation error inconsistently.

Please see our paper for a more comprehensive analysis of PQ, and its theoretical and empirical comparisons with LRP.

Specification of Dependencies

• numpy
• setuptools>=18.0
• cython>=0.27.3
• matplotlib>=2.1.0
• python3

Installation

In this repo, we merge using LRP on different tasks and datasets into one repo. Currently, you could install by run

# Install cocoapi
pip install "git+https://github.com/kemaloksuz/LRP-Error.git#subdirectory=pycocotools"
# Install panopticapi
pip install "git+https://github.com/kemaloksuz/LRP-Error.git#subdirectory=panopticapi"
# Install lvisapi (requires cocoapi, so first install cocoapi)
pip install "git+https://github.com/kemaloksuz/LRP-Error.git#subdirectory=pycocotools"
pip install "git+https://github.com/kemaloksuz/LRP-Error.git#subdirectory=lvis-api"

Using Demo Files

To facilitate the usage of LRP on each supported evaluation api, we provide a demo file:

• Official COCO api: Please follow the instructions in this file to reproduce an example evaluation with LRP. This is an example output of obtained by this api.
• Official COCO panopticapi: Please follow this file to reproduce an example evaluation with LRP. This is an example output of obtained by this api.
• Official LVIS api: Please see this file as an example evaluation of LVIS result with LRP. This is an example output of obtained by this api.

Evaluated Visual Detection Tasks and Models

We evaluate the models from the three common repositories: mmdetection [6], detectron [7], detectron [8], and our aLRP Loss implementation [9, 10].

You can see some examples of the evaluated models under each task. Additionally, please see corresponding file of the task for more results including link to configuration files from the utilized repositories, used models, detection files from these models in json format and the result files including LRP Errors, which are generated by this repository. In each separate file, the results are presented in the following form:

Method	Backbone	Epoch	Link to Config	Model	Detections	LRP Results	oLRP	oLRPLoc	oLRPFP	oLRPFN	APC	AP50	AP75	ARC100
SSD-300	VGG-16	120	mmdetection	model	json	txt	78.4	20.6	37.1	57.9	25.6	43.8	26.3	37.5

Following the same structure, you can also make a pull request to include your results in the corresponding table.

Evaluated Object Detection Models

Some example LRP results of the models for object detection task:

Method	Backbone	Epoch	oLRP↓	oLRPLoc↓	oLRPFP↓	oLRPFN↓	APC↑	AP50↑	AP75↑
ATSS	R50	12	68.6	15.4	30.3	46.6	39.4	57.6	42.8
Faster R-CNN	R101	12	67.6	17.2	24.2	44.3	39.4	61.2	43.4
NAS-FPN	R50	50	66.7	14.8	26.6	46.3	40.5	58.4	43.1
FreeAnchor	R50	12	66.0	15.2	26.4	44.5	41.9	61.0	45.0
Cascade R-CNN	X101	12	63.2	14.4	23.9	40.9	44.7	63.6	48.9
aLRP Loss	X101	100	62.5	15.1	23.2	39.5	45.4	66.6	48.0

Please see object_detection.md for more and detailed results.

Evaluated Keypoint Detection Models

Some example LRP results of the models for keypoint detection task:

Method	Backbone	Epoch	oLRP↓	oLRPLoc↓	oLRPFP↓	oLRPFN↓	APC↑	AP50↑	AP75↑
Keypoint R-CNN	R50	12	44.8	12.8	10.8	18.6	64.0	86.4	69.3
Keypoint R-CNN	X101	12	41.9	11.7	8.8	18.1	66.0	87.3	72.2

Please see keypoint_detection.md for more and detailed results.

Evaluated Instance Segmentation Models

Some example LRP results of the models for instance segmentation task:

Method	Backbone	Epoch	oLRP↓	oLRPLoc↓	oLRPFP↓	oLRPFN↓	APC↑	AP50↑	AP75↑
Mask R-CNN	X101	12	67.8	18.3	24.9	43.5	38.4	60.6	41.3
Mask Scoring R-CNN	X101	12	67.5	17.9	24.5	43.3	39.5	60.5	42.6
Hybrid Task Cascade	X101	20	63.6	17.0	23.4	37.9	43.8	66.8	47.1

Please see instance_segmentation.md for more and detailed results.

Evaluated Panoptic Segmentation Models

Some example LRP results of the models for panoptic segmentation task:

Method	Backbone	Epoch	LRP↓	LRPLoc↓	LRPFP↓	LRPFN↓	PQ↑	SQ↑	RQ↑
Panoptic FPN	R50	12	77.5	22.2	40.2	57.2	39.4	77.8	48.3
Panoptic FPN	R101	37	75.9	20.3	38.6	55.2	41.5	79.1	50.5
Panoptic FPN	R101	37	74.6	19.4	37.0	53.6	43.0	80.0	52.1

Please see panoptic_segmentation.md for more and detailed results.

License

This project is released under the Apache 2.0 license. Please see also the licences of each api provided under each directory.

References

[1] cocoapi of COCO dataset.
[2] panopticapi of COCO dataset.
[3] lvisapi of LVIS dataset. [4] cocoapi of mmdetection.
[5] Oksuz K, Cam BC, Akbas E, Kalkan S, Localization recall precision (LRP): A new performance metric for object detection, ECCV 2018.
[6] mmdetection.
[7] detectron.
[8] detectron2.
[9] aLRP Loss Ablation Experiments.
[10] Oksuz K, Cam BC, Akbas E, Kalkan S, A Ranking-based, Balanced Loss Function Unifying Classification and Localisation in Object Detection, NeurIPS 2020.

Contact

This repo is maintained by Kemal Oksuz and Baris Can Cam.