Defuzzification by Feature Distance Minimization Based on DC Programming
2007 (English)In: 5th International Symposium on Image and Signal Processing and Analysis, 2007: ISPA 2007, 2007, 373-378 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
2007. 373-378 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:uu:diva-12442DOI: 10.1109/ISPA.2007.4383722ISBN: 978-953-184-116-0OAI: oai:DiVA.org:uu-12442DiVA: diva2:40211