Chapter 2

Minkowski Distances for Face Recognition

Enrico Vezzetti and Federica Marcolin

Abstract

Minkowski distances really deserve a whole chapter for theirselves. Depending on the value choice of parameter p, explained here below in the introduction, the concept of Minkowski distance is split up in different distance measures, which are typically known as taxicab (p=1), Euclidean (p=2), and Chebyshev distances (

Total Pages: 9-30 (22)

Purchase Chapter  Book Details

RELATED BOOKS

.Multi-Objective Optimization In Theory and Practice II: Metaheuristic Algorithms.
.Arduino and SCILAB based Projects.
.Arduino meets MATLAB: Interfacing, Programs and Simulink.
.Budget Optimization and Allocation: An Evolutionary Computing Based Model.