Adaptive Grid Refinement Procedures for Efficient Optical Flow Computation

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

Two approaches are described that improve the efficiency of optical flow computation without incurring loss of accuracy. The first approach segments images into regions of moving objects. The method is based on a previously defined Galerkin finite element method on a triangular mesh combined with a multiresolution segmentation approach for object flow computation. Images are automatically segmented into subdomains of moving objects by an algorithm that employs a hierarchy of mesh coarseness for the flow computation, and these subdomains are reconstructed over a finer mesh on which to recompute flow more accurately. The second approach uses an adaptive mesh in which the resolution increases where motion is found to occur. Optical flow is computed over a reasonably coarse mesh, and this is used to construct an optimal adaptive mesh in a way that is different from the gradient methods reported in the literature. The finite element mesh facilitates a reduction in computational effort by enabling processing to focus on particular objects of interest in a scene (i.e. those areas where motion is detected). The proposed methods were tested on real and synthetic image sequences, and promising results are reported.
LanguageEnglish
Pages31-54
JournalInternational Journal of Computer Vision
Volume61
Issue number1
DOIs
Publication statusPublished - Jan 2005

Fingerprint

Optical flows
Gradient methods
Finite element method
Processing

Keywords

  • adaptive grids
  • Delaunay algorithm
  • inverse finite elements
  • motion estimation
  • optical flow
  • triangular meshes

Cite this

@article{c255f7b74b12454ab6ff712fe13d6cc9,
title = "Adaptive Grid Refinement Procedures for Efficient Optical Flow Computation",
abstract = "Two approaches are described that improve the efficiency of optical flow computation without incurring loss of accuracy. The first approach segments images into regions of moving objects. The method is based on a previously defined Galerkin finite element method on a triangular mesh combined with a multiresolution segmentation approach for object flow computation. Images are automatically segmented into subdomains of moving objects by an algorithm that employs a hierarchy of mesh coarseness for the flow computation, and these subdomains are reconstructed over a finer mesh on which to recompute flow more accurately. The second approach uses an adaptive mesh in which the resolution increases where motion is found to occur. Optical flow is computed over a reasonably coarse mesh, and this is used to construct an optimal adaptive mesh in a way that is different from the gradient methods reported in the literature. The finite element mesh facilitates a reduction in computational effort by enabling processing to focus on particular objects of interest in a scene (i.e. those areas where motion is detected). The proposed methods were tested on real and synthetic image sequences, and promising results are reported.",
keywords = "adaptive grids, Delaunay algorithm, inverse finite elements, motion estimation, optical flow, triangular meshes",
author = "J Condell and BW Scotney and PJ Morrow",
year = "2005",
month = "1",
doi = "10.1023/B:VISI.0000042933.07192.26",
language = "English",
volume = "61",
pages = "31--54",
journal = "International Journal of Computer Vision",
issn = "0920-5691",
number = "1",

}

TY - JOUR

T1 - Adaptive Grid Refinement Procedures for Efficient Optical Flow Computation

AU - Condell, J

AU - Scotney, BW

AU - Morrow, PJ

PY - 2005/1

Y1 - 2005/1

N2 - Two approaches are described that improve the efficiency of optical flow computation without incurring loss of accuracy. The first approach segments images into regions of moving objects. The method is based on a previously defined Galerkin finite element method on a triangular mesh combined with a multiresolution segmentation approach for object flow computation. Images are automatically segmented into subdomains of moving objects by an algorithm that employs a hierarchy of mesh coarseness for the flow computation, and these subdomains are reconstructed over a finer mesh on which to recompute flow more accurately. The second approach uses an adaptive mesh in which the resolution increases where motion is found to occur. Optical flow is computed over a reasonably coarse mesh, and this is used to construct an optimal adaptive mesh in a way that is different from the gradient methods reported in the literature. The finite element mesh facilitates a reduction in computational effort by enabling processing to focus on particular objects of interest in a scene (i.e. those areas where motion is detected). The proposed methods were tested on real and synthetic image sequences, and promising results are reported.

AB - Two approaches are described that improve the efficiency of optical flow computation without incurring loss of accuracy. The first approach segments images into regions of moving objects. The method is based on a previously defined Galerkin finite element method on a triangular mesh combined with a multiresolution segmentation approach for object flow computation. Images are automatically segmented into subdomains of moving objects by an algorithm that employs a hierarchy of mesh coarseness for the flow computation, and these subdomains are reconstructed over a finer mesh on which to recompute flow more accurately. The second approach uses an adaptive mesh in which the resolution increases where motion is found to occur. Optical flow is computed over a reasonably coarse mesh, and this is used to construct an optimal adaptive mesh in a way that is different from the gradient methods reported in the literature. The finite element mesh facilitates a reduction in computational effort by enabling processing to focus on particular objects of interest in a scene (i.e. those areas where motion is detected). The proposed methods were tested on real and synthetic image sequences, and promising results are reported.

KW - adaptive grids

KW - Delaunay algorithm

KW - inverse finite elements

KW - motion estimation

KW - optical flow

KW - triangular meshes

UR - http://www.kluweronline.com/issn/0920-5691/

U2 - 10.1023/B:VISI.0000042933.07192.26

DO - 10.1023/B:VISI.0000042933.07192.26

M3 - Article

VL - 61

SP - 31

EP - 54

JO - International Journal of Computer Vision

T2 - International Journal of Computer Vision

JF - International Journal of Computer Vision

SN - 0920-5691

IS - 1

ER -