A hybrid image restoration algorithm based on Projections onto Convex Sets and Harmony Search

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-27T11:30:41Z
dc.date.accessioned2022-10-05T18:59:13Z
dc.date.available2014-05-27T11:30:41Z
dc.date.available2022-10-05T18:59:13Z
dc.date.created2014-05-27T11:30:41Z
dc.date.issued2013-09-09
dc.identifierProceedings - IEEE International Symposium on Circuits and Systems, p. 2824-2827.
dc.identifier0271-4310
dc.identifierhttp://hdl.handle.net/11449/76537
dc.identifier10.1109/ISCAS.2013.6572466
dc.identifierWOS:000332006803008
dc.identifier2-s2.0-84883369806
dc.identifier9039182932747194
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3925421
dc.description.abstractImage restoration is a research field that attempts to recover a blurred and noisy image. Since it can be modeled as a linear system, we propose in this paper to use the meta-heuristics optimization algorithm Harmony Search (HS) to find out near-optimal solutions in a Projections Onto Convex Sets-based formulation to solve this problem. The experiments using HS and four of its variants have shown that we can obtain near-optimal and faster restored images than other evolutionary optimization approach. © 2013 IEEE.
dc.languageeng
dc.relationProceedings - IEEE International Symposium on Circuits and Systems
dc.relation0,237
dc.rightsAcesso aberto
dc.sourceScopus
dc.subjectBlurred and noisy images
dc.subjectEvolutionary optimizations
dc.subjectHarmony search
dc.subjectMeta heuristics
dc.subjectNear-optimal solutions
dc.subjectOptimization algorithms
dc.subjectProjections onto convex sets
dc.subjectResearch fields
dc.subjectAlgorithms
dc.subjectImage reconstruction
dc.subjectLinear systems
dc.subjectOptimization
dc.subjectSet theory
dc.titleA hybrid image restoration algorithm based on Projections onto Convex Sets and Harmony Search
dc.typeTrabalho apresentado em evento


Este ítem pertenece a la siguiente institución