Edge Detector Evolution using Multidimensional Multiobjective Genetic Programming

نویسندگان

  • Y Zhang
  • P I Rockett
  • Yang Zhang
  • Peter I. Rockett
چکیده

In this paper we report the evolution of a feature extraction stage for edge detection using multidimensional multiobjective genetic programming. We have employed training and validation data produced using a realistic model of the imaging physics to evolve an n-to-m mapping which projects the pixel intensities of an n × n image patch into an m-dimensional decision space. The (near-)optimal value of m is also simultaneously determined during evolution. A conventional Fisher linear discriminant is then used to classify edge patterns. On the independent validation set, the suggested edge detector is shown to give performance superior to both the well-known conventional Canny detector and to earlier multiobjective genetic programming results which projected the pattern vector into a one-dimensional decision space. In addition, the superiority of the new detector is also demonstrated on a hand-labeled set of real images.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

Solving multiobjective linear programming problems using ball center of polytopes

Here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎The algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎Numerical examples and a simulation study are used to illu...

متن کامل

Hardware-Software Codesign of Multidimensional Programs

We present a method for parametrised partitioning of multidimensional programs for acceleration using a hardware coprocessor. The method involves a divide-andconquer structure, with the “divide” and “merge” phases carried out by a general-purpose processor while the “conquer” phase is handled by application-specific hardware. The partitioning strategy has been captured in a simple functional la...

متن کامل

The Position of Multiobjective Programming Methods in Fuzzy Data Envelopment Analysis

Traditional Data Envelopment Analysis (DEA) models evaluate the efficiency of decision making units (DMUs) with common crisp input and output data. However, the data in real applications are often imprecise or ambiguous. This paper transforms fuzzy fractional DEA model constructed using fuzzy arithmetic, into the conventional crisp model. This transformation is performed considering the goal pr...

متن کامل

FUZZY GOAL PROGRAMMING TECHNIQUE TO SOLVE MULTIOBJECTIVE TRANSPORTATION PROBLEMS WITH SOME NON-LINEAR MEMBERSHIP FUNCTIONS

The linear multiobjective transportation problem is a special type of vector minimum problem in which constraints are all equality type and the objectives are conicting in nature. This paper presents an application of fuzzy goal programming to the linear multiobjective transportation problem. In this paper, we use a special type of nonlinear (hyperbolic and exponential) membership functions to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007