Discrete particle swarm optimization based on estimation of distribution for polygonal approximation problems

The polygonal approximation is an important topic in the area of pattern recognition, computer graphics and computer vision. This paper presents a novel discrete particle swarm optimization algorithm based on estimation of distribution (DPSO-EDA), for two types of polygonal approximation problems. E...

Full description

Saved in:
Bibliographic Details
Published inExpert systems with applications Vol. 36; no. 5; pp. 9398 - 9408
Main Authors Wang, Jiahai, Kuang, Zhanghui, Xu, Xinshun, Zhou, Yalan
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.07.2009
Subjects
Online AccessGet full text

Cover

Loading…
Abstract The polygonal approximation is an important topic in the area of pattern recognition, computer graphics and computer vision. This paper presents a novel discrete particle swarm optimization algorithm based on estimation of distribution (DPSO-EDA), for two types of polygonal approximation problems. Estimation of distribution algorithms sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The DPSO-EDA incorporates the global statistical information collected from local best solution of all particles into the particle swarm optimization and therefore each particle has comprehensive learning and search ability. Further, constraint handling methods based on the split-and-merge local search is introduced to satisfy the constraints of the two types of problems. Simulation results on several benchmark problems show that the DPSO-EDA is better than previous methods such as genetic algorithm, tabu search, particle swarm optimization, and ant colony optimization.
AbstractList The polygonal approximation is an important topic in the area of pattern recognition, computer graphics and computer vision. This paper presents a novel discrete particle swarm optimization algorithm based on estimation of distribution (DPSO-EDA), for two types of polygonal approximation problems. Estimation of distribution algorithms sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The DPSO-EDA incorporates the global statistical information collected from local best solution of all particles into the particle swarm optimization and therefore each particle has comprehensive learning and search ability. Further, constraint handling methods based on the split-and-merge local search is introduced to satisfy the constraints of the two types of problems. Simulation results on several benchmark problems show that the DPSO-EDA is better than previous methods such as genetic algorithm, tabu search, particle swarm optimization, and ant colony optimization.
Author Wang, Jiahai
Zhou, Yalan
Kuang, Zhanghui
Xu, Xinshun
Author_xml – sequence: 1
  givenname: Jiahai
  surname: Wang
  fullname: Wang, Jiahai
  email: wjiahai@hotmail.com
  organization: Department of Computer Science, Sun Yat-sen University, No. 135, Xingang West Road, Guangzhou 510275, China
– sequence: 2
  givenname: Zhanghui
  surname: Kuang
  fullname: Kuang, Zhanghui
  organization: Department of Computer Science, Sun Yat-sen University, No. 135, Xingang West Road, Guangzhou 510275, China
– sequence: 3
  givenname: Xinshun
  surname: Xu
  fullname: Xu, Xinshun
  organization: School of Computer Science and Technology, Shandong University Middle of Shunhua Road, Jinan, Shandong 250101, China
– sequence: 4
  givenname: Yalan
  surname: Zhou
  fullname: Zhou, Yalan
  organization: Information Science School, Guangdong University of Business Studies, No. 21, Chisha Road, Guangzhou 510320, China
BookMark eNp9UMtOwzAQtFCRaAs_wCknbglrO4kTiQsqT6kSFzhbjr1BrpI42ClQvh6XwpXT7o5mdmdnQWaDG5CQcwoZBVpebjIMHypjAFVGWQZ5cUTmtBI8LUXNZ2QOdSHSnIr8hCxC2ABQASDmpL-xQXucMBmVn6zuMImLfJ-4cbK9_VKTdUPSqIAmiQ2GiB4w1ybGhsnbZvszt84no-t2r25QXaLG0bvPP27smw77cEqOW9UFPPutS_Jyd_u8ekjXT_ePq-t1qjmnU0q1Lhk1RkPTcA7CNAIEN4q2LC8F1U3Fc8Na1ha8VbwUkOu6pDlAXReVbihfkovD3nj4bRtNyz6-iV2nBnTbIDkvq7pgVSSyA1F7F4LHVo4-mvY7SUHuk5UbuU9W7pOVlMmYbBRdHUQYX3i36GXQFgeNxnrUkzTO_if_Bg8-hsI
CitedBy_id crossref_primary_10_1016_j_eswa_2010_12_124
crossref_primary_10_1007_s00500_011_0780_6
crossref_primary_10_1109_TCYB_2015_2424836
crossref_primary_10_1016_j_jvcir_2014_09_012
crossref_primary_10_1016_j_ins_2013_05_031
crossref_primary_10_1016_j_gmod_2016_01_004
crossref_primary_10_1016_j_eswa_2011_07_039
crossref_primary_10_1016_j_patrec_2012_02_015
Cites_doi 10.1016/0167-8655(94)00081-D
10.1109/21.293514
10.1109/CEC.2004.1330874
10.1016/S0031-3203(98)00173-3
10.1134/S105466180602009X
10.1016/j.jvcir.2003.12.001
10.1142/S0218001499000598
10.1016/S0167-8655(98)00082-8
10.1007/s11047-007-9050-z
10.1109/ICNN.1995.488968
10.1109/4235.797971
10.1142/S0219467804001385
10.1109/34.31447
10.1007/s11047-007-9049-5
10.1016/S0031-3203(00)00159-X
10.1142/S0218001400000209
10.1142/S0218001400000167
10.1016/0031-3203(92)90126-4
10.1109/ICNC.2007.18
10.1023/A:1013500812258
10.1016/S0734-189X(84)80023-7
10.1016/S0031-3203(02)00321-7
10.1016/0031-3203(93)90106-7
ContentType Journal Article
Copyright 2008 Elsevier Ltd
Copyright_xml – notice: 2008 Elsevier Ltd
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.eswa.2008.12.045
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1873-6793
EndPage 9408
ExternalDocumentID 10_1016_j_eswa_2008_12_045
S0957417408009317
GroupedDBID --K
--M
.DC
.~1
0R~
13V
1B1
1RT
1~.
1~5
29G
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
ABBOA
ABFNM
ABKBG
ABMAC
ABMVD
ABUCO
ABXDB
ABYKQ
ACDAQ
ACGFS
ACHRH
ACNNM
ACNTT
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGJBL
AGUBO
AGUMN
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALEQD
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
BNSAS
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
GBOLZ
HAMUX
HLZ
HVGLF
HZ~
IHE
J1W
JJJVA
KOM
LG9
LY1
LY7
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SDS
SES
SET
SEW
SPC
SPCBC
SSB
SSD
SSL
SST
SSV
SSZ
T5K
TN5
WUQ
XPP
ZMT
~G-
AAXKI
AAYXX
AFJKZ
AKRWK
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c331t-1cc621ddc0bb3307db7073da1f24671cb834d2f2f53fa36704c9614009958cb13
IEDL.DBID AIKHN
ISSN 0957-4174
IngestDate Fri Oct 25 05:22:17 EDT 2024
Thu Sep 26 16:49:22 EDT 2024
Fri Feb 23 02:30:21 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 5
Keywords Discrete particle swarm optimization
Polygonal approximation problem
Estimation of distribution
Split-and-merge
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c331t-1cc621ddc0bb3307db7073da1f24671cb834d2f2f53fa36704c9614009958cb13
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 33689528
PQPubID 23500
PageCount 11
ParticipantIDs proquest_miscellaneous_33689528
crossref_primary_10_1016_j_eswa_2008_12_045
elsevier_sciencedirect_doi_10_1016_j_eswa_2008_12_045
PublicationCentury 2000
PublicationDate 2009-07-01
PublicationDateYYYYMMDD 2009-07-01
PublicationDate_xml – month: 07
  year: 2009
  text: 2009-07-01
  day: 01
PublicationDecade 2000
PublicationTitle Expert systems with applications
PublicationYear 2009
Publisher Elsevier Ltd
Publisher_xml – name: Elsevier Ltd
References Harik, Lobo, Goldberg (bib4) 1999; 3
(pp. 4104–4109). NJ: Piscatawary.
Wall, Danielsson (bib19) 1984; 28
Baluja, S. (1994).
Ray, Ray (bib14) 1995; 16
Banks, Vincent, Anyakoha (bib2) 2007; 6
Banks, Vincent, Anyakoha (bib3) 2008; 7
Yin (bib24) 2000; 14
Yin (bib23) 1999; 13
Kennedy, J., & Eberhart, R. C. (1995). Particle swarm optimization. In Proceedings of IEEE international conference on neural networks. NJ: Piscataway, pp.1942–1948.
Muhlenbein, Paaß (bib11) 1996; Vol. 1411
Pelikan, Goldberg, Lobo (bib12) 2002; 21
Huang, Sun (bib7) 1999; 32
Wang, J. (2007). Genetic particle swarm optimization based on estimation of distribution, 2007. In
Kennedy, J., & Eberhart, R. C. (1997). A discrete binary version of the particle swarm algorithm. In
Sarkar, Singh, Sarkar (bib15) 2004; 4
Ho, Chen (bib6) 2001; 34
Held, Abe, Arcelli (bib5) 1994; 24
Ray, Ray (bib13) 1993; 26
Zhou, Wang, Yin (bib28) 2007; 4
Yang, Wang, Jiao (bib21) 2004; 1
Sun, Huang (bib17) 2000; 14
Teh, Chin (bib18) 1989; 11
Yin (bib25) 2003; 36
Larranaga, Lozano (bib10) 2001; Vol. 2
(Vol. 4688, pp. 287–296).
Pittsburgh, PA: School of Computer Science, Carnegie Mellon University. Technical Report CMU-CS-94-163.
Yin (bib22) 1998; 19
Yin (bib26) 2004; 15
Yin (bib27) 2006; 16
Sato (bib16) 1992; 25
Sarkar (10.1016/j.eswa.2008.12.045_b0075) 2004; 4
10.1016/j.eswa.2008.12.045_b0040
Yin (10.1016/j.eswa.2008.12.045_b0120) 2000; 14
10.1016/j.eswa.2008.12.045_b0045
10.1016/j.eswa.2008.12.045_b0100
10.1016/j.eswa.2008.12.045_b0005
Banks (10.1016/j.eswa.2008.12.045_b0010) 2007; 6
Teh (10.1016/j.eswa.2008.12.045_b0090) 1989; 11
Yang (10.1016/j.eswa.2008.12.045_b0105) 2004; 1
Pelikan (10.1016/j.eswa.2008.12.045_b0060) 2002; 21
Sato (10.1016/j.eswa.2008.12.045_b0080) 1992; 25
Larranaga (10.1016/j.eswa.2008.12.045_b0050) 2001; Vol. 2
Yin (10.1016/j.eswa.2008.12.045_b0125) 2003; 36
Yin (10.1016/j.eswa.2008.12.045_b0135) 2006; 16
Yin (10.1016/j.eswa.2008.12.045_b0110) 1998; 19
Banks (10.1016/j.eswa.2008.12.045_b0015) 2008; 7
Ray (10.1016/j.eswa.2008.12.045_b0065) 1993; 26
Zhou (10.1016/j.eswa.2008.12.045_b0140) 2007; 4
Held (10.1016/j.eswa.2008.12.045_b0025) 1994; 24
Harik (10.1016/j.eswa.2008.12.045_b0020) 1999; 3
Muhlenbein (10.1016/j.eswa.2008.12.045_b0055) 1996; Vol. 1411
Huang (10.1016/j.eswa.2008.12.045_b0035) 1999; 32
Ray (10.1016/j.eswa.2008.12.045_b0070) 1995; 16
Ho (10.1016/j.eswa.2008.12.045_b0030) 2001; 34
Yin (10.1016/j.eswa.2008.12.045_b0115) 1999; 13
Yin (10.1016/j.eswa.2008.12.045_b0130) 2004; 15
Wall (10.1016/j.eswa.2008.12.045_b0095) 1984; 28
Sun (10.1016/j.eswa.2008.12.045_b0085) 2000; 14
References_xml – volume: 16
  start-page: 161
  year: 1995
  end-page: 169
  ident: bib14
  article-title: A new split-and-merge technique for polygonal approximation of chain coded curves
  publication-title: Pattern Recognition Letter
  contributor:
    fullname: Ray
– volume: 14
  start-page: 243
  year: 2000
  end-page: 255
  ident: bib24
  article-title: A tabu search approach to the polygonal approximation of digital curves
  publication-title: International Journal of Pattern Recognition and Artificial Intelligence
  contributor:
    fullname: Yin
– volume: 3
  start-page: 287
  year: 1999
  end-page: 297
  ident: bib4
  article-title: The compact genetic algorithm
  publication-title: IEEE Transaction on Evolutionary Computation
  contributor:
    fullname: Goldberg
– volume: 25
  start-page: 1535
  year: 1992
  end-page: 1543
  ident: bib16
  article-title: Piecewise linear approximation of plane curves by perimeter optimization
  publication-title: Pattern Recognition
  contributor:
    fullname: Sato
– volume: 28
  start-page: 220
  year: 1984
  end-page: 227
  ident: bib19
  article-title: A fast sequential method for polygonal approximation of digitized curves
  publication-title: Computer Vision, Graphics, and Image Processing
  contributor:
    fullname: Danielsson
– volume: 19
  start-page: 1017
  year: 1998
  end-page: 1026
  ident: bib22
  article-title: A new method of polygonal approximation using genetic algorithm
  publication-title: Pattern Recognition Letter
  contributor:
    fullname: Yin
– volume: 34
  start-page: 2305
  year: 2001
  end-page: 2317
  ident: bib6
  article-title: An efficient evolutionary algorithm for accurate polygonal approximation
  publication-title: Pattern Recognition
  contributor:
    fullname: Chen
– volume: 32
  start-page: 409
  year: 1999
  end-page: 1420
  ident: bib7
  article-title: Polygonal approximation using genetic algorithms
  publication-title: Pattern Recognition
  contributor:
    fullname: Sun
– volume: 11
  start-page: 859
  year: 1989
  end-page: 872
  ident: bib18
  article-title: On the detection of dominant points on digital curves
  publication-title: IEEE Transactions on Pattern Analytical Machine Intelligence
  contributor:
    fullname: Chin
– volume: 6
  start-page: 467
  year: 2007
  end-page: 484
  ident: bib2
  article-title: A review of particle swarm optimization. Part I: Background development
  publication-title: Natural Computing: An International Journal
  contributor:
    fullname: Anyakoha
– volume: 14
  start-page: 297
  year: 2000
  end-page: 314
  ident: bib17
  article-title: Genetic algorithms for error-bounded polygonal approximation
  publication-title: International Journal of Pattern Recognition and Artificial Intelligence
  contributor:
    fullname: Huang
– volume: 4
  start-page: 80
  year: 2007
  end-page: 84
  ident: bib28
  article-title: A discrete estimation of distribution particle swarm optimization for combinatorial optimization problems
  publication-title: Proceeding of the 3rd International Conference on Natural Computation (ICNC’07)
  contributor:
    fullname: Yin
– volume: Vol. 1411
  start-page: 178
  year: 1996
  end-page: 187
  ident: bib11
  article-title: From recombination of genes to the estimation of distributions
  publication-title: Proceedings of the fourth conference on parallel problem solving from nature-PPSN IV
  contributor:
    fullname: Paaß
– volume: 7
  start-page: 109
  year: 2008
  end-page: 124
  ident: bib3
  article-title: A review of particle swarm optimization. Part II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
  publication-title: Natural Computing: An International Journal
  contributor:
    fullname: Anyakoha
– volume: 16
  start-page: 223
  year: 2006
  end-page: 233
  ident: bib27
  article-title: Genetic particle swarm optimization for polygonal approximation of digital curves
  publication-title: Pattern Recognition and Image Analysis
  contributor:
    fullname: Yin
– volume: 24
  start-page: 942
  year: 1994
  end-page: 949
  ident: bib5
  article-title: Towards a hierarchical contour description via dominant point detection
  publication-title: IEEE Transaction Systems, Man, and Cybernetics
  contributor:
    fullname: Arcelli
– volume: 21
  start-page: 5
  year: 2002
  end-page: 20
  ident: bib12
  article-title: A survey of optimization by building and using probabilistic models
  publication-title: Computational Optimization and Applications
  contributor:
    fullname: Lobo
– volume: 36
  start-page: 1783
  year: 2003
  end-page: 1997
  ident: bib25
  article-title: Ant colony search algorithms for optimal polygonal approximation of plane curves
  publication-title: Pattern Recognition
  contributor:
    fullname: Yin
– volume: 4
  start-page: 223
  year: 2004
  end-page: 239
  ident: bib15
  article-title: A genetic algorithm-based approach for detection of significant vertices for polygonal approximation of digital curves
  publication-title: International Journal of Image Graphics
  contributor:
    fullname: Sarkar
– volume: 13
  start-page: 1061
  year: 1999
  end-page: 1082
  ident: bib23
  article-title: Genetic algorithms for polygonal approximation of digital curves
  publication-title: International Journal of Pattern Recognition and Artificial Intelligence
  contributor:
    fullname: Yin
– volume: 1
  start-page: 320
  year: 2004
  end-page: 324
  ident: bib21
  article-title: A quantum particle swarm optimization
  publication-title: Proceeding of the 2004 IEEE Congress on Evolutionary Computation
  contributor:
    fullname: Jiao
– volume: 15
  start-page: 241
  year: 2004
  end-page: 260
  ident: bib26
  article-title: A discrete particle swarm algorithm for optimal polygonal approximation of digital curves
  publication-title: Journal of Visual Communication and Image Representation
  contributor:
    fullname: Yin
– volume: 26
  start-page: 505
  year: 1993
  end-page: 509
  ident: bib13
  article-title: Determination of optimal polygon from digital curve using LI norm
  publication-title: Pattern Recognition
  contributor:
    fullname: Ray
– volume: Vol. 2
  year: 2001
  ident: bib10
  article-title: Estimation of distribution algorithms: A new tool for evolutionary computation
  publication-title: Genetic algorithms and evolutionary computation
  contributor:
    fullname: Lozano
– volume: 16
  start-page: 161
  year: 1995
  ident: 10.1016/j.eswa.2008.12.045_b0070
  article-title: A new split-and-merge technique for polygonal approximation of chain coded curves
  publication-title: Pattern Recognition Letter
  doi: 10.1016/0167-8655(94)00081-D
  contributor:
    fullname: Ray
– volume: 24
  start-page: 942
  year: 1994
  ident: 10.1016/j.eswa.2008.12.045_b0025
  article-title: Towards a hierarchical contour description via dominant point detection
  publication-title: IEEE Transaction Systems, Man, and Cybernetics
  doi: 10.1109/21.293514
  contributor:
    fullname: Held
– volume: Vol. 1411
  start-page: 178
  year: 1996
  ident: 10.1016/j.eswa.2008.12.045_b0055
  article-title: From recombination of genes to the estimation of distributions
  contributor:
    fullname: Muhlenbein
– volume: 1
  start-page: 320
  year: 2004
  ident: 10.1016/j.eswa.2008.12.045_b0105
  article-title: A quantum particle swarm optimization
  publication-title: Proceeding of the 2004 IEEE Congress on Evolutionary Computation
  doi: 10.1109/CEC.2004.1330874
  contributor:
    fullname: Yang
– volume: 32
  start-page: 409
  year: 1999
  ident: 10.1016/j.eswa.2008.12.045_b0035
  article-title: Polygonal approximation using genetic algorithms
  publication-title: Pattern Recognition
  doi: 10.1016/S0031-3203(98)00173-3
  contributor:
    fullname: Huang
– volume: 16
  start-page: 223
  issue: 2
  year: 2006
  ident: 10.1016/j.eswa.2008.12.045_b0135
  article-title: Genetic particle swarm optimization for polygonal approximation of digital curves
  publication-title: Pattern Recognition and Image Analysis
  doi: 10.1134/S105466180602009X
  contributor:
    fullname: Yin
– volume: 15
  start-page: 241
  year: 2004
  ident: 10.1016/j.eswa.2008.12.045_b0130
  article-title: A discrete particle swarm algorithm for optimal polygonal approximation of digital curves
  publication-title: Journal of Visual Communication and Image Representation
  doi: 10.1016/j.jvcir.2003.12.001
  contributor:
    fullname: Yin
– volume: 13
  start-page: 1061
  issue: 7
  year: 1999
  ident: 10.1016/j.eswa.2008.12.045_b0115
  article-title: Genetic algorithms for polygonal approximation of digital curves
  publication-title: International Journal of Pattern Recognition and Artificial Intelligence
  doi: 10.1142/S0218001499000598
  contributor:
    fullname: Yin
– volume: 19
  start-page: 1017
  year: 1998
  ident: 10.1016/j.eswa.2008.12.045_b0110
  article-title: A new method of polygonal approximation using genetic algorithm
  publication-title: Pattern Recognition Letter
  doi: 10.1016/S0167-8655(98)00082-8
  contributor:
    fullname: Yin
– volume: 7
  start-page: 109
  issue: 1
  year: 2008
  ident: 10.1016/j.eswa.2008.12.045_b0015
  article-title: A review of particle swarm optimization. Part II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
  publication-title: Natural Computing: An International Journal
  doi: 10.1007/s11047-007-9050-z
  contributor:
    fullname: Banks
– ident: 10.1016/j.eswa.2008.12.045_b0040
  doi: 10.1109/ICNN.1995.488968
– volume: 3
  start-page: 287
  issue: 4
  year: 1999
  ident: 10.1016/j.eswa.2008.12.045_b0020
  article-title: The compact genetic algorithm
  publication-title: IEEE Transaction on Evolutionary Computation
  doi: 10.1109/4235.797971
  contributor:
    fullname: Harik
– volume: 4
  start-page: 223
  issue: 2
  year: 2004
  ident: 10.1016/j.eswa.2008.12.045_b0075
  article-title: A genetic algorithm-based approach for detection of significant vertices for polygonal approximation of digital curves
  publication-title: International Journal of Image Graphics
  doi: 10.1142/S0219467804001385
  contributor:
    fullname: Sarkar
– volume: 11
  start-page: 859
  year: 1989
  ident: 10.1016/j.eswa.2008.12.045_b0090
  article-title: On the detection of dominant points on digital curves
  publication-title: IEEE Transactions on Pattern Analytical Machine Intelligence
  doi: 10.1109/34.31447
  contributor:
    fullname: Teh
– volume: Vol. 2
  year: 2001
  ident: 10.1016/j.eswa.2008.12.045_b0050
  article-title: Estimation of distribution algorithms: A new tool for evolutionary computation
  contributor:
    fullname: Larranaga
– volume: 6
  start-page: 467
  issue: 4
  year: 2007
  ident: 10.1016/j.eswa.2008.12.045_b0010
  article-title: A review of particle swarm optimization. Part I: Background development
  publication-title: Natural Computing: An International Journal
  doi: 10.1007/s11047-007-9049-5
  contributor:
    fullname: Banks
– volume: 34
  start-page: 2305
  year: 2001
  ident: 10.1016/j.eswa.2008.12.045_b0030
  article-title: An efficient evolutionary algorithm for accurate polygonal approximation
  publication-title: Pattern Recognition
  doi: 10.1016/S0031-3203(00)00159-X
  contributor:
    fullname: Ho
– ident: 10.1016/j.eswa.2008.12.045_b0045
– volume: 14
  start-page: 297
  issue: 3
  year: 2000
  ident: 10.1016/j.eswa.2008.12.045_b0085
  article-title: Genetic algorithms for error-bounded polygonal approximation
  publication-title: International Journal of Pattern Recognition and Artificial Intelligence
  doi: 10.1142/S0218001400000209
  contributor:
    fullname: Sun
– ident: 10.1016/j.eswa.2008.12.045_b0005
– volume: 14
  start-page: 243
  issue: 2
  year: 2000
  ident: 10.1016/j.eswa.2008.12.045_b0120
  article-title: A tabu search approach to the polygonal approximation of digital curves
  publication-title: International Journal of Pattern Recognition and Artificial Intelligence
  doi: 10.1142/S0218001400000167
  contributor:
    fullname: Yin
– volume: 25
  start-page: 1535
  year: 1992
  ident: 10.1016/j.eswa.2008.12.045_b0080
  article-title: Piecewise linear approximation of plane curves by perimeter optimization
  publication-title: Pattern Recognition
  doi: 10.1016/0031-3203(92)90126-4
  contributor:
    fullname: Sato
– volume: 4
  start-page: 80
  year: 2007
  ident: 10.1016/j.eswa.2008.12.045_b0140
  article-title: A discrete estimation of distribution particle swarm optimization for combinatorial optimization problems
  publication-title: Proceeding of the 3rd International Conference on Natural Computation (ICNC’07)
  doi: 10.1109/ICNC.2007.18
  contributor:
    fullname: Zhou
– volume: 21
  start-page: 5
  issue: 1
  year: 2002
  ident: 10.1016/j.eswa.2008.12.045_b0060
  article-title: A survey of optimization by building and using probabilistic models
  publication-title: Computational Optimization and Applications
  doi: 10.1023/A:1013500812258
  contributor:
    fullname: Pelikan
– volume: 28
  start-page: 220
  year: 1984
  ident: 10.1016/j.eswa.2008.12.045_b0095
  article-title: A fast sequential method for polygonal approximation of digitized curves
  publication-title: Computer Vision, Graphics, and Image Processing
  doi: 10.1016/S0734-189X(84)80023-7
  contributor:
    fullname: Wall
– ident: 10.1016/j.eswa.2008.12.045_b0100
– volume: 36
  start-page: 1783
  year: 2003
  ident: 10.1016/j.eswa.2008.12.045_b0125
  article-title: Ant colony search algorithms for optimal polygonal approximation of plane curves
  publication-title: Pattern Recognition
  doi: 10.1016/S0031-3203(02)00321-7
  contributor:
    fullname: Yin
– volume: 26
  start-page: 505
  year: 1993
  ident: 10.1016/j.eswa.2008.12.045_b0065
  article-title: Determination of optimal polygon from digital curve using LI norm
  publication-title: Pattern Recognition
  doi: 10.1016/0031-3203(93)90106-7
  contributor:
    fullname: Ray
SSID ssj0017007
Score 2.064059
Snippet The polygonal approximation is an important topic in the area of pattern recognition, computer graphics and computer vision. This paper presents a novel...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Publisher
StartPage 9398
SubjectTerms Discrete particle swarm optimization
Estimation of distribution
Polygonal approximation problem
Split-and-merge
Title Discrete particle swarm optimization based on estimation of distribution for polygonal approximation problems
URI https://dx.doi.org/10.1016/j.eswa.2008.12.045
https://search.proquest.com/docview/33689528
Volume 36
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED5BWVh4I8rTAxsKrWMndceqgAoIFqjULYpfqIgmFS0CFn4759hBAiEGtiRyXne57z7lXgDHwvXQ6lgTtbUSEedcRpJZZ3imi3vGsipccHObDob8apSMFqBf18K4tMqA_R7TK7QOR1pBmq3peNy6Q3KA7rDDHefpohtchCV0R7FowFLv8npw-xVM6LR91TSuj9wJoXbGp3mZ2WvuUyrdX0FX1fS7f_qB1JX7uViDlcAbSc8_2josmGIDVuuZDCSY6CZMzsYIBMiEyTS8BsFbP09IidgwCUWXxPkuTXDD9djwxYuktES7LrphABZBNkum5dP7g-PqpOo9_lavDWNoZlswvDi_7w-iMFIhUozReUSVSmOqtWpLydC8teygjeuc2hgRkyopGNexjW3CbO56u3HVRQfueGQilKRsGxpFWZgdIMq0dc6pFVpQjtqWyLQsS7lC9WvEjSac1ILMpr5zRlanlD1mTux-BCaNMxR7E5Ja1tk3_WcI7X-ed1QrJkPDcNGOvDDlyyxjLBXdJBa7_7zyHiz7yJFLzd2Hxvz5xRwgAZnLQ1g8_aCH4TP7BB953N8
link.rule.ids 315,783,787,4509,24128,27936,27937,45597,45691
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELZKGWDhjXjjgQ2F1rHTpCMCqvJcaKVuVvxCRbSpaBGw8Nu5ix0kEGJgSyLndc599ym--46Qoww1tFJno6bRWSSEUJHiDh3PtmHPOl4uF9zetbp9cTVIBjVyVtXCYFplwH6P6SVahyONYM3GZDhs3AM5gHCYCuQ8bQiDc2ReID-Gj_rk4yvPA_XnUi-4l0Y4PFTO-CQvO33NfUIl_hPEmqbfo9MPnC6DT2eFLAXWSE_9g62Smh2vkeWqIwMNDrpORudDgAHgwXQSXoLCrZ9HtABkGIWSS4qRy1DYQIUNX7pIC0cNauiG9lcUuCydFE_vD8jUaak8_laNDU1ophuk37nonXWj0FAh0pyzWcS0bsXMGN1UioNzG5WCh5ucuRjwkmmVcWFiF7uEuxyV3YRuQ_hGFplkWjG-SerjYmy3CNW2aXLBXGYyJmCuFfAsx1tCw-QbQI1tclwZUk68boasEsoeJZrdN8BksQSzb5OksrX8NvsSgP3P8w6riZHgFrjWkY9t8TKVnLeydhJnO_-88iFZ6PZub-TN5d31Lln0a0iYpLtH6rPnF7sPVGSmDspP7RMhht24
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Discrete+particle+swarm+optimization+based+on+estimation+of+distribution+for+polygonal+approximation+problems&rft.jtitle=Expert+systems+with+applications&rft.au=Wang%2C+Jiahai&rft.au=Kuang%2C+Zhanghui&rft.au=Xu%2C+Xinshun&rft.au=Zhou%2C+Yalan&rft.date=2009-07-01&rft.issn=0957-4174&rft.volume=36&rft.issue=5&rft.spage=9398&rft.epage=9408&rft_id=info:doi/10.1016%2Fj.eswa.2008.12.045&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_eswa_2008_12_045
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0957-4174&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0957-4174&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0957-4174&client=summon