Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
ai-p:pattern-recognition [2022/04/07 22:34] cyril delete |
— (current) | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Pattern recognition - Basic ====== | ||
| - | |||
| - | ====Mean-Square Regression==== | ||
| - | ==Objective== | ||
| - | Very fast if you already have a list of pixels you know belong to one contour, and you want to check if it fits to a parametric shape. | ||
| - | ==Quick Def== | ||
| - | ==References== | ||
| - | ==Full Definition== | ||
| - | |||
| - | ====Hough Transforms==== | ||
| - | |||
| - | ===Standard Hough Transform=== | ||
| - | ===Randomized Hough Transform=== | ||
| - | [Xu, | ||
| - | ==Objective== | ||
| - | Improve speed, resolution, low memory needs, infinite scale. | ||
| - | ==Quick Def== | ||
| - | If n parameters, take n points and only accumulate one point. | ||
| - | ==References== | ||
| - | - [[http:// | ||
| - | - [[http:// | ||
| - | Vision_1998/ | ||
| - | ==Full Definition== | ||
| - | |||
| - | ===Connective Randomized Hough Transform=== | ||
| - | [Kalvianen, | ||
| - | ==Objective== | ||
| - | ==Quick Def== | ||
| - | ==References== | ||
| - | - [[http:// | ||
| - | fizSzdokumentitzSzjulkaisutzSztiedostotzSz1995zSzKalviainen_SCIA95_crht.pdf/ | ||
| - | connective-randomized-hough-transform.pdf| Main Article [EN] ]] | ||
| - | =Full Definition= | ||
| - | |||
| - | ===Combinatorial Hough Transform=== | ||
| - | ==Objective== | ||
| - | ==Quick Def== | ||
| - | ==References== | ||
| - | ==Full Definition== | ||
| - | |||
| - | ===Adaptive Hough Transform=== | ||
| - | [Ilingworth, | ||
| - | ==Objective== | ||
| - | Improve speed and resolution. | ||
| - | ==Quick Def== | ||
| - | First time at low resolution, then second time at higher resolution where there are peaks. | ||
| - | ==References== | ||
| - | ==Full Definition== | ||
| - | |||
| - | ===Probabilistic Hough Transform=== | ||
| - | [Kiryati, | ||
| - | ==Objective== | ||
| - | Improve speed. | ||
| - | ==Quick Def== | ||
| - | Only process n% of the pixels. | ||
| - | ==References== | ||
| - | ==Full Definition== | ||
| - | |||
| - | ===Adaptive Probabilistic Hough Transform=== | ||
| - | ==Objective== | ||
| - | ==Quick Def== | ||
| - | ==References== | ||
| - | ==Full Definition== | ||
| - | |||
| - | ===Progressive Probabilistic Hough Transform=== | ||
| - | ==Objective== | ||
| - | ==Quick Def== | ||
| - | ==References== | ||
| - | ==Full Definition== | ||
| - | |||
| - | ===Hierarchical Hough Transform=== | ||
| - | [Princen, | ||
| - | ==Objective== | ||
| - | ==Quick Def== | ||
| - | ==References== | ||
| - | ==Full Definition== | ||
| - | |||
| - | ===Sampling Hough Transform=== | ||
| - | ==Objective== | ||
| - | ==Quick Def== | ||
| - | ==References== | ||
| - | - http:// | ||
| - | =Full Definition= | ||
| - | |||
| - | ===Generalized Hough Transform=== | ||
| - | ==Objective== | ||
| - | ==Quick Def== | ||
| - | ==References== | ||
| - | ==Full Definition== | ||
| - | |||
| - | ====UpWrite method==== | ||
| - | ==References== | ||
| - | - http:// | ||
| - | | ||
| - | ====Curvogram==== | ||
| - | |||
| - | |||
| - | ====== Pattern recognition - Learning ====== | ||
| - | |||
| - | =====Viola-Jones Detector===== | ||
| - | [Viola, | ||
| - | ==Quick Def== | ||
| - | Cascade of boosted classifiers based on Haar-like features. | ||
| - | ==References== | ||
| - | - {{|2001, | ||
| - | |||
| - | ====with Extended Set of Haar features==== | ||
| - | [Lienhart, | ||
| - | ==Quick Def== | ||
| - | Basic features are line features, edge features, and center surrounded features, all of them horizontal or vertical. The extended set also includes 45° rotated features, and an optional diagonal feature. | ||
| - | ==References== | ||
| - | - {{|2002, | ||
| - | |||
| - | ====Stumps or CART trees==== | ||
| - | ==Quick Def== | ||
| - | Stumps are single node trees, and CART (Classification And Regression Trees) more complex trees with a few nodes (4 or 5). | ||
| - | |||
| - | ====Rotation Invariant==== | ||
| - | ==References== | ||
| - | - | ||
| - | |||
| - | ====Multiview==== | ||
| - | ===Parallel Cascades=== | ||
| - | ==Objective== | ||
| - | Obvious way to deal with multiview. | ||
| - | ==Quick Def== | ||
| - | {{ parallel-cascades.png | ||
| - | |||
| - | ===Pyramid Cascades=== | ||
| - | ==Objective== | ||
| - | ==Quick Def== | ||
| - | {{ pyramid-cascades.png | ||
| - | ==References== | ||
| - | - {{|2002, | ||
| - | |||
| - | ===Tree Cascades=== | ||
| - | ==Objective== | ||
| - | ==Quick Def== | ||
| - | {{ tree-cascades.png | ||
| - | ==References== | ||
| - | - {{|2003, | ||
| - | |||
| - | ===Vector Boosting=== | ||
| - | ==Objective== | ||
| - | ==Quick Def== | ||
| - | ==References== | ||
| - | - {{|2005, | ||
| - | |||
| - | |||
