Fast 3D boundary computation from occluding contour motion

A. Bendiksen, Gregory Hager

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

This paper presents a fast method for computing a bounding volume within which an observed object must lie from the observed motion of the occluding contour during a straight-line motion of the camera. The bounding volume is represented as a set of planar cross sections each consisting of multiple convex polygons within which the object lies. The algorithm's worst-case runtime performance is O(nmk) operations, where n is the number of viewpoints used, m is the number of polygons created during the execution of the algorithm, and k is a parameter dependent on the geometric complexity of the object being viewed. Experimental examples are demonstrated; bounding polygon computation from sampled contours in 20 images required less than one second on a 50 Mhz i486 CPU.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Conference on Robotics and Automation
PublisherIEEE
Pages1934-1941
Number of pages8
Volume3
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 IEEE International Conference on Robotics and Automation, ICRA99 - Detroit, MI, USA
Duration: May 10 1999May 15 1999

Other

OtherProceedings of the 1999 IEEE International Conference on Robotics and Automation, ICRA99
CityDetroit, MI, USA
Period5/10/995/15/99

Fingerprint

Program processors
Cameras

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering

Cite this

Bendiksen, A., & Hager, G. (1999). Fast 3D boundary computation from occluding contour motion. In Proceedings - IEEE International Conference on Robotics and Automation (Vol. 3, pp. 1934-1941). IEEE.

Fast 3D boundary computation from occluding contour motion. / Bendiksen, A.; Hager, Gregory.

Proceedings - IEEE International Conference on Robotics and Automation. Vol. 3 IEEE, 1999. p. 1934-1941.

Research output: Chapter in Book/Report/Conference proceedingChapter

Bendiksen, A & Hager, G 1999, Fast 3D boundary computation from occluding contour motion. in Proceedings - IEEE International Conference on Robotics and Automation. vol. 3, IEEE, pp. 1934-1941, Proceedings of the 1999 IEEE International Conference on Robotics and Automation, ICRA99, Detroit, MI, USA, 5/10/99.
Bendiksen A, Hager G. Fast 3D boundary computation from occluding contour motion. In Proceedings - IEEE International Conference on Robotics and Automation. Vol. 3. IEEE. 1999. p. 1934-1941
Bendiksen, A. ; Hager, Gregory. / Fast 3D boundary computation from occluding contour motion. Proceedings - IEEE International Conference on Robotics and Automation. Vol. 3 IEEE, 1999. pp. 1934-1941
@inbook{490141f215ad4ded8251f84e8ee03264,
title = "Fast 3D boundary computation from occluding contour motion",
abstract = "This paper presents a fast method for computing a bounding volume within which an observed object must lie from the observed motion of the occluding contour during a straight-line motion of the camera. The bounding volume is represented as a set of planar cross sections each consisting of multiple convex polygons within which the object lies. The algorithm's worst-case runtime performance is O(nmk) operations, where n is the number of viewpoints used, m is the number of polygons created during the execution of the algorithm, and k is a parameter dependent on the geometric complexity of the object being viewed. Experimental examples are demonstrated; bounding polygon computation from sampled contours in 20 images required less than one second on a 50 Mhz i486 CPU.",
author = "A. Bendiksen and Gregory Hager",
year = "1999",
language = "English (US)",
volume = "3",
pages = "1934--1941",
booktitle = "Proceedings - IEEE International Conference on Robotics and Automation",
publisher = "IEEE",

}

TY - CHAP

T1 - Fast 3D boundary computation from occluding contour motion

AU - Bendiksen, A.

AU - Hager, Gregory

PY - 1999

Y1 - 1999

N2 - This paper presents a fast method for computing a bounding volume within which an observed object must lie from the observed motion of the occluding contour during a straight-line motion of the camera. The bounding volume is represented as a set of planar cross sections each consisting of multiple convex polygons within which the object lies. The algorithm's worst-case runtime performance is O(nmk) operations, where n is the number of viewpoints used, m is the number of polygons created during the execution of the algorithm, and k is a parameter dependent on the geometric complexity of the object being viewed. Experimental examples are demonstrated; bounding polygon computation from sampled contours in 20 images required less than one second on a 50 Mhz i486 CPU.

AB - This paper presents a fast method for computing a bounding volume within which an observed object must lie from the observed motion of the occluding contour during a straight-line motion of the camera. The bounding volume is represented as a set of planar cross sections each consisting of multiple convex polygons within which the object lies. The algorithm's worst-case runtime performance is O(nmk) operations, where n is the number of viewpoints used, m is the number of polygons created during the execution of the algorithm, and k is a parameter dependent on the geometric complexity of the object being viewed. Experimental examples are demonstrated; bounding polygon computation from sampled contours in 20 images required less than one second on a 50 Mhz i486 CPU.

UR - http://www.scopus.com/inward/record.url?scp=0032640446&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032640446&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:0032640446

VL - 3

SP - 1934

EP - 1941

BT - Proceedings - IEEE International Conference on Robotics and Automation

PB - IEEE

ER -