In EDS ansehen

Hybrid Scheme with Triangulations for Transform Coding

Gespeichert in:
Bibliographische Detailangaben
Titel: Hybrid Scheme with Triangulations for Transform Coding
Autoren: Partyk, Martin, Polec, Jaroslav, Kolingerova, Ivana
Verlagsinformationen: Radioengineering Society
Publikationsjahr: 2016
Bestand: Brno University of Technology (VUT): Digital Library / Vysoké učení technické v Brně: Digitální knihovně
Schlagwörter: Triangulation, polygonal approximation, texture ap-proximation, orthogonal transforms, image compres-sion
Beschreibung: Our approach to image region approximation offers a complete scheme consisting of several steps. We separate the encoding of region boundaries from the texture description. The original image is first segmented using an unsupervised segmentation method for color-texture regions. Following polygonal approximation of created regions causes the degradation of region boundaries. The triangulation is then applied to polygons and either all short edges, or all small triangles are filtered out from the triangular mesh. This results in new smaller regions. The encoding and decoding of polygons and triangles is very efficient, because we need to store only the vertices. For texture approximation we use 2D shape independent orthogonal transforms (e.g. DCT II). The texture is encoded with a code similar to JPEG arithmetic code. The encoding scheme proposed in this paper is much faster than latest approaches with polygonal approximation. We present the two triangulation algorithms - constrained greedy (CGT) and constrained Delaunay triangulation (CDT). Both CGT and CDT provide similar results.
Publikationsart: article in journal/newspaper
Dateibeschreibung: text; 42-45; application/pdf
Sprache: English
Relation: Radioengineering; http://www.radioeng.cz/fulltexts/2003/03_03_42_45.pdf; https://hdl.handle.net/11012/58107
Verfügbarkeit: https://hdl.handle.net/11012/58107
Rights: Creative Commons Attribution 3.0 Unported License ; http://creativecommons.org/licenses/by/3.0/ ; openAccess
Dokumentencode: edsbas.725814C2
Datenbank: BASE
Beschreibung
Abstract:Our approach to image region approximation offers a complete scheme consisting of several steps. We separate the encoding of region boundaries from the texture description. The original image is first segmented using an unsupervised segmentation method for color-texture regions. Following polygonal approximation of created regions causes the degradation of region boundaries. The triangulation is then applied to polygons and either all short edges, or all small triangles are filtered out from the triangular mesh. This results in new smaller regions. The encoding and decoding of polygons and triangles is very efficient, because we need to store only the vertices. For texture approximation we use 2D shape independent orthogonal transforms (e.g. DCT II). The texture is encoded with a code similar to JPEG arithmetic code. The encoding scheme proposed in this paper is much faster than latest approaches with polygonal approximation. We present the two triangulation algorithms - constrained greedy (CGT) and constrained Delaunay triangulation (CDT). Both CGT and CDT provide similar results.