extfieldsofstudy:
Computer Science
Medicine

text:
Insights into analysis operator learning: From patch-based sparse models to higher-order MRFs

This paper addresses a new learning algorithm for the recently introduced co-sparse analysis model. First, we give new insights into the co-sparse analysis model by establishing connections to filter-based MRF models, such as the Field of Experts (FoE) model of Roth and Black. For training, we introduce a technique called bi-level optimization to learn the analysis operators. Compared to existing analysis operator learning approaches, our training procedure has the advantage that it is unconstrained with respect to the analysis operator. We investigate the effect of different aspects of the co-sparse analysis model and show that the sparsity promoting function (also called penalty function) is the most important factor in the model. In order to demonstrate the effectiveness of our training approach, we apply our trained models to various classical image restoration problems. Numerical experiments show that our trained models clearly outperform existing analysis operator learning approaches and are on par with state-of-the-art image denoising algorithms. Our approach develops a framework that is intuitive to understand and easy to implement.

Abstract-This paper addresses a new learning algorithm for the recently introduced co-sparse analysis model. First, we give new insights into the co-sparse analysis model by establishing connections to filter-based MRF models, such as the Field of Experts (FoE) model of Roth and Black. For training, we introduce a technique called bi-level optimization to learn the analysis operators. Compared to existing analysis operator learning approaches, our training procedure has the advantage that it is unconstrained with respect to the analysis operator. We investigate the effect of different aspects of the co-sparse analysis model and show that the sparsity promoting function (also called penalty function) is the most important factor in the model. In order to demonstrate the effectiveness of our training approach, we apply our trained models to various classical image restoration problems. Numerical experiments show that our trained models clearly outperform existing analysis operator learning approaches and are on par with state-of-the-art image denoising algorithms. Our approach develops a framework that is intuitive to understand and easy to implement.
Index Terms-analysis operator learning, loss-specific training, bi-level optimization, image restoration, MRFs

I. INTRODUCTION
O ne of the most successful approaches to solve inverse problems in image processing is to minimize a suitable energy functional whose minimizer provides a trade-off between a smoothness term and a data term. In a Bayesian framework, energy minimization can also be interpreted as finding the Maximum-a-Posteriori (MAP) estimate. Hence, the smoothness term is related to the image prior distribution and the data term is related to the data likelihood. Some classical smoothness terms are the squared 2 norm of the image gradients, the 1 norm of the image gradients (total variation), wavelet sparsity or more general MRF priors. Among the overwhelming number of priors in the literature, sparse representations have attracted remarkable attention in the last decade. Sparse representation models have been intensively investigated and widely used in various image processing applications such as image denoising, image inpainting, super resolution, etc. See for example [13], [25], [15] and references therein.

A. Patch-based synthesis and analysis models
Historically, sparse representations refer to the so-called sparse synthesis model. In the synthesis-based models, a signal x ∈ R m (a patch) is called sparse over a given dictionary D ∈ R m×n with m ≤ n, when it can be composed of a linear combination of only a few atoms from dictionary D. This is formulated as the following minimization problem: where f ∈ R m is the observed patch, α ∈ R n is the coefficient vector and φ is the penalty function. In order to induce sparsity in the representation, typical penalty functions include p norms with p ∈ {0, 1} or logarithmic functions such as log(1 + |z| p ), with p ∈ {1, 2}. The synthesis model has been intensively studied in the past decade, including global and specialized dictionary learning algorithms and applications to various image processing tasks, see [13], [1], [22], [24], [26] for examples. However, there is another viewpoint to consider sparse representations, which is the so-called co-sparse analysis model [14]. The objective of a co-sparse model is to pursue a linear operator A ∈ R n×m , such that the resulting coefficient vector Ax ∈ R n is expected to be sparse. In the framework of MAP inference, the co-sparse analysis model is given as the following minimization problem: where A is the so-called analysis operator, φ is again a sparsity promoting function as mentioned above and f ∈ R m is the observed patch. Note that both the analysis model and the synthesis model become equivalent if D is invertible. However, the analysis model is much less investigated compared to the well-known synthesis model, but it has been gaining more and more attention in recent years [17], [28], [32].

B. Patch-based analysis operator learning
In the case of the synthesis model, the learning of an optimized dictionary has become ubiquitous. However, in analysis-based models, fixed operators inspired from variational methods such as the discrete total variation have been used for a long time. It is only recently that people started to develop customized algorithms to learn in some sense optimal analysis operators.
Existing algorithms mainly concentrate on the patchbased training strategy. Given a set of S training samples Y = [y 1 , . . . , y S ] ∈ R m×S , where depending of the training arXiv:1401.2804v1 [cs.CV] 13 Jan 2014 procedure, each sample is a noisy version or a clean version of an image patch. For the noisy version, y i = x i + n i , where n i is an additive zero-mean white Gaussian noise vector and x i is the clean signal.
For the noise-free training, the goal of the analysis operator learning is to find a linear operator A ∈ R n×m with m ≤ n, such that the coefficient vector Ay i is as sparse as possible. This strategy can be formally expressed as the following optimization problem.
For the noise aware case, the objective is to learn an optimal analysis operator A, which enforces the coefficient vector Ax i to be sparse, while x i − y i 2 2 ≤ ε for each training sample (ε is an error tolerance, which is derived from the noise level). This requires solving a problem of the form Using a Lagrange multiplier λ > 0 this can be equivalently expressed as where φ is again a sparsity promoting function and · F denotes the Frobenius norm. Unfortunately, the above optimization problems suffer from the problem of trivial solutions. Indeed, if no constraints are imposed on A, it is easy to see that the trivial solution A ≡ 0 is the global minimizer of (I.3), (I.4) and (I.5). A possible solution to exclude the trivial solution is to impose additional assumptions on A, i.e., restricting the solution set to an admissible set C. The following constraints have been investigated in [39] and [17]: (i) row norm constraints. All the rows of A have the same norm, i.e., A i 2 = c for the i th row of operator A. (ii) row norm + full rank constraints. The analysis operator A has full rank, i.e., rk(A) = m. (iii) tight frame constraints. The admissible set of this constraint is the set of tight frame in R n×m , i.e., where I m is the identity operator in R m . As pointed out in [39], each individual constraint presented above does not lead to satisfactoy results. Therefore, in [39], [40] a constraint called the Uniform Normalized Tight Frame (UNTF) was proposed, which is a combination of the unit row norm and the tight frame constraint. The authors of [17] employed a constraint combining the unit row norm and the full rank constraint with an additional consideration that the analysis operator A doesn't have trivially linear dependent rows, i.e., A i = A j for i = j.
In [39], Yaghoobi et al. employed the convex 1 -norm, i.e., φ(AY ) = AY 1 , as sparsity promoting function and the UNTF constraint to solve problem (I.3). In [40], the same authors proposed an extension of their previous algorithm that simultaneously learns the analysis operator and denoises the training samples. The improved algorithm solves the problem (I.5) by alternating between updating the analysis operator and denoising the training samples. They gave some preliminary image denoising results by applying the learned operator to natural face images.
In [17], Hawe et al. exploited the above constraints -full rank matrices with normalized rows, and a non-convex sparsity measurement function called the mixed (p, q)-pseudo-norm to minimize problem (I.3). They employed a conjugate gradient method on manifolds to solve this optimization problem. Their experimental results for classical image restoration problems show competitive performance compared to state-of-the-art techniques.
Rubinstein et al. [31] presented an adaption of the widely known K-SVD dictionary learning method [13] to solve the problem (I.4) directly based on the 0 quasi-norm, i.e., φ(AY ) = AY 0 . Unfortunately, there are only synthetic experiments and examples based on piece-wise constant images considered in their work. The same authors presented some preliminary natural image denoising results in their later work [32]. However, it turns out that the performance of the learned analysis operator is inferior to the synthesis model [13].
Ophir et al. [27] proposed a simple analysis operator learning algorithm, where analysis "atoms" are learned sequentially by identifying directions that are orthogonal to a subset of the training data.
Apart from the above analysis operator learning algorithms, Peyré and Fadili proposed an attractive learning approach in [28]. They considered the analysis operator from a particular viewpoint. They interpreted the behavior of the analysis operator as a convolution with some finite impulse response filters. Keeping this idea in mind, they formulated the analysis operator learning as a bi-level programming problem [8] which was solved using a gradient descent algorithm. However, their work only considered a simple case -one filter and 1D signals. Following this direction, a preliminary attempt to apply this idea to 2D image processing was done in [6].

C. Motivation and contributions
Among the existing algorithms for analysis operator learning, only few prior works have been evaluated based on natural images [40], [32], [17]. Moreover, most of these algorithms have to impose a non-convex constraint on the analysis operator A, making the corresponding optimization problems hard to solve. Thus a question arises: Is it possible to introduce a more principled technique to learn optimized analysis operators without the need to impose additional constraints on the operators?
In this paper, we give an answer to this question. First, we extend the patch-based analysis model to a global image regularization term, which allows to consider also more general inverse problems such as image deconvolution and image inpainting. Then, we show that this model is equivalent to higher-order filter-based MRF models such as the FoE model [30]. Motivated by this observation, we apply a loss-function based training scheme [33] and show that this approach excludes the trivial solution of the analysis operator learning problem without imposing any additional constraints. Furthermore, we carefully investigate the effect of different aspects of the analysis based model. We show that the choice of the sparsity promoting function is the most important aspect. We present various experimental results for standard image restoration problems to demonstrate the effectiveness of our training model. Numerical results show that our trained model significantly outperforms existing analysis operator based models and is on par with specialized image denoising algorithms while being computationally very efficient. Therefore, our training procedure provides an attractive alternative to existing approaches.
A shorter version of this paper was presented in GCPR [7].

D. Notation
In this paper, our model presents a global prior over the entire image instead of small image patches. In order to distinguish between a small patch and an entire image, we represent a square patch (patch size: and an image (image size: M × N , with m M, m N ) by u ∈ R M N . We denote the patch-based synthesis dictionary and analysis operator by D ∈ R m×n and A ∈ R n×m with m ≤ n, respectively. Furthermore, when the analysis operator A is applied to the entire image u, we use the common sliding-window fashion to compute the coefficients Ax for all M N patches in the image. This result is equivalent to a multiplication of a highly sparse matrix A ∈ R (n×M N )×M N with the image u, i.e., Au. We can group A to n separable sparse matrices {A 1 , . . . , A n }, where A i ∈ R M N ×M N is associated with the i th row of A (A i ). If we consider A i as a 2-D filter ( √ m × √ m), we have: A i u is equivalent to the result of convolving image u with filter A i .

II. INSIGHTS INTO ANALYSIS BASED MODELS
In this section, we first show the equivalence between the patch-based analysis model and filter-based probabilistic image patch modeling -Product of Experts (PoE) [38], [18]. Then we extend the patch-based analysis model to the imagebased model and show connections to higher order MRFs [30].

A. Equivalence between the patch-based analysis model and the PoE model
The patch-based analysis model in (I.2) focuses on modeling small image patches, which is formulated as a matrix-vector multiplication (Ax). This procedure can be interpreted as projecting a signal x (an image patch) onto a set of linear components {A i } n i=1 , where each component A i is a row of the matrix A. Note that projecting an image patch onto a linear component (A i x) is equivalent to filtering the patch with a linear filter given by A i .
The PoE model provides a prior distribution on small image patches by taking the product of several expert distributions, where each expert works on a linear filter and the expert function. The PoE model is formally written as p( where ρ i is the potential function, Z(Θ) is the normalization and Θ are the parameters of this model. Comparing the analysis prior given in (I.2), with the above PoE model, we can see they are actually the same model if we choose the penalty function as φ i = −logρ i . In this case, if we consider the analysis operator learning problem based on the strategy which focuses on the modeling of small image patches rather than defining a prior model over an entire image, the learning problem is tantamount to learning filters in the PoE model.

B. From patch-based to image-based model
Patch-based models are only valid for the reconstruction of a single patch. When they are applied to full image recovery, a common strategy is patch averaging [13]. All the patches in the entire image are treated independently, reconstructed individually and then integrated to form the final reconstruction result by averaging the overlapping regions. While this method is simple and intuitive, it clearly ignores the coherence between over-lapping patches, and thus misses global support during image reconstruction. To overcome these drawbacks, an extension to the whole image is necessary where patches are not treated independently but each of them is a part of the image.
A promising direction to formulate an image-based model is to make use of the formalism of higher-order MRFs which enforce coherence across patches [17]. The basic idea is to modify the patch-based analysis model in (I.2) such that all possible patches in the entire image and the corresponding coefficient vectors Ax are considered at once. This leads to an image-based prior model of the form: and P p ∈ R m×Np is a sampling matrix extracting the patch at pixel p in image u. For the patches at the image boundaries, we extract patches by using symmetric boundary conditions.
A key characteristic of the model (II.2) is that it explicitly models the overlapping of image patches, which are highly correlated. Intuitively, it is a better strategy for image modeling compared to the patch averaging approach. In Subsection V-A we will provide experimental results to support this claim.

C. Equivalence between the image-based analysis model and the FoE model
we can rewrite this term as where (A i * u p ) denotes the result of convolving the patch at pixel p with filter A i . After having a closer look at this prior term, interestingly we find that it is the same as the FoE model proposed by Roth and Black [30]. The FoE models the prior probability of an image by using a set of linear filters and a potential function. The probability density function for the entire image is written as where ρ i is the potential function, Z(Θ) is the normalization and Θ is a vector holding the parameters of this model. Based on the observation that responses of linear filters applied to natural images typically exhibit heavy tailed distribution, two types of heavy tailed potential functions, the Student-t distribution (ST) and generalized Laplace distribution (GLP), are commonly considered: Comparing (II.3) and (II.4), we can see that they are exactly the same if we choose the penalty function φ i = −logρ i , Note that these choices lead to commonly used non-convex sparsity promoting functions [38], [17].
In conclusion, the FoE model can be seen as an extension of the co-sparse analysis model from a patch-based formulation to an image-based formulation. It comes along with the advantage of inherently capturing the coherence between overlapping patches which has to be enforced explicitly in patch-based models. As we will see in the next section, the image-based model also allows to learn optimized analysis operators without the need for additional constraints.

III. LEARNING
In this section, we first present a loss-based training procedure based on bi-level optimization. Our algorithm is closely related to the algorithm proposed in [33] but we propose to solve the lower level problems with high accuracy which leads to improved gradient directions for minimizing the loss function with respect to the model parameters. As a result of this seemingly minor modification, we achieve significantly better results compared to previous work. For more details about the refined training algorithm we refer to [7].

A. Bi-level optimization
Existing approaches to learn the parameters in the FoE model fall into two main types: (1) probabilistic learning using sampling-based algorithms, e.g., [30], [34], [16]; (2) bi-level training based on MAP estimation, e.g., [11], [3], [33], [35]. Reviewing all algorithms is beyond the scope of this paper. Here we focus on the the bi-level training scheme and refer the interested reader to [7] for a survey.
Bi-level optimization is a popular and effective technique for selecting hyper parameters, cf. [10], [36], [21]. The problem of learning the analysis operator can be written as the following bi-level optimization problem Given a noisy observation f and the ground truth g, our goal is to find optimal hyper parameters ϑ such that the minimizer u * (ϑ) of the lower level problem E(u, f, ϑ) minimize the higher level problem L(u * (ϑ), g). In our case, the hyper parameters will be used to parametrize the analysis operators as well as the potential functions, the lower level problem is given by the energy function and the higher level problem is given by a certain loss function that compares the solution of the lower level problem with the ground truth solution. First, we consider the lower level problem. Treating the analysis operator A ∈ R n×m in (II.3) as n filters with dimension √ m× √ m, the analysis model for image denoising is given by , A i is an N p × N p highly sparse matrix, which makes the convolution of the filter A i with a two-dimensional image u equivalent to the product of the matrix A i with the vectorization of u, i.e., A i * u ⇔ A i u, and α i ≥ 0 is the weight parameter associated to the filter A i . In our training model, we express the filter A i as a linear combination of a set of basis filters {B 1 , · · · , B N B }, i.e., The loss function is defined to penalize the difference (loss) between the optimal solution of the energy minimization problem and the ground-truth. In this paper, we make use of the following differentiable function as in [33]: where g is the ground-truth image and u * is the minimizer of energy function (III.2). This loss function has an interpretation of pursuing as high PSNR as possible.
Given the training samples {f s , g s } S s=1 , where g s and f s are the s th clean image and the associated noisy version respectively, our aim is to learn an optimal analysis operator or a set of filters which are defined by parameters ϑ = (α, β) (we group the coefficients β ij and weights α i into a single vector ϑ), such that the overall loss function for all samples is as small as possible. Therefore, our learning model is formulated as the following bi-level optimization problem: We eliminate λ for simplicity since it can be incorporated into the weights α. Our analysis operator training model has two advantages over existing analysis operator learning algorithms. (a) It is completely unconstrained with respect to the analysis operator A. Normally, existing approaches such as [39], [40], [17] have to impose some non-convex constraints over the analysis operator. On the one hand, this makes the corresponding optimization problem difficult to solve, and on the other hand it decreases the probability of learning a meaningful analysis operator, because as indicated in [39], there is no evidence to prove that the introduced constraints are the most suitable choices. The reason why constraints are indispensable for these approaches lies in the need to exclude the trivial solution A = 0. However, looking back at our training model, this trivial solution can be avoided naturally. If A = 0, the optimal solution of the lower-level problem in (III.5) is certainly u * s = f s , which makes the loss function still large; thus this trivial solution is not acceptable in that the goal of our model is to minimize the loss function. Therefore, the optimal operator A must comprise some meaningful filters such that the minimizer of the lower-level problem is close to the ground-truth. (b) The learned analysis operator inherently captures the properties of overlapping patches. In [13], [31], [32], [39], their approaches present a patch-based prior, and thus for global reconstruction of an entire image, the common strategy consists of two stages: (i) extract overlapping patches, reconstruct them individually by synthesisprior or analysis-prior based model, and (ii) form the entire image by averaging the final reconstruction results in the overlapping regions. This strategy clearly misses global support during the reconstruction process; however our approach can overcome these drawbacks. In the work of [17], the authors employ the patch-based model to train the analysis operator, but use it in the manner of an image based model. Clearly, if the final intent is to use the analysis operator in an image-based model, a better strategy is to train it also in the same framework.

B. Solving the bi-level problem
In this subsection, we consider the bi-level optimization problem from a general point of view. For convenience, we only consider the case of a single training sample and we show how to extend the framework to multiple training samples in the end.
According to the optimality condition, the solution of the lower-level problem in (III.5) is given by u * , such that ∇ u E(u * ) = 0. Therefore, we can rewrite problem (III.5) as following constrained optimization problem Now we can introduce Lagrange multipliers and study the Lagrange function where µ ∈ R n and p ∈ R Np are the Lagrange multipliers associated to the inequality constraint α ≥ 0 and the equality constraint in (III.6), respectively. Here ·, · denotes the standard inner product. Taking into account the inequality constraint α ≥ 0, the first-order necessary condition for optimality is given by 1 , p , · · · , (·) r , p ) T , and N c = n × N B . Note that the last equation is derived from the optimality condition for the inequality constraint α ≥ 0, which is expressed as α ≥ 0, µ ≥ 0, α, µ = 0. It is easy to check that these three conditions are equivalent to µ − max(0, µ − cα) = 0 with c to be any positive scalar and max operates coordinate-wise.
In principle, we can continue to calculate the second derivatives of (III.7), i.e., the Jacobian matrix of G, with which we can then employ a Newton's method to solve the necessary optimality system (III.8) as in [21]. However, for this problem, calculating the Jacobian of G is computationally expensive; thus in this paper we do not consider the second derivatives and only make use of the first derivatives. An efficient Newton's method is subject to the future work.
In our training model, what we are interested in is the parameters ϑ = {α, β}. We can reduce unnecessary variables in (III.8) by solving for p and u in (III.8), and substituting them into the second and the third equation. We arrive at the following gradients of the loss function with respect to the parameters ϑ: Note that in (III.9) we also eliminated the Lagrange multiplier µ associated to the inequality constraint α ≥ 0 since we utilize a quasi-Newton's method for optimization, which can easily handle this type of box constraints; therefore we do not need to consider the inequality constraint in the derivatives. The derivatives in (III.9) are equivalent to the results presented in [33], which used implicit differentiation for the derivation.
Considering the case of S training samples, in fact it turns out that the derivatives of the overall loss function in (III.5) with respect to the parameters ϑ are just the sum of gradients given in (III.9) with respect to all the training samples.
the parameters ϑ, so we can now employ gradient descent based algorithms, e.g., the steepest descent method, for optimization. Although this type of algorithm is very easy to implement, it is not efficient. In this paper, we turn to a more efficient non-linear optimization method -the Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) quasi-Newton's method [23]. We summarize our bi-level learning scheme in Algorithm III.1. In our work, step (ii) in Algorithm III.1 is completed using the L-BFGS algorithm, as this problem is smooth, to which L-BFGS is perfectly applicable. We solve this minimization problem to a very high accuracy with ∇ u E(u * ) 2 ≤ 10 −3 (gray-values in the range [0 255]), i.e., we use a more conservative convergence criterion in this inner loop than previous work [33]. The training algorithm is terminated when the relative change of the loss is less than a tolerance, e.g., tol = 10 −5 , a maximum number of iterations e.g., maxiter = 500 is reached or L-BFGS can not find a feasible step to decrease the loss.

IV. TRAINING EXPERIMENTS
We conducted our training experiments using the training images from the BSDS300 image segmentation database [2]. We used the whole 200 training images, and randomly sampled one 64 × 64 patch from each training image, resulting in a total of 200 training samples. We then generated the noisy versions by adding Gaussian noise with standard deviation σ = 25. Figure 1 shows an exemplary subset of the training data together with the noisy version.
In order to evaluate the performance of the learned analysis operators, we applied them to the image denoising experiment over a validation dataset consisting of 68 images from Berkeley database [2]. This is a common denoising test dataset for natural images, which was selected by Roth and Black [30]. The performance of an image denoising algorithm varies greatly for different image contents. We therefore consider the average performance over the whole test dataset as performance measure.

A. Penalty functions
So far we have not designated the penalty function φ used in our training model. In this paper, we consider three penalty functions with different properties: (1) the 1 norm, which is a well-known convex sparsity promoting function and has been successfully applied to a number of problems in image restoration [12], (2) the log-sum penalty suggested in [4], log(1 + |z|), which is a non-convex function and can enhance sparsity and (3) the smooth non-convex function log(1 + z 2 ), which is derived from the student-t distribution and has been employed as the penalty function for sparse representation [37]. As our training model needs differentiable penalty functions, we have to use a small parameter ε to regularize the absolute function |z|. The penalty functions and their associated derivatives are given by

B. Training experiments
We focused training on filters of dimension 7 × 7, since our approach allowed us to train larger filters than those trained in [34], [16], and normally larger filters can involve more information of the neighborhood. First, we conducted a preliminary training experiment based on the penalty function log(1 + z 2 ). We intended to learn an analysis operator A ∈ R 48×49 , i.e, 48 filters with dimension 7 × 7, and each filter is expressed as a linear combination of the DCT-7 basis. In principle, we can use any basis such as the identity, PCA or ICA basis; however as described below, we need zero-mean filters, which is guaranteed by the DCT filters after excluding the filter with constant entries.
For the preliminary experiment, we initialized the analysis operator using 48 random filters having unified norms and weights, which are 0.01 and 1, respectively. Finally training result shows that all the coefficients with respect to the first atom of DCT-7 (an atom with constant entries) are approximately equal to zero, implying that the first atom isn't necessary to construct the filters. Therefore the learned filters are undoubtedly zero-mean because all the remaining atoms are zero-mean; this makes the analysis prior based (8. Fig. 2. 48 filters of size 7×7 learned by using the penalty function log(1+z 2 ). Each filter is shown with the corresponding norm and weight. The first number in the bracket is the weight α i and the second one is the norm of the filter.

model (III.2) illumination invariant. This result is coherent
with the findings in the work [19] that meaningful filters should be zero-mean. Then we explicitly exclude the first atom in DCT-7 to speed up the training process for the following experiments.
We then conducted training experiments based on three different penalty functions. In this paper, the regularization parameter ε in (IV.1) was set to ε = 10 −2 . Smaller ε implies a better fitting to the absolute function, but it makes the lowerlevel problem harder to solve and the training algorithm fail. Just like in the preliminary experiment, we also learned 48 filters. We initialized the filters using the modified DCT-7 basis with unified norms and weights. The optimal analysis operator learned by using the penalty function log(1 + z 2 ) is shown in Figure 2. The final loss function values (normalized by the number of training images) of these three experiments are presented in Table I (first three columns), together with the average denoising PSNR results based on 68 test images with σ = 25 Gaussian noise.
As shown in Figure 2, the learned filters present some special structures. We can find high-frequency filters as well as derivative filters including the first derivatives along different directions, the second and the third derivatives. These filters make the analysis prior based model (III.2) a higher-order model which is able to capture the structures in natural images that cannot be captured by using only the first derivatives as in the total variation based methods. In our training model, the size and the number of filters are free parameters; thus we can train filters of various sizes and numbers. Our current implementation is unoptimized Matlab code. The training time for 48 filters of size 7 × 7 was approximately 24 hours on a server (Intel X5675, 3.07GHz), 98 filters of size 7 × 7 took about 80 hours. However, the training time for larger filter size 9 × 9 was much longer; it took about 20 days. Fortunately, the training procedure is off-line; thus the training time does not matter too much in practice. Demo training code can be downloaded from our homepage 1 .

C. The influence of the penalty function
From Table I, we can see that the results obtained by two non-convex penalty functions, log(1 + |z|) and log(1 + z 2 ) are 1 www.gpu4vision.org -log PDF log(1 + z 2 ) log(1 + |z|) |z| Fig. 3. Negative log probability density function (PDF) of the filter response of a learned 7 × 7 filter applied to natural images. Note that non-convex functions log(1 + |z|) and log(1 + z 2 ) provide much better fits to the heavy tailed shape of the true density function, compared to the convex function |z|. very similar; however, there is a great improvement compared with the convex 1 penalty function. The reason is as follows.
It is well known that the probability density function (PDF) of the responses of zero-mean linear filters (e.g., DCT filters) applied to natural images exhibit heavy tailed distributions [19]. Figure 3 shows the negative log PDF of the first filter in Figure 2 applied to natural images together with different model fits. We can clearly see that two non-convex functions, log(1+|z|) and log(1+z 2 ) both provide an almost perfect fit to the heavy tailed shape of the true density function. The convex function |z| presents a much worse fitting, however. Therefore, a suitable penalty function is crucial for the analysis-prior based model. In general, in order to model the heavy tailed shape of the true PDF, a non-convex function is required. In order to further investigate how important the non-convex penalty function is for the analysis prior based model, we considered an analysis model consisting of 48 fixed and predefined filters (DCT-7 filters excluding the filter with uniform entries) and making use of the log(1 + z 2 ) penalty function. We only optimized the norm and weight of each filter by using our bi-level training algorithm. The training loss value and the denoising test result of this model are shown in Table I (the sixth column entitled "direct DCT-7"). The image denoising test result is surprisingly good, even though this analysis model only utilizes a predefined analysis operator DCT-7. We will see in Table II of Section V that the performance of this model is already on par with the currently best analysis operator learning model -GOAL [17], which involves much more carefully trained filters. The success of this model lies in the non-convex penalty function log(1 + z 2 ).

D. The influence of the number of filters
In previous work of analysis operator learning [31], [39], [17], the authors were interested in the over-complete case, where the number of filters is larger than the dimension of filters. Clearly our learned analysis operator in Figure 2 is undercomplete. In order to investigate the influence of the overcomplete property, we also conducted a training experiment for the over-complete case (A ∈ R 98×49 ) based on the penalty function log(1 + z 2 ). We initialized the analysis operator A using 98 random zero-mean filters. The performance of this over-complete case is presented in Table I.
From Table I, one can see that the improvement achieved by over-complete analysis operator is marginal. Therefore for the analysis model, under-complete operators already work sufficiently well. An increase of the number of filters can not bring large improvements.

E. The influence of filter size
Intuitively the size of filters should be an important factor for the analysis model. In order to investigate the influence of filter size, we conducted training experiments for several different analysis models, where the filter size varies from 3×3 to 9 × 9. The training and evaluation results of these models are presented in Table I and Figure 4.
One can see that increasing the filter size yields some improvements. However, the performance is close to saturation when the filter size is increasing to 7 × 7. The improvement brought by increasing the filter size to 9 × 9 is negligible. This implies that we can not expect large improvements by increasing the filter size to 11 × 11 or larger.
F. The robustness of our training scheme As our training model (III.5) is a non-convex optimization problem, we can only find local minima. Thus a natural question about the initialization arises. We did have experiments for different initializations, such as random initialization. The final learned analysis operators are surely different, but all of them have almost the same training loss, which is the goal of our optimization problem. In addition, these operators perform similarly in evaluation experiments.
Another issue about the robustness of our training scheme is the influence of the training dataset. Since the training patches were randomly selected, we could run the training experiment multiple times by using a different training dataset. Finally, we found that the deviation of test PSNR values based on 68 test images is within 0.02dB, which is negligible.

V. APPLICATION RESULTS USING LEARNED OPERATORS
An important question for a learned prior model is how well it generalizes. To evaluate this, we directly applied our learned analysis operators, which where trained for the image denoising task, to various image restoration problems such as image deconvolution, inpainting and super-resolution, as well as denoising. To start with, we first express the image restoration model by using our learned analysis operator, which is formulated as: where K is a linear operator which depends on the respective application to be handled.
To solve the minimization problem (V.1), for convex 1 based model, we used the first-order primal-dual algorithm proposed in [5] with the preconditioning technique described in [29]; for non-convex penalty function based model, we employed L-BFGS for optimization. For L-BFGS, we need to calculate the gradient ∇ u E, which includes constructing the highly sparse large matrix A i and its transpose A T i . This is quite time consuming in practice. In order to speed up the inference algorithm, we turn to a filtering technique as we know that A i u is equivalent to the filtering operation (A i * u). Therefore, the gradient ∇ u E is given by where A i * u denotes the convolution of image u with filter A i , and A − i denotes the filter obtained by mirroring A i around its center pixel (in practice, we need to carefully handle the boundaries as we need to ensure that the filters A − i correspond to A T i ). We provide Matlab demo code for training and denoising with penalty function log(1 + z 2 ) on our homepage www.gpu4vision.org.

A. Image denoising results
We first apply the analysis model based on our learned operators to the image denoising problem. In the case of image denoising, K is simply the identity matrix, i.e., K = I. Since the image denoising performance of one method varies greatly for different image contents, in order to make a fair comparison, we conducted denoising experiments over a standard test dataset -68 Berkeley test images identified by Roth and Black [30]. We used exactly the same noisy version of each test image for different methods and different test images were added with distinct noise realizations. All results were computed per image and then averaged over the test dataset.
We considered image denoising for various noise levels σ = {15, 25, 50}. For noise levels other than σ = 25, we need to tune the parameter λ in (V.1). An empirical choice of λ is: σ = 15, λ = 25/σ × 1.15; σ = 50, λ = 25/σ × 0.8. 1) Comparison of three different penalty functions: Table II shows the summary of denoising results achieved by different penalty functions. One can clearly see that two non-convex penalty functions lead to similarly good results and they significantly outperform the results of the convex function |z|. In addition, we can also see that the over-complete operator can not improve the performance too much and larger filters (9×9) can only achieve slightly better performance. Both of these two models are more time consuming than the model with 48 filters for inference; therefore, the analysis model based on 48 filters of size 7 × 7 offers the best trade-off between computational cost and performance. In the following experiments, we only consider the model of 48 filters and the penalty function log(1+z 2 ). We prefer the penalty function log(1+z 2 ), since it is completely smooth, making the corresponding minimization problem easier to solve. We present two denoising examples obtained by three different penalty functions in Figure 5.
2) Comparison to other analysis models: Our learned model is an analysis prior-based model, but can also be viewed as a MRF-based system. In order to rank our model among other analysis models, we compared its performance with existing analysis models, including typical FoE models [30], [34], [33], [3], [11], [16] and the currently published best analysis operator model -GOAL [17]. For the GOAL method, we made use of the l 0.4 -norm penalty function |z| 0.4 , together with the learned analysis operator Ω ∈ R 98×49 provided by the authors. We also utilized the L-BFGS algorithm to solve the corresponding minimization problem. We present image denoising results of all approaches over 68 test images with noise level σ = 25 in Table III. One can see that our model based on the penalty function log(1 + z 2 ) (48 learned filters, 7×7) has achieved the best performance among all the related approaches. The comparison with the best FoE [16] model and the latest analysis model GOAL for other noise levels is shown in Table II. For all the noise levels, our trained analysis model outperforms both of them significantly.
An interesting result in Table II is that the performance of the direct DCT-7 model, which only utilizes a predefined analysis operator DCT-7 (48 filters of size 7 × 7), is already on par with the GOAL model, which involves much more carefully trained filters (98 filters of size 7 × 7). For this direct DCT-7 model, we used the log(1 + z 2 ) penalty function, and only optimized the norms and weights of the filters using our bi-level training algorithm. This result demonstrates the importance of non-convex penalty functions and the effectiveness of our bi-level training scheme.
As the analysis operator of GOAL model is trained using a patch-based model, we can also use it in the manner of patch-averaging to conduct image denoising like K-SVD [13]. We embedded the learned analysis operator Ω into the patchbased analysis model (I.2), and used it to denoise each patch extracted from an image. We also considered overlapped windows and averaged the results in the overlapping regions to form the final denoised image. As expected, we got inferior results (average PSNR 28.25 over 68 test images) to the model formulated under the FoE framework (average PSNR 28.45).
3) Comparison to state-of-the-art methods: In order to evaluate how well our analysis models work for the denoising task, we compared their performance with leading image denoising methods, including three state-of-the-art methods: (1) BM3D [9]; (2) LSSC [25]; (3) GMM-EPLL [41] along with three leading generic methods: (4) a MRF-based approach, FoE [16]; (5) a synthesis sparse representation based method, KSVD [13] trained on natural image patches; and (6) the currently published best analysis operator learning method, GOAL [17]. All implementations were downloaded from the   Table II shows the summary of results. One can see that our trained model based on the penalty function log(1 + z 2 ) (48 learned filters, 7 × 7) outperforms three leading generic methods and is on par with three state-of-the-art methods for any noise level. To the best of our knowledge, this is the first time that a MRF model based on generic priors of natural images has achieved such clear state-of-the-art performance. Figure 6 gives a detailed comparison between our learned analysis model and three state-of-the-art methods over 68 test images for σ = 25. We can see that all the points surround the diagonal line "y = x" closely, i.e., all considered methods achieve very similar results. Therefore, it is clear that our learned analysis models based on non-convex penalty functions are state-of-the-art. We present an image denoising example of the considered methods in Figure 7.
Our model is well-suited to GPU parallel computation since it solely contains convolution of filters with an image. Our GPU implementation based on a NVIDIA Geforce GTX 580 accelerates the inference procedure significantly; for a denoising task with σ = 25, typically it takes 0.87s for image size 512×512, 0.60s for 481×321 and 0.29s for 256×256, i.e., using our GPU based implementation, image denoising can be conducted in near real-time at 3 sequence, with state-of-the-art performance. In Table IV, we show the average running time of the considered denoising methods on 481 × 321 images.
Considering the speed and quality of our model, it is a perfect choice as a base method in the image restoration framework proposed in [20], which leverages advantages of existing methods.

B. Single image super-resolution
For single image super-resolution, the linear operator K is constructed by a decimation operator Φ and a blurring operator B, i.e., K = ΦB. In order to perform a better comparison with the latest analysis model GOAL [17], we conducted the same single image super-resolution experiment. We artificially created a low resolution image by downsampling a groundtruth image by a factor of 3 using bicubic interpolation. Then the low resolution image was corrupted by Gaussian noise with σ = 8. We magnified the noisy low resolution image by the same factor using (a) bicubic interpolation, (b) GOAL method [17], (c) our learned analysis model based on penalty function log(1 + z 2 ) respectively. Figure 8 shows the results for different methods. One can see that two analysis models present similar results, which are visually and quantitatively better than the bicubic method.

C. Non-blind image deconvolution
In the case of image deconvolution, Ku can be written as a convolution, i.e., Ku = k K * u, where k K is the convolution kernel. We considered a non-blind image deconvolution task, where a clean image was degraded by a motion blur of approximately 20 pixels and slight Gaussian noise with noise level σ = 2.5. Again, we used our learned analysis models based on the log(1 + z 2 ) penalty function for image deblurring. In order to present a comparison, we also conducted deblurring by using the GMM-EPLL model [41] and the latest analysis operator learning algorithm GOAL [17]. For the GOAL method, we utilized the learned analysis operator Ω ∈ R 98×49 provided by the authors. Figure 9 shows the motion deblurring results achieved by our model, GMM-EPLL and GOAL, respectively. We can see that our learned analysis model yields better results in terms of PSNR.

D. Image inpainting
Image inpainting is the process of filling in lost image data such that the resulting image is visually appealing. Typically, the positions of the pixels to be filled up are given. In our formulation, the linear operator K is simply a sampling matrix, where each row contains exactly one entry equal to one. Its position indicates a pixel with given value. The parameter λ corresponds to joint inpainting and denoising, and the choice λ → +∞ means pure inpainting. In our experiment since we assumed the test images are noise free, we empirically selected λ = 10 3 . Due to space limitation, we only considered a classical image inpainting task here.
We destroyed the ground-truth " Lena" image (512 × 512) artificially by masking 90% of the entire pixels randomly as shown in Figure 10(a). Then we reconstructed the incomplete image using our learned analysis model -log(1 + z 2 )-based model. In order to present a comparison, we also give the inpainting result of the GOAL model [17] and FoE model [30]. From Figure 10, one can see that the result of our learned analysis model based on log(1 + z 2 ) penalty achieves equivalent results with respect to the GOAL model.

VI. CONCLUSION AND OUTLOOK
In this paper, we have expressed our insights into the cosparse analysis model. We propose to go beyond existing patch-based models, and to exploit the framework of FoE model to define a image prior over the entire image, rather than image patches. We have pointed out that the image based analysis model is equivalent to the FoE model. Starting from this conclusion, we have introduced a bi-level training approach for analysis operator learning, which is solved effectively with L-BFGS algorithm. By using our training framework, we have carefully investigated the effect of different aspects of the analysis prior model including the filter size, the number of filters and the penalty function.
Since our training scheme directly optimizes the MAPinference based analysis model, the learned model is an optimal MAP inference for image restoration problems. Numerical results have confirmed the good performance of our learned analysis model. For classic tasks such as image denoising, image deconvolution, image super-resolution and image inpainting, our learned analysis model has achieved strongly . Motion deblurring results of our learned analysis model, the GMM-EPLL model [41] and the GOAL model [17]. The degraded image is generated using a motion blur of approximately 20 pixels and a Gaussian noise of σ = 2.5.
competitive performance with current state-of-the-art methods, and clearly outperforms existing analysis learning approaches. For future work, focusing on generic priors of natural images, we expect that our learned analysis model could be improved potentially in two aspects: (1) consider more flexible penalty function. In our current model, the penalty function is fixed to the same form for every filter. If we free the shape of the penalty function, our model will possess more freedom, which might increase the performance. A feasible way to consider alterable penalty function is to make use of the GSMs prior [34]. (2) make use of larger training dataset. Our training is conducted based on 200 training samples, which is only a very small part of the natural images. Consequently, the learned filters may over-fit on the training dataset. However, our current training scheme is not available for large training dataset, e.g., ∼ 10 6 , because it needs to solve the lowerlevel problem for each training sample. Feasible methods may include making use of stochastic optimization.


Representing Multimodal Linguistic Annotated data

The question of interoperability for linguistic annotated resources covers different aspects. First, it requires a representation framework making it possible to compare, and eventually merge, different annotation schema. In this paper, a general description level representing the multimodal linguistic annotations is proposed. It focuses on time representation and on the data content representation: This paper reconsiders and enhances the current and generalized representation of annotations. An XML schema of such annotations is proposed. A Python API is also proposed. This framework is implemented in a multi-platform software and distributed under the terms of the GNU Public License.

Introduction
Multimodal text analysis has become a crucial part of research, teaching and practice for a wide range of academic and practical disciplines. Multimodal annotation is facing the necessity of encoding many different information types, from different domains, with different levels of granularity (Jewitt, 2009). In the Linguistics field, multimodal annotations contain information ranging from general linguistic to domain specific information. Some are annotated with automatic tools, and some are manually annotated. This implies technical and methodological levels to produce high quality multimodal annotations, as proposed in (Blache et al., 2010). Linguistics annotation, especially when dealing with multiple domains, makes use of different tools within a given project. The annotation itself should be done with the most ergonomic and convenient tool for the given annotation task. Then it is up to the person to develop the exploitation tool to create "views" in the very rich and layered object that corresponds to the whole annotation set. This is to make sure that analysts, annotators and end-users never face the intrinsic complexity of a rich multi-level annotation framework. Acoustic analysis, phonetics and prosody annotation are very often done using Praat (Boersma and Weenink, 2011). Gesture annotations, and more generally multimodal studies, now rely on higher level systems such as Anvil (Kipp., 2011) or Elan (Nijmegen: Max Planck Institute for Psycholinguistics, 2011) (see (Rohlfing et al., 2006) for a comparison of multimodal annotation tools). As for orthographic transcriptions, a great number of tools can be used. None of the annotations tools are directly interoperable, each using a native format, some of them on top of XML, some others developing an ad hoc markup language. The heterogeneity of such annotations has been recognized as a key problem limiting the interoperability and re-usability of NLP tools and linguistic data collections. Manipulating linguistic annotated resources requires to be independent from the coding format. This implies two kinds of pre-requisites: • to specify and organize the information to be encoded independently from the constraints or restriction of the format (or the annotation tool); • to encode the information into an exchange format, readable whatever the edition or annotation system.
But schemas and tools multiplication renders the data manipulation very problematic. On the other hand, despite standardization efforts it is unlikely that a unique generic schema or tool emerge. This paper addresses the problem of representing these multimodal annotated speech corpora. Metadata (speaker information, recording condition, etc) are not addressed. This paper focuses on the annotation representation itself: time representation, content representation and data organization.

Related works
Many tools and frameworks are available for handling rich media data. The practice of taking advantage of such a rich tool offer will not change. What can change however is the habit of developing a new language for each new project. Interchange format such as AIF (Bird et al., 2000) constitute an important step for answering this need of common frameworks. Although necessary for bringing some tool interoperability, such interchange formats remained relatively poor with regard to their descriptive power. Indeed the development of these formats was done according to a "tool perspective" as illustrated by the importance of the notions of tiers or tracks. Nowadays, most of linguistic annotation projects require a rich framework in order to deal with all the information levels involved. For example, dialogue act annotation involve multi-dimensional communicative functions (Bunt, 2009) that are organized in a complex taxonomy. Another example concerns discourse units that can be discontinuous which prevent them from treating them a simple sequence of units on a tier. Instead of being answered by richer model, extensibility and flexibility are gained by tricks and ad-hoc solutions to overcome the basic nature of the original model. The other way toward interoperability is the standardization of annotation frameworks. The ISO TC37/4 1 initia-tive is crucial for making converge annotation frameworks. However, ISO standards usually provide precise guidelines for developing interoperable systems but do not resolve the technical issues of this interoperability. Web semantics languages such as RDF (Resource Description Framework) and OWL (Ontology Web Language) also constitute an important path to explore for practical interoperability. Unique Resource Identifier allows to uniquely identified and facilitate sharing schema and resources. Finally, OWL has been developed for providing a standard semantics to the ingredients present in all these resources. These features should allow a real re-usability and interoperability. Moreover the mapping between those welldefined schema should be easier to perform thanks to existing tools and methodologies in the semantic community.
In spite of their benefits, those semantic web languages do not impose themselves easily as standard languages in language annotation projects. This is mainly due to their verbosity and their complexity as illustrated in the short example below. This has two important consequences: (i) they need sophisticated tools to be easily handled while annotation model development early stages is usually not performed with these tools; (ii) it drastically increase data size (although this should not be an issue for other corpora than massive web corpora and some more compact syntax 2 has been proposed).

Linguistics: Annotated data
The annotation of audio-video corpora is concerned by many Linguistics sub-fields as Phonetics, Prosody, Gestures or Discourse. Consequently, organizing such annotations in a hierarchy or simply performing an inventory of all possible annotations is impractical. It ranges from utterances, orthographic transcription, prosodic cues, phonetic segmentation, to gestures and nowadays motion-capture or more physiological data. In annotation tools, annotated data are mainly represented in the form of "tiers" or "tracks" of annotations. Of course, this is not just an artifact of such tools, and clearly, many annotators are using such representation during the annotation procedure. In most tools, tiers are series of intervals defined by: • a time point to represent the beginning of the interval; • a time point to represent the end of the interval; • a label to represent the annotation itself.
In Praat, tiers can be represented by a time point and a label (such tiers are named PointTiers and IntervalTiers). Of course, depending on the annotation tool, the internal data representation and the file formats are different. For example, in Elan, unlabeled intervals are not represented nor saved. On the contrary, in Praat, tiers are made of a succession of consecutive intervals (labeled or un-labeled). Another difference among tools concerns relations between tiers. In Praat for example, no relation can be defined. On the contrary, in Anvil, hierarchies can be established between tiers, by mean of an XML schema describing all annotations and their structures. This XML schema is performed by annotators themselves, before the annotation process. It is then assumed that the user is familiar with XML. Elan proposes an intermediate solution with possibility to connect tiers by a relation named "subdivision". Our proposal of data representation is based on the common set of information all tool are currently sharing: Tiers. Each tier includes a set of annotations. As usual, an annotation is represented by an interval (or a point) and a label. Our proposal focus on the way to represent such information: time and label. Therefore, this paper reconsiders and enhances the current and generalized representation of annotations.

Representation of annotations 4.1. Overview
Time in the various file formats is described in different ways. In the TEI format, all temporal points are grouped in a timeline object and an annotated element can refer to a point using his id. Some other data formats do not use a specific timeline object and directly put the time value inside an element using 'start' and 'end' attributes. Tools are using real numbers to represent time. They are described thank to a timeline: each number corresponds to one point on the line, and each point determines one real number. From the "computer science" point of view, real numbers are approximated and depend on the number of coding digit. Moreover, the time value is expressed with various time units: nanoseconds is the unit used by some tools, milliseconds by some others, and seconds are mainly used (seconds are represented from 4 to 10 digits). These approximation can cause troubles in some cases, as for example by comparing numbers: In this case a == b should be true. Consequently, a the framework representing data, as time in our example, and using real numbers must take into account such phenomena. Furthermore, annotated data are often created or modified manually. Then, the precision of the time value depends on various factors, as: • the human decision (aims of the work, time dedicated to annotate, etc); • with an audio or a video media, the annotation itself suffers of various precision: it can be very precise (about 1ms) while annotating Tones in the prosody domain; and for the gestures annotation, the precision of a time value can't be less than the duration of one picture in a video (often 40ms).
• the graphical user interface of the tool: in the best case, the precision of the "time value" corresponds to 1 pixel. This means that the time value is not a real but a duration, which depends on the zoom level.

Time points
Our proposal is to define a TimePoint X as an imprecise value. It is possible to characterize a point in a space immediately allowing its vagueness by choosing the representation space Midpoint / Radius. A TimePoint is modeled as follows: where M X is the midpoint (center) of the value and R X is the radius (as proposed in (D'Urso and De Giovanni, 2011)) representing the uncertainty of X (see Figure 1). It is to be noted that M X − R X ≥ 0.
and the Radius or half-width is the vagueness of the interval a, which becomes directly accessible: The transition from one representation to the other is achieved thanks to the previous equations, or by using the following: x − = M X − R X and x + = M X + R X . The equality and inequalities between 2 TimePoint instances X and Y are then defined as:

Time intervals
A TimeInterval is defined as a temporal interval-valued datum: where X − and X + denote, respectively, the lower and upper TimePoint bounds of the interval as we proposed in equation 1.

Labels
Each annotation holds at least one label, mainly represented in the form of a string, freely written by the annotator or selected from a list of categories. A general framework, aiming at representing any kind of linguistic annotations, have to allow to assign a score to each label, and to allow a multiple label selection.

XML representation
XML has become a de facto standard for the representation of annotated corpus resources . It is also a widely established practice to produce a particular type of annotation with a special-purpose tool that outputs XML or maps its output onto XML. Moreover, any markup or encoding schema will have to be robust enough to handle existing data. As the framework proposed in this paper calls into consideration the common representation of time and labels, none of the existing annotation schema allows to encode such information; and unfortunately it was not relevant to adapt one. It was then appropriate to develop a new schema, that we name XRA. The physical level of representation of XRA obviously makes use of XML, XML-related standards and stand-off annotation. The format specification as well as the texts encoded in XRA are "reusable, i.e., potentially usable in more than one research project and by more than one research team, and extensible, i.e., capable of further enhancement" (Ide and Brew, 2000).

Main structure
An XRA document is linked to a set of recordings of a corpus. Each document holds a set of tiers, which are directly linked to the primary media. Tiers are used to distribute the annotations of a recording. Each tier consists of a set of independent annotations, that all pertain to one or more Time instances. The definition of a tier proposed in (Brugman, 2003) is then largely recovered: "a tier is a group of annotations that all describe the same type of phenomenon, that all share the same metadata attribute values and that are all subject to the same constraints on annotation structures, on annotation content and on time alignment characteristics.". Then, an annotation is made of: a time reference, and (optionally) a label.
As the whole description of the XRA format is very long, only the annotation-related part is detailed.

Inter-tier relations
As we already said, it is not possible to decide over an exhaustive list of annotation levels for all annotation projects. Each project and each annotator as its own habits and needs. It is not possible to fix a set of "normative" tags such as < u > is an utterance and < w > is a word, and < t > is a tone, and < p > is a phoneme and < gt > is a gesture type, and so on... and then to create a static normative hierarchy between them, at least with the purpose to create a generic framework. The genericity and flexibility of "tiers" is appropriate to represent any multimodal annotated data because it simply maps the annotations on the timeline. Then, dependencies between such tiers must be represented and we propose to extend the sub-division concept, proposed in Elan. These inter-tier relations are managed by establishing alignment or constituency links between 2 tiers: • alignment: annotations of a tier A have only Time instances included in those of annotations of tier B; • constituency: annotations of a tier A have only Time instances included in those of annotations of tier B and labels of B are made of those of A.
Example of alignment: Phonemes is the reference tier and Tokens are alignment tier: Phonemes: | l | S | a | e | l | a | Tokens: | le | chat |est| la | Example of constituency: Phonemes is the reference tier and Syllables are made of Phonemes: Phonemes: | l | S | a | e | l | a | Syllabes: There are several advantages to represent data with this solution. Firstly, the relations can easily be obtained by an automatic analysis of time values, even while importing flatdata. Secondly, an existing tree-structure can be mapped on it and vice-versa.

Description
Given the current use of large corpora in NLP work, automatic conversion into the corpus representation is desired, as well as automatic annotation and exploitation. Several tools were created in the scope of this work, to support resource conversion to .xra and to enable the integration of annotation/analysis tools. An Application Programming Interface (API) is proposed in the programming language Python. We implement behaviors in abstract classes ( Figure 2) and each class is documented using docstrings. The current version allows to import data from Praat, Elan, Transcriber or from CSV files. Moreover, the XRA-schema is freely available in the package. This API is already used in the automatic annotation tool SPPAS (Bigi and Hirst, 2012; and is distributed under the terms of the GNU Public License. Among other functions, it proposes an automatic speech segmentation at the phone and token levels for French, English, Spanish, Italian, Chinese, Taiwanese and Japanese.

Main usage
Open/Read a file of any format (TextGrid, Elan, Transcriber, CSV) and load in a Transcription() instance: Create an annotation made of an interval and a label, and add it into a tier: p1 = TimePoint(1.5, radius=0.01) p2 = TimePoint(1.6, radius=0.01) t = TimeInterval(p1,p2) l = Label("foo") ann = Annotation(t,l) tier.Add(ann) Removing an annotation of a tier: Get an annotation of a tier from its index: Getting all annotations between 2 time values: Then, the next occurrence of such pattern can be retrieved by setting the pos argument to annfirstindex. Get the annotation contents: Add a sub-division link between two tiers: trs.AddSubdivision(reftier,\ alignedtier,type="alignment") trs.AddSubdivision(reftier, \ alignedtier,type="constituency") Remove a sub-division link between two tiers: trs.RemoveSubdivision(reftier,alignedtier)

Conclusion
The development of an expressive and generic framework for linguistic annotations is very beneficial. This paper particularly focused on the problem of representing annotations, and an annotation representation was proposed. The paper reconsidered and enhanced the current and generalized representation of speech annotations. We proposed a framework that can capture the indeterminacy of annotations.
We are currently working on extending this work to the construction of a software for the creation, manipulation, and analysis of annotated corpora (Figure 3). : Example of multimodal annotated data, imported from 3 different annotation tools. Each TimePoint is represented by a vertical black line with a gradient color to refer to the radius value (0ms for prosody, 5ms for phonetics, discourse and syntax and 40ms for gestures in this screenshot). Uncertain labels are underlined and the related information is highlighted when it is clicked on.