@conference {cCasas93a,
	title = {Efficient coding of residual images},
	booktitle = {SPIE Visual Communications {\textquoteright}93},
	year = {1993},
	month = {10/1993},
	pages = {694{\textendash}705},
	publisher = {SPIE},
	organization = {SPIE},
	address = {Cambridge, MA},
	abstract = {<p><span style="color: $\#$000000; font-family: {\textquoteright}Museo Sans-300{\textquoteright}, Arial, {\textquoteright}Sans Serif{\textquoteright}; font-size: 15px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: 24px; orphans: auto; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; display: inline !important; float: none; background-color: $\#$ffffff;">In progressive image coding, the cost in bits of the successive residual images being encoded does not always correspond with the subjective importance that such components may have. The original idea of this paper arose for increasing the efficiency when coding the last Laplacian levels in linear decompositions for pyramidal coding. The same principle has been applied to the non-linear image decomposition presented in which a segmentation-based progressive scheme is used for coding purposes. The {\textquoteleft}post-it{\textquoteright} method for extracting details based on mathematical morphology proposed by Meyer has been modified in order to improve the rendition of the posterior coding, and a suitable technique for coding the extracted details from an extension of run-length coding is then applied. In both linear and non-linear cases the results of this method for {\textquoteleft}detail-coding{\textquoteright} are compared against the conventional progressive coding technique, i.e., pyramidal coding or pure segmentation-based contour/texture coding.</span></p>},
	doi = {10.1117/12.157987},
	author = {Casas, J. and Torres, L. and Jare{\~n}o, M.}
}
