Graph Representation for Face Analysis in Image Collections

11/27/2019
by   Domingo Mery, et al.
0

Given an image collection of a social event with a huge number of pictures, it is very useful to have tools that can be used to analyze how the individuals –that are present in the collection– interact with each other. In this paper, we propose an optimal graph representation that is based on the `connectivity' of them. The connectivity of a pair of subjects gives a score that represents how `connected' they are. It is estimated based on co-occurrence, closeness, facial expressions, and the orientation of the head when they are looking to each other. In our proposed graph, the nodes represent the subjects of the collection, and the edges correspond to their connectivities. The location of the nodes is estimated according to their connectivity (the closer the nodes, the more connected are the subjects). Finally, we developed a graphical user interface in which we can click onto the nodes (or the edges) to display the corresponding images of the collection in which the subject of the nodes (or the connected subjects) are present. We present relevant results by analyzing a wedding celebration, a sitcom video, a volleyball game and images extracted from Twitter given a hashtag. We believe that this tool can be very helpful to detect the existing social relations in an image collection.

READ FULL TEXT

page 2

page 4

research
12/06/2021

Dense and well-connected subgraph detection in dual networks

Dense subgraph discovery is a fundamental problem in graph mining with a...
research
10/22/2021

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams

We initiate the study of k-edge-connected orientations of undirected gra...
research
03/22/2023

Learning Brain Connectivity in Social Cognition with Dynamic Network Regression

Dynamic networks have been increasingly used to characterize brain conne...
research
01/16/2022

Cost Sharing for Connectivity with Budget

We consider a cost sharing problem to connect all nodes in a weighted un...
research
08/10/2020

ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms

Connected components is a fundamental kernel in graph applications due t...
research
06/06/2023

Minimizing Hitting Time between Disparate Groups with Shortcut Edges

Structural bias or segregation of networks refers to situations where tw...

Please sign up or login with your details

Forgot password? Click here to reset