Petter strandmark fredrik kahl
This presentation is the property of its rightful owner.
Sponsored Links
1 / 25

Curvature Regularization for Curves and Surfaces in a Global Optimization Framework PowerPoint PPT Presentation


  • 111 Views
  • Uploaded on
  • Presentation posted in: General

Petter StrandmarkFredrik Kahl . Curvature Regularization for Curves and Surfaces in a Global Optimization Framework. Centre for Mathematical Sciences, Lund University. Length Regularization. Segmentation. Segmentation by minimizing an energy:. Data term. Length of boundary.

Download Presentation

Curvature Regularization for Curves and Surfaces in a Global Optimization Framework

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Petter strandmark fredrik kahl

Petter StrandmarkFredrik Kahl

Curvature Regularization for Curves andSurfaces in a Global Optimization Framework

Centre for Mathematical Sciences, Lund University


Length regularization

Length Regularization

Segmentation

Segmentation by minimizing an energy:

Dataterm

Length of boundary


Long thin structures

Long, thin structures

Example from Schoenemann et al. 2009

Dataterm

Squared curvature

Length of boundary


Important papers

Important papers

Motivation from a psychological/biological standpoint

Improved multi-label formulation

  • Schoenemann, Kahl and Cremers, ICCV 2009

  • Schoenemann, Kahl, Masnou and Cremers, arXiv 2011

  • Schoenemann, Masnou and Cremers, arXiv 2011

Continuous formulation

Global optimization of curvature

  • Schoenemann, Kuang and Kahl, EMMCVPR 2011

  • Goldluecke and Cremers, ICCV 2011

  • Kanizsa, Italian Journal of Psychology 1971

  • Dobbins, Zucker and Cynader, Nature 1987

Correct formulation,

efficiency,

  • This paper:

3D


Approximating c urves

Approximating Curves


Approximating curves

Approximating Curves

  • Start with a mesh of all possible line segments

variable for each region

variables for each pair of edges

Restricted to {0,1}


Linear objective function

Linear Objective Function

variable for each region; 1 meansforeground, 0 background

Incorporate curvature:

variables for each pair of edges


Linear constraints

Linear Constraints

Boundary constraints:

then

Surface continuation constraints:

then


New constraints

New Constraints

  • Problem with the existing formulation:

Nothing prevents a ”double boundary”


New constraints1

New Constraints

Existing formulation

Simple fix?

Global solution!

Require that

Not correct!

Not optimal (fractional)


New constraints2

New Constraints

  • Consistency:

then


New constraints3

New Constraints

New constraints

Existing formulation

Global solution!

Global + correct!

Not optimal (fractional)

Not correct!


Mesh types

Mesh Types

Too

coarse!

90°

60°

45°

27°

30°

32 regions, 52 lines

12 regions, 18 lines


Mesh types1

Mesh Types


Adaptive meshes

Adaptive Meshes

Always split the most important region; use a priority queue


Adaptive meshes1

Adaptive Meshes

p. 69


Adaptive meshes2

Adaptive Meshes


Does it matter

Does It Matter?

16-connectivity


Does it matter1

Does It Matter?

8-connectivity


Curvature of surfaces

Curvature of Surfaces

Approximate surface with a mesh of faces

Want to measure how much the surface bends:

Willmore energy


3d mesh

3D Mesh

One unit cell

(5 tetrahedrons)

8 unit cells


3d results

3D Results

Problem: “Wrapping a surface around a cross”

Area regularization

Curvature regularization


Surface c ompletion results

Surface CompletionResults

Problem: “Connecting two discs”

Area regularization

Curvature regularization

491,000 variables

637,000 variables

128 seconds


Conclusions

Conclusions

  • Curvature regularization is now more practical

    • Adaptive meshes

    • Hexagonal meshes

  • New constraints give correct formulation

  • Surface completion

Source code available online (2D and 3D)


The end

The end


  • Login