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.11.tar.gz
(19.6 kB
view hashes)
Built Distribution
Close
Hashes for robust_extraction2-0.1.11.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | b86e0330641e1e023433a5fd2b91507f6ad74157cedb2e6a05bc767abd2b4979 |
|
MD5 | 4bd9cf039dabc6b55d0e44eeb9856e10 |
|
BLAKE2b-256 | c0eaca1381168c8e3d53de6410a7278620b4969f1285d87196dca17ea4be2a23 |
Close
Hashes for robust_extraction2-0.1.11-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | f07413581598c6c9ee96ee53cf1990a1510c241d0d358f20e4e27e8183098afa |
|
MD5 | 6a5ab8f779bc8ae0bd88dda8b0b357fc |
|
BLAKE2b-256 | fece0436d58d9a57dcfe39cc459fc06b82bc045017cfd384ddfefcd0f8e80a13 |