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.1: Long-distance communication between image sites in CRFs. 52
The next advantage of using CRFs is that they provide a foundation that easily induces global, local and regional knowledge of the document in the process. Because of the conditional nature of the system, any interaction between the fields’ labels in a Markov network can be learned from available knowledge. In this chapter we first introduce two-dimensional CRFs. Next, we describe feature functions which are the most important building blocks of CRFs. Then we note different types of observations that we extract from a document image. These observation are used inside our feature functions. This chapter also includes methods for decoding optimal label configuration for two-dimensional CRFs and methods for training parameters of the model. Finally, we note the results. 4.1 Conditional random fields (CRFs) tel-00912566, version 1 - 2 Dec 2013 First appeared in the domain of natural language processing, conditional random fields are proposed by Lafferty et al. [50] as a framework for building probabilistic models to segment and label sequence data. Example of such sequence data can be found in a wide variety of problems in text and speech processing such as part-of-speech (POS) tagging. Among probabilistic models that perform the same task, we can name Hidden Markov Models (HMMs) [78] that are well understood and widely used throughout the literature. HMMs identify the most likely label sequence for any given observation sequence. They assign a joint probability p(x, y) to pairs of observation (x) and label (y) sequences. To define a joint probability of this type, models must enumerate all possible observation sequences which is intractable for most domains, unless the observation elements are independent of each other within the observation sequence. Although this assumption is appropriate for simple toy examples, most practical observations are best represented in terms of multiple features with long-range dependencies. CRFs address this issue by using a conditional probability p(y|x) over label sequence given an observation sequence, rather than a joint distribution over both label and observation sequences. CRFs first appeared in the form of chain-conditional random fields. In other words, several fields are connected in a sequential format and the label of each field depends on the label of the field on its left and on the whole observation sequence. This model best fits for applications in signal and natural language processing in which the data appear naturally in a row format. In our application, we deal with images, which can be expressed naturally in two dimensions. Thus, we are interested in two-dimensional conditional random fields. To obtain our two-dimensional random fields, we first divide the document image into rectangular blocks with equal heights and widths. We call each block a site. Contrary to other CRFs that use sites with fix sizes for all document images, we choose the height and width of sites to be identical to half of the mean of heights and widths of all text characters on the document, respectively. 53
- 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: Chapter 4 Region detection tel-0091
- 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
tel-00912566, version 1 - 2 Dec 2013<br />
Figure 4.1:<br />
Long-dist<strong>an</strong>ce communication between image sites in CRFs.<br />
52