1 / 10

Finite State Automata a s Data Storage

Finite State Automata a s Data Storage. {marian.mindek, martin.hynar}@vsb.cz Dateso 2005. Content. - Motivation - Finite automata (data access) - Compression and interesting information Data storage Tests - Conclusion. VŠB - TU Ostrava FEI. Finite State Automata as Data Storage.

illias
Télécharger la présentation

Finite State Automata a s Data Storage

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Finite State Automata asData Storage {marian.mindek, martin.hynar}@vsb.cz Dateso 2005

  2. Content - Motivation - Finite automata (data access) - Compression and interesting information Data storage Tests - Conclusion VŠB - TU Ostrava FEI Finite State Automata as Data Storage

  3. Motivation • Space- Speed • Interesting information VŠB - TU Ostrava FEI Finite State Automata as Data Storage

  4. image 1 image 2 Motivation 2 • Searching VŠB - TU Ostrava FEI Finite State Automata as Data Storage

  5. Finite automata (data access) 3203 1101 - Address of sub-square -  = {0,1,2,3};  = {0,1}; … - Multiresolution image - L * - example: {1,2} * 2{1,2} * VŠB - TU Ostrava FEI Finite State Automata as Data Storage

  6. Compression - 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=0 2. Create state 0 and assign u0=I, define average grayness of image I 3. Assume ui=Iw. Process state i, that is fork=0,1,2,3 do:If Iwk=uq (with E) orIwkcan be expressed (expanded, flipped, rotated, …) as a part of image uqfor 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 VŠB - TU Ostrava FEI Finite State Automata as Data Storage

  7. Data storage VŠB - TU Ostrava FEI Finite State Automata as Data Storage

  8. Tests VŠB - TU Ostrava FEI Finite State Automata as Data Storage

  9. Tests 2 VŠB - TU Ostrava FEI Finite State Automata as Data Storage

  10. Layered oriented approach • Generalsolution • Better structure Conclusion Thank you {marian.mindek, matin.hynar}@vsb.cz VŠB - TU Ostrava FEI Finite State Automata as Data Storage

More Related