MST for Lossy Compression of Image Sets

Snowbird, Utah March 28-March 30

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/DCC.2006.48

Data Compression Conference (DCC'06)

	This Article
	PURCHASE ARTICLE: $0 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Clinton Nielsen Articles by Xiaobo Li

	ASCII Text	x
	Clinton Nielsen, Xiaobo Li, "MST for Lossy Compression of Image Sets," Data Compression Conference, pp. 463, Data Compression Conference (DCC'06), 2006.

	BibTex	x
	@article{ 10.1109/DCC.2006.48, author = {Clinton Nielsen and Xiaobo Li}, title = {MST for Lossy Compression of Image Sets}, journal ={Data Compression Conference}, volume = {0}, year = {2006}, issn = {1068-0314}, pages = {463}, doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2006.48}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Compression Conference TI - MST for Lossy Compression of Image Sets SN - 1068-0314 SP EP A1 - Clinton Nielsen, A1 - Xiaobo Li, PY - 2006 KW - null VL - 0 JA - Data Compression Conference ER -

Clinton Nielsen, The University of Alberta, Canada

Xiaobo Li, The University of Alberta, Canada

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.