DocumentCode
3421818
Title
MST for lossy compression of image sets
Author
Nielsen, Clinton ; Li, Xiaobo
Author_Institution
Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.
fYear
2006
fDate
28-30 March 2006
Lastpage
463
Abstract
Summary form only given. This paper presents an algorithm for organizing and compressing groups of similar images using a minimum spanning tree (MST). Called IsMST, it supports content based image retrieval (CBIR) and facilitates better compression performance that is attained using JPEG2000 on each image individually. Preliminary experimental results show that the gains in compression and accuracy of the data organization of the data sets using IsMST are encouraging
Keywords
content-based retrieval; data compression; image coding; image retrieval; JPEG2000; content based image retrieval; data organization; image set compression; minimum spanning tree; Compression algorithms; Content based retrieval; Data structures; Histograms; Image coding; Image databases; Image retrieval; Information retrieval; Redundancy; Transform coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2006. DCC 2006. Proceedings
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
0-7695-2545-8
Type
conf
DOI
10.1109/DCC.2006.48
Filename
1607306
Link To Document