The Experts below are selected from a list of 2667 Experts worldwide ranked by ideXlab platform

Guoping Wang - One of the best experts on this subject based on the ideXlab platform.

  • Computable Relation graph based calibration pattern extraction algorithm on multiple calibration boards
    Image and Vision Computing New Zealand, 2012
    Co-Authors: Jiewei Sun, Yisong Chen, Guoping Wang
    Abstract:

    Calibration point extraction is an important step in camera calibration. Traditional methods work on single calibration board. In this paper, we propose a brand-new calibration point extraction algorithm that works on multiple calibration boards. In order to solve the world coordinate for every calibration point on multiple calibration boards, we propose a Computable Relation graph based algorithm. This algorithm constructs a Computable Relation graph with the Computable Relation between two calibration boards, and determines the computation order employing the classic minimum spanning tree algorithm. We use a triple parameter model to compute the position of one calibration board from another, and solve the problem by downhill simplex optimization. The proposed algorithm is fully automatic, and the precision is sufficiently high to fulfill the requirement of an image based modeling system.

Jiewei Sun - One of the best experts on this subject based on the ideXlab platform.

  • Computable Relation graph based calibration pattern extraction algorithm on multiple calibration boards
    Image and Vision Computing New Zealand, 2012
    Co-Authors: Jiewei Sun, Yisong Chen, Guoping Wang
    Abstract:

    Calibration point extraction is an important step in camera calibration. Traditional methods work on single calibration board. In this paper, we propose a brand-new calibration point extraction algorithm that works on multiple calibration boards. In order to solve the world coordinate for every calibration point on multiple calibration boards, we propose a Computable Relation graph based algorithm. This algorithm constructs a Computable Relation graph with the Computable Relation between two calibration boards, and determines the computation order employing the classic minimum spanning tree algorithm. We use a triple parameter model to compute the position of one calibration board from another, and solve the problem by downhill simplex optimization. The proposed algorithm is fully automatic, and the precision is sufficiently high to fulfill the requirement of an image based modeling system.

Yisong Chen - One of the best experts on this subject based on the ideXlab platform.

  • Computable Relation graph based calibration pattern extraction algorithm on multiple calibration boards
    Image and Vision Computing New Zealand, 2012
    Co-Authors: Jiewei Sun, Yisong Chen, Guoping Wang
    Abstract:

    Calibration point extraction is an important step in camera calibration. Traditional methods work on single calibration board. In this paper, we propose a brand-new calibration point extraction algorithm that works on multiple calibration boards. In order to solve the world coordinate for every calibration point on multiple calibration boards, we propose a Computable Relation graph based algorithm. This algorithm constructs a Computable Relation graph with the Computable Relation between two calibration boards, and determines the computation order employing the classic minimum spanning tree algorithm. We use a triple parameter model to compute the position of one calibration board from another, and solve the problem by downhill simplex optimization. The proposed algorithm is fully automatic, and the precision is sufficiently high to fulfill the requirement of an image based modeling system.

Tahereh Jafarikhah - One of the best experts on this subject based on the ideXlab platform.

  • Computable jordan decomposition of linear continuous functionals on c 0 1
    Logical Methods in Computer Science, 2014
    Co-Authors: Klaus Weihrauch, Tahereh Jafarikhah
    Abstract:

    By the Riesz representation theorem using the Riemann-Stieltjes integral, linear continuous functionals on the set of continuous functions from the unit interval into the reals can either be characterized by functions of bounded variation from the unit interval into the reals, or by signed measures on the Borel-subsets. Each of these objects has an (even minimal) Jordan decomposition into non-negative or non-decreasing objects. Using the representation approach to Computable analysis, a Computable version of the Riesz representation theorem has been proved by Jafarikhah, Lu and Weihrauch. In this article we extend this result. We study the Computable Relation between three Banach spaces, the space of linear continuous functionals with operator norm, the space of (normalized) functions of bounded variation with total variation norm, and the space of bounded signed Borel measures with variation norm. We introduce natural representations for defining computability. We prove that the canonical linear bijections between these spaces and their inverses are Computable. We also prove that Jordan decomposition is Computable on each of these spaces.

Klaus Weihrauch - One of the best experts on this subject based on the ideXlab platform.

  • Computable jordan decomposition of linear continuous functionals on c 0 1
    Logical Methods in Computer Science, 2014
    Co-Authors: Klaus Weihrauch, Tahereh Jafarikhah
    Abstract:

    By the Riesz representation theorem using the Riemann-Stieltjes integral, linear continuous functionals on the set of continuous functions from the unit interval into the reals can either be characterized by functions of bounded variation from the unit interval into the reals, or by signed measures on the Borel-subsets. Each of these objects has an (even minimal) Jordan decomposition into non-negative or non-decreasing objects. Using the representation approach to Computable analysis, a Computable version of the Riesz representation theorem has been proved by Jafarikhah, Lu and Weihrauch. In this article we extend this result. We study the Computable Relation between three Banach spaces, the space of linear continuous functionals with operator norm, the space of (normalized) functions of bounded variation with total variation norm, and the space of bounded signed Borel measures with variation norm. We introduce natural representations for defining computability. We prove that the canonical linear bijections between these spaces and their inverses are Computable. We also prove that Jordan decomposition is Computable on each of these spaces.