Improving analytical color and texture similarity estimation methods for dataset-agnostic person reidentification

• URL: http://arxiv.org/abs/2412.05076v2
• Date: Fri, 20 Dec 2024 08:17:53 GMT
• Title: Improving analytical color and texture similarity estimation methods for dataset-agnostic person reidentification
• Authors: Nikita Gabdullin,
• Abstract summary: It is proposed to analyze and compare colors in CIE-Lab color space using histogram smoothing for noise reduction. A novel pre-configured latent space (LS) supervised autoencoder (SAE) is proposed for texture analysis. The viability of the proposed method is verified by computing rank-1, rank-10, and mAP re-id metrics on Market1501 dataset.
• Score: 0.0
• License:
• Abstract: This paper studies a combined person reidentification (re-id) method that uses human parsing, analytical feature extraction and similarity estimation schemes. One of its prominent features is its low computational requirements so it can be implemented on edge devices. The method allows direct comparison of specific image regions using interpretable features which consist of color and texture channels. It is proposed to analyze and compare colors in CIE-Lab color space using histogram smoothing for noise reduction. A novel pre-configured latent space (LS) supervised autoencoder (SAE) is proposed for texture analysis which encodes input textures as LS points. This allows to obtain more accurate similarity measures compared to simplistic label comparison. The proposed method also does not rely upon photos or other re-id data for training, which makes it completely re-id dataset-agnostic. The viability of the proposed method is verified by computing rank-1, rank-10, and mAP re-id metrics on Market1501 dataset. The results are comparable to those of conventional deep learning methods and the potential ways to further improve the method are discussed.

Related papers

• RGB-based Category-level Object Pose Estimation via Decoupled Metric Scale Recovery [72.13154206106259]
  We propose a novel pipeline that decouples the 6D pose and size estimation to mitigate the influence of imperfect scales on rigid transformations. Specifically, we leverage a pre-trained monocular estimator to extract local geometric information. A separate branch is designed to directly recover the metric scale of the object based on category-level statistics.
  arXiv  Detail & Related papers  (2023-09-19T02:20:26Z)
• Data-Adaptive Discriminative Feature Localization with Statistically Guaranteed Interpretation [10.122986238546492]
  We use two real datasets, the MNIST handwritten digits and MIT-BIH Electrocardiogram signals, to motivate key characteristics of discriminative features. We develop a localization framework based on adversarial attacks to effectively localize discriminative features. In the first, the compact image regions localized by the proposed method are visually appealing. In the second, the identified ECG features are biologically plausible and consistent with cardiac electrophysiological principles.
  arXiv  Detail & Related papers  (2022-11-18T07:20:00Z)
• Texture image analysis based on joint of multi directions GLCM and local ternary patterns [0.0]
  Texture features can be used in many different applications in commuter vision or machine learning problems. New approach is proposed based on combination of two texture descriptor, co-occurrence matrix and local ternary patterns. Experimental results show that proposed approach provide higher classification rate in comparison with some state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-09-05T09:53:00Z)
• Multiscale Analysis for Improving Texture Classification [62.226224120400026]
  This paper employs the Gaussian-Laplacian pyramid to treat different spatial frequency bands of a texture separately. We aggregate features extracted from gray and color texture images using bio-inspired texture descriptors, information-theoretic measures, gray-level co-occurrence matrix features, and Haralick statistical features into a single feature vector.
  arXiv  Detail & Related papers  (2022-04-21T01:32:22Z)
• On the Limits of Pseudo Ground Truth in Visual Camera Re-localisation [83.29404673257328]
  Re-localisation benchmarks measure how well each method replicates the results of a reference algorithm. This begs the question whether the choice of the reference algorithm favours a certain family of re-localisation methods. This paper analyzes two widely used re-localisation datasets and shows that evaluation outcomes indeed vary with the choice of the reference algorithm.
  arXiv  Detail & Related papers  (2021-09-01T12:01:08Z)
• Denoising and Optical and SAR Image Classifications Based on Feature Extraction and Sparse Representation [0.0]
  This paper presents a method for denoising, feature extraction and compares classifications of Optical and SAR images. Optical image data have been used by the Remote Sensing workforce to study land use and cover since such data is easily interpretable.
  arXiv  Detail & Related papers  (2021-06-03T14:39:30Z)
• Estimating leverage scores via rank revealing methods and randomization [50.591267188664666]
  We study algorithms for estimating the statistical leverage scores of rectangular dense or sparse matrices of arbitrary rank. Our approach is based on combining rank revealing methods with compositions of dense and sparse randomized dimensionality reduction transforms.
  arXiv  Detail & Related papers  (2021-05-23T19:21:55Z)
• Texture image classification based on a pseudo-parabolic diffusion model [0.0]
  The proposed approach is tested on the classification of well established benchmark texture databases and on a practical task of plant species recognition. The good performance can be justified to a large extent by the ability of the pseudo-parabolic operator to smooth possibly noisy details inside homogeneous regions of the image.
  arXiv  Detail & Related papers  (2020-11-14T00:04:07Z)
• Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
  Local features provide region-to-region rather than point-to-point correspondences. We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline. Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
  arXiv  Detail & Related papers  (2020-07-20T12:07:48Z)
• UC-Net: Uncertainty Inspired RGB-D Saliency Detection via Conditional Variational Autoencoders [81.5490760424213]
  We propose the first framework (UCNet) to employ uncertainty for RGB-D saliency detection by learning from the data labeling process. Inspired by the saliency data labeling process, we propose probabilistic RGB-D saliency detection network.
  arXiv  Detail & Related papers  (2020-04-13T04:12:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.