Shape based local affine invariant texture characteristics for fabric image retrieval
Autor: | Yuhua Li, Chen Ming, Huang Yan, Haopeng Lei, Jianwei Zhang, Guoliang Luo |
---|---|
Rok vydání: | 2018 |
Předmět: |
Computer Networks and Communications
Computer science business.industry ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION 020207 software engineering Pattern recognition 02 engineering and technology Hardware and Architecture 0202 electrical engineering electronic engineering information engineering Media Technology Affine invariant Affine transformation Artificial intelligence Invariant (mathematics) business Image retrieval Software |
Zdroj: | Multimedia Tools and Applications. 78:15433-15453 |
ISSN: | 1573-7721 1380-7501 |
DOI: | 10.1007/s11042-018-6936-y |
Popis: | The rapid growth of fabric images needs fast retrieval for related applications, such as fashion design. The goal of fabric image retrieval is to retrieve and rank relevant fabrics from a large scale fabric database to visually assist users’ online shopping process in e-commerce. Most of existing solutions to this issue are not invariant with respect to 2D similarity or affine transformations, much less to 3D transformations of textured surface. In this paper, we propose a new search method with a shape based local affine invariant texture characteristics. By employing topographic map to represent fabric images, which is a complete, multi-scale and contrast invariant representation, the proposed method first obtains a tree of shapes from the topographic map. Then, a group of statistics is applied on these shapes to acquire a set of features that are invariant to 3D transformations. We finally represent these features combing relations between shapes, and based on the representation the similarity of pairs of fabric images can be estimated. To evaluate the performance of our algorithm, we conducted a series of experiments on a real-world fabric image dataset, and compared the proposed method with other previous ones. Experimental results demonstrate that the time of the proposed method spending in searching is less than 1 second, and meanwhile a higher PR score than others is obtained. |
Databáze: | OpenAIRE |
Externí odkaz: |