A complexity-bounded motion estimation algorithm (Articolo in rivista)

Type
Label
  • A complexity-bounded motion estimation algorithm (Articolo in rivista) (literal)
Anno
  • 2002-01-01T00:00:00+01:00 (literal)
Alternative label
  • A. Chimienti, D. Pau, C. Ferraris (2002)
    A complexity-bounded motion estimation algorithm
    in IEEE transactions on image processing
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • A. Chimienti, D. Pau, C. Ferraris (literal)
Pagina inizio
  • 387 (literal)
Pagina fine
  • 392 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 11 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • Motion estimation full search algorithm in video coding is an operation computationally very intensive. For this reason, in real time or low power application, simplified motion estimation algorithms are very appreciated. In this paper a new motion estimation algorithm of reduced complexity will be presented. It tries to conjugate the extreme reduction of computational load with a good efficiency. It exploits the \"past\" history of the motion field to predict the current motion field. This approach permits to limit greatly the number of motion vector to test. A following refinement phase gives the final motion vector. The complexity is lower than other algorithms present in literature and is also constant because in the algorithm there is no recursivity. Simulation evaluation show the robustness of the algorithm with any kind of video sequence, an optimal performance with respect to other reduced complexity algorithms and a very reduced loss of efficiency with respect to the full search algorithm (literal)
Note
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • 1,3 - CNR, 2 - STMicroelectronics (literal)
Titolo
  • A complexity-bounded motion estimation algorithm (literal)
Abstract
  • Motion estimation full search algorithm in video coding is an operation computationally very intensive. For this reason, in real time or low power application, simplified motion estimation algorithms are very appreciated. In this paper a new motion estimation algorithm of reduced complexity will be presented. It tries to conjugate the extreme reduction of computational load with a good efficiency. It exploits the \"past\" history of the motion field to predict the current motion field. This approach permits to limit greatly the number of motion vector to test. A following refinement phase gives the final motion vector. The complexity is lower than other algorithms present in literature and is also constant because in the algorithm there is no recursivity. Simulation evaluation show the robustness of the algorithm with any kind of video sequence, an optimal performance with respect to other reduced complexity algorithms and a very reduced loss of efficiency with respect to the full search algorithm (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


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