Compression of Silhouette-like Images based on WFA

dc.creatorIi.,Karel
dc.creatorValenta,Vladimir
dc.creatorKari,Jarkko
dc.date1997
dc.date.accessioned2024-02-06T12:49:05Z
dc.date.available2024-02-06T12:49:05Z
dc.descriptionWe describe a new approach to lossy compression of silhouette-like images. By a silhouette-like image we mean a bi-level image consisting of black and white regions divided by a small number of closed curves. We use a boundary detection algorithm to express the closed curves by chain codes, and we express the chains as one function of one variable. We compress this function using WFA over two letter alphabet. Finally, we use arithmetic coding to store the automaton. 1.) This work was supported by the National Science Foundation under Grant No. CCR-9417384. Preliminary version was presented in DCC 1997.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-003-10-1100
dc.identifierhttps://lib.jucs.org/article/27415/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/7234
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 3(10): 1100-1113
dc.titleCompression of Silhouette-like Images based on WFA
dc.typeResearch Article
Файлы