Search results for "Transform"
showing 10 items of 3975 documents
Exploiting Visual Saliency Algorithms for Object-Based Attention: A New Color and Scale-Based Approach
2017
Visual Saliency aims to detect the most important regions of an image from a perceptual point of view. More in detail, the goal of Visual Saliency is to build a Saliency Map revealing the salient subset of a given image by analyzing bottom-up and top-down factors of Visual Attention. In this paper we proposed a new method for Saliency detection based on colour and scale analysis, extending our previous work based on SIFT spatial density inspection. We conducted several experiments to study the relationships between saliency methods and the object attention processes and we collected experimental data by tracking the eye movements of thirty viewers in the first three seconds of observation o…
A New Class of Searchable and Provably Highly Compressible String Transformations
2019
The Burrows-Wheeler Transform is a string transformation that plays a fundamental role for the design of self-indexing compressed data structures. Over the years, researchers have successfully extended this transformation outside the domains of strings. However, efforts to find non-trivial alternatives of the original, now 25 years old, Burrows-Wheeler string transformation have met limited success. In this paper we bring new lymph to this area by introducing a whole new family of transformations that have all the "myriad virtues" of the BWT: they can be computed and inverted in linear time, they produce provably highly compressible strings, and they support linear time pattern search direc…
Multi-modal Medical Image Registration by Local Affine Transformations
2018
Image registration is the process of finding the geometric transformation that, applied to the floating image, gives the registered image with the highest similarity to the reference image. Registering a pair of images involves the definition of a similarity function in terms of the parameters of the geometric transformation that allows the registration. This paper proposes to register a pair of images by iteratively maximizing the empirical mutual information through coordinate gradient descent. Hence, the registered image is obtained by applying a sequence of local affine transformations. Rather than adopting a uniformly spaced grid to select image blocks to locally register, as done by s…
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…
Effective and Efficient Interpolation for Mutual Information based Multimodality Elastic Image Registration
2009
Mutual information (MI) is a popular similarity metric for multimodality image registration purpose. However, it is negatively influenced by artifacts due to interpolation effects. As a result, registration algorithms performance could be affected. In this paper a novel interpolation scheme is presented. It is both effective and efficient. Effective because it limits the presence of local maxima in the mutual information curve, efficient because it is simple to compute being based on simple and optimized distance measures. The method is validated and compared against other techniques both from performance and time complexity persepectives. Differently from other reference works, which perfo…
An Evolution of the Non-Parameter Harris Affine Corner Detector: A Distributed Approach
2009
A parallel version of a new automatic Harris-based corner detector is presented. A scheduler to dynamically and homogeneously distribute high computational workload on heterogeneous parallel architectures such as Grid systems has been implemented to speedup the whole procedure. Experimental results show the robustness of the underlying scheduler, which can be easily exploited in various automatic image analysis systems.
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.
Fake News Spreaders Detection: Sometimes Attention Is Not All You Need
2022
Guided by a corpus linguistics approach, in this article we present a comparative evaluation of State-of-the-Art (SotA) models, with a special focus on Transformers, to address the task of Fake News Spreaders (i.e., users that share Fake News) detection. First, we explore the reference multilingual dataset for the considered task, exploiting corpus linguistics techniques, such as chi-square test, keywords and Word Sketch. Second, we perform experiments on several models for Natural Language Processing. Third, we perform a comparative evaluation using the most recent Transformer-based models (RoBERTa, DistilBERT, BERT, XLNet, ELECTRA, Longformer) and other deep and non-deep SotA models (CNN,…
ARC FAULT DETECTION EQUIPMENT AND METHOD USING LOW FREQUENCY HARMONIC CURRENT ANALYSIS
2012
An arc fault detection circuit includes a current sensing circuit coupled to a line conductor carrying a current. The current sensing circuit operates to sense current and output data indicative of the sensed current. A processing circuit implements a frequency transform algorithm to transform the output data to frequency data in a low frequency range and with a high spectral resolution where a minimum short time observation window is concerned. The processing circuit identifies an arc fault condition on the line conductor by identifying differences in said frequency data between at least two subsequent observation windows and identifying characteristics which exceed thresholds.