A deterministic algorithm for optical flow estimation (Articolo in rivista)

Type
Label
  • A deterministic algorithm for optical flow estimation (Articolo in rivista) (literal)
Anno
  • 2011-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1685/2010CAIM584 (literal)
Alternative label
  • Gerace I., Martinelli F., Pucci P. (2011)
    A deterministic algorithm for optical flow estimation
    in Comunications in Applied and Industrial Mathematics
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Gerace I., Martinelli F., Pucci P. (literal)
Pagina inizio
  • 249 (literal)
Pagina fine
  • 268 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#altreInformazioni
  • Ivan Gerace, Francesca Martinelli, Patrizia Pucci (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://caim.simai.eu/index.php/caim/article/view/2010CAIM584 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 1 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 2 (literal)
Note
  • PuMa (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Italy; CNR-ISTI, Pisa Italy (literal)
Titolo
  • A deterministic algorithm for optical flow estimation (literal)
Abstract
  • In this paper we propose a new deterministic algorithm for determining optical flow through regularization techniques so that the solution of the problem is defined as the minimum of an appropriate energy function. We also assume that the displacements are piecewise continuous and that the discontinuities are variable to be estimated. More precisely, we introduce a hierarchical three-step optimization strategy to minimize the constructed energy function, which is not convex. In the first step we find a suitable initial guess of the displacements field by a gradient-based GNC algorithm. In the second step we define the local energy of a displacement field as the energy function obtained by fixing all the field with the exception of a row or of a column. Then, through an application of the shortest path technique we minimize iteratively each local energy function restricted to a row or to a column until we arrive at a fixed point. In the last step we use again a GNC algorithm to recover a sub-pixel accuracy. The experimental results confirm the goodness of this technique. (literal)
Prodotto di
Autore CNR

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
data.CNR.it