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.14.tar.gz
(19.7 kB
view hashes)
Built Distribution
Close
Hashes for robust_extraction2-0.1.14.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 457bb12e046a81d77bfd9bc950ca0b6560d1a082f81126fd803f9627023e87e1 |
|
MD5 | f25e653ad3e4316dfa9477a5ee0d50f3 |
|
BLAKE2b-256 | 014b52538711489d5f7bce6fdf175357808b5785b6235d839980e1da0d63453f |
Close
Hashes for robust_extraction2-0.1.14-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 73d2422a4d59505668c90d58c8245a4b45a2c0d1aa79381bfbfd36dc4295ffcc |
|
MD5 | 937e200615e51995461c528e10373648 |
|
BLAKE2b-256 | 0322376503088a34ef2f5820eeac2695d5a9da2b61d0cc4f2f3e545e1aec5adc |