[105] A. Zahour, B. Taconet, L. Likform<strong>an</strong>-Sulem, <strong>an</strong>d W. Boussellaa. Overlapping <strong>an</strong>d multi-touching text-line segmentation by block covering <strong>an</strong>alysis. Pattern Analysis <strong>an</strong>d Applications, 12(4):335–351, July 2009. tel-00912566, version 1 - 2 Dec 2013 126
Index tel-00912566, version 1 - 2 Dec 2013 ABBYY FineReader, 2 Active contour model, 26 AdaBoost, 46 Adaptive local connectivity, 27 Aletheia, 11 Anisotropic Gaussi<strong>an</strong>, 31 Auto correlation, 18 B-spline wavelets, 20 Belief propagation, 70 Binary partition tree, 100, 101 Boosted decision trees, 46 Boosting, 46 Bottom-up approach, 18 Br<strong>an</strong>ch-<strong>an</strong>d-bound algorithm, 20 Camera-captured, 20, 21, 24, 26 CAMSHIFT, 17 Classifier selection, 45 Co-occurrence matrices, 17 Conditional r<strong>an</strong>dom fields, 53 Connected components <strong>an</strong>alysis, 5 Constrained run-length algorithm, 19 Cross-validation, 45 D-spline wavelets, 20 De-warping contest, 26 Delaunay tri<strong>an</strong>gulation, 26 Delauney tessellation, 18 Dempster-Shafer theory, 17 Diagonal run-lengths, 16 Dist<strong>an</strong>ce-based region detection, 18, 19 Docstrum, 18, 19 Document image <strong>an</strong>alysis, 2 Document page segmentation, 3 Dynamic programming, 56 Emission probability, 92 Feature <strong>an</strong>alysis, 44 Feature correlation, 45 Feature functions, 56, 62 Feature relev<strong>an</strong>ce, 45 Filter b<strong>an</strong>k, 26 Forward-backward algorithms, 71 Frequency features, 17 Fuzzy C-me<strong>an</strong>s classifier, 29 Gabor filtering, 60 Gaussi<strong>an</strong> probability density, 29 Gaussi<strong>an</strong> smoothing, 26 GentleBoost, 46 Geometric layout <strong>an</strong>alysis, 3 Geometrical features, 16 Global projections, 27 Gradient vector flow, 26 Ground truth, 8 H<strong>an</strong>dwritten text line detection, 27 Height <strong>an</strong>d width maps, 58 Hessi<strong>an</strong> matrix, 71 Hidden Markov Models, 29, 53, 88 Highly curled text lines, 26 hOCR, 98 Horn-Riley based ridge detection, 26 Hough tr<strong>an</strong>sform, 14, 30 Hu-moments, 44 Image binarization, 5 Image pyramids, 17 Information gain, 44 Iterated Conditional Models, 68 K-me<strong>an</strong>s clustering, 20 K-nearest neighbors, 19 L-BFGS, 71 Label decoding, 56, 66 Level-set methods, 32 LogitBoost classifier, 46 Loopy belief propagation, 68, 70 Marginal inference, 55 Markov r<strong>an</strong>dom fields, 18, 20, 21 127
- Page 1 and 2:
tel-00912566, version 1 - 2 Dec 201
- Page 3 and 4:
Resumé La segmentation de page est
- Page 5 and 6:
Acknowledgements This work would no
- Page 7 and 8:
4.3.2 Text components . . . . . . .
- Page 9 and 10:
3.6 Two documents that have obtaine
- Page 11 and 12:
6.1 PARAGRAPH DETECTION SUCCESS RAT
- Page 13 and 14:
tel-00912566, version 1 - 2 Dec 201
- Page 15 and 16:
detection and we conclude that the
- Page 17 and 18:
tel-00912566, version 1 - 2 Dec 201
- Page 19 and 20:
tel-00912566, version 1 - 2 Dec 201
- Page 21 and 22:
Figure 1.8: A screen shot that show
- Page 23 and 24:
Chapter 2 Related work tel-00912566
- Page 25 and 26:
tel-00912566, version 1 - 2 Dec 201
- Page 27 and 28:
them. In such circumstances, it wou
- Page 29 and 30:
tel-00912566, version 1 - 2 Dec 201
- Page 31 and 32:
[21] is another texture-based metho
- Page 33 and 34:
Figure 2.4: Part of a document in o
- Page 35 and 36:
• Degraded quality due to ageing
- Page 37 and 38:
2.3.2 Handwritten text line detecti
- Page 39 and 40:
(a) Divided strips and their projec
- Page 41 and 42:
(a) Five zones 1-5 (b) Projection p
- Page 43 and 44:
would be difficult to draw a conclu
- 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 and 96: tel-00912566, version 1 - 2 Dec 201
- Page 97 and 98: Chapter 5 Text line detection tel-0
- 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: [91] M. Stamp. A revealing introduc