| bibtype |
J -
Journal Article
|
| ARLID |
0518087 |
| utime |
20240903170644.3 |
| mtime |
20191217235959.9 |
| WOS |
000509991200001 |
| SCOPUS |
85079682794 |
| DOI |
10.14736/kyb-2019-5-0755 |
| title
(primary) (eng) |
CLOSE-TO-OPTIMAL ALGORITHM FOR RECTANGULAR DECOMPOSITION OF 3D SHAPES |
| specification |
| page_count |
27 s. |
| media_type |
P |
|
| serial |
| ARLID |
cav_un_epca*0297163 |
| ISSN |
0023-5954 |
| title
|
Kybernetika |
| volume_id |
55 |
| volume |
5 (2019) |
| page_num |
755-781 |
| publisher |
| name |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
|
| keyword |
3D binary object |
| keyword |
voxels |
| keyword |
decomposition |
| author
(primary) |
| ARLID |
cav_un_auth*0282545 |
| name1 |
Höschl |
| name2 |
Cyril |
| institution |
UTIA-B |
| full_dept (cz) |
Zpracování obrazové informace |
| full_dept (eng) |
Department of Image Processing |
| department (cz) |
ZOI |
| department (eng) |
ZOI |
| full_dept |
Department of Image Processing |
| country |
CZ |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| author
|
| ARLID |
cav_un_auth*0101087 |
| name1 |
Flusser |
| name2 |
Jan |
| institution |
UTIA-B |
| full_dept (cz) |
Zpracování obrazové informace |
| full_dept |
Department of Image Processing |
| department (cz) |
ZOI |
| department |
ZOI |
| full_dept |
Department of Image Processing |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| source |
|
| source |
|
| cas_special |
| project |
| ARLID |
cav_un_auth*0360229 |
| project_id |
GA18-07247S |
| agency |
GA ČR |
|
| abstract
(eng) |
In this paper, we propose a novel algorithm for a decomposition of 3D binary shapes to rectangular blocks. The aim is to minimize the number of blocks. Theoretically optimal brute-force algorithm is known to be NP-hard and practically infeasible. We introduce its suboptimal polynomial heuristic approximation, which transforms the decomposition problem onto a graph-theoretical problem. We compare its performance with the state of the art Octree and Delta methods. We show by extensive experiments that the proposed method outperforms the existing ones in terms of the number of blocks on statistically signifficant level. We also discuss potential applications of the method in image processing. |
| result_subspec |
WOS |
| RIV |
JD |
| FORD0 |
10000 |
| FORD1 |
10200 |
| FORD2 |
10201 |
| reportyear |
2020 |
| num_of_auth |
2 |
| mrcbC52 |
4 A hod sml 4ah 4as 20231122144550.7 |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0303985 |
| mrcbC64 |
1 Department of Image Processing UTIA-B 10200 COMPUTER SCIENCE, THEORY & METHODS |
| confidential |
S |
| contract |
| name |
Copyright Form |
| date |
20190512 |
|
| mrcbC86 |
3+4 Article Computer Science Cybernetics |
| mrcbC91 |
A |
| mrcbT16-e |
COMPUTERSCIENCECYBERNETICS |
| mrcbT16-j |
0.215 |
| mrcbT16-s |
0.241 |
| mrcbT16-B |
15.751 |
| mrcbT16-D |
Q4 |
| mrcbT16-E |
Q4 |
| arlyear |
2019 |
| mrcbTft |
\nSoubory v repozitáři: flusser-0518087.pdf, flusser-0518087-CopyrightForm5004.pdf |
| mrcbU14 |
85079682794 SCOPUS |
| mrcbU24 |
PUBMED |
| mrcbU34 |
000509991200001 WOS |
| mrcbU63 |
cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 55 č. 5 2019 755 781 Ústav teorie informace a automatizace AV ČR, v. v. i. |
|