Implementation of Holes Filling in Binary image

I need to implement the holes filling algorithm for binary images in Visual Basic 6.0 The filling algorithm steps as follows: 1. Find and label the regions corresponding to background intensity. Labeling Algorithm is included below. 2. Separate the regions belonging to either background or holes based on the following condition. In each region, the ends of runs are checked for image limit. If a run ends with image limit then the entire region will be marked as a background. Otherwise it is marked as a hole. 3. Repeat step 2 for all the detected regions that are having intensity equal to background. 4. Change the intensity of regions that are marked as holes to foreground intensity (hole filling). Labeling Algorithm : Region labeling using run length encoded data is simple and fast. This algorithm has two passes. In first pass, the runs are analyzed for neighborhood and labeled in row-wise. The label collision problem realized in first pass is solved by second pass. The algorithm has the following steps. 1. First pass: Use a new label for each continuous run in the first image row that is not part of the background. 2. For the second and subsequent rows, compare the positions of runs. (a) If a run in a row does not neighbor (in the 4- or 8- sense) any run in the previous row, assign a new label. (b) If a run neighbor precisely one run in the previous row, assign its label to the new run. (c) If the new run neighbors more than one run in the previous row, a label collision has occurred. (Collision information is stored in an equivalence table, and the new run is labeled using the label of any one of its neighbors). 3. Second pass: Search the image row by row and re-label the image according to the equivalence table information. The input and output is as in the attached image, no library or com is allowed I also attached the pdf paper of the algorithm