Answers are grounded in this paper and cite their sources.
All other things being equal, context classifiers have a higher identification accuracy than pixel independent classifiers. This paper discusses a classifier whose context for each pixel is the best row monotonically increasing path including the given pixel. Use of such a context results in a two pass algorithm in which both the top down and bottom up pass require only two rows of data and whose computational complexity per pixel is constant independent of the size of image or the length of the best context path including the given pixel.
No takes yet. Share an insight, caveat, or question.
Haralick et al. (1986) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: