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.13.tar.gz
(19.6 kB
view hashes)
Built Distribution
Close
Hashes for robust_extraction2-0.1.13.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | adc834a7aa91764618af17bc5d39a63982161f1fd60bfa8c3608ac87f9aa54ac |
|
MD5 | 394486fad9fab71112bef22b62da646e |
|
BLAKE2b-256 | 007b38a0faa187326d1450e3013edcade02dac20156f33e9f31ed927c9830324 |
Close
Hashes for robust_extraction2-0.1.13-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 56a38fd8c532a61366eee9fb4450bbe7b57e4800f3fd45093fa39ab75127b43e |
|
MD5 | 995aa501987e090aea936090bd7da84f |
|
BLAKE2b-256 | 1f16db62da3f674b57993d1959214c3f50aca85aaccb7b2ef5b424bb8f49450c |