0381722 20240103201333.520121030235959.9 000308271000018 84864289216 10.1016/j.patcog.2012.05.012 13 s. cav_un_epca*02573880031-32034512 (2012)4279-4291Elsevier Binary image decomposition Bipartite graph Image compression Moment computation cav_un_auth*0101203 Suk Tomáš Zpracování obrazové informace Department of Image Processing ZOI ZOI UTIA-B Department of Image Processing Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0282545 Höschl Cyril Zpracování obrazové informace Department of Image Processing ZOI ZOI UTIA-B Department of Image Processing Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0101087 Flusser Jan Zpracování obrazové informace Department of Image Processing ZOI ZOI UTIA-B Department of Image Processing Ústav teorie informace a automatizace AV ČR, v. v. i. http://library.utia.cas.cz/separaty/2012/ZOI/suk-0381722.pdf GAP103/11/1552 GA ČR cav_un_auth*0273618 We present an overview of the most important methods that decompose an arbitrary binary object into a union of rectangles. We describe a run-length encoding and its generalization, decompositions based on quadtrees, on mathematical morphology, on the distance transform, and a theoretically optimal decomposition based on a maximal matching in bipartite graphs. 2013 JD 3 4 A 4a 20231122135233.8 RVO:67985556 http://hdl.handle.net/11104/0212128 COMPUTERSCIENCEARTIFICIALINTELLIGENCE|ENGINEERINGELECTRICALELECTRONIC 3.219 0.453 7.3 0.03232 1.223 13229 364 108 1.238 38.81 4.22 Q1 85.863 87.397 Q1 Q1 2012 Soubory v repozitáři: suk-0381722.pdf 84864289216 SCOPUS 000308271000018 WOS cav_un_epca*0257388 Pattern Recognition 0031-3203 1873-5142 Roč. 45 č. 12 2012 4279 4291 Elsevier