Image retrieval using Nash equilibrium and Kalai-Smorodinsky solution

Abstract

In this paper, we propose a new formulation of Nash games for solving a general multi-objectives optimization problems. The objective of this approach is to split the optimization variables, allowing us to determine numerically the strategies between two players. The first player minimizes his function cost using the variables of the first table P and the second player, using the second table Q. The original contribution of this work concerns the construction of the two tables of allocations that lead to a Nash equilibrium on the Pareto front. The second proposition of this paper is to find a Nash Equilibrium solution, which coincides with the Kalai--Smorodinsky solution. Two algorithms that calculate P, Q and their associated Nash equilibrium, by using some extension of the normal boundary intersection approach, are tried out successfully. Then, we propose a search engine to look for similar images of a given image based on multiple image representations using Color, Texture and Shape Features.