this paper presents, a hybrid method, low-resolution and high-resolution, for persian page segmentation. in the low-resolution page segmentation, a pyramidal image structure is constructed for multiscale analysis and segments document image to a set of regions. by high-resolution page segmentation, by connected components analysis, each region is segmented to homogeneous regions and identifying...

Recent work by Birnbaum & Lozinskii [1999] demonstrated that a clever yet simple extension of the well-known DavisPutnam procedure for solving instances of propositional satisfiability yields an efficient scheme for counting the number of satisfying assignments (models). We present a new extension, based on recursively identifying connected constraint-graph components, that substantially improv...

In this paper, we describe our implementation of several parallel graph algorithms for nding connected components. Our implementation, with virtual processing, is on a 16,384-processor MasPar MP-1 using the language MPL. We present extensive test data on our code. In our previous projects [21, 22, 23], we reported the implementation of an extensible parallel graph algorithms library. We develop...

The classic connected components labelling algorithm requires a minimum of 2 passes through an image. This paper presents a modification of this algorithm that allows the resolution of merged labels to be deferred. This enables the subsequent data analysis step to be combined with the labelling procedure, with the result that connected components can be analysed in a single pass by gathering da...