Algorithms for computing the maximum weight region decomposable into elementary shapes

Jinhi Jiyon; Ryosei Kasai; Cozzetti Matias Korman; Takeshi Tokuyama

doi:10.1007/978-3-642-10631-6_117

Algorithms for computing the maximum weight region decomposable into elementary shapes

Jinhi Jiyon, Ryosei Kasai, Cozzetti Matias Korman, Takeshi Tokuyama

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

8 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings
Pages	1166-1174
Number of pages	9
DOIs	https://doi.org/10.1007/978-3-642-10631-6_117
Publication status	Published - 2009 Dec 1
Event	20th International Symposium on Algorithms and Computation, ISAAC 2009 - Honolulu, HI, United States Duration: 2009 Dec 16 → 2009 Dec 18

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5878 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	20th International Symposium on Algorithms and Computation, ISAAC 2009
Country/Territory	United States
City	Honolulu, HI
Period	09/12/16 → 09/12/18

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-10631-6_117

Cite this

Jiyon, J., Kasai, R., Korman, C. M., & Tokuyama, T. (2009). Algorithms for computing the maximum weight region decomposable into elementary shapes. In Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings (pp. 1166-1174). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5878 LNCS). https://doi.org/10.1007/978-3-642-10631-6_117

Algorithms for computing the maximum weight region decomposable into elementary shapes. / Jiyon, Jinhi; Kasai, Ryosei; Korman, Cozzetti Matias et al.

Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. 2009. p. 1166-1174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5878 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Jiyon, J, Kasai, R, Korman, CM & Tokuyama, T 2009, Algorithms for computing the maximum weight region decomposable into elementary shapes. in Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5878 LNCS, pp. 1166-1174, 20th International Symposium on Algorithms and Computation, ISAAC 2009, Honolulu, HI, United States, 09/12/16. https://doi.org/10.1007/978-3-642-10631-6_117

Jiyon J, Kasai R, Korman CM, Tokuyama T. Algorithms for computing the maximum weight region decomposable into elementary shapes. In Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. 2009. p. 1166-1174. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-10631-6_117

Jiyon, Jinhi ; Kasai, Ryosei ; Korman, Cozzetti Matias et al. / Algorithms for computing the maximum weight region decomposable into elementary shapes. Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. 2009. pp. 1166-1174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d43f8a0ac0114ae0a33da6b0692aad61,

title = "Algorithms for computing the maximum weight region decomposable into elementary shapes",

abstract = "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.",

author = "Jinhi Jiyon and Ryosei Kasai and Korman, {Cozzetti Matias} and Takeshi Tokuyama",

year = "2009",

month = dec,

day = "1",

doi = "10.1007/978-3-642-10631-6_117",

language = "English",

isbn = "3642106307",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "1166--1174",

booktitle = "Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings",

note = "20th International Symposium on Algorithms and Computation, ISAAC 2009 ; Conference date: 16-12-2009 Through 18-12-2009",

}

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 -

Algorithms for computing the maximum weight region decomposable into elementary shapes

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this