Robust Extraction, rewrited
Project description
Robust Extraction2
Robust Extraction, rewrited
Changes w.r.t. Version 1
Cluster Intersections
- Original: mean intersection of the cartesian product of lines in both clusters
- New: intersection of a fitted line by cluster (regressed on all endpoints)
ST-Invariant Matching Penalization
Given the number of matched points $N$ and number of minimum points $n_{min}$, the penalization is defined as $1/(N-n_{min}+1)^e$, where $e$ is the "penalization exponent" parameter:
Original | New |
---|---|
$e=0.5$ | $e=5$ |
Put simply, we basically force matching as many points as possible that don't incur a huge cost.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
robust_extraction2-0.1.9.tar.gz
(19.8 kB
view hashes)
Built Distribution
Close
Hashes for robust_extraction2-0.1.9-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 88b3a6f5f3aa3be15cffe760884c979b4fe288abfefa7af8c38a56ab5e9a9d61 |
|
MD5 | 9ea72a952aa70923ad3264ff203480e0 |
|
BLAKE2b-256 | d2c8b2a2bd67aae6a169cee294ebf57791c3db207111bbd4a990d8d536b0a4ee |