You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/129416
Title: 
On the optical flow model selection through metaheuristics
Author(s): 
Institution: 
  • Universidade Estadual Paulista (UNESP)
  • Universidade dos Andes
ISSN: 
1687-5281
Sponsorship: 
  • Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
  • Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
  • Universidad de los Andes FAI
Sponsorship Process Number: 
  • FAPESP: 2013/20387-7
  • FAPESP: 2014/16250-9
  • CNPq: 303182/2011-3
  • CNPq: 470571/2013-6
  • CNPq: 306166/2014-3
  • Universidad de los Andes FAI: 05/2013
Abstract: 
Optical flow methods are accurate algorithms for estimating the displacement and velocity fields of objects in a wide variety of applications, being their performance dependent on the configuration of a set of parameters. Since there is a lack of research that aims to automatically tune such parameters, in this work, we have proposed an optimization-based framework for such task based on social-spider optimization, harmony search, particle swarm optimization, and Nelder-Mead algorithm. The proposed framework employed the well-known large displacement optical flow (LDOF) approach as a basis algorithm over the Middlebury and Sintel public datasets, with promising results considering the baseline proposed by the authors of LDOF.
Issue Date: 
9-May-2015
Citation: 
Eurasip Journal On Image And Video Processing. Cham: Springer International Publishing Ag, v. 2015, n. 11, p. 1-10, 2015.
Time Duration: 
1-10
Publisher: 
Springer
Keywords: 
  • Optimization methods
  • Evolutionary algorithms
  • Optical flow methods
Source: 
http://jivp.eurasipjournals.com/content/2015/1/11
URI: 
Access Rights: 
Acesso aberto
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/129416
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.