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
- Enhancing Fault Ride-Through Capacity of DFIG-Based WPs by Adaptive Backstepping Command Using Parametric Estimation in Non-Linear Forward Power Controller Design
- Research in Brief: Three-City Evaluation of Gunshot Detection Technology
- Simultaneous Imaging of Latent Fingermarks and Detection of Analytes of Forensic Relevance by Laser Ablation Direct Analysis in Real Time Imaging-Mass Spectrometry (LADI-MS)