Refining image compression with weighted finite automata

被引：9
|
作者：
Hafner, U [1 ]
机构：
[1] UNIV WURZBURG,LEHRSTUHL INFORMAT 2,W-8700 WURZBURG,GERMANY
来源：
DCC '96 - DATA COMPRESSION CONFERENCE, PROCEEDINGS | 1996年
关键词：
D O I：
10.1109/DCC.1996.488341
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：359 / 368
页数：10
相关论文
共 50 条
  • [31] Fragile and semi-fragile colour image authentication using weighted finite automata
    Nawito, Hussein
    El Din, Sherif Nour
    Fakhr, Waleed
    Moniri, M.
    [J]. 2007 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING & SYSTEMS: ICCES '07, 2007, : 179 - +
  • [32] Evolutionary Cellular Automata for image compression
    Martínez, HJ
    Moreno, JA
    [J]. CELLULAR AUTOMATA: RESEARCH TOWARDS INDUSTRY, 1998, : 117 - 126
  • [33] Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
    Droste, Manfred
    FillOp, Zoltan
    Koszo, David
    Vogler, Heiko
    [J]. THEORETICAL COMPUTER SCIENCE, 2022, 919 : 118 - 143
  • [34] On generalizations of weighted finite automata and graphics applications
    Albert, Juergen
    Tischler, German
    [J]. ALGEBRAIC INFORMATICS, 2007, 4728 : 1 - 22
  • [35] Linear encoding scheme for weighted finite automata
    Giraud, M
    Lavenier, D
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2005, 3317 : 146 - 155
  • [36] From regular weighted expressions to finite automata
    Champarnaud, JM
    Laugerotte, É
    Ouardi, F
    Ziadi, D
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2003, 2759 : 49 - 60
  • [37] REPRESENTATION OF LINEAR AUTOMATA BY THE FINITE WEIGHTED GRAPH
    GABBASOV, NZ
    [J]. IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII MATEMATIKA, 1985, (07): : 68 - 70
  • [38] From regular weighted expressions to finite automata
    Champarnaud, JM
    Laugerotte, É
    Ouardi, F
    Ziadi, D
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2004, 15 (05) : 687 - 700
  • [39] On Finite and Polynomial Ambiguity of Weighted Tree Automata
    Paul, Erik
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016, 2016, 9840 : 368 - 379
  • [40] Approximating Probabilistic Models as Weighted Finite Automata
    Suresh, Ananda Theertha
    Roark, Brian
    Riley, Michael
    Schogol, Vlad
    [J]. COMPUTATIONAL LINGUISTICS, 2021, 47 (02) : 221 - 254
12345