107,791 research outputs found

    On Robust Face Recognition via Sparse Encoding: the Good, the Bad, and the Ugly

    Get PDF
    In the field of face recognition, Sparse Representation (SR) has received considerable attention during the past few years. Most of the relevant literature focuses on holistic descriptors in closed-set identification applications. The underlying assumption in SR-based methods is that each class in the gallery has sufficient samples and the query lies on the subspace spanned by the gallery of the same class. Unfortunately, such assumption is easily violated in the more challenging face verification scenario, where an algorithm is required to determine if two faces (where one or both have not been seen before) belong to the same person. In this paper, we first discuss why previous attempts with SR might not be applicable to verification problems. We then propose an alternative approach to face verification via SR. Specifically, we propose to use explicit SR encoding on local image patches rather than the entire face. The obtained sparse signals are pooled via averaging to form multiple region descriptors, which are then concatenated to form an overall face descriptor. Due to the deliberate loss spatial relations within each region (caused by averaging), the resulting descriptor is robust to misalignment & various image deformations. Within the proposed framework, we evaluate several SR encoding techniques: l1-minimisation, Sparse Autoencoder Neural Network (SANN), and an implicit probabilistic technique based on Gaussian Mixture Models. Thorough experiments on AR, FERET, exYaleB, BANCA and ChokePoint datasets show that the proposed local SR approach obtains considerably better and more robust performance than several previous state-of-the-art holistic SR methods, in both verification and closed-set identification problems. The experiments also show that l1-minimisation based encoding has a considerably higher computational than the other techniques, but leads to higher recognition rates

    Online Dispute Resolution Through the Lens of Bargaining and Negotiation Theory: Toward an Integrated Model

    Get PDF
    [Excerpt] In this article we apply negotiation and bargaining theory to the analysis of online dispute resolution. Our principal objective is to develop testable hypotheses based on negotiation theory that can be used in ODR research. We have not conducted the research necessary to test the hypotheses we develop; however, in a later section of the article we suggest a possible methodology for doing so. There is a vast literature on negotiation and bargaining theory. For the purposes of this article, we realized at the outset that we could only use a small part of that literature in developing a model that might be suitable for empirical testing. We decided to use the behavioral theory of negotiation developed by Richard Walton and Robert McKersie, which was initially formulated in the 1960s. This theory has stood the test of time. Initially developed to explain union-management negotiations, it has proven useful in analyzing a wide variety of disputes and conflict situations. In constructing their theory, Walton and McKersie built on the contributions and work of many previous bargaining theorists including economists, sociologists, game theorists, and industrial relations scholars. In this article, we have incorporated a consideration of the foundations on which their theory was based. In the concluding section of the article we discuss briefly how other negotiation and bargaining theories might be applied to the analysis of ODR
    • …
    corecore