<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Discrete tomographic reconstruction of binary images with disjoint components using shape information</style></title><secondary-title><style face="normal" font="default" size="100%">INTERNATIONAL JOURNAL OF SHAPE MODELLING</style></secondary-title><short-title><style face="normal" font="default" size="100%">INT J SHAPE MODEL</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Dec 2008</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">World Scientific</style></publisher><volume><style face="normal" font="default" size="100%">14</style></volume><pages><style face="normal" font="default" size="100%">189 - 207</style></pages><isbn><style face="normal" font="default" size="100%">0218-6543</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div&gt;&lt;div&gt;We present a general framework for reconstructing binary images with disjoint components from the horizontal and vertical projections. We develop a backtracking algorithm that works for binary images having components from an arbitrary class. Thus, a priori knowledge about the components of the image to be reconstructed can be incorporated into the reconstruction process. In addition, we show how to extend the algorithm to obtain a branch-and-bound scheme useful to reconstruct images satisfying some further properties (for example similarity to a model image) as much as possible. Experimental results are also presented.&lt;br&gt;&amp;nbsp;&lt;/div&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 76849116810doi: 10.1142/S0218654308001142</style></notes></record></records></xml>