Relaxation labelling
Jump to navigation
Jump to search
Relaxation labelling is an image treatment methodology. Its goal is to associate a label to the pixels of a given image or nodes of a given graph.[1]
See also
References
- ^ A. Dave Marshall; Ralph R. Martin (1992), Computer vision, models, and inspection, World Scientific, p. 149, ISBN 978-981-02-0772-4
Further reading
- Marcello Pelillo (1997). "The dynamics of nonlinear relaxation labeling processes". Journal of Mathematical Imaging and Vision. 7 (4): 309–323. doi:10.1023/A:1008255111261. S2CID 16789724. (Full text: [1])
- Kuner, Peter; Ueberreiter, Birgit (1988). "Pattern Recognition by Graph Matching – Combinatorial Versus Continuous Optimization". International Journal of Pattern Recognition and Artificial Intelligence. 02 (3): 527–542. doi:10.1142/S0218001488000303. Retrieved January 3, 2012. (Full text: [2])
- Andrew Lewis; Sanaz Mostaghim; Marcus Randall (2009), Biologically-inspired Optimisation Methods: Parallel Algorithms, Systems and Applications, Springer, p. 110, ISBN 978-3-642-01261-7
- Terry Caelli; Walter F. Bischof (1997), Machine learning and image interpretation, Springer, p. 160, ISBN 978-0-306-45761-6
 | This computer graphics–related article is a stub. You can help Wikipedia by expanding it. |