| bibtype |
C -
Conference Paper (international conference)
|
| ARLID |
0468204 |
| utime |
20240103213252.5 |
| mtime |
20170103235959.9 |
| SCOPUS |
85011097258 |
| WOS |
000391534900037 |
| DOI |
10.1109/DICTA.2016.7797028 |
| title
(primary) (eng) |
Decomposition of 3D Binary Objects into Rectangular Blocks |
| specification |
| page_count |
8 s. |
| media_type |
P |
|
| serial |
| ARLID |
cav_un_epca*0468203 |
| ISBN |
978-1-5090-2897-9 |
| title
|
Digital Image Computing: Techniques and Applications (DICTA) 2016 |
| publisher |
| place |
Piscataway |
| name |
IEEE |
| year |
2016 |
|
|
| keyword |
Algorithm design and analysis |
| keyword |
Particle separators |
| keyword |
Image coding |
| author
(primary) |
| ARLID |
cav_un_auth*0282545 |
| name1 |
Höschl |
| name2 |
Cyril |
| 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 |
| country |
CZ |
| 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 |
| ARLID |
cav_un_auth*0314467 |
| project_id |
GA15-16928S |
| 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 polynomial sub-optimal approximation, which transforms the decomposition problem onto a graph-theoretical problem. We show by extensive experiments that the proposed method outperforms the the octree decomposition in terms of the number of blocks on statistically significant level. We also discuss potential applications of the method in image processing. |
| action |
| ARLID |
cav_un_auth*0340227 |
| name |
DICTA 2016 : Digital Image Computing: Techniques and Applications |
| dates |
20161130 |
| mrcbC20-s |
20161202 |
| place |
Gold Coast |
| country |
AU |
|
| RIV |
JD |
| reportyear |
2017 |
| num_of_auth |
2 |
| presentation_type |
PR |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0266053 |
| mrcbC61 |
1 |
| confidential |
S |
| mrcbC86 |
3+4 Proceedings Paper Computer Science Theory Methods|Engineering Electrical Electronic|Imaging Science Photographic Technology |
| arlyear |
2016 |
| mrcbU14 |
85011097258 SCOPUS |
| mrcbU24 |
PUBMED |
| mrcbU34 |
000391534900037 WOS |
| mrcbU63 |
cav_un_epca*0468203 Digital Image Computing: Techniques and Applications (DICTA) 2016 978-1-5090-2897-9 Piscataway IEEE 2016 |
|