Segmentation of heterogeneous document images : an ... - Tel
Segmentation of heterogeneous document images : an ... - Tel Segmentation of heterogeneous document images : an ... - Tel
tel-00912566, version 1 - 2 Dec 2013 Figure 4.18: This figure displays the number of misclassified sites per iteration for 5 experiments with different maximum number of ICM cycles. trade-off between speed and accuracy of the training process. 4.9 Final Notes This chapter provided a method for detecting and separating regions or columns of text. Because we are yet to detect paragraphs within each region, a complete evaluation and comparison of the results will be performed in chapter 6, when other parts of the system are available. 86
Chapter 5 Text line detection tel-00912566, version 1 - 2 Dec 2013 Text line detection refers to the segmentation of each text region into distinct entities, namely text lines. In chapter 2 we mentioned and analyzed many methods for detecting text line. Our text line detection method is a variant of the method proposed by Papavassiliou in [75]. The original method segments a document image into non-overlapping vertical zones with equal width. The height of each zone is equal to the height of the document image. Its width is equal to 5% of the width of the document image so as to ignore the effect of skewed text lines, and wide enough to contain decent amount of characters. Also the original method disregards zones situated close to the left and right borders of the page; mainly because they do not contain sufficient amount of text. Since documents in our corpus contain side notes, it is not wise to dismiss zones that do not contain sufficient amount of text compared to zones in the middle of the document. One reason why the original method neglects these zones is because of the effect of large gaps that affect the overall estimation of model parameters. To solve this problem we ensure that parameters of the model are estimated from detected text regions. Also we ensure that detected lines do not cross from one text region to another as it happens in the original method. 5.1 Initial text line separators The first step is to calculate the projection profile of each vertical zone onto y axis. Let P R i be the projection profile of the i th vertical zone onto y axis. Peaks and valleys of PRs give rough indication of the location of text lines; however, in the case where writing style results in large gaps between successive words, a vertical zone many not contain enough foreground pixels for every text line. In order to slake the influence of these instances on P R i , a smoothed projection profile SP R i is estimated as a normalized weighted sum of M profiles on either side of the i th zone. The dimension for P R i and SP R i is 1 × Page’s height. In figures 5.1 and 5.2, the bar chart view for P R i and SP R i are rendered at the 87
- Page 45 and 46: The proposed methods by Xiao [102],
- Page 47 and 48: tel-00912566, version 1 - 2 Dec 201
- Page 49 and 50: is assigning a label to a region of
- Page 51 and 52: fixed range. When the elongation ap
- Page 53 and 54: tel-00912566, version 1 - 2 Dec 201
- Page 55 and 56: The second method calculates the co
- Page 57 and 58: 3. Repeat for m = 1, 2, ..., M •
- Page 59 and 60: tel-00912566, version 1 - 2 Dec 201
- Page 61 and 62: Chapter 4 Region detection tel-0091
- Page 63 and 64: The next advantage of using CRFs is
- Page 65 and 66: weights that are assigned to edge a
- Page 67 and 68: { 1 if ys = text and y f 1 (y s , y
- Page 69 and 70: (a) Document (b) Filled text compon
- Page 71 and 72: tel-00912566, version 1 - 2 Dec 201
- Page 73 and 74: tel-00912566, version 1 - 2 Dec 201
- Page 75 and 76: f = [y c = 0] × [y tl = 0] f = [y
- Page 77 and 78: (a) Ground-truth (b) y c = 0 tel-00
- Page 79 and 80: ∂l λ = ∑ ( ∑y∈Y f k (y s ,
- Page 81 and 82: incorrect [100]. Several sufficient
- Page 83 and 84: tel-00912566, version 1 - 2 Dec 201
- Page 85 and 86: tel-00912566, version 1 - 2 Dec 201
- Page 87 and 88: tel-00912566, version 1 - 2 Dec 201
- Page 89 and 90: tel-00912566, version 1 - 2 Dec 201
- Page 91 and 92: Table 4.3: TION COUNT WEIGHTED SUCC
- Page 93 and 94: tel-00912566, version 1 - 2 Dec 201
- Page 95: tel-00912566, version 1 - 2 Dec 201
- Page 99 and 100: tel-00912566, version 1 - 2 Dec 201
- Page 101 and 102: tel-00912566, version 1 - 2 Dec 201
- Page 103 and 104: Having specified the model, a verti
- Page 105 and 106: • The fifth step is to remove ext
- Page 107 and 108: tel-00912566, version 1 - 2 Dec 201
- Page 109 and 110: text lines can be divided into two
- Page 111 and 112: the two children. The root node rep
- Page 113 and 114: leaves of the tree which contain on
- Page 115 and 116: tel-00912566, version 1 - 2 Dec 201
- Page 117 and 118: tel-00912566, version 1 - 2 Dec 201
- Page 119 and 120: tel-00912566, version 1 - 2 Dec 201
- Page 121 and 122: currently working on some of these
- Page 123 and 124: • fn (false negative) is the numb
- Page 125 and 126: 2 ∗ RA ∗ DR F − Measure = RA
- Page 127 and 128: • ”-tn”: This option uses the
- Page 129 and 130: [12] T. M. Breuel. Two geometric al
- Page 131 and 132: [39] B. Gatos, A. Antonacopoulos, a
- Page 133 and 134: [64] K. P. Murphy, Y. Weiss, and M.
- Page 135 and 136: [91] M. Stamp. A revealing introduc
- Page 137 and 138: Index tel-00912566, version 1 - 2 D
tel-00912566, version 1 - 2 Dec 2013<br />
Figure 4.18: This figure displays the number <strong>of</strong> misclassified sites per iteration for<br />
5 experiments with different maximum number <strong>of</strong> ICM cycles.<br />
trade-<strong>of</strong>f between speed <strong>an</strong>d accuracy <strong>of</strong> the training process.<br />
4.9 Final Notes<br />
This chapter provided a method for detecting <strong>an</strong>d separating regions or columns<br />
<strong>of</strong> text. Because we are yet to detect paragraphs within each region, a complete<br />
evaluation <strong>an</strong>d comparison <strong>of</strong> the results will be performed in chapter 6, when<br />
other parts <strong>of</strong> the system are available.<br />
86