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.10.tar.gz
(19.7 kB
view hashes)
Built Distribution
Close
Hashes for robust_extraction2-0.1.10.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 0988939ec5e2a9cf01c94656300c61c2e835ccd0d09d32f553b22d4a347dab68 |
|
MD5 | 48be6553078f6295aaa66c48982c8ee9 |
|
BLAKE2b-256 | c88db34c8e5a273e1ebdad43dbe6b16fe9e6c66c877ec4647c702c10b9954150 |
Close
Hashes for robust_extraction2-0.1.10-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 73742eb5fba24e661ff15e22d5d69d34b13804b6ee61ed87435a128e45734294 |
|
MD5 | f048aa4339a80d78d542eeb291d68618 |
|
BLAKE2b-256 | 3385bb808eeef9b1b2d7081d8c123fdd062f6ce28690d1afc1c6d1528e314e11 |