2 edition of **Investigation of binary parallel thinning algorithms** found in the catalog.

Investigation of binary parallel thinning algorithms

A. Melidis

- 91 Want to read
- 31 Currently reading

Published
**1997**
by UMIST in Manchester
.

Written in English

**Edition Notes**

Statement | A. Melidis ; supervised by P. Liatsis. |

Contributions | Liatsis, P., Electrical Engineering and Electronics. |

ID Numbers | |
---|---|

Open Library | OL17290212M |

Abstract: A thinning scheme could be used as a useful method of pre-processing in image processing. Various algorithms have been proposed to produce the skeleton of a digital binary pattern. However, they have undesirable properties that tend to cause shrinking or vanishing of segments, the appearance of a beard, and warping where segments intersect. This paper investigates the skeletonization problem using parallel thinning techniques and proposes a new one-pass parallel asymmetric thinning algorithm (OPATA 8).Wu and Tsai presented a one-pass parallel asymmetric thinning algorithm (OPATA 4) that implemented 4-distance, or city block distance, r, city block distance is not a good approximation of Euclidean distance.

@article{osti_, title = {Fast parallel algorithm for thinning digital patterns}, author = {Zhang, T Y and Suen, C Y}, abstractNote = {A fast parallel thinning algorithm is proposed in this paper. It consists of two subiterations: one aimed at deleting the south-east boundary points and the north-west corner points while the other one is aimed at deleting the north-west boundary points. Binary Search Algorithm and its Implementation. In our previous tutorial we discussed about Linear search algorithm which is the most basic algorithm of searching which has some disadvantages in terms of time complexity, so to overcome them to a level an algorithm based on dichotomic (i.e. selection between two distinct alternatives) divide and conquer technique is used i.e. Binary .

It is a challenging topic to perform pattern reconstruction from a unit-width skeleton, which is obtained by a parallel thinning algorithm. The bias skeleton yielded by a fully-parallel thinning algorithm, which usually results from the so-called hidden deletable points, will result in the difficulty of pattern reconstruction. In order to make a fully-parallel thinning algorithm pattern. This work was sponsored by the National Natural Science Foundation of China (Grant No. ), the United States Army Research Office under the Multi-University Research Initiative (Contract No. WNF), and the Beijing Institute of .

You might also like

Guide to the study of West Virginia history.

Guide to the study of West Virginia history.

Broadcast by his excellency, the executive governor of Akwa Ibom State to the people of Akwa Ibom on the occasion of the 21st anniversary of Akwa Ibom State

Broadcast by his excellency, the executive governor of Akwa Ibom State to the people of Akwa Ibom on the occasion of the 21st anniversary of Akwa Ibom State

Americas Far Eastern Policy (Institute of Pacific Relations)

Americas Far Eastern Policy (Institute of Pacific Relations)

Research advances in rabies

Research advances in rabies

Managers for tomorrow

Managers for tomorrow

Freshwater tropical aquarium fishes

Freshwater tropical aquarium fishes

Battered Woman Syndrome

Battered Woman Syndrome

Survival tips for new teachers

Survival tips for new teachers

Shaquille ONeal (Taking Part Series)

Shaquille ONeal (Taking Part Series)

The Measurement of personality

The Measurement of personality

Peripheral plasma levels of oestrogens and prosgesterone with special reference to bovine pregnancy.

Peripheral plasma levels of oestrogens and prosgesterone with special reference to bovine pregnancy.

Articles in London

Articles in London

Contemporary American philosophy

Contemporary American philosophy

Public-School System of D.C.

Public-School System of D.C.

Clare Arts Development Plan 2000-2004

Clare Arts Development Plan 2000-2004

The proposed algorithm is a parallel image thinning algorithm and the method can pull out the one pel midst lines.

The proposed algorithm has the characteristics like one-pixel midst, stop point saving, and perfect proposed an efficient two base on balls analogue binary image thinning algorithm can be utile in image cutting.

This paper proposes an efficient parallel thinning algorithm for binary images. The proposed thinning algorithm adopts a two iteration approach, wherein four conditions are tested at each.

Thinning algorithms on binary images are used to generate skeletons that preserve the same connectivity structures as the objects in the original images.

Two kinds of skeletons may be appropriate for 3D thinning algorithms: digital curves and digital surfaces. We propose two thinning algorithms on 3D (18, 6) binary by: Parallel algorithms process all the border pixels at once and Principles of thinning Binary image thinning algorithms based on the assumption that motivated us for the further investigation and to find the possible solution to overcome the above limitations.

An important preprocessing step for the vectorization of the scanned lines is thinning them to minimal width for line-following. Most thinning algorithms are suitable for small resolutions only.

We present two fast algorithms for thinning large binary images. The first one is a variation of an iterative parallel thinning by: 1.

This paper describes new parallel thinning algorithm for binary images. The use of 3X3 mask for pixel deletability in parallel and pixel deletion criteria needed to preserve the connectivity of the image pattern is exclusively discussed.

This algorithm preserves the connectivity of an input image. The experimental result shows the better. This paper presents two parallel isthmus-based 3D thinning algorithms that are capable of producing centerlines and medial surfaces. The strategy which is used is called subiteration-based or directional: each iteration step is composed of 12 subiterations each of which are executed in parallel.

The authors define these algorithms over binary-valued images digitized in a rectangular tessellation, as two-subiteration algorithms restricted to 3 × 3 thinning operators. These two algorithms are compared with other two-subiteration algorithms and with a fully parallel thinner considered in the literature.

Parallel thinning algorithms. A major problem which arises when designing thinning algorithms is that the simultaneous removal of simple points may change the topology of an object: for example, we see that, if we delete in parallel all simple points of the object depicted in Fig.

1, it will be disconnected. parallel binary search tend to split an array into small arrays many times over. An example is included in“Efficient Parallel Binary Search on Sorted Arrays” by Danny Z.

Chen. [1] Chen discusses an algorithm that uses two arrays A and B with n numbers and m numbers that has a time complexity of Though this is a valid approach there are some key.

A thinning algorithm for digital binary pictures is presented. The algorithm repeats the removal of the deletable border points in parallel and the extraction of the final points. This paper describes two new parallel algorithms for thinning.

Instead of a conventional 3 X 3 operator, a small cross window '+' with 5 or 9 points is employed in the implementation. The algorithms do not change the connectivity of the images. A Sequential Thinning Algorithm For Multi-Dimensional Binary Patterns Himanshu Jain, Archana Praveen Kumar Abstract—Thinning is the removal of contour pixels/points of connected components in an image to produce their skeleton with retained connectivity and structural properties.

The output. fully parallel thinning or shrinking algorithms which use reduction only 3 X 3 operators [ For exam- ple, if we define z parallel thinr,ing algorithm with identical thinning; results over 90” rotations of the ob- ject we will typic,llly completely delete the 2 X 2 square object; thcs violating goal 1.

THI NNING ALGORITHM Thinning algorithms proposed by various re- searchers [] can be generally grouped into three categories: serial, parallel, and maximum methods. In serial thinning algorithms, the value of a pixel at the nth iteration depends on a set of the pixels for some of which, the result of nth iteration is already known.

A Fast Parallel Thinning Algorithm for the Binary Image Skeletonization. CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract—Skeletons are widely used shape descriptors which summarize the general form of binary objects.

A technique to obtain skeletons is the thinning, that is an iterative layerby-layer erosion in a topology-preserving way. Conventional thinning algorithms preserve line endpoints to provide important geometric.

(Se Hyun Park, Sang Kyoon Kim and Hang Joo Kim, ), “A Fully Parallel Thinning Algorithm using a Weighted Template”, IEEE, Tenco-Digital signal proce. (Jun-Sik Kwon, Jun-Woong Gi and Eung-Kwan Kang, ), “An Enhanced Thinning Algorithm Using Parallel.

Fast Parallel Thinning Algorithm English Language Essay. INTRODUCTION The important data structure the algorithm utilises is a Binary Heap. Each element of the binary heap represents the distance value of a pointer to a single voxel.

At this point evoke that the element with the lowest (or largest) value remains on top in the binary heap. faster and more efficient parallel thinning algorithm. The distortion should be as little as possible.

Experi- mental results indicate that this method can be used to thin a variety of digital patterns. PARALLEL PICTURE PROCESSING A binary digitized picture is defined by a matrix IT. There are three categories of parallel thinning algorithms in literature, sub-iteration parallel thinning algorithm [], sub-field parallel thinning algorithm [] and fully parallel thinning algorithm [9].

Brief surveys of algorithms in each category can be found in the literature [6, 9]. The rest of this paper is organized as follows. Home Magazines Communications of the ACM Vol. 27, No. 3 A fast parallel algorithm for thinning digital patterns article A fast parallel algorithm for thinning digital patterns.The parallel algorithms in this chapter have been drawn principally from the area of graph theory.

They represent only a scant selection of the present array of parallel algorithms. The techniques introduced in this chapter, however, are quite representative of the techniques used for parallel algorithms in other areas of computer science.