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.2.tar.gz
(19.6 kB
view hashes)
Built Distribution
Close
Hashes for robust_extraction2-0.1.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 896eba3aa6cfd862c8269c24b5ffb9c3aff1c2231866139ed94587d03e937757 |
|
MD5 | ce8e3d8dac3844f48dee95b0d19b324b |
|
BLAKE2b-256 | 4e4c3bb2272b067d25015ced197831d42867a79f4d253346e0c89a25d76b78bf |