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.12.tar.gz
(19.6 kB
view hashes)
Built Distribution
Close
Hashes for robust_extraction2-0.1.12.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | d76ab4145c3c023707953603da33544f959d1c13f66fab15ec9f721be2fb337b |
|
MD5 | e46f163d24faf3193035424f15021d5f |
|
BLAKE2b-256 | e3e81bb218903bb6828964aa0aef7775905f57ed0f222d444d4c4c2fe8b1183c |
Close
Hashes for robust_extraction2-0.1.12-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 0ddc1680987cb553750ed90a041b0d52e81b483b960d35eebd5823cae8c76506 |
|
MD5 | cc21aa8c6ab5584bc9e57e10568b2f56 |
|
BLAKE2b-256 | 44fbf895d52b040771ae833d6d17c7b5cd680f9b332cdbbd7513b5c09e33fa0b |