John M. Danskin

Learn More
We examine various simple algorithms that exploit homogeneity and accumulate2 opacity for tracing rays through shaded volumes. Most of these methods have error criteria which allow them to trade quality for speed. The time vs. quality tradeoff for these adaptive methods is compared to fixed step multiresolution methods. These methods are also useful for(More)
Images are usually transmitted across the Internet using a lossless protocol such as TCP/IP. Lossless protocols require retransmission of lost packets, which substantially increases transmission time. We introduce a fast lossy Internet image transmission scheme (FLIIT) for compressed images which uses forward error correction to eliminate retransmission(More)
Network bandwidth has always been a key issue for multimedia protocols. Many potential users of networked multimedia protocols will continue to have low bandwidth network connections for some time: copper wire ISDN, infra-red, cellular modems, etc.. Compression provides potential relief for users of slow networks by increasing effective bandwidth. Higher(More)
Pattern-matching based document compression systems rely on finding a small set of patterns that can be used to represent all of the ink in the document. Finding an optimal set of patterns is NP-hard; previous compression schemes have resorted to heuristics. We extend the cross-entropy approach, used previously for measuring pattern similarity, to this(More)
The Xremote protocol is a compressed transformation of the XWindow System protocol, designed to e ciently implement X connections across relatively slow serial lines. Using an Xremote simulator and 11 traces of X sessions, we found that Xremote's overall compression ratio is 2.4:1. This gure varies widely depending on the trace. A study of compression ratio(More)