Results 11 to 20 of about 1,230,337 (268)
Track to Reconstruct and Reconstruct to Track [PDF]
IEEE Robotics and Automation Letters, 2020 Object tracking and 3D reconstruction are often performed together, with tracking used as input for reconstruction. However, the obtained reconstructions also provide useful information for improving tracking. We propose a novel method that closes this loop, first tracking to reconstruct, and then reconstructing to track.
Jonathon Luiten +2 more
openaire +2 more sources
Reconstruction of Partitions [PDF]
The Electronic Journal of Combinatorics, 2005 For the partition $x=[x_1\ge x_2\ge \cdots\ge x_k]$ of the integer $n=\sum_{i}\, x_{i}$ a $t$-deletion is a partition $y=[y_1\ge y_2\ge \cdots\ge y_k]$ with $x_{i}\geq y_{i}\geq 0$ and $\sum_{i}\, (x_{i}-y_{i})=t$. We prove that all partitions of $n$ are reconstructible from their $t$–deletions if $n$ is sufficiently large in relation to $t$.
Pretzel, Oliver, Siemons, Johannes
openaire +3 more sources
Asian Journal of Andrology, 2012 During the most recent years, a variety of new techniques of penile reconstruction have been described in the literature. This paper focuses on the most recent advances in male genital reconstruction after trauma, excision of benign and malignant disease, in gender reassignment surgery and aphallia with emphasis on surgical technique, cosmetic and ...
Garaffa, G +2 more
openaire +4 more sources
Understanding the factors that influence breast reconstruction decision making in Australian women [PDF]
, 2015 Background Breast reconstruction is safe and improves quality of life. Despite this, many women do not undergo breast reconstruction and the reasons for this are poorly understood.
Baghdikian, Nairy +8 more
core +1 more source
Permutation Reconstruction [PDF]
The Electronic Journal of Combinatorics, 2006 In this paper, we consider the problem of permutation reconstruction. This problem is an analogue of graph reconstruction, a famous question in graph theory. In the case of permutations, the problem can be stated as follows: In all possible ways, delete $k$ entries of the permutation $p=p_1p_2p_3...p_n$ and renumber accordingly, creating $n \choose k$
openaire +2 more sources
On the Reconstruction of Polytopes
Discrete & Computational Geometry, 2018 Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$. We show that (1) the face lattice of any $d$-polytope with at most two nonsimple vertices is determined by its $1$
Joseph Doolittle +4 more
openaire +4 more sources
Eigenvectors and Reconstruction [PDF]
The Electronic Journal of Combinatorics, 2007 In this paper, we study the simple eigenvectors of two hypomorphic matrices using linear algebra. We also give new proofs of results of Godsil and McKay.
openaire +3 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction This study investigated the safety and efficacy of single‐needle Rheocarna therapy for chronic limb‐threatening ischemia (CLTI) with wounds. Methods Six patients with CLTI involving ulcers unresponsive to revascularization underwent single‐needle Rheocarna treatment.
Yasutaka Yamauchi +9 more
wiley +1 more source