Optimizing Edge Detection for Image Segmentation with Multicut Penalties-Reference-Cited by-同舟云学术

Optimizing Edge Detection for Image Segmentation with Multicut Penalties

Published:2022 Issue: Volume: Page:182-197
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Jung Steffen^ORCID,Ziegler Sebastian,Kardoost Amirhossein^ORCID,Keuper Margret^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-16788-1_12

Reference46 articles.

1. Abbas, A., Swoboda, P.: Combinatorial optimization for panoptic segmentation: a fully differentiable approach. Adv. Neural. Inf. Process. Syst. 34, 15635–15649 (2021)

2. Acharjya, P., Sinha, A., Sarkar, S., Dey, S., Ghosh, S.: A new approach of watershed algorithm using distance transform applied to image segmentation. Int. J. Innov. Res. Comput. Commun. Eng. 1(2), 185–189 (2013)

3. Andres, B., et al.: Segmenting planar superpixel adjacency graphs w.r.t. non-planar superpixel affinity graphs. In: EMMCVPR (2013)

4. Andres, B., Kappes, J.H., Beier, T., Köthe, U., Hamprecht, F.A.: Probabilistic image segmentation with closedness constraints. In: ICCV (2011)

5. Arbeláez, P., Pont-Tuset, J., Barron, J., Marques, F., Malik, J.: Multiscale combinatorial grouping. In: Computer Vision and Pattern Recognition (2014)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A data-driven approach for volume feature recognition based on cell graph;International Journal of Computer Integrated Manufacturing;2024-08-12

2. Learning to Solve Minimum Cost Multicuts Efficiently Using Edge-Weighted Graph Convolutional Neural Networks;Machine Learning and Knowledge Discovery in Databases;2023