bibtype |
J -
Journal Article
|
ARLID |
0381722 |
utime |
20240103201333.5 |
mtime |
20121030235959.9 |
WOS |
000308271000018 |
SCOPUS |
84864289216 |
DOI |
10.1016/j.patcog.2012.05.012 |
title
(primary) (eng) |
Decomposition of Binary images - A Survey and Comparison |
specification |
|
serial |
ARLID |
cav_un_epca*0257388 |
ISSN |
0031-3203 |
title
|
Pattern Recognition |
volume_id |
45 |
volume |
12 (2012) |
page_num |
4279-4291 |
publisher |
|
|
keyword |
Binary image decomposition |
keyword |
Bipartite graph |
keyword |
Image compression |
keyword |
Moment computation |
author
(primary) |
ARLID |
cav_un_auth*0101203 |
name1 |
Suk |
name2 |
Tomáš |
full_dept (cz) |
Zpracování obrazové informace |
full_dept (eng) |
Department of Image Processing |
department (cz) |
ZOI |
department (eng) |
ZOI |
institution |
UTIA-B |
full_dept |
Department of Image Processing |
fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
author
|
ARLID |
cav_un_auth*0282545 |
name1 |
Höschl |
name2 |
Cyril |
full_dept (cz) |
Zpracování obrazové informace |
full_dept |
Department of Image Processing |
department (cz) |
ZOI |
department |
ZOI |
institution |
UTIA-B |
full_dept |
Department of Image Processing |
fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
author
|
ARLID |
cav_un_auth*0101087 |
name1 |
Flusser |
name2 |
Jan |
full_dept (cz) |
Zpracování obrazové informace |
full_dept |
Department of Image Processing |
department (cz) |
ZOI |
department |
ZOI |
institution |
UTIA-B |
full_dept |
Department of Image Processing |
fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
source |
|
cas_special |
project |
project_id |
GAP103/11/1552 |
agency |
GA ČR |
ARLID |
cav_un_auth*0273618 |
|
abstract
(eng) |
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. |
reportyear |
2013 |
RIV |
JD |
num_of_auth |
3 |
mrcbC52 |
4 A 4a 20231122135233.8 |
inst_support |
RVO:67985556 |
permalink |
http://hdl.handle.net/11104/0212128 |
mrcbT16-e |
COMPUTERSCIENCEARTIFICIALINTELLIGENCE|ENGINEERINGELECTRICALELECTRONIC |
mrcbT16-f |
3.219 |
mrcbT16-g |
0.453 |
mrcbT16-h |
7.3 |
mrcbT16-i |
0.03232 |
mrcbT16-j |
1.223 |
mrcbT16-k |
13229 |
mrcbT16-l |
364 |
mrcbT16-q |
108 |
mrcbT16-s |
1.238 |
mrcbT16-y |
38.81 |
mrcbT16-x |
4.22 |
mrcbT16-4 |
Q1 |
mrcbT16-B |
85.863 |
mrcbT16-C |
87.397 |
mrcbT16-D |
Q1 |
mrcbT16-E |
Q1 |
arlyear |
2012 |
mrcbTft |
\nSoubory v repozitáři: suk-0381722.pdf |
mrcbU14 |
84864289216 SCOPUS |
mrcbU34 |
000308271000018 WOS |
mrcbU63 |
cav_un_epca*0257388 Pattern Recognition 0031-3203 1873-5142 Roč. 45 č. 12 2012 4279 4291 Elsevier |
|