![]() |
|
#1
|
||||
|
||||
Data CompressionLets create a new arena where we can also talk about Data And File Compression........
|
|
#2
|
||||
|
||||
Re: Data CompressionI had recently studied about file compression algorithms and started to work on that for my college project ..At this time GID Forums have been really helpful to me..Now I want to put one question for all the respected viewers and members of this forum ..
Why BWT ? |
|
#3
|
||||
|
||||
Re: Data CompressionQuote:
Hey, and welcome to GID. I assume you mean the Burrows-Wheeler Transform. When writing an academic project, you probably need to work with proven and efficient algorithms (or you can prove correctnes and calculate efficiency on your own). The point is that you are expected to write a correct and "efficient" implementation. I use inverted commas because many times, a theoretically efficient algorithm, may not be so efficient in "real life" usage. BWT (or any other proved algorithm) will save you lots of time because you don't need to prove anything - someone did the job for you. It happens that BWT is also very efficient and simple (relatively) to implement Good luck, Kobi. __________________
It's actually a one time thing (it just happens alot). |
|
#4
|
|||
|
|||
Re: Data CompressionQuote:
Since it's your project, I will put a few questions to you: 1. What is the point of the project? To implement a given algorithm? To compare algorithms and select a "good" one? What? 2. Are you going to make claims for whatever method you choose (compared with other published compression algorithms)? How are you going to support the claims? (That is, do you have a data base of various types and sizes of files for which results are published or on which you can run some other algorithms?) 3. What is the criterion for "good"? Smallest compressed file size for "random" text files? Smallest size for "random" binary files (such as program object or executable files)? Smallest size for compressed video files? Fastest compression? Fastest decompression (with no penalty for slow compression)? Fastest compression and decompression? For each of these are there tradeoffs that depend on file size? (For example since the BTW works on an entire file, files larger than the memory capacity of your system must be broken into chunks and compressed separately). 4. Are you aware that GNU bzip2 is based on BWT? So you can get some prelinary results by comparing, say bzip2 with PKZIP for files such as found at this link: Compression Project By comparing timing and file sizes you may get enough preliminary information to see if it would make a good project. Sometimes it helps to know a little about where you are going to end up before you start out. On the other hand, my personal definition of research is: "Research is when you don't know what you are doing." (But if the goal of the project is graduation rather than research, I wouldn't want to spend a lot of time proving something that didn't support a previously-announced premise.) Regards, Dave |
|
#5
|
|||
|
|||
Re: Data CompressionHello .... i am doing my final year project in bwt... can any one help me how to proceed with bwt and also to add full text indexing with bwt ..... please help me
|
Recent GIDBlog
Halfway done! by crystalattice
| Thread Tools | Search this Thread |
| Rate This Thread | |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| [Include] Doubly-linked List | dsmith | C Programming Language | 6 | 14-Apr-2006 13:12 |
| Strange C++ code memory leakage problem | gaoanyu | C++ Forum | 7 | 04-Nov-2005 08:09 |
| Mrs | stacy12 | C Programming Language | 14 | 05-Feb-2005 18:02 |
| [CONTEST?]Data Structure Test | dsmith | C Programming Language | 2 | 06-Jun-2004 15:13 |
Network Sites: GIDNetwork · GIDWebHosts · GIDSearch · Learning Journal by J de Silva, The