Open AccessPosted Content
Task-specific multispectral band selection
Sebastian J. Wirkert,Fabian Isensee,Fabian Isensee,Anant Vemuri,Leonardo Ayala,Klaus H. Maier-Hein,Baowei Fei,Lena Maier-Hein +7 more
TL;DR: The investigated domain adaptation technique, which only requires unannotated in vivo measurements yielded better results than the pure in silico band selection method, and could guide development of novel and fast multispectral imaging systems suited for interventional use without relying on complex hardware setups or manually labeled data.
read more
Abstract: Multispectral imaging provides valuable information on tissue composition such as hemoglobin oxygen saturation. However, the real-time application of this technique in interventional medicine can be challenging because the acquisition time of large amount of hyperspectral data with hundreds of bands can be long. This challenge can partially be addressed by choosing a discriminative subset of bands. The band selection methods proposed to date are mainly based on the availability of often hard to obtain reference measurements. We address this bottleneck with a new approach to band selection that leverages highly accurate Monte Carlo simulations. We hypothesize that a so chosen small subset of bands can reproduce or even improve upon the results of a quasi continuous spectral measurement. We further investigate whether novel domain adaptation techniques can address the inevitable domain shift stemming from the use of simulations. Initial results based on in silico and in vivo experiments suggest that 10-20 bands are sufficient to closely reproduce results from 101 band spectral measurement in the 500-700nm range, depending on the experiment. The investigated domain adaptation technique, which only requires unannotated in vivo measurements yielded better results than the pure in silico band selection method. Overall, our method could guide development of novel and fast multispectral imaging systems suited for interventional use without relying on complex hardware setups or manually labeled data.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Conditional Infomax Learning : An Integrated Framework for Feature Extraction and Fusion
Dahua Lin,Xiaoou Tang +1 more
TL;DR: A new framework for feature learning in classification motivated by information theory is introduced where a novel concept called class-relevant redundancy is introduced and a new algorithm called Conditional Informative Feature Extraction is formulated, which maximizes the jointclass-relevant information by explicitly reducing the class- relevant redundancies among features.
References
A Survey on Transfer Learning
Sinno Jialin Pan,Qiang Yang +1 more
TL;DR: The relationship between transfer learning and other related machine learning techniques such as domain adaptation, multitask learning and sample selection bias, as well as covariate shift are discussed.
An introduction to variable and feature selection
Isabelle Guyon,André Elisseeff +1 more
TL;DR: The contributions of this special issue cover a wide range of aspects of variable selection: providing a better definition of the objective function, feature construction, feature ranking, multivariate feature selection, efficient search methods, and feature validity assessment methods.
Wrappers for feature subset selection
Ron Kohavi,George H. John +1 more
TL;DR: The wrapper method searches for an optimal feature subset tailored to a particular algorithm and a domain and compares the wrapper approach to induction without feature subset selection and to Relief, a filter approach tofeature subset selection.
9.6K
•Proceedings Article
Random Features for Large-Scale Kernel Machines
Ali Rahimi,Benjamin Recht +1 more
- 03 Dec 2007
TL;DR: Two sets of random features are explored, provided convergence bounds on their ability to approximate various radial basis kernels, and it is shown that in large-scale classification and regression tasks linear machine learning algorithms applied to these features outperform state-of-the-art large- scale kernel machines.
Estimating mutual information.
TL;DR: Two classes of improved estimators for mutual information M(X,Y), from samples of random points distributed according to some joint probability density mu(x,y), based on entropy estimates from k -nearest neighbor distances are presented.
4.2K