jni / jni/affinder

Add ability to use RANSAC for robust registration with many points

Open
#34 0 comments 0 reactions 0 assignees View on GitHub
Dominant language
Python
Stars
23
Forks
13
PR merge metrics
No merged PRs in 30d

Description

Currently, affinder uses least squares to estimate the transformation between all user selected keypoints. However, it might not always be the best choice, as some user selected points may be more accurately placed than others (due e.g. to the sharpness of image features in different parts of the image). Additionally, users may want to use pre-computed points (see #11, for example), which could come from automated methods). Using RANSAC to match points will increase the reliability of found alignments.

Contributor guide

No contributing guide indexed for this repository

Research direction

Start by locating where affinder currently estimates the affine transformation with least squares, then review issue #11 for the pre-computed point context. Done means users can use RANSAC for robust registration when correspondences include inaccurate or automatically generated points, while the existing alignment behavior remains understood.

Written by the indexing model from the issue text.

Assessment

Tech stack
python
Domain
computer-vision
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.