high-resolution hyperspectral imaging via matrix factorization
DESCRIPTION
High-resolution Hyperspectral Imaging via Matrix Factorization. Rei Kawakami 1 John Wright 2 Yu-Wing Tai 3 Yasuyuki Matsushita 2 Moshe Ben-Ezra 2 Katsushi Ikeuchi 3 1 University of Tokyo, 2 Microsoft Research Asia (MSRA), 3 Korea Advanced Institute of Science and Technology (KAIST) - PowerPoint PPT PresentationTRANSCRIPT
High-resolution Hyperspectral Imaging via Matrix Factorization
Rei Kawakami1 John Wright2 Yu-Wing Tai3 Yasuyuki Matsushita2 Moshe Ben-Ezra2 Katsushi Ikeuchi3
1University of Tokyo, 2Microsoft Research Asia (MSRA), 3Korea Advanced Institute of Science and Technology (KAIST)
CVPR 11
Representation: Basis function
W (Image width)
H (Image height)
S
𝒁
= …
01.00…0
= +x 0 x 1.0 x 0 x 0++
Two-step approach
1. Estimate basis functions from hyperspectral image
2. For each pixel in high-res RGB image, estimate coefficients for the basis functions
1: Limited number of materials
Sparse vector
For all pixel (i,j)
Sparse matrix
W (Image width)
H (Image height)
S
= …
00.40…
0.6
𝒀 h𝑠
• At each pixel of , only a few () materials are present
2: Sparsity in high-res image
W
H
S
Sparse coefficients
𝒀 𝑟𝑔𝑏
�̂� (𝑖 , 𝑗 )=argmin‖𝒉‖1subject ¿‖𝒀 𝑟𝑔𝑏 (𝑖 , 𝑗 ,∗ )−𝒫𝑟𝑔𝑏 𝑨𝒉‖2≤𝜀
𝒀 𝑟𝑔𝑏 (𝑖 , 𝑗 ,∗ )=𝒫𝑟𝑔𝑏𝑨𝒉(𝑖 , 𝑗)
Reconstruction
Error images of Global PCA with back-projection
Error images of local window with back-projection
Error images of RGB clustering with back-projection
Summary•Method to reconstruct high-resolution
hyperspectral image from ▫Low-res hyperspectral camera▫High-res RGB camera
•Spatial sparsity of hyperspectral input▫Search for a factorization of the input into
basis functions set of maximally sparse coefficients