By Topic

New sensing strategies for monitoring moving polyhedral objects by machine vision

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. -J. Leou ; Inst. of Electron., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; W. -H. Tsai

A set of sensing strategies is proposed for monitoring three-dimensional moving objects by computer vision. Three-dimensional (3-D) object surface points are selected as the features for monitoring 3-D moving objects because the point features are easy to detects, extract, store, and manipulate. It is proved that the minimum measurable feature point set for monitoring a 3-D moving convex polyhedral object is exactly the set containing all the junction points of the objects. Based on the sampling theorem and several properties of photogrammetry it is proved that the minimum data-acquisition rate of a vision system monitoring 3-D moving objects can be determined with discretely sampled two-dimensional image sequence data alone. Certain properties of orthographic projection useful for determining the minimum number of sensors needed Ns to monitor 3-D moving convex polyhedral objects are investigated, and the bound on Ns are also derived. An algorithm for determining Ns and the corresponding directions of the sensors is proposed. The feasibility of the proposed algorithm is shown by three illustrative examples and an application example

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:19 ,  Issue: 4 )