2013
DOI: 10.1007/978-3-642-41181-6_84
|View full text |Cite
|
Sign up to set email alerts
|

Attributed Relational SIFT-Based Regions Graph for Art Painting Retrieval

Abstract: Recently, image retrieval and analysis algorithms have been extensively applied to art related domains. In this field, state-of-the-art approaches mainly focus on feature extraction with the aim of improving reliability of authentication, classification and retrieval of art paintings. In this paper we propose an effective modeling, based on a graph structure, and a retrieval strategy, based on a graph matching algorithm, for art paintings. The proposed approach has been tested on different datasets with high q… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
24
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
3
2
1

Relationship

3
3

Authors

Journals

citations
Cited by 11 publications
(24 citation statements)
references
References 54 publications
0
24
0
Order By: Relevance
“…In this section, we describe the proposed object recognition framework, named FastGCN + ARSRGemb, composed by different modules. In the first module, each image is encoded through an Attributed Relational SIFT-based Graph (ARSRG [16]). This structure is able to capture both local and spatial information of image.…”
Section: Framework Overviewmentioning
confidence: 99%
See 2 more Smart Citations
“…In this section, we describe the proposed object recognition framework, named FastGCN + ARSRGemb, composed by different modules. In the first module, each image is encoded through an Attributed Relational SIFT-based Graph (ARSRG [16]). This structure is able to capture both local and spatial information of image.…”
Section: Framework Overviewmentioning
confidence: 99%
“…where s(G m , P i ) is a graph similarity measure between graph G m and the ith prototype. We apply this paradigm to obtain a vector where components encode the distance, obtained through an iterative and efficient graph matching algorithm [16], between the considered ARSRGs and related prototypes. Specifically, regions similarities among the ARSRGs are measured through the exploration of topological relations.…”
Section: Graph Embeddingmentioning
confidence: 99%
See 1 more Smart Citation
“…Usually, graphs are adopted in application domains where relations among data (edges) must be highlighted [2]. Image processing [3], pattern recognition [4] and many other fields benefit from data graph representations and related manipulation algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…In this context, our aim is addressing two important aspects of the image classification problem. First, image representation: We faced the problem of encoding both spatial and structural information adopting a graph based representation termed ARSRG (attributed relational SIFT (scale-invariant feature transform) regions graph) [1]. Differently to what happens in the dense sampling step (e.g., dense SIFT) in BoVW, our approach selects only relevant candidates through the result of image segmentation.…”
Section: Introductionmentioning
confidence: 99%