Accelerated Compression Algorithm Based on Factoring Repeated Content

Article Preview

Abstract:

In this paper, we introduce the accelerated image compression method to reduce memory and bandwidth cost by factoring repeated content within images. Since the compression procedure costs much time to search for the similar regions, we adopt the feature descriptor Gray Split Rotate (GSR) to accelerate the self-similarity computation. The self-similarity computation is partly transformed into the comparison of the distances between feature descriptors. And we find that the computations of GSR distances of each feature descriptors are independent with each other. By the use of GPU parallel computing power, we filter out a huge amount of unmatched candidates. In our experiments we improve the speed of the compression process by one order of magnitude and meanwhile still preserve the quality of the compressed image by reducing unnecessary candidates.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 760-762)

Pages:

1972-1977

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] H Wang, Y Wexler, E Ofek, and H Hoppe, Factoring repeated content within and among images, ACM Transactions on Graphics (TOG), Vol. 27, No. 3, p.14, (2008).

DOI: 10.1145/1360612.1360613

Google Scholar

[2] Skodras, N Athanassios., A Charilaos. Christopoulos, and Ebrahimi Touradj, JPEG2000: The upcoming still image compression standard, Proceedings of the 11th Portuguese Conference on Pattern Recognition, Porto. Portugal, pp.359-366, (2000).

DOI: 10.1016/s0167-8655(01)00079-4

Google Scholar

[3] Beers, C Andrew., Agrawala Maneesh, and Chaddha Navin, Rendering from compressed textures, Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, ACM, pp.373-378, (1996).

DOI: 10.1145/237170.237276

Google Scholar

[4] Lowe, David G, Object recognition from local scale-invariant features, Computer vision, 1999, The proceedings of the seventh IEEE international conference, Ieee, Vol. 2, pp.1150-1157, (1999).

DOI: 10.1109/iccv.1999.790410

Google Scholar

[5] J Sivic, and A Zisserman, Video Google: A text retrieval approach to object matching in videos, Computer Vision, 2003, Proceedings, Ninth IEEE International Conference on. IEEE, pp.1470-1477, (2003).

DOI: 10.1109/iccv.2003.1238663

Google Scholar

[6] E Shechtman, M Irani, Matching local self-similarities across images and videos, " Computer Vision and Pattern Recognition, 2007, CVPR, 07, IEEE Conference on. IEEE, pp.1-8, (2007).

DOI: 10.1109/cvpr.2007.383198

Google Scholar

[7] V Garcia, E Debreuve, M Barlaud, Fast k nearest neighbor search using GPU, " Computer Vision and Pattern Recognition Workshops, 2008, CVPRW, 08, IEEE Computer Society Conference on. IEEE, pp.1-6, (2008).

DOI: 10.1109/cvprw.2008.4563100

Google Scholar

[8] Xusheng Zeng, Large-scale remote sensing image texture compression and spatial data integration, [D], Zhejiang University, (2011).

Google Scholar

[9] H Bay, T Tuytelaars, L Gool Van, Surf: Speeded up robust features, Computer Vision–ECCV 2006, pp.404-417, (2006).

DOI: 10.1007/11744023_32

Google Scholar

[10] J Shi, C Tomasi, Good features to track, " Computer Vision and Pattern Recognition, 1994, Proceedings CVPR, 94, 1994 IEEE Computer Society Conference on. IEEE, pp.593-600, (1994).

DOI: 10.1109/cvpr.1994.323794

Google Scholar