Asset Details
Do you wish to reserve the book?
A Graph Multi-separator Problem for Image Segmentation
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A Graph Multi-separator Problem for Image Segmentation
Do you wish to request the book?
A Graph Multi-separator Problem for Image Segmentation
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
A Graph Multi-separator Problem for Image Segmentation
2024
Overview
We propose a novel abstraction of the image segmentation task in the form of a combinatorial optimization problem that we call the
multi-separator problem
. Feasible solutions indicate for every pixel whether it belongs to a segment or a segment separator, and indicate for pairs of pixels whether or not the pixels belong to the same segment. This is in contrast to the closely related lifted multicut problem, where every pixel is associated with a segment and no pixel explicitly represents a separating structure. While the multi-separator problem is
np
-hard, we identify two special cases for which it can be solved efficiently. Moreover, we define two local search algorithms for the general case and demonstrate their effectiveness in segmenting simulated volume images of foam cells and filaments.
Publisher
Springer US,Springer Nature B.V
