TY - GEN
T1 - Algorithms for computing the maximum weight region decomposable into elementary shapes
AU - Jiyon, Jinhi
AU - Kasai, Ryosei
AU - Korman, Cozzetti Matias
AU - Tokuyama, Takeshi
PY - 2009/12/1
Y1 - 2009/12/1
N2 - Motivated from the image segmentation problem, we consider the problem of finding the maximum weight region with a shape decomposable into elementary shapes in n ×n pixel grid where each pixel has a real valued weight. We give efficient algorithms for several interesting cases. This shows string constrast to the NP-hardness results to find the maximum weight union for the corresponding cases.
AB - Motivated from the image segmentation problem, we consider the problem of finding the maximum weight region with a shape decomposable into elementary shapes in n ×n pixel grid where each pixel has a real valued weight. We give efficient algorithms for several interesting cases. This shows string constrast to the NP-hardness results to find the maximum weight union for the corresponding cases.
UR - http://www.scopus.com/inward/record.url?scp=75649151207&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=75649151207&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-10631-6_117
DO - 10.1007/978-3-642-10631-6_117
M3 - Conference contribution
AN - SCOPUS:75649151207
SN - 3642106307
SN - 9783642106309
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1166
EP - 1174
BT - Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings
T2 - 20th International Symposium on Algorithms and Computation, ISAAC 2009
Y2 - 16 December 2009 through 18 December 2009
ER -