Social computing for image matching.

PLoS One

BISITE Digital Innovation Hub, Edificio Multiusos I+D+i, University of Salamanca, 37007, Salamanca, Spain.

Published: December 2018

One of the main technological trends in the last five years is mass data analysis. This trend is due in part to the emergence of concepts such as social networks, which generate a large volume of data that can provide added value through their analysis. This article is focused on a business and employment-oriented social network. More specifically, it focuses on the analysis of information provided by different users in image form. The images are analyzed to detect whether other existing users have posted or talked about the same image, even if the image has undergone some type of modification such as watermarks or color filters. This makes it possible to establish new connections among unknown users by detecting what they are posting or whether they are talking about the same images. The proposed solution consists of an image matching algorithm, which is based on the rapid calculation and comparison of hashes. However, there is a computationally expensive aspect in charge of revoking possible image transformations. As a result, the image matching process is supported by a distributed forecasting system that enables or disables nodes to serve all the possible requests. The proposed system has shown promising results for matching modified images, especially when compared with other existing systems.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC5973563PMC
http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0197576PLOS

Publication Analysis

Top Keywords

image matching
12
image
7
social computing
4
computing image
4
matching
4
matching main
4
main technological
4
technological trends
4
trends years
4
years mass
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!