19 April 2004 Corner-edge structure detection and reconstruction using virtual line scanning
Author Affiliations +
Abstract
When the xy-coordinates of any point in a binary image are compared with a standard VIRTUAL line of y=(n/wid)x, we can program a computer to find all the continuous points in the image which have equal vertical distance yd to the line. The starting and ending points of all these continuous points are then the corner points of a potential STRAIGHT EDGE detected from the image. The (n/wid) in the virtual line is the “slope constant” of the line. wid is the width of the image frame. n is an integer running from -hgt to hgt, and hgt is the height of the image frame. If we scan the standard line by running n from -hgt to +hgt in a loop and repeat the above process for each n, we can find all potential corner points and all potential straight edges in one half of the image with slopes running from -hgt/wid to +hgt/wid. Similarly, if we do a similar loop on the standard line of x=(m/hgt)y, where m runs from -wid to +wid on equal horizontal distance xd, we will get all the potential corner points and potential straight edges in the other half of the image frame. By these means, we can get all the potential corner points and the potential straight lines in the binary picture. Then the program will refine the findings by many sub-programs to find the true geometrical lines and true corner points. The result can be saved in a very compact file and recalled very efficiently to reconstruct the “skeleton” of the original object.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sirikanlaya Chanekasit, Anyarat Boonnithrovalkur, Chia-Lun John Hu, "Corner-edge structure detection and reconstruction using virtual line scanning", Proc. SPIE 5300, Vision Geometry XII, (19 April 2004); doi: 10.1117/12.529326; https://doi.org/10.1117/12.529326
PROCEEDINGS
5 PAGES


SHARE
Back to Top