CS-TR-3123, UMIACS-TR-93-80

Scalable Data Parallel Algorithms for Texture Synthesis and Compression using Gibbs Random Fields

This paper introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov Random Field model representation for textures, we present parallel algorithms for texture synthesis, compression, and maximum likelihood parameter estimation, currently implemented on Thinking Machines CM-2 and CM-5. Use of fine-grained, data parallel processing techniques yields real-time algorithms for texture synthesis and compression that are substantially faster than the previously known sequential implementations. Although current implementations are on Connection Machines, the methodology presented here enables machine independent scalable algorithms for a number of problems in image processing and analysis.

HTML or PostScript or Compressed PostScript Version of this report.

HTML Version of IEEE Transactions on Image Processing journal publication of this report.

University of Maryland

Department of Computer Science and Department of Electrical Engineering, and

The University of Maryland Institute for Advanced Computer Studies

For more infomation on any of the these topics, click on the hotlink.
Any queries, comments, or inquiries to:

David A. Bader (Click here for personal info!) E-mail: dbader@umiacs.umd.edu

Office phone: (301)405-6755

FAX: (301)314-9658

Return to the Experimental Parallel Algorithmics page.