Affinity Derivation and Graph Merge for Instance Segmentation

19Citations
Citations of this article
200Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present an instance segmentation scheme based on pixel affinity information, which is the relationship of two pixels belonging to the same instance. In our scheme, we use two neural networks with similar structures. One predicts the pixel level semantic score and the other is designed to derive pixel affinities. Regarding pixels as the vertexes and affinities as edges, we then propose a simple yet effective graph merge algorithm to cluster pixels into instances. Experiments show that our scheme generates fine grained instance masks. With Cityscape training data, the proposed scheme achieves 27.3 AP on test set.

Cite

CITATION STYLE

APA

Liu, Y., Yang, S., Li, B., Zhou, W., Xu, J., Li, H., & Lu, Y. (2018). Affinity Derivation and Graph Merge for Instance Segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11207 LNCS, pp. 708–724). Springer Verlag. https://doi.org/10.1007/978-3-030-01219-9_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free