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.16.tar.gz
(19.3 kB
view hashes)
Built Distribution
Close
Hashes for robust_extraction2-0.1.16.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | c5ae82d558611004ecb7628097ae0e87d1aeb89df613803ccd871b9221014d4d |
|
MD5 | ee07623f5be5ccdcef85ddcdac16412d |
|
BLAKE2b-256 | 93f96dd8ee1b3f3d65248c7144d35aa21b9931037ef35e19b31e634e512353bd |
Close
Hashes for robust_extraction2-0.1.16-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | c601c866df315e6004929b607b8588ebb9ef76db14efd76af3ac33361de4354d |
|
MD5 | b474d90c6782b471b81cf6344678c2d4 |
|
BLAKE2b-256 | f582ec56c92d89d6cf8cdbbc09cbc38bf95fc83e4519ce12400df1e2ea1cbde2 |