2018
DOI: 10.1007/s00371-017-1469-3
|View full text |Cite
|
Sign up to set email alerts
|

Efficient spectral reconstruction using a trichromatic camera via sample optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 34 publications
0
8
0
Order By: Relevance
“…The training set we used is 100,000 spectral image patches selected from each dataset using volume maximization strategy [13]. Applying K-svd algorithm, we learned a multispectral patch dictionary consisting of q=3000 atoms for sparse reconstruction, where each atom is a whl×1 vector.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The training set we used is 100,000 spectral image patches selected from each dataset using volume maximization strategy [13]. Applying K-svd algorithm, we learned a multispectral patch dictionary consisting of q=3000 atoms for sparse reconstruction, where each atom is a whl×1 vector.…”
Section: Resultsmentioning
confidence: 99%
“…Here spectral reconstruction is an operation that recovering spectrum at the position of each pixel from incomplete samples output from a MSFA sensor. The most widely applied solution first obtains the full resolution image of multiple channels through multispectral demosaicing [10], and then recovers spectral information of each pixel using the obtained multiple responses [11,12,13]. Recently, some works have demonstrated the great capability of sparse coding either for color demosaicing [14,15] or for spectral recovery [16].…”
Section: Introductionmentioning
confidence: 99%
“…Usually this involves both spatial and spectral interpolation, based on a transformation learned from large collections of training samples. The data redundancy problem has been addressed with different sample optimization techniques [17][18][19], with a common requirement of maximizing diversity among the selected samples. In [20], the samples are selected based on local color and texture descriptions of the neighborhood around each pixel, and the results show that including texture improves the quality of the optimized dataset.…”
Section: Related Workmentioning
confidence: 99%
“…This is achieved by adding a regularization term which calculates second derivative vectors, imposing smoothness condition for the sensitivities [8]. Li et al [19] proposed to learn an optimized training set of RGB-hyperspectral pairs and use radial basis function interpolation to infer spectrum of a given image while assuming the spectral power distributions of illumination is known.…”
Section: Related Workmentioning
confidence: 99%