Against Expectations: A Simple Greedy Heuristic Outperforms Advanced Methods in Bitmap Decomposition
Publiceringsår
2025
Upphovspersoner
Pitkäkangas, Ville
Abstrakt
Partitioning rectangular and rectilinear shapes in n-dimensional binary images into the smallest set of axis-aligned n-cuboids is a fundamental problem in image analysis, pattern recognition, and computational geometry, with applications in object detection, shape simplification, and data compression. This paper introduces and evaluates four deterministic decomposition methods: pure greedy selection, greedy with backtracking, greedy with a priority queue, and an iterative integer linear programming (IILP) approach. These methods are benchmarked against three established baseline techniques across 13 diverse 1D–4D images (up to 8 × 8 × 8 × 8 elements), featuring holes, concavities, and varying orientations. Surprisingly, the simplest approach—a purely greedy heuristic selecting the largest unvisited region at each step—consistently achieved optimal or near-optimal decompositions, even for complex images, and maintained optimality under rotation without post-processing. By contrast, the more sophisticated methods (backtracking, prioritization, and IILP) exhibited trade-offs between speed and quality, with IILP adding overhead without superior results. Runtime testing showed IILP was on average ~37× slower than the fastest greedy method (ranging from ~3× to 100× slower). These findings highlight that a well-designed greedy strategy can outperform more complex algorithms for practical binary shape decomposition, offering a compelling balance between computational efficiency and solution quality in pattern recognition and image analysis.
Visa merOrganisationer och upphovspersoner
Publikationstyp
Publikationsform
Artikel
Moderpublikationens typ
Tidning
Artikelstyp
En originalartikel
Målgrupp
VetenskapligKollegialt utvärderad
Kollegialt utvärderadUKM:s publikationstyp
A1 Originalartikel i en vetenskaplig tidskriftPublikationskanalens uppgifter
Journal
Förläggare
Volym
14
Nummer
13
Artikelnummer
2615
ISSN
Publikationsforum
Publikationsforumsnivå
0
Öppen tillgång
Öppen tillgänglighet i förläggarens tjänst
Ja
Öppen tillgång till publikationskanalen
Helt öppen publikationskanal
Licens för förläggarens version
CC BY
Parallellsparad
Nej
Övriga uppgifter
Vetenskapsområden
Matematik; El-, automations- och telekommunikationsteknik, elektronik
Nyckelord
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Publiceringsland
Schweiz
Förlagets internationalitet
Internationell
Språk
engelska
Internationell sampublikation
Nej
Sampublikation med ett företag
Nej
DOI
10.3390/electronics14132615
Publikationen ingår i undervisnings- och kulturministeriets datainsamling
Ja