Data Compression Conference (DCC'06) Snowbird, Utah March 28-March 30 ISBN: 0-7695-2545-8
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2006.48
We propose an algorithm (IsMST) to organise and compress groups of similar images using a Minimum Spanning Tree (MST). This data structure supports Content Based Image Retrieval (CBIR) and also facilitates a better compression performance than is attained using JPEG2000 on each image individually.
Citation:
Clinton Nielsen, Xiaobo Li, "MST for Lossy Compression of Image Sets," dcc, pp.463, Data Compression Conference (DCC'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||