.png){kind=icon}
.png){kind=icon}
Return
Low-Complexity and High-Coding-Efficiency Image Deletion for Compressed Image Sets in Cloud Servers
.png){kind=icon}
PRE
AI
DOI：10.1109/TCC.2021.3106103.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Image deletion refers to removing images from a compressed image set in cloud servers, which has always received much attention. However, in some cases images are not successfully deleted, and coding performance still remains to rise. In this paper, we propose a low-complexity and high-coding-efficiency image deletion algorithm. First, all the images are classified into to-be-deleted images, images unneeded to be processed, and images needed to be processed further divided into images needed to be only decoded and images needed to be re-encoded. Then, we also propose a depth- and subtree-constrained minimum spanning tree (DSCMST) heuristics to produce the DSCMST of images needed to be processed. Third, every image unneeded to be processed is added to the just obtained DSCMST as the child of the vertex that is still its parent in the compressed image set. Finally, after the encoding of images needed to be re-encoded, a new compressed image set is constructed, implying the completion of image deletion. Experimental results show that under various circumstances our proposed algorithm can effectively remove any images, including root vertex, internal vertices, and leaf vertices. Moreover, compared with state-of-the-art methods, the proposed algorithm achieves higher coding efficiency while having the minimum complexity.
Keywords:
Image coding
Cloud computing
Complexity theory
Classification algorithms
Image edge detection
Servers
Production
Image deletion
compressed image set
depth- and subtree-constrained minimum spanning tree
low complexity
high coding efficiency
Journal
I
IF:
5
Papers:
1.8K
Citations:
4.3K