Moving-Least-Squares

by Jarvis73

Implementation of three algorithms of image deformation using moving least squares. http://dl.acm.o...

149 Stars 40 Forks Last release: Not found MIT License 12 Commits 0 Releases

Available items

No Items, yet!

The developer of this repository has not created any items for sale yet. Need a bug fixed? Help with integration? A different license? Create a request here:

Moving Least Squares (MLS)

Update: 2020-09-25 No need for so-called inverse transformation. Just transform target pixels to the corresponding source pixels.

Introduction

Moving least squares is a method of reconstructing continuous functions from a set of unorganized point samples via the calculation of a weighted least squares measure biased towards the region around the point at which the reconstructed value is requested.

In computer graphics, the moving least squares method is useful for reconstructing a surface from a set of points. Often it is used to create a 3D surface from a point cloud through either downsampling or upsampling.

Methods

  • Affine deformation
  • Similarity deformation
  • Rigid deformation

Preview

  • Toy

Affine deformation

Similarity deformation

Rigid deformation

  • Monalisa

Rigid deformation

  • Cells

Rigid Deformation

Code list

  • img_utils.py
    : Implementation of the algorithms
  • img_utils_demo.py
    : Demo program
  • read_tif.py
    : TIF file reader
  • tiff_deformation.py
    : Demo program

Reference

[1] Schaefer S, Mcphail T, Warren J. Image deformation using moving least squares[C]// ACM SIGGRAPH. ACM, 2006:533-540.

We use cookies. If you continue to browse the site, you agree to the use of cookies. For more information on our use of cookies please see our Privacy Policy.