Defuzzification by feature distance minimization based on DC programming

Abstract

We introduce the use of DC programming, in combination with convex-concave regularization, as a deterministic approach for solving the optimization problem imposed by defuzzification by feature distance minimization. We provide a DC based algorithm for finding a solution to the defuzzification problem by expressing the objective function as a difference of two convex functions and iteratively solving a family of DC programs. We compare the performance with the previously recommended method, simulated annealing, on a number of test images. Encouraging results, together with several advantages of the DC based method, approve use of this approach, and motivate its further exploration.