Search results for "Pattern Recognition"
showing 10 items of 2301 documents
An evaluation of recent local image descriptors for real-world applications of image matching
2019
This paper discusses and compares the best and most recent local descriptors, evaluating them on increasingly complex image matching tasks, encompassing planar and non-planar scenarios under severe viewpoint changes. This evaluation, aimed at assessing descriptor suitability for real-world applications, leverages the concept of approximated overlap error as a means to naturally extend to non-planar scenes the standard metric used for planar scenes. According to the evaluation results, most descriptors exhibit a gradual performance degradation in the transition from planar to non-planar scenes. The best descriptors are those capable of capturing well not only the local image context, but als…
Is There Anything New to Say About SIFT Matching?
2020
SIFT is a classical hand-crafted, histogram-based descriptor that has deeply influenced research on image matching for more than a decade. In this paper, a critical review of the aspects that affect SIFT matching performance is carried out, and novel descriptor design strategies are introduced and individually evaluated. These encompass quantization, binarization and hierarchical cascade filtering as means to reduce data storage and increase matching efficiency, with no significant loss of accuracy. An original contextual matching strategy based on a symmetrical variant of the usual nearest-neighbor ratio is discussed as well, that can increase the discriminative power of any descriptor. Th…
A Low Cost Solution for NOAA Remote Sensing
2018
United States National Oceanic and Atmospheric Administration (NOAA) weather satellites adopt Advanced Very High Resolution Radiometer (AVHRR) sensors to acquire remote sensing data and broadcast Automatic Picture Transmission (APT) images. The orientation of the scan lines is perpendicular to the orbit of the satellite. In this paper we propose a new low cost solution for NOAA remote sensing. More in detail, our method focuses on the possibility of directly sampling the modulated signal and processing it entirely in software enabled by recent breakthroughs on Software Defined Radios (SDR) and CPU computational speed, while keeping the costs extremely low. We aim to achieve good results wit…
Image Segmentation through a Hierarchy of Minimum Spanning Trees
2012
Many approaches have been adopted to solve the problem of image segmentation. Among them a noticeable part is based on graph theory casting the pixels as nodes in a graph. This paper proposes an algorithm to select clusters in the images (corresponding to relevant segments in the image) corresponding to the areas induced in the images through the search of the Minimum Spanning Tree (MST). In particular is is based on a clustering algorithm that extracts clusters computing a hierarchy of Minimum Spanning Trees. The main drawback of this previous algorithm is that the dimension of the cluster is not predictable and a relevant portion of found clusters can be composed by micro-clusters that ar…
Normalised compression distance and evolutionary distance of genomic sequences: comparison of clustering results
2009
Genomic sequences are usually compared using evolutionary distance, a procedure that implies the alignment of the sequences. Alignment of long sequences is a time consuming procedure and the obtained dissimilarity results is not a metric. Recently, the normalised compression distance was introduced as a method to calculate the distance between two generic digital objects and it seems a suitable way to compare genomic strings. In this paper, the clustering and the non-linear mapping obtained using the evolutionary distance and the compression distance are compared, in order to understand if the two distances sets are similar.
Text localization from photos
2009
In this paper a new text extraction algorithm is proposed. In real scenes the text is usually overlapped or is part of the background. To identify the text regions, in complex conditions, a method exploiting a “multi-resolution feature based method” for extracting text with undefined dimension has been developed. Once identified, the multi-resolution information are merged and skimmed through a set of Support Vector Machines (SVM). The tests and the comparisons with other techniques, performed on heterogeneous images, have shown the effectiveness of the proposed.
Mean shift clustering for personal photo album organization
2008
In this paper we propose a probabilistic approach for the automatic organization of pictures in personal photo album. Images are analyzed in term of faces and low-level visual features of the background. The description of the background is based on RGB color histogram and on Gabor filter energy accounting for texture information. The face descriptor is obtained by projection of detected and rectified faces on a common low dimensional eigenspace. Vectors representing faces and background are clustered in an unsupervised fashion exploiting a mean shift clustering technique. We observed that, given the peculiarity of the domain of personal photo libraries where most of the pictures contain fa…
Fuzzy Smoothed Composition of Local Mapping Transformations for Non-rigid Image Registration
2009
This paper presents a novel method for medical image regis- tration. The global transformation is obtained by composing affine trans- formations, which are recovered locally from given landmarks. Transfor- mations of adjacent regions are smoothed to avoid blocking artifacts, so that a unique continuous and differentiable global function is obtained. Such composition is operated using a technique derived from fuzzy C- means clustering. The method was successfully tested on several datasets; results, both qualitative and quantitative, are shown. Comparisons with other methods are reported. Final considerations on the efficiency of the technique are explained.
Iterative Multiple Bounding-Box Refinements for Visual Tracking.
2022
Single-object visual tracking aims at locating a target in each video frame by predicting the bounding box of the object. Recent approaches have adopted iterative procedures to gradually refine the bounding box and locate the target in the image. In such approaches, the deep model takes as input the image patch corresponding to the currently estimated target bounding box, and provides as output the probability associated with each of the possible bounding box refinements, generally defined as a discrete set of linear transformations of the bounding box center and size. At each iteration, only one transformation is applied, and supervised training of the model may introduce an inherent ambig…
Soft Topographic Map for Clustering and Classification of Bacteria
2007
In this work a new method for clustering and building a topographic representation of a bacteria taxonomy is presented. The method is based on the analysis of stable parts of the genome, the so-called “housekeeping genes”. The proposed method generates topographic maps of the bacteria taxonomy, where relations among different type strains can be visually inspected and verified. Two well known DNA alignement algorithms are applied to the genomic sequences. Topographic maps are optimized to represent the similarity among the sequences according to their evolutionary distances. The experimental analysis is carried out on 147 type strains of the Gammaprotebacteria class by means of the 16S rRNA…