Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions
We consider an optimization version of the image segmentation problem, in which we are given a grid graph with weights on the grid cells. We are interested in finding the maximum weight subgraph such that the subgraph can be decomposed into two ”star-shaped” images. We show that this problem can be reduced to the problem of finding a maximum-weight closed set in an appropriately defined directed graph which is well known to have efficient algorithms which run very fast in practice. We also show that finding a maximum-weight subgraph that is decomposable into m star-shaped objects is NP-hard for some m > 2.
KeywordsGrid Cell Image Segmentation Directed Graph Vertex Cover Grid Graph
Unable to display preview. Download preview PDF.
- 5.Christ, T., Pálvölgyi, D., Stojakovic, M.: Consistent digital line segments. In: Snoeyink, J., de Berg, M., Mitchell, J.S.B., Rote, G., Teillaud, M. (eds.) Symposium on Computational Geometry, pp. 11–18. ACM, New York (2010)Google Scholar
- 9.Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining using two-dimensional optimized accociation rules: Scheme, algorithms, and visualization. In: Jagadish, H.V., Mumick, I.S. (eds.) SIGMOD Conference, pp. 13–23. ACM Press (1996)Google Scholar