# Efficient Retrieval of Logos Using Rough Set Reducts

**Authors:** Ushasi Chaudhuri, Partha Bhowmick, Jayanta Mukhopadhyay

arXiv: 1904.05008 · 2019-04-11

## TL;DR

This paper introduces a rough-set based method for efficient and accurate logo retrieval by representing logos as polygonal approximations, improving speed and precision in trademark database searches.

## Contribution

The paper presents a novel rough-set based approach to encode logo structures as feature vectors, enhancing retrieval efficiency and accuracy.

## Key findings

- Method is computationally efficient
- Achieves high retrieval accuracy
- Effective on standard datasets

## Abstract

Searching for similar logos in the registered logo database is a very important and tedious task at the trademark office. Speed and accuracy are two aspects that one must attend to while developing a system for retrieval of logos. In this paper, we propose a rough-set based method to quantify the structural information in a logo image that can be used to efficiently index an image. A logo is split into a number of polygons, and for each polygon, we compute the tight upper and lower approximations based on the principles of a rough set. This representation is used for forming feature vectors for retrieval of logos. Experimentation on a standard data set shows the usefulness of the proposed technique. It is computationally efficient and also provides retrieval results at high accuracy.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1904.05008/full.md

## Figures

56 figures with captions in the complete paper: https://tomesphere.com/paper/1904.05008/full.md

## References

24 references — full list in the complete paper: https://tomesphere.com/paper/1904.05008/full.md

---
Source: https://tomesphere.com/paper/1904.05008