Factoring repeated content within and among images
Authors:
Open Access
- 1 August 2008
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 27 (3) , 1-10
Abstract
We reduce transmission bandwidth and memory space for images by factoring their repeated content. A transform map and a condensed epitome are created such that all image blocks can be reconstructed from transformed epitome patches. The transforms may include affine deformation and color scaling to account for perspective and tonal variations across the image. The factored representation allows efficient random-access through a simple indirection, and can therefore be used for real-time texture mapping without expansion in memory. Our scheme is orthogonal to traditional image compression, in the sense that the epitome is amenable to further compression such as DXT. Moreover it allows a new mode of progressivity, whereby generic features appear before unique detail. Factoring is also effective across a collection of images, particularly in the context of image-based rendering. Eliminating redundant content lets us include textures that are several times as large in the same memory space.Keywords
This publication has 23 references indexed in Scilit:
- Shape from Texture without BoundariesInternational Journal of Computer Vision, 2006
- Photo tourism2006
- Discovering Texture Regularity as a Higher-Order Correspondence Problem2006
- Near-regular texture analysis and manipulation2004
- Self-similarity based texture editing2002
- Least squares conformal maps for automatic texture atlas generation2002
- Disconnected Graph Layout and the Polyomino Packing Approach2002
- Unstructured lumigraph rendering2001
- Surface light fields for 3D photography2000
- Light field rendering1996