Segmenting Planar Superpixel Adjacency Graphs w.r.t. Non-planar Superpixel 
Affinity Graphs

Andres, Bjoern; Yarkony, Julian; Manjunath, B. S.; Kirchhoff, Steffen; Turetken, Engin; Fowlkes, Charless C.; Pfister, Hanspeter

doi:10.1007/978-3-642-40395-8_20

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Segmenting Planar Superpixel Adjacency Graphs w.r.t. Non-planar Superpixel Affinity Graphs

MPS-Authors

/persons/resource/persons98382

Andres, Bjoern
Computer Vision and Multimodal Computing, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Andres, B., Yarkony, J., Manjunath, B. S., Kirchhoff, S., Turetken, E., Fowlkes, C. C., et al. (2013). Segmenting Planar Superpixel Adjacency Graphs w.r.t. Non-planar Superpixel Affinity Graphs. In A. Heyden, F. Kahl, C. Olsson, M. Oskarsson, & X.-C. Tai (Eds.), Energy Minimization Methods in Computer Vision and Pattern Recognition (pp. 266-279). Berlin: Springer. doi:10.1007/978-3-642-40395-8_20.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0018-4E84-E

Abstract

There is no abstract available