@article {15772,
	title = {Multi-resolution relaxation},
	journal = {Pattern Recognition},
	volume = {16},
	year = {1983},
	month = {1983///},
	pages = {223 - 230},
	abstract = {Several types of iterative methods can be used to segment the pixels in an image into light and dark regions; these include {\textquotedblleft}relaxation{\textquotedblright} methods of probability adjustment and steepest-descent methods of cost function minimization. Conventionally, these methods operate on the image at a single resolution. This paper investigates the possibility of using these approaches at two (or more) resolutions in order to reduce their computational cost{\textemdash}e.g. first obtain an approximate solution by iterating at low resolution, then refine the solution using a few iterations at high resolution.},
	keywords = {Multigrid methods, Pyramids, Relaxation, segmentation},
	isbn = {0031-3203},
	doi = {10.1016/0031-3203(83)90026-2},
	url = {http://www.sciencedirect.com/science/article/pii/0031320383900262},
	author = {Narayanan,K. A. and O{\textquoteright}Leary, Dianne P. and Rosenfeld,Azriel}
}
