A variant of \(k\)-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing

DOI10.1016/J.DAM.2015.02.011zbMath1329.68272OpenAlexW2019228674MaRDI QIDQ499379

Humberto J. Longo, Jorge P. de Morais Neto, Les R. Foulds, Wellington S. Martins, Hugo A. D. Do Nascimento

Publication date: 30 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.02.011

zbMATH Keywords

image processingfast Fourier transformparallel computingcirculant matrix\(k\)-nearest neighborsrotation-invariance

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10)

Related Items (1)

Preface

Uses Software

• FFTW
• SIFT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation- and space-efficient implementation of SSA
• Support-vector networks
• Theoretical foundations of the potential function method in pattern recognition learning
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Support Vector Machines
• Multidimensional binary search trees used for associative searching
• Enhanced Shift and Scale Tolerance for Rotation Invariant Polar Matching With Dual-Tree Wavelets
• Nearest neighbor pattern classification

This page was built for publication: A variant of \(k\)-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing