A multi-objective approach for the segmentation issue

References

• Ansari , N. and Huang , K. 1991 . Non-parametric dominant point detection . Pattern Recognition , 24 ( 9 ) : 849 – 862 .
   Web of Science ®Google Scholar
• Attneave , F. 1954 . Some informational aspects of visual perception . Psychological review , 61 ( 3 ) : 183 – 193 .
   PubMed Web of Science ®Google Scholar
• Coello , C. and Lamont , G. 2004 . Applications of multi-objective evolutionary algorithms , Singapore : World Scientific .
   Google Scholar
• Coello , C. , Lamont , G. and Van Veldhuizen , D. 2007 . Evolutionary algorithms for solving multi-objective problems , New York : Springer-Verlag .
   Google Scholar
• Corder , G. and Foreman , D. 2009 . Nonparametric statistics for non-statisticians: a step-by-step approach , Chichester , , UK : Wiley .
   Google Scholar
• Cronin , T. 1999 . A boundary concavity code to support dominant point detection . Pattern Recognition Letters , 20 ( 6 ) : 617 – 634 .
   Web of Science ®Google Scholar
• Deb , K. 2002 . A fast and elitist multiobjective genetic algorithm: NSGA-II . IEEE Transactions on Evolutionary Computation , 6 ( 2 ) : 182 – 197 .
   Web of Science ®Google Scholar
• Dunham , J. 1986 . Optimum uniform piecewise linear approximation of planar curves . IEEE Transactions on Pattern Analysis and Machine Intelligence , 8 ( 1 ) : 67 – 75 .
   Web of Science ®Google Scholar
• Durillo , J. J. and Nebro , A. J. 2011 . jMetal: a Java framework for multi-objective optimization . Advances in Engineering Software , 42 ( 11 ) : 760 – 771 .
   Google Scholar
• Ehrgott , M. 2005 . Multicriteria optimization , Berlin : Springer-Verlag .
   Google Scholar
• Fourman , M. Compaction of symbolic layout using genetic algorithms . Proceedings of the 1st international conference on genetic algorithms . pp. 141 – 153 . Hillsdale , NJ : Lawrence Erlbaum Associates .
   Google Scholar
• Freeman , H. 1961 . On the encoding of arbitrary geometric configurations . IRE Transactions on Electronic Computers , 10 ( 2 ) : 260 – 268 .
   Google Scholar
• Gen , M. and Cheng , R. 1997 . Genetic algorithms and engineering design , New York : Wiley-Interscience .
   Google Scholar
• Gionis , A. and Mannila , H. Segmentation algorithms for time series and sequence data . Tutorial in the SIAM international conference on data mining . Newport Beach , CA : SIAM .
   Google Scholar
• Goldberg , D. 1989 . Genetic algorithms in search, optimization, and machine learning , Boston , MA : Addison-Wesley .
   Google Scholar
• Guerrero , J. Piecewise linear representation segmentation as a multiobjective optimization problem . September 7–10 2010 , Valencia , Spain. Distributed computing and artificial intelligence: 7th international symposium , Edited by: de Leon , A. P. pp. 267 – 274 . Berlin : Springer-Verlag . Advances in intelligent and soft computing Vol. 79.
   Google Scholar
• Guerrero , J. , García , J. and Molina , J. Air traffic control: a local approach to the trajectory segmentation issue . Proceedings of the twenty-third international conference on industrial, engineering & other applications of applied intelligent systems – Part III . pp. 498 – 507 . Berlin : Springer-Verlag . Lecture notes in artificial intelligence Vol. 6098.
   Google Scholar
• Guerrero , J. , García , J. and Molina , J. 2011 . Piecewise linear representation segmentation in noisy domains with a large number of measurements: the air traffic control domain . International Journal on Artificial Intelligence Tools , 20 ( 2 ) : 367 – 399 .
   Web of Science ®Google Scholar
• Horn , J. 1997 . “ Multicriterion decision making ” . In Handbook of evolutionary computation , Oxford : Oxford University Press .
   Google Scholar
• Keogh , E. 2001 . Dimensionality reduction for fast similarity search in large time series databases . Knowledge and Information Systems , 3 ( 3 ) : 263 – 286 .
   Google Scholar
• Keogh , E. 2004 . “ Segmenting time series: a survey and novel approach ” . In Data mining in time series databases , Series in machine perception and artificial intelligence Vol. 57 Edited by: Last , M. 1 – 21 . Singapore : World Scientific .
   Google Scholar
• Keogh , E. and Pazzani , M. An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback . Proceedings of the 4th international conference on knowledge discovery and data mining . August 27–31 , New York . pp. 239 – 241 . Palo Alto , CA : AAAI Press .
   Google Scholar
• Langridge , D. 1972 . “ On the computation of shape ” . In Frontiers of Pattern Recognition Edited by: Watanabe , S. 347 – 366 .
   Google Scholar
• Liu , X. , Lin , Z. and Wang , H. 2008 . Novel online methods for time series segmentation . IEEE Transactions on Knowledge and Data Engineering , 20 ( 12 ) : 1616 – 1626 .
   Web of Science ®Google Scholar
• Loncaric , S. and Dhawan , A. 1995 . Near-optimal MST-based shape description using genetic algorithm . Pattern Recognition , 28 ( 4 ) : 571 – 579 .
   Web of Science ®Google Scholar
• Marji , M. and Siy , P. 2003 . A new algorithm for dominant points detection and polygonization of digital curves . Pattern Recognition , 36 ( 10 ) : 2239 – 2251 .
   Web of Science ®Google Scholar
• Miettinen , K. 1999 . Nonlinear multiobjective optimization , Boston , MA : Kluwer Academic .
   Google Scholar
• Mörchen , F. 2003 . “ Time series feature extraction for data mining using DWT and DFT ” . Department of Mathematics and Computer Science, Philipps-University Marburg . Technical report 33.
   Google Scholar
• Osyczka , A. 1985 . Multicriteria optimization for engineering design . Design Optimization , : 193 – 227 .
   Google Scholar
• Pal , N. , Kundu , M. and Nandi , S. Application of a new genetic operator in feature selection problems . 1998 IEEE Region 10 international conference on global connectivity in energy, computer, communication and control (TENCON’98) . December 17–19 , New Delhi , India. Vol. 1 , pp. 37 – 40 . Piscataway , NJ : IEEE .
   Google Scholar
• Pavlidis , T. and Ali , F. 2007 . Computer recognition of handwritten numerals by polygonal approximations . IEEE Transactions on Systems, Man and Cybernetics , 5 ( 6 ) : 610 – 614 .
   Google Scholar
• Ramer , U. 1972 . An iterative procedure for the polygonal approximation of plane curves . Computer Graphics and Image Processing , 1 ( 3 ) : 244 – 256 .
   Google Scholar
• Ray , B. and Ray , K. 1992 . Detection of significant points and polygonal approximation of digitized curves . Pattern Recognition Letters , 13 ( 6 ) : 443 – 452 .
   Web of Science ®Google Scholar
• Rosenberg , B. 1972 . The analysis of convex blobs . Computer Graphics and Image Processing , 1 ( 2 ) : 183 – 192 .
   Google Scholar
• Sarfraz , M. 2008 . “ Linear capture of digital curves ” . In Interactive curve modeling , 241 – 265 . London : Springer-Verlag .
   Google Scholar
• Sarfraz , M. , Asim , M. and Masood , A. 2004 . Piecewise polygonal approximation of digital curves . Proceedings of the eighth international conference on information visualisation (IV 2004) . July 14–16 2004 , Washington, D.C . pp. 991 – 996 . New York : IEEE .
   Google Scholar
• Sarkar , D. 1993 . A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves . Pattern Recognition Letters , 14 ( 12 ) : 959 – 964 .
   Web of Science ®Google Scholar
• Sato , Y. 1992 . Piecewise linear approximation of plane curves by perimeter optimization . Pattern Recognition , 25 ( 12 ) : 1535 – 1543 .
   Web of Science ®Google Scholar
• Singh , M. , Chatterjee , A. and Chaudhury , S. 1997 . Matching structural shape descriptions using genetic algorithms . Pattern Recognition , 30 ( 9 ) : 1451 – 1462 .
   Web of Science ®Google Scholar
• Sklansky , J. and Gonzalez , V. 1980 . Fast polygonal approximation of digitized curves . Pattern Recognition , 12 ( 5 ) : 327 – 331 .
   Web of Science ®Google Scholar
• Surry , P. , Radcliffe , N. and Boyd , I. A multi-objective approach to constrained optimisation of gas supply networks: the COMOGA method . Proceedings of the AISB-95 Workshop on Evolutionary Computing, 3–7 April . Sheffield , UK. pp. 166 – 180 . London : Springer .
   Google Scholar
• Teh , C. and Chin , R. 2002 . On the detection of dominant points on digital curves . IEEE Transactions on Pattern Analysis and Machine Intelligence , 11 ( 8 ) : 859 – 872 .
   Google Scholar
• Tsai , Y. Fast polygonal approximation based on genetic algorithms . Proceedings of the 5th IEEE/ACIS international conference on computer and information science and the 1st IEEE/ACIS international workshop on component-based software engineering, software architecture and reuse . pp. 322 – 326 . Washington, D.C : IEEE Computer Society Press .
   Google Scholar
• Wu , W. 2003 . An adaptive method for detecting dominant points . Pattern Recognition , 36 ( 10 ) : 2231 – 2237 .
   Web of Science ®Google Scholar
• Yin , P. Y. 1998 . A new method for polygonal approximation using genetic algorithms . Pattern Recognition Letters , 19 ( 11 ) : 1017 – 1026 .
   Web of Science ®Google Scholar
• Yin , P. 1999 . Genetic algorithms for polygonal approximation of digital curves . International Journal of Pattern Recognition and Artificial Intelligence , 13 : 1061 – 1082 .
   Web of Science ®Google Scholar
• Zitzler , E. 2003 . Performance assessment of multiobjective optimizers: an analysis and review . IEEE Transactions on Evolutionary Computation , 7 ( 2 ) : 117 – 132 .
   Web of Science ®Google Scholar
• Zitzler , E. , Laumanns , M. and Thiele , L. SPEA2: improving the Strength Pareto Evolutionary Algorithm . Evolutionary methods for design, optimization and control with applications to industrial problems (EUROGEN 2001) . September 19–21 , Athens . Edited by: Giannakoglou , K. , Tsahalis , D. , Periaux , J. , Papailou , P. Fogarty , T. pp. 95 – 100 . Barcelona : International Center for Numerical Methods in Engineering (CIMNE) .
   Google Scholar