Non-rigid structure from motion using ranklet-based tracking and non-linear optimization

2007 ◽  
Vol 25 (3) ◽  
pp. 297-310 ◽  
Author(s):  
A. Del Bue ◽  
F. Smeraldi ◽  
L. Agapito
Author(s):  
Sebastian Hoppe Nesgaard Jensen ◽  
Mads Emil Brix Doest ◽  
Henrik Aanæs ◽  
Alessio Del Bue

AbstractNon-rigid structure from motion (nrsfm), is a long standing and central problem in computer vision and its solution is necessary for obtaining 3D information from multiple images when the scene is dynamic. A main issue regarding the further development of this important computer vision topic, is the lack of high quality data sets. We here address this issue by presenting a data set created for this purpose, which is made publicly available, and considerably larger than the previous state of the art. To validate the applicability of this data set, and provide an investigation into the state of the art of nrsfm, including potential directions forward, we here present a benchmark and a scrupulous evaluation using this data set. This benchmark evaluates 18 different methods with available code that reasonably spans the state of the art in sparse nrsfm. This new public data set and evaluation protocol will provide benchmark tools for further development in this challenging field.


Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 653 ◽  
Author(s):  
Saeed Dobbah ◽  
Muhammad Aslam ◽  
Khushnoor Khan

In this paper, we propose a new synthetic sampling plan assuming that the quality characteristic follows the normal distribution with known and unknown standard deviation. The proposed plan is given and the operating characteristic (OC) function is derived to measure the performance of the proposed sampling plan for some fixed parameters. The parameters of the proposed sampling plan are determined using non-linear optimization solution. A real example is added to explain the use of the proposed plan by industry.


2019 ◽  
Vol 102 (5-8) ◽  
pp. 1557-1566 ◽  
Author(s):  
Elham Mirkoohi ◽  
Peter Bocchini ◽  
Steven Y. Liang

2017 ◽  
Vol 1 (2) ◽  
pp. 82 ◽  
Author(s):  
Tirana Noor Fatyanosa ◽  
Andreas Nugroho Sihananto ◽  
Gusti Ahmad Fanshuri Alfarisy ◽  
M Shochibul Burhan ◽  
Wayan Firdaus Mahmudy

The optimization problems on real-world usually have non-linear characteristics. Solving non-linear problems is time-consuming, thus heuristic approaches usually are being used to speed up the solution’s searching. Among of the heuristic-based algorithms, Genetic Algorithm (GA) and Simulated Annealing (SA) are two among most popular. The GA is powerful to get a nearly optimal solution on the broad searching area while SA is useful to looking for a solution in the narrow searching area. This study is comparing performance between GA, SA, and three types of Hybrid GA-SA to solve some non-linear optimization cases. The study shows that Hybrid GA-SA can enhance GA and SA to provide a better result


Sign in / Sign up

Export Citation Format

Share Document