RLSA matlab code needed

5 vues (au cours des 30 derniers jours)
priya
priya le 20 Mar 2012
Commenté : Walter Roberson le 7 Fév 2014
The basic RLSA is applied to a binary sequence in which white pixels are represented by 0’s and black pixels by 1’s. The algorithm transforms a binary sequence x into an output sequence y according to the following rules:
1. 0’s in x are changed to 1’s in y if the number of adjacent 0’s is less than or equal to a predefined limit C. 2. 1’s in x are unchanged in y .
For example, with C = 4 the sequence x is mapped into y as follows:
x : 0 0 0 1 0 0 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 0 0 0 1 1 0 0 0 y : 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 1
When applied to pattern arrays, the RLSA has the effect of linking together neighboring black areas that are separated by less than C pixels. With an appropriate choice of C, the linked areas will be regions of a common data type.
The RLSA is applied row-by-row as well as column-by-column to a document, yielding two distinct bit-maps. Because spacings of document components tend to differ horizontally and vertically, different values of C are used for row and column processing. Thet wo bit-maps are then combined in a logical AND operation. Additional horizontal smoothing using the RLSA produces the final segmentation result.
  1 commentaire
Walter Roberson
Walter Roberson le 7 Fév 2014
This looks very much like it was homework.

Connectez-vous pour commenter.

Réponses (1)

Vortana
Vortana le 7 Fév 2014

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by