J Knapman
Image and Vision Computing
A method of feature selection is presented that has linear computational complexity, and ways are shown how to use it when the type of the probability density function is unknown. There is no claim that the procedures for nonparametric probability density function estimation are applicable to any thinkable distribution, but the lower bound for the classifier performance estimation makes the presented measure applicable in most practical cases. Simulations with synthetic test data as well as references to applications with real-world data demonstrate the applicability of the measure discussed.
J Knapman
Image and Vision Computing
Jehanzeb Mirza, Leonid Karlinsky, et al.
NeurIPS 2023
Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
Diganta Misra, Muawiz Chaudhary, et al.
CVPRW 2024