초록 ▼

To efficiently compress image data, the image data is divided into rectangular blocks of non-equal length in a hierarchal structure in accordance with a brightness change, and is encoded into tree-structure data for each of the divided blocks so that the mean distortion of the image data inside each

To efficiently compress image data, the image data is divided into rectangular blocks of non-equal length in a hierarchal structure in accordance with a brightness change, and is encoded into tree-structure data for each of the divided blocks so that the mean distortion of the image data inside each block does not exceed an allowable value.

대표청구항 ▼

A method of encoding image data, comprising the steps of: dividing said image data into blocks of variable size so that an index representing the degree of an error, generated by approximation of the data in each block by a polynomial function of at least two independent variables corresponding to t

A method of encoding image data, comprising the steps of: dividing said image data into blocks of variable size so that an index representing the degree of an error, generated by approximation of the data in each block by a polynomial function of at least two independent variables corresponding to the coordinates on said image data multiplied respectively by a predetermined coefficient, is less than a predetermined value; quantizing the coefficient of said function; encoding said quantized data in a form of treestructured data.