作者: Kunio Aizawa , Akira Nakamura
关键词: Time complexity 、 Graph 、 Quadtree 、 Image processing 、 Computer science 、 Power graph analysis 、 Theoretical computer science 、 Pixel 、 Embedding 、 Rule-based machine translation
摘要: In this paper, we define graph compression rules for the graphs representing two-dimensional rectangular grids with black and white pixels by making use of PCE way embedding. The rewrite four nodes having same label forming a square into node label. It also inserts deletes special labels to preserve neighborhood relations in original image. Then introduce an image algorithm using concept our rules. We show that time complexity is O(Nlog2N), where N number input graph, which as case best quadtree representation.