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.15.tar.gz
(19.7 kB
view hashes)
Built Distribution
Close
Hashes for robust_extraction2-0.1.15.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | cb59e3fe40dda4f1751d891b68012c76940d10c8263a91bcf7c65cef83f73f97 |
|
MD5 | 8975185d93aeb40298c542f16b47824d |
|
BLAKE2b-256 | e7a314173dd16b69cefaba57f8a1475fb765e1067432ce575e3e82d1aff171c6 |
Close
Hashes for robust_extraction2-0.1.15-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | d99f95365b62983a089e90e0708edc4d652fc0adae0f0ef3f3aca47e2868742f |
|
MD5 | f9baf7a19e0991d78393354b9371eaef |
|
BLAKE2b-256 | 461475e8c7ef1822c11eb6c27235e7bc58c481a1225b0e7869d8abcd2ad5eb20 |