ACM Home Page
Please provide us with feedback. Feedback
Factoring repeated content within and among images
Full text MovMov (25:48),  PdfPdf (12.79 MB)
Source
ACM Transactions on Graphics (TOG) archive
Volume 27 ,  Issue 3  (August 2008) table of contents
Proceedings of ACM SIGGRAPH 2008
SESSION: Image collections and video table of contents
Article No. 14  
Year of Publication: 2008
ISSN:0730-0301
Also published in ...
Authors
Huamin Wang  Georgia Tech
Yonatan Wexler  Microsoft Corporation
Eyal Ofek  Microsoft Corporation
Hugues Hoppe  Microsoft Research
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 48,   Downloads (12 Months): 738,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1360612.1360613
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Ahuja N., and Todorovic S. 2007. Extracting texels in 2.1D natural textures. ICCV.
2
3
 
4
5
6
 
7
Dabov K., Foi A., Katkovnik V., and Egiazarian K. 2007. Image denoising by sparse 3D transform-domain collaborative filtering. IEEE Transactions on Image Processing, 16, 8.
 
8
 
9
 
10
 
11
Hays J., Leordeanu M., Efros A., and Liu Y. 2006. Discovering texture regularity as a higher-order correspondence problem. ECCV.
 
12
 
13
Kannan A., Winn J., and Rother C. 2006. Clustering appearance and shape by learning jigsaws. NIPS.
 
14
15
16
17
 
18
19
 
20
Lucas B., and Kanade T. 1981. An iterative image registration technique with an application to stereo vision. Proceedings of Imaging Understanding Workshop.
 
21
McCabe D., and Brothers J. 1998. DirectX 6 texture map compression. Game Developer, 42--46.
22
23
 
24
Shi J., and Tomasi C. 1994. Good features to track. CVPR.
25
26
 
27


Collaborative Colleagues:
Huamin Wang: colleagues
Yonatan Wexler: colleagues
Eyal Ofek: colleagues
Hugues Hoppe: colleagues