José Luis Guerrero
ABSTRACT
This work formalizes a multi-objective evolutionary approach for the segmentation issue according to Piecewise Linear Representation. It consists in the approximation of a given digital curve by a set of linear models minimizing the representation error and the number of such models. This solution allows the final user to decide from the best array of best found solutions considering the different objectives jointly. The proposed approach eliminates the difficult a-priori parameter choices in order to satisfy the user restrictions (the solution choice is performed a-posteriori, from the obtained array of solutions) and allows the algorithm to be run a single time (since the whole Pareto front is obtained with a single run and different solutions may be chosen at different times from that Pareto front in order to satisfy different requirements). This solution will be applied to Petroleum Industry in particular to the problem of identifying resources from extraction areas in order to optimize their operational costs and production capacity.
- N. Ansari and K. Huang. 1991. Non-parametric dominant point detection. Pattern Recognition 24, 9 (1991), 849--862. Google Scholar
Digital Library
- F. Attneave. 1954. Some informational aspects of visual perception. Psychological review 61, 3 (1954), 183--193.Google Scholar
- C.A.C. Coello and G.B. Lamont. 2004. Applications of multi-objective evolutionary algorithms. World Scientific Pub Co Inc.Google Scholar
- C.A.C. Coello, G.B. Lamont, and D.A. Van Veldhuizen. 2007. Evolutionary algorithms for solving multi-objective problems. Springer-Verlag New York Inc. Google ScholarDigital Library
- G.W. Corder and D.I. Foreman. 2009. Nonparametric statistics for non-statisticians: a step-by-step approach. John Wiley & Sons Inc.Google Scholar
- T.M. Cronin. 1999. A boundary concavity code to support dominant point detection. Pattern Recognition Letters 20, 6 (1999), 617--634. Google ScholarDigital Library
- K. Deb, A. Anand, and D. Joshi. 2002. A computationally efficient evolutionary algorithm for real-parameter optimization. Evolutionary computation 10, 4 (2002), 371--395. Google ScholarDigital Library
- David H. Douglas and Thomas K. Peucker. 1973. Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature. The Canadian Cartographer 10, 2 (1973), 112--122.Google ScholarCross Ref
- R. O. Duda and P. E. Hart. 1973. Pattern Classification and Scene Analysis. Wiley.Google Scholar
- Juan J. Durillo and Antonio J. Nebro. 2011. jMetal: A Java framework for multi-objective optimization. Advances in Engineering Software 42, 11 (2011), 760--771. https://doi.org/ Google ScholarDigital Library
- M.P. Fourman. 1985. Compaction of symbolic layout using genetic algorithms. In Proceedings of the 1st International Conference on Genetic Algorithms. L. Erlbaum Associates Inc., 141--153. Google ScholarDigital Library
- A. Gionis and H. Mannila. 2005. Segmentation algorithms for time series and sequence data. Tutorial on SIAM International Conference in Data Mining. (2005).Google Scholar
- D.E. Goldberg et al. 1989. Genetic algorithms in search, optimization, and machine learning. Addison-wesley Reading Menlo Park. Google ScholarDigital Library
- FCA Groen and PW Verbeek. 1978. Freeman-code probabilities of object boundary quantized contours. Computer Graphics and Image Processing 7, 3 (1978), 391--402.Google ScholarCross Ref
- Jos Luis Guerrero, J. Garcia, and Jos Manuel Molina. 2010. Air Traffic Control: A Local Approach to the Trajectory Segmentation Issue. In Proceedings for the 23rd International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems, part III. Lecture Notes in Artificial Intelligence, Vol. 6098. Springer, 498--507. Google ScholarDigital Library
- J. Horn. 1997. Handbook of evolutionary computation. Oxford University Press, Chapter Multicriterion decision making.Google Scholar
- E. Keogh, K. Chakrabarti, M. Pazzani, and S. Mehrotra. 2001. Dimensionality reduction for fast similarity search in large time series databases. Knowledge and Information Systems 3, 3 (2001), 263--286.Google ScholarCross Ref
- E. Keogh, S. Chu, D. Hart, and M. Pazzani. 2003. Segmenting time series: A survey and novel approach. Data mining in time series databases (2003), 1--21.Google Scholar
- E. Keogh and M. Pazzani. 1998. An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. In Proceedings of the 4th International Conference of Knowledge Discovery and Data Mining. AAAI Press, 239--241. Google ScholarDigital Library
- DJ Langridge. 1972. On the computation of shape. Frontiers of Pattern Recognition (1972), 347--366.Google Scholar
- X. Liu, Z. Lin, and H. Wang. 2008. Novel online methods for time series segmentation. IEEE Transactions on Knowledge and Data Engineering 20, 12 (2008), 1616--1626. Google ScholarDigital Library
- M. Marji and P. Siy 2003. A new algorithm for dominant points detection and polygonization of digital curves. Pattern recognition 36, 10 (2003), 2239--2251.Google Scholar
- K. Miettinen. 1999. Nonlinear multiobjective optimization. Kluwer Academic Publisher, Boston.Google Scholar
- F Mörchen. 2003. Time series feature extraction for data mining using DWT and DFT. Technical Report 33. Departement of Mathematics and Computer Science Philipps-University Marburg.Google Scholar
- A. Osyczka. 1985. Multicriteria optimization for engineering design. Design Optimization (1985), 193--227.Google Scholar
- N.R. Pal, M.K. Kundu, and S. Nandi. 1998. Application of a new genetic operator in feature selection problems. In IEEE Region 10 International Conference on Global Connectivity in Energy Computer, Communication and Control, Vol. 1. IEEE, 37--40.Google Scholar
- T. Pavlidis and F. Ali. 2007. Computer recognition of handwritten numerals by polygonal approximations. Systems, Man and Cybernetics, IEEE Transactions on 5, 6 (2007), 610--614.Google Scholar
- U. Ramer. 1972. An Iterative Procedure for the Polygonal Approximation of Plane Curves. Computer Graphics and Image Processing 1 (1972), 244--256.Google ScholarCross Ref
- B.K. Ray and K.S. Ray. 1992. Detection of significant points and polygonal approximation of digitized curves. Pattern Recognition Letters 13, 6 (1992), 443--452. Google ScholarDigital Library
- B. Rosenberg. 1972. The analysis of convex blobs. Computer Graphics and Image Processing 1, 2 (1972), 183--192.Google ScholarCross Ref
- A. Rosenfeld and E. Johnston. 1973. Angle Detection on Digital Curves. IEEE Trans. Comput. 22, 9 (1973), 875--878. Google ScholarDigital Library
- M. Sarfraz. 2008. Linear Capture of Digital Curves. In Interactive Curve Modeling. Springer London, 241--265.Google Scholar
- M. Sarfraz, MR Asim, and A. Masood. 2004. Piecewise polygonal approximation of digital curves. In Proceedings of the 8th International Conference on Information Visualisation. IEEE, 991--996. Google ScholarDigital Library
- D. Sarkar. 1993. A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves. Pattern Recognition Letters 14, 12 (1993), 959--964. Google ScholarDigital Library
- P. Surry, N. Radcliffe, and I. Boyd. 1995. A multi-objective approach to constrained optimisation of gas supply networks: The COMOGA method. Evolutionary Computing (1995), 166--180. Google ScholarDigital Library
- C.H. Teh and RT Chin. 2002. On the detection of dominant points on digital curves. IEEE Transactions on Pattern Analysis and Machine Intelligence 11, 8 (2002), 859--872. Google ScholarDigital Library
- Y.H. Tsai. 2006. Fast Polygonal Approximation Based on Genetic Algorithms. In Proceedings of the 5th International Conference on Computer and Information Science and 1st International Workshop on Component-Based Software Engineering, Software Architecture and Reuse. IEEE, 322--326. Google ScholarDigital Library
- W.Y. Wu. 2003. An adaptive method for detecting dominant points. Pattern Recognition 36, 10 (2003), 2231--2237.Google ScholarCross Ref
- P.Y. YIN. 1999. Genetic algorithms for polygonal approximation of digital curves. International journal of pattern recognition and artificial intelligence 13, 7 (1999), 1061--1082.Google Scholar
- P. Y. Yin. 1998. A New Method for Polygonal Approximation Using Genetic Algorithms. Pattern Recognition Letters 19, 11 (1998), 1017--1026. Google ScholarDigital Library
- E. Zitzler, M. Laumanns, and L. Thiele. 2001. SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. In Proceedings of the Conference on Evolutionary Methods for Design, Optimisation and Control with Applications to Industrial Problems.Google Scholar
- E. Zitzler, L. Thiele, M. Laumanns, C.M. Fonseca, and V.G. da Fonseca. 2003. Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation 7, 2 (2003), 117--132. Google ScholarDigital Library
Index Terms
- Multiobjective evolutionary polygonal approximation for identifying crude oil reservoirs
Recommendations
Approximate non-dominated sorting for evolutionary many-objective optimization
Non-dominated sorting has widely been adopted and shown to be very effective in dominance based evolutionary multi-objective optimization where the number of objectives is two or three. In dealing with many-objective optimization problems, where the ...
Analysis of inverted PBI and comparison with other scalarizing functions in decomposition based MOEAs
MOEA/D is one of the promising evolutionary approaches for solving multi and many-objective optimization problems. MOEA/D decomposes a multi-objective optimization problem into a number of single objective optimization problems. Each single objective ...
Effects of dominance resistant solutions on the performance of evolutionary multi-objective and many-objective algorithms
GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation ConferenceDominance resistant solutions (DRSs) in multi-objective problems have very good values for some objectives and very bad values for other objectives. Whereas DRSs are far away from the Pareto front, they are hardly dominated by other solutions due to ...
Comments