Top Document: comp.compression Frequently Asked Questions (part 2/3) Previous Document: [71] Introduction to MPEG (long) Next Document: [73] What is the theoretical compression limit? See reader questions & answers on this topic! - Help others by sharing your knowledge Preprints and software are available by anonymous ftp from the Yale Mathematics Department computer ftp://ceres.math.yale.edu/pub/wavelets/ and /pub/software/ . For source code of several wavelet coders, see item 15 in part one of this FAQ. A list of pointers, covering theory, papers, books, implementations, resources and more can be found at http://www.amara.com/current/wavelet.html#Wavelinks Bill Press of Harvard/CfA has made some things available on ftp://cfata4.harvard.edu/pub/ There is a short TeX article on wavelet theory (wavelet.tex, to be included in a future edition of Numerical Recipes), some sample wavelet code (wavelet.f, in FORTRAN - sigh), and a beta version of an astronomical image compression program which he is currently developing (FITS format data files only, in fitspress08.tar.Z). The Rice Wavelet Toolbox Release 2.0 is available in ftp://cml.rice.edu/pub/dsp/software/ and /pub/dsp/papers/ . This is a collection of MATLAB of "mfiles" and "mex" files for twoband and M-band filter bank/wavelet analysis from the DSP group and Computational Mathematics Laboratory (CML) at Rice University, Houston, TX. This release includes application code for Synthetic Aperture Radar despeckling and for deblocking of JPEG decompressed Images. Contact: Ramesh Gopinath <ramesh@rice.edu>. A wavelet transform coder construction kit is available at http://www.cs.dartmouth.edu/~gdavis/wavelet/wavelet.html Contact: Geoff Davis <gdavis@cs.dartmouth.edu> A matlab toolbox for constructing multi-scale image representations, including Laplacian pyramids, QMFs, wavelets, and steerable pyramids, is available at ftp://ftp.cis.upenn.edu/pub/eero/ Contact: Eero Simoncelli <eero.simoncelli@nyu.edu>. A mailing list dedicated to research on wavelets has been set up at the University of South Carolina. To subscribe to this mailing list, send a message with "subscribe" as the subject to wavelet@math.sc.edu. For back issues and other information, check the Wavelet Digest home page at http://www.wavelet.org/ A tutorial by M. Hilton, B. Jawerth, and A. Sengupta, entitled "Compressing Still and Moving Images with Wavelets" is available in ftp://ftp.math.sc.edu/pub/wavelet/papers/varia/tutorial/ . The files are "tutorial.ps.Z" and "fig8.ps.Z". fig8 is a comparison of JPEG and wavelet compressed images and could take several hours to print. The tutorial is also available at http://www.mathsoft.com/wavelets.html A page on wavelet-based HARC-C compression technology is available at http://www.harc.edu/HARCC.html Commercial wavelet image compression software: http://www.aware.com http://www.summus.com http://www.infinop.com Details of the wavelet transform can be found in ftp://ftp.isds.duke.edu/pub/brani/papers/ ftp://ftp.isds.duke.edu/pub/brani/papers/ A 5 minute course in wavelet transforms, by Richard Kirk <rak@crosfield.co.uk>: Do you know what a Haar transform is? Its a transform to another orthonormal space (like the DFT), but the basis functions are a set of square wave bursts like this... +--+ +------+ + | +------------------ + | +-------------- +--+ +------+ +--+ +------+ ------+ | +------------ --------------+ | + +--+ +------+ +--+ +-------------+ ------------+ | +------ + | + +--+ +-------------+ +--+ +---------------------------+ ------------------+ | + + + +--+ This is the set of functions for an 8-element 1-D Haar transform. You can probably see how to extend this to higher orders and higher dimensions yourself. This is dead easy to calculate, but it is not what is usually understood by a wavelet transform. If you look at the eight Haar functions you see we have four functions that code the highest resolution detail, two functions that code the coarser detail, one function that codes the coarser detail still, and the top function that codes the average value for the whole `image'. Haar function can be used to code images instead of the DFT. With bilevel images (such as text) the result can look better, and it is quicker to code. Flattish regions, textures, and soft edges in scanned images get a nasty `blocking' feel to them. This is obvious on hardcopy, but can be disguised on color CRTs by the effects of the shadow mask. The DCT gives more consistent results. This connects up with another bit of maths sometimes called Multispectral Image Analysis, sometimes called Image Pyramids. Suppose you want to produce a discretely sampled image from a continuous function. You would do this by effectively `scanning' the function using a sinc function [ sin(x)/x ] `aperture'. This was proved by Shannon in the `forties. You can do the same thing starting with a high resolution discretely sampled image. You can then get a whole set of images showing the edges at different resolutions by differencing the image at one resolution with another version at another resolution. If you have made this set of images properly they ought to all add together to give the original image. This is an expansion of data. Suppose you started off with a 1K*1K image. You now may have a 64*64 low resolution image plus difference images at 128*128 256*256, 512*512 and 1K*1K. Where has this extra data come from? If you look at the difference images you will see there is obviously some redundancy as most of the values are near zero. From the way we constructed the levels we know that locally the average must approach zero in all levels but the top. We could then construct a set of functions out of the sync functions at any level so that their total value at all higher levels is zero. This gives us an orthonormal set of basis functions for a transform. The transform resembles the Haar transform a bit, but has symmetric wave pulses that decay away continuously in either direction rather than square waves that cut off sharply. This transform is the wavelet transform ( got to the point at last!! ). These wavelet functions have been likened to the edge detecting functions believed to be present in the human retina. Loren I. Petrich <lip@s1.gov> adds that order 2 or 3 Daubechies discrete wavelet transforms have a speed comparable to DCT's, and usually achieve compression a factor of 2 better for the same image quality than the JPEG 8*8 DCT. (See item 25 in part 1 of this FAQ for references on fast DCT algorithms.) User Contributions:Comment about this article, ask questions, or add new information about this topic:Top Document: comp.compression Frequently Asked Questions (part 2/3) Previous Document: [71] Introduction to MPEG (long) Next Document: [73] What is the theoretical compression limit? Part1 - Part2 - Part3 - Single Page [ Usenet FAQs | Web FAQs | Documents | RFC Index ] Send corrections/additions to the FAQ Maintainer: jloup@gzip.OmitThis.org
Last Update March 27 2014 @ 02:11 PM
|
online dating services is not a newest platform but it has taken a sudden rise after the advancement in the technologies. This has revolutionised the way singles meet. With many struggles of dating in today sphere, More people these days are turning their heads towards the internet.
Even for arranged your marriage, Older dating and stuff like that, People are changing themselves and adopting the platform with all open heart and mind. Beside several advantages these platforms possess, Location and religion are the factors that set it apart. You can find your life partner from everywhere and out of any religion. These religions and castes barely matters when it comes to online dating sites.
really fast, Easy and convenient: At the first, Dating platforms might seem to be a daunting process, [url=https://charmdatescamreviews.wordpress.com/2018/03/19/charmdate-review-why-should-i-date-ukrainian-girls-how-charmdate-protects-me/]online dating ukraine[/url] But in real it is a simple and efficient process to register and connect with people all around the globe. The only thing you need to do is creating an eye catchy and appealing profile mentioning all needed details about you, Your hobbies and your fascinates. Its speedy and convenient access makes it a must have platform for those busy corporate out there.
Less pressing: This is one of the best platforms especially for the people who are shy or nervous as they can connect with people they find interesting via chats unless they get familiar enough with them to either have a verbal talk or start with dating in person. It gives you relaxed atmosphere, Where you can take out efficient time to think to understand and what you want to say to proceed ahead with the conversation.
Meet lots more people: This platform gives user a numerous choices to select from and also it is possible that you can connect with many people altogether and you can find sometimes a person who can be a great friend and a person who can be eligible to be your partner in the future time. This platform will allow you to pick the best one out of many with whom you think you can share your interests with.
add on a Deeper Level: This online site help you know a person back to front. The only appearance you have of your mate is his profile picture, Else you have to know it with the help of the chat you have with him. this can help you evaluate a person behind his face, numerous experts judge who these persons are truly are. Such dating platforms leave you unbiased to be love someone you share similar interests with.
Full Disclosure: The online dating sites allow you to specify whatever is your expectation and intention, Right right from the start so that you can find people looking for the same things and interests as of yours. The major benefit of all such platform is that it helps preventing misunderstandings and disappointments.
fee: Last but not the cheapest, Cost saving is the most appealing benefit of online dating because real life dates are expensive. You need to hangout with your partner every weekend and you further have to spend money either on food or night-life or both.
These platforms therefore gives you enable you to get to know the person well in advance through these online portals and thereafter you should spend money on real dates. different, On the very first meet even you must spend money with no surety that you will like the person as a partner or not.
I love sex. Here are my erotic photos - is.gd/bPOmnQ
I dream of hard sex! Write me - tinyurl.com/yjefe8mm
I love oral sex! Write me - is.gd/sTu2T8
I dream of hard sex! Write me - is.gd/gPWpcf
I love sex. Here are my erotic photos - tinyurl.com/yghegmr2
I want sex! Write me - is.gd/MvyEhY
I dream of hard sex! Write me - tinyurl.com/yjs64g36
If you want to meet me, I'm here - tinyurl.com/ydun3hp3
I love oral sex! Write me - tinyurl.com/ygqxenap
Do you want to see a beautiful female body? Here are my erotic photos - tinyurl.com/yhtxq5lg
I want sex! Here are my photos - is.gd/M7qBFG
I love oral sex! Write me - chilp.it/d870a00
I love sex. Write me - u.to/j-bKGw
Also, I want sex! Don't have any photos though :/
Hello, I wish for to subscribe for this webpage to get most recent updates, thus where can i do it please help out.
https://cutt.ly/x55XjOQ
Best Regards
If you want to meet me, I'm here - is.gd/CZZI2g
nice to see another human around here!