By Topic

Algorithms for recognizing planar polygonal configurations using perspective images

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

3 Author(s)
N. S. V. Rao ; Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA ; W. Wu ; C. W. Glover

A simplified abstraction of the problem of recognizing planar arrangements of objects using camera pictures taken from unknown positions is considered. A set of polygons in planes is called a planar polygonal configuration. Given perspective images P and Q corresponding to planar polygonal configurations, the matching problem is to determine if P and Q correspond to the same configuration. An optimal θ (n log n) time algorithm is presented to solve this problem, where n is the total number of vertices of polygons in each image. The algorithm is obtained by combining ideas of cross ratios, which are well known to be invariant under perspective projections, and the first fundamental theorem of perspective projections. This algorithm has been implemented and tested with satisfactory results

Published in:

IEEE Transactions on Robotics and Automation  (Volume:8 ,  Issue: 4 )