2012
DOI: 10.1007/978-3-642-33712-3_31
|View full text |Cite
|
Sign up to set email alerts
|

Soft Inextensibility Constraints for Template-Free Non-rigid Reconstruction

Abstract: Abstract. In this paper, we exploit an inextensibility prior as a way to better constrain the highly ambiguous problem of non-rigid reconstruction from monocular views. While this widely applicable prior has been used before combined with the strong assumption of a known 3D-template, our work achieves template-free reconstruction using only inextensibility constraints. We show how to formulate an energy function that includes soft inextensibility constraints and rely on existing discrete optimisation methods t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
80
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 49 publications
(80 citation statements)
references
References 24 publications
0
80
0
Order By: Relevance
“…Fusion moves [32,33] is an optimization technique for graphical models, which can handle continuous variables by iteratively solving a discrete problem. In the context of deformable surfaces, this approach was employed by [19] to address the well-textured template-based and template-free scenarios. Cast to our problem, the fusion moves algorithm works in the following manner: Given the current solution at iteration t, (U, D, L) t , and a proposal, (U, D, L) p , the fusion moves algorithm combines the solution and proposal into a new solution (U, D, L) t+1 while ensuring that the energy of the new solution is at least as low as that of both the current solution and the proposal.…”
Section: Optimization Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…Fusion moves [32,33] is an optimization technique for graphical models, which can handle continuous variables by iteratively solving a discrete problem. In the context of deformable surfaces, this approach was employed by [19] to address the well-textured template-based and template-free scenarios. Cast to our problem, the fusion moves algorithm works in the following manner: Given the current solution at iteration t, (U, D, L) t , and a proposal, (U, D, L) p , the fusion moves algorithm combines the solution and proposal into a new solution (U, D, L) t+1 while ensuring that the energy of the new solution is at least as low as that of both the current solution and the proposal.…”
Section: Optimization Methodsmentioning
confidence: 99%
“…In this section, we briefly review the literature on monocular 3D reconstruction of deformable surfaces, i.e., template-based methods [1][2][3][4][5][6][7][8][9][10][11] and NRSfM [14][15][16][17][18][19]. In both cases, we focus the discussion on the methods that are the most relevant to our work.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…[3] uses the orthographic camera to recover the shape's normal locally; they suffer from local two-fold ambiguities and significantly degrade for shorter focal lengths. [5] recently solved the same problem for an orthographic and perspective camera. [4] specifically addresses the case of piecewise planar surfaces; it uses the perspective camera but still has patch-wise two-fold unresolved ambiguities induced by the processing of image pairs.…”
mentioning
confidence: 99%