SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:liu-179288"
 

Search: onr:"swepub:oai:DiVA.org:liu-179288" > Predicting Signed D...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Brissman, EmilLinköpings universitet,Datorseende,Tekniska fakulteten (author)

Predicting Signed Distance Functions for Visual Instance Segmentation

  • Article/chapterEnglish2021

Publisher, publication year, extent ...

  • Institute of Electrical and Electronics Engineers (IEEE),2021
  • electronicrdacarrier

Numbers

  • LIBRIS-ID:oai:DiVA.org:liu-179288
  • https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-179288URI
  • https://doi.org/10.1109/SAIS53221.2021.9484039DOI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:kon swepub-publicationtype

Notes

  • Funding: Wallenberg AI, Autonomous Systems, and Software Program (WASP) - Knut and Alice Wallenberg Foundation
  • Visual instance segmentation is a challenging problem and becomes even more difficult if objects of interest varies unconstrained in shape. Some objects are well described by a rectangle, however, this is hardly always the case. Consider for instance long, slender objects such as ropes. Anchor-based approaches classify predefined bounding boxes as either negative or positive and thus provide a limited set of shapes that can be handled. Defining anchor-boxes that fit well to all possible shapes leads to an infeasible number of prior boxes. We explore a different approach and propose to train a neural network to compute distance maps along different directions. The network is trained at each pixel to predict the distance to the closest object contour in a given direction. By pooling the distance maps we obtain an approximation to the signed distance function (SDF). The SDF may then be thresholded in order to obtain a foreground-background segmentation. We compare this segmentation to foreground segmentations obtained from the state-of-the-art instance segmentation method YOLACT. On the COCO dataset, our segmentation yields a higher performance in terms of foreground intersection over union (IoU). However, while the distance maps contain information on the individual instances, it is not straightforward to map them to the full instance segmentation. We still believe that this idea is a promising research direction for instance segmentation, as it better captures the different shapes found in the real world.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Johnander, JoakimLinköpings universitet,Datorseende,Tekniska fakulteten(Swepub:liu)joajo88 (author)
  • Felsberg, Michael,1974-Linköpings universitet,Datorseende,Tekniska fakulteten(Swepub:liu)micfe03 (author)
  • Linköpings universitetDatorseende (creator_code:org_t)

Related titles

  • In:33rd Annual Workshop of the Swedish-Artificial-Intelligence-Society (SAIS): Institute of Electrical and Electronics Engineers (IEEE), s. 5-1097816654423679781665442374

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Brissman, Emil
Johnander, Joaki ...
Felsberg, Michae ...
About the subject
NATURAL SCIENCES
NATURAL SCIENCES
and Computer and Inf ...
and Computer Vision ...
Articles in the publication
33rd Annual Work ...
By the university
Linköping University

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view