By Topic

Branch and bound discrete tomography reconstruction of binary contours

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)
Miklos, P. ; Subotica Tech, Subotica, Serbia ; Imre, L.

In this paper a new method is shown for reconstructing binary contours from its two orthogonal projections. The paper focuses on the reconstruction of contours whose inner territory is hv-convex. Since the inner territory of the contour is hv-convex, the first and the last row and column of ones are comprised from one part, while all other rows and columns consist of two streaks of ones. An additional constraint is that all ones in the matrix have exactly two 4-neighbours. To find the solution, a branch and bound method is used which allows the cutting of the edges during tree development. The algorithm works best for smaller matrices up to size 50×50 pixels.

Published in:

Intelligent Systems and Informatics (SISY), 2010 8th International Symposium on

Date of Conference:

10-11 Sept. 2010