<span style="font-family: MSTT31c3f700; font-size...

In the developed countries, many organizations are regarded a...

In this paper, we apply an equivalent color transform (ECT) for a minimal k-coloring of any graph G. It contracts each color class of the graph to a single vertex and produces a complete graph Kk for G by removing redundant edges between any two vertices. Based on ECT, a simple proof for four color theorem for planar graph is then proposed.

Given a color image that was quantized in some hidden color space (termed compression color space) during previous JPEG compression, we aim to estimate this unknown compression color space from the image. This knowledge is potentially useful for color image enhancement and JPEG re-compression. JPEG quantizes the discrete cosine transform (DCT) coefficients of each color plane independently duri...

Given a color image that was quantized in some hidden color space (termed compression color space) during previous JPEG compression, we aim to estimate this unknown compression color space from the image. This knowledge is potentially useful for color image enhancement and JPEG re-compression. JPEG quantizes the discrete cosine transform (DCT) coefficients of each color plane independently duri...