Construction of signed distance to a given interface is a topic of special interest to level set methods. There are currently, however, few algorithms that can efficiently produce highly accurate solutions. We introduce an algorithm for constructing an approximate signed distance function through manipulation of values calculated from flow of time dependent eikonal equations. We provide operati...

Rich geometric understanding of the world is an important component many robotic applications such as planning and manipulation. In this paper, we present a modular pipeline for pose shape estimation objects from RGB-D images given their category. The core our method generative model, which integrate with novel initialization network differentiable renderer to enable 6D single or multiple views...

Left ventricle (LV) segmentation of cardiac magnetic resonance (MR) images is essential for evaluating function parameters and diagnosing cardiovascular diseases (CVDs). Accurate LV remains a challenge because the large differences in structures different research subjects. In this work, network based on an encoder–decoder architecture automatic short-axis MR proposed. It combines UNet 3+ Trans...

in this paper, we define the common minimal common neighborhooddominating signed graph (or common minimal $cn$-dominating signedgraph) of a given signed graph and offer a structuralcharacterization of common minimal $cn$-dominating signed graphs.in the sequel, we also obtained switching equivalencecharacterization: $overline{sigma} sim cmcn(sigma)$, where$overline{sigma}$ and $cmcn(sigma)$ are ...

Given two convex polyhedra P and Q and a direction s, the minimum directional distance (MDD) is defined to be the shortest translational distance along the direction s that is required to make P and Q just in contact. In this paper we propose a novel method, called MDD-DUAL , for computing the MDD between two convex polyhedra. The MDD is equivalent to the shortest distance between the origin an...

The arrangement distance between singlechromosome genomes can be estimated as the minimum number of inversions required to transform the gene ordering observed in one into that observed in the other. This measure, known as “inversion distance,” can be computed as the reversal distance between signed permutations. During the past decade, much progress has been made both on the problem of computi...