A method for reducing the cardinality of the Pareto front

Abstract

Multi-objective problems are characterised by the presence of a set of optimal trade-off solutions -a Pareto front-, from which a solution has to be selected by a decision maker. However, selecting a solution from a Pareto front depends on large quantities of solutions to select from and dimensional complexity due to many involved objectives, among others. Commonly, the selection of a solution is based on preferences specified by a decision maker. Nevertheless a decision maker may have not preferences at all. Thus, an informed decision making process has to be done, which is difficult to achieve. In this paper, selecting a solution from a Pareto front is addressed as a multi-objective problem using two utility functions and operating in the objective space. A quantitative comparison of stereo correspondence algorithms performance is used as an application domain. © 2012 Springer-Verlag.