10
Finite State Automata as Data Storage {marian.mindek, martin.hynar}@vsb.cz Dateso 2005
Finite State Automata as Data Storage
{marian.mindek, martin.hynar}@vsb.cz
Dateso 2005
- Motivation
- Finite automata (data access)
- Compression and interesting information
- Data storage
- Tests
- Conclusion
Content
VŠB - TUOstrava
FEIFinite State Automata as Data Storage
Motivation
VŠB - TUOstrava
FEI
- Space- Speed- Interesting information
Finite State Automata as Data Storage
2 2 2 2 2 2 2 2 2 2 ... 2
2 2 3 3 3 3 3 3 3 2 ... 2
2 2 3 4 4 4 4 4 3 2 ... 2
2 2 3 4 5 5 5 4 3 2 ... 2
2 2 3 4 5 6 4 4 3 2 ... 2
2 2 3 4 5 5 5 4 3 2 ... 2
2 2 3 4 4 4 4 4 3 2 ... 2
2 2 3 3 3 3 3 3 3 2 ... 2
2 2 2 2 2 2 2 2 2 2 ... 2
Motivation 2
VŠB - TUOstrava
FEIFinite State Automata as Data Storage
image 1
image 2
- Searching
- Address of sub-square
- = {0,1,2,3}; = {0,1}; … - Multiresolution image - L *
- example: {1,2} *
2{1,2} *
Finite automata (data access)
VŠB - TUOstrava
FEIFinite State Automata as Data Storage
3203 1101
- Procedure Construct Automaton for Compression
For given image I, we denote Iw the zoomed part of I in the square addressed w. The image represented by state number x is denoted by ux.1. i=j=02. Create state 0 and assign u0=I, define average grayness of image I3. Assume ui=Iw. Process state i, that is for k=0,1,2,3 do: If Iwk=uq (with E) or Iwk can be expressed (expanded, flipped, rotated, …) as a part of image uq for some state q, or some state in another automaton, then create an edge labeled k from state i to state q; otherwise assign j=j+1, uj=Iwk, and create an edge labeled k from state i to the new state j,4. if i=j, that is all states have been processed, stop; otherwise i=i+1, go to 3.
- Procedure Reconstruct Image
Compression
VŠB - TUOstrava
FEIFinite State Automata as Data Storage
2 2 2 2 2 2 2 2 2 2 ... 2
2 2 3 3 3 3 3 3 3 2 ... 2
2 2 3 4 4 4 4 4 3 2 ... 2
2 2 3 4 5 5 5 4 3 2 ... 2
2 2 3 4 5 6 4 4 3 2 ... 2
2 2 3 4 5 5 5 4 3 2 ... 2
2 2 3 4 4 4 4 4 3 2 ... 2
... … … … … … … … … … ... …
2 2 2 2 2 2 2 2 2 2 ... 2
Data storage
VŠB - TUOstrava
FEIFinite State Automata as Data Storage
Tests
VŠB - TUOstrava
FEIFinite State Automata as Data Storage
Tests 2
VŠB - TUOstrava
FEIFinite State Automata as Data Storage
Conclusion
VŠB - TUOstrava
FEI
Thank you {marian.mindek, matin.hynar}@vsb.cz
- Layered oriented approach
- General solution
- Better structure
Finite State Automata as Data Storage
