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.0.tar.gz
(19.4 kB
view hashes)
Built Distribution
Close
Hashes for robust_extraction2-0.1.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | ad2ee1d1424f5417ed8b0290487e70b91931ee1bbc2b62df23175d3a8c07bfe9 |
|
MD5 | 23ea9a458d0201b6de22cd43a9b2d8ac |
|
BLAKE2b-256 | fb10ce8e956e3b7f88a9dec33ccfd50cf40b8a42010e3b8811a059b6954f52fa |