[vc_empty_space][vc_empty_space]
Image Graph Matching Based on Region Adjacency Graph
Akmala, Munir R.a, Santoso J.a
a Institut Teknologi Bandung, School of Electrical Engineering and Informatics, Bandung, Indonesia
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2019 IEEE.Extraction of image features done in traditional pixel-based image analysis is not done effectively. This extraction is caused by extraction, which only represents content. A very promising and challenging approach is extracting graphs from images that represent not only content but also the relation of content. The process of graph extraction from an image begins with the segmentation process. The segmentation method using the Minimum Spanning Tree algorithm is one way to divide the image into homogeneous regions. The regions obtained in the segmentation stage are represented as vertices and relations between neighboring regions are represented as edges. This form of representation is called the Region Adjacency Graph (RAG). By assuming that the RAG obtained is a graph feature of the image, then a graph matching process is performed using it. Image graph matching is performed on the artificial images and batik core images using VF2 algorithm and Graph Edit Distance (GED) algorithm. Based on the experiments, the best evaluation results on artificial image data are obtained through the VF2 algorithm with an f-score value of 90.00%. Both precision and recall values for this algorithm have good values, namely 96.24% and 84.52%. Then in the batik core motif, the highest results are achieved through Graph Edit Distance with the GED ≥ 8 parameter. The f-score value obtained is 59.76%, and precision and recall are 47.46% and 60.00%[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Exact graph matching,Graph extractions,Inexact graph matching,Minimum spanning trees,Precision and recall,Region adjacency graphs,Segmentation methods,Segmentation process[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]exact graph matching,graph extraction,inexact graph matching,region adjacency graph,segmentation[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][{‘$’: ‘supported by BUDI-DN (No: PRJ-‘}, {‘$’: ‘This study is supported by BUDI-DN (No: PRJ-5777/LPDP.3/2016)’}][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1109/ICSITech46713.2019.8987480[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]