Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/DCC.2006.48 | DCC |
Keywords | Field | DocType |
similar image,minimum spanning tree,lossy compression,compress group,image sets,compression performance,image retrieval,data structure,information retrieval,histograms,data compression,data structures,compression algorithms,transform coding,redundancy,jpeg2000 | Computer vision,Data structure,Lossy compression,Pattern recognition,Computer science,Image retrieval,Transform coding,Artificial intelligence,JPEG 2000,Data compression,Content-based image retrieval,Minimum spanning tree | Conference |
ISSN | ISBN | Citations |
1068-0314 | 0-7695-2545-8 | 9 |
PageRank | References | Authors |
0.78 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Clinton Nielsen | 1 | 29 | 2.45 |
| Xiaobo Li | 2 | 53 | 6.44 |