This paper proposes a method to search over a space of parameterized kernels using a gradient-descent based method.
Kernel machines (e.g., SVM, KLDA) have shown state-of-the-art performance in several visual classification tasks. The classification performance of kernel machines greatly depends on the choice of kernels and its parameters. The authors’ method effectively learns a non-linear representation of the data useful for classification and simultaneously performs dimensionality reduction. In addition, they suggest a new matrix formulation that simplifies and unifies previous approaches. The effectiveness and robustness of the proposed algorithm is demonstrated in both synthetic and real examples of pedestrian and mouth detection in images. (Published abstract provided)
Similar Publications
- Commentary on: Alberink I, de Jongh A, Rodriguez C. Fingermark evidence evaluation based on automated fingerprint identification system matching scores: the effect of different types of conditioning on likelihood ratios. J Forensic Sci 2014; 59(1):70–81.
- The relative and joint effects of gunshot detection technology and video surveillance cameras on case clearance in Chicago
- Unmanned Aerial Systems for the Search and Documentation of Clandestine Remains