Sciweavers

35 search results - page 2 / 7
» Improving the Performance of Hyperspectral Image and Signal ...
Sort
View
ICASSP
2011
IEEE
12 years 8 months ago
Low-complexity predictive lossy compression of hyperspectral and ultraspectral images
Lossy compression of hyperspectral and ultraspectral images is traditionally performed using 3D transform coding. This approach yields good performance, but its complexity and mem...
Andrea Abrardo, Mauro Barni, Enrico Magli
ICASSP
2011
IEEE
12 years 8 months ago
Variational methods for spectral unmixing of hyperspectral images
This paper studies a variational Bayesian unmixing algorithm for hyperspectral images based on the standard linear mixing model. Each pixel of the image is modeled as a linear com...
Olivier Eches, Nicolas Dobigeon, Jean-Yves Tourner...
SBCCI
2003
ACM
129views VLSI» more  SBCCI 2003»
13 years 10 months ago
Hyperspectral Images Clustering on Reconfigurable Hardware Using the K-Means Algorithm
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
Abel Guilhermino S. Filho, Alejandro César ...
ICASSP
2009
IEEE
13 years 2 months ago
A differential motion estimation method for image interpolation in distributed video coding
Motion estimation methods based on differential techniques proved to be very useful in the context of video analysis, but have a limited employment in classical video compression ...
Marco Cagnazzo, Thomas Maugey, Béatrice Pes...
JPDC
2006
134views more  JPDC 2006»
13 years 4 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong