Order statistics and the linear assignment problem

Under mild conditions on the distribution functionF, we analyze the asymptotic behavior in expectation of the smallest order statistic, both for the case thatF is defined on (–, +) and for the case thatF is defined on (0, ). These results yield asymptotic estimates of the expected optiml value of the linear assignment problem under the assumption that the cost coefficients are independent random variables with distribution functionF.asymptotic analysis;linear assignment problem;order statistic

Order statistics and the linear assignment problem

Under mild conditions on the distribution functionF, we analyze the asymptotic behavior in expectation of the smallest order statistic, both for the case thatF is defined on (–, +) and for the case thatF is defined on (0, ). These results yield asymptotic estimates of the expected optiml value of the linear assignment problem under the assumption that the cost coefficients are independent random variables with distribution functionF

Riemannian Flows for Supervised and Unsupervised Geometric Image Labeling

In this thesis we focus on the image labeling problem, which is used as a subroutine in many image processing applications. Our work is based on the assignment flow which was recently introduced as a novel geometric approach to the image labeling problem. This flow evolves over time on the manifold of row-stochastic matrices, whose elements represent label assignments as assignment probabilities. The strict separation of assignment manifold and feature space enables the data to lie in any metric space, while a smoothing operation on the assignment manifold results in an unbiased and spatially regularized labeling. The first part of this work focuses on theoretical statements about the asymptotic behavior of the assignment flow. We show under weak assumptions on the parameters that the assignment flow for data in general position converges towards integral probabilities and thus ensures unique assignment decisions. Furthermore, we investigate the stability of possible limit points depending on the input data and parameters. For stable limits, we derive conditions that allow early evidence of convergence towards these limits and thus provide convergence guarantees. In the second part, we extend the assignment flow approach in order to impose global convex constraints on the labeling results based on linear filter statistics of the assignments. The corresponding filters are learned from examples using an eigendecomposition. The effectiveness of the approach is numerically demonstrated in several academic labeling scenarios. In the last part of this thesis we consider the situation in which no labels are given and therefore these prototypical elements have to be determined from the data as well. To this end we introduce an additional flow on the feature manifold, which is coupled to the assignment flow. The resulting flow adapts the prototypes in time to the assignment probabilities. The simultaneous adaptation and assignment of prototypes not only provides suitable prototypes, but also improves the resulting image segmentation, which is demonstrated by experiments. For this approach it is assumed that the data lie on a Riemannian manifold. We elaborate the approach for a range of manifolds that occur in applications and evaluate the resulting approaches in numerical experiments

Tests for Trends in Binary Response

Tests for trend in binary response are especially important when analyzing animal experiments where the response in various dose--groups is of interest. Among the nonparametric tests the approach of Cochran and Armitage is the one which is most commonly used. This test (CA-test) is actually a test for a linear trend. The result of this test is highly dependent on the quantification of the dose. Varying score assignments can lead to totally different results. As an alternative isotonic regression is proposed. The result of this approach is independent of any monotonic transformation of the dose. The p--value related with the isotonic regression can be obtained either from considering all possible combinations of the total number of events in the dose--groups or by analyzing a random sample of all permutations. Both tests are compared within a simulation--study and on data from an experiment considering whether a certain type of fibre, para--aramid, is carcinogenic. The result of the commonly used CA--test is highly dependent on the event rate in the lowest and highest dose--group. Based on our analyses we recommend to use the isotonic regression instead of the test proposed by Cochran and Armitage