Package Exports

iterative-closest-point
iterative-closest-point/index.js

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (iterative-closest-point) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

Iterative Closest Point

Customizable Iterative-Closest-Point simple implementation in JS.

See Iterative Closest Point

Installation

npm install iterative-closest-point

Usage

As an example, we consider a 1d problem, to match 2 list of numbers (sourceList and destinationList), considering the translation to use.

A diff

const diff = (s,d) => d - s;

match

const munkres = require('munkres-js');

const transform = function ({translation}, b) {
    return b + translation;
};

const match = function ({source, destination, state, iteration}) {
    // state is {translation}
    const transformedSource = source.map(a => transform(state, a))
    const diffMat = transformedSource.map(a => destination.map(b => diff(a, b)));
    const costs = transformedSource.map(a => destination.map(b => Math.abs(diff(a, b))));

    const assignement = munkres(costs);
    const cost = sum(assignement.map(([i, j]) => costs[i][j]));
    return {
        cost, // Mandatory
        assignement, // Mandatory
        diffs: assignement.map(([i, j]) => diffMat[i][j]), // Custom key, we reuse it in updateFn
    };
};

estimate

const sum = list => list.reduce((a,b) => a+b, 0);

// this function estimate the state
const estimate = function ({diffs, state, iteration}) {

    if (diffs.length === 0) {
        throw (new Error('empty diffs'));
    }

    const translation = sum(diffs) / diffs.length + state.translation;
    return {
        translation,
    }; // This object will be the input of transformFn
};

all together

const ict = new Ict({
    init: {translation: 0}, // initialize the state
    transform,
    estimate,
    match,
    threshold: 1
});

const sourceList = [1, 2, 3, 4, 5, 6];
const destinationList = [8, 9, 10, 11, 12, 13];
const {translation, assignement, iteration, cost} = await ict.run(sourceList, destinationList);

console.log(transformation)
// {translation: 7}
console.log(iteration)
// 2
// Explanation : 
// first iteration : basic matching
// second iteration : correct matching

Thanks

Special thanks to Gabriel Peyré and Victor Magron