Bixels: picture samples with sharp embedded boundaries

  • Authors:
  • Jack Tumblin;Prasun Choudhury

  • Affiliations:
  • Department of Computer Science, Northwestern University, Evanston, IL;Department of Computer Science, Northwestern University, Evanston, IL

  • Venue:
  • EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Pixels store a digital image as a grid of point samples that can reconstruct a limited-bandwidth continuous 2-D source image. Although convenient for anti-aliased display, these bandwidth limits irreversibly discard important visual boundary information that is difficult or impossible to accurately recover from pixels alone. We propose bixels instead: they also store a digital image as a grid of point samples, but each sample keeps 8 extra bits to set embedded geometric boundaries that are infinitely sharp, more accurately placed, and directly machine-readable. Bixels represent images as piecewise-continuous, with discontinuous intensities and gradients at boundaries that form planar graphs. They reversibly combine vector and raster image features, decouple boundary sharpness from the number of samples used to store them, and do not mix unrelated but adjacent image contents, e.g blue sky and green leaf. Bixels are meant to be compatible with pixels. A bixel is a image sample point with an 8 bit code for local boundaries. We describe a boundary-switched bilinear filter kernel for bixel reconstruction and pre-filtering to find bixel samples, a bixels-to-pixels conversion method for display, and an iterative method to combine pixels and given boundaries to make bixels. We discuss applications in texture synthesis, matting and compositing. We demonstrate sharpness-preserving enlargement, warping and bixels-to-pixels conversion with example images.