Search results for "algorithm"

A Harris-based Region Detector on a Computational Grid

2007

This paper introduces a new Harris-based feature detector algorithm, characterized by no parameters tuning to detect region of interest. Preliminary results show that the proposed methodology returns good results with respect to standard detectors which need a set of parameters. An uncommon parallel implementation of the proposed algorithm is presented to support the high computational workload which is required to avoid the approximation of the results. Our parallel approach differs from the conventional one because an internal scheduler, based on the expected running time, is used to balance the data distribution on a client-server model. The aim of this paper is also to underline the adv…

Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis

2012

AbstractThe advent of high throughput technologies, in particular microarrays, for biological research has revived interest in clustering, resulting in a plethora of new clustering algorithms. However, model selection, i.e., the identification of the correct number of clusters in a dataset, has received relatively little attention. Indeed, although central for statistics, its difficulty is also well known. Fortunately, a few novel techniques for model selection, representing a sharp departure from previous ones in statistics, have been proposed and gained prominence for microarray data analysis. Among those, the stability-based methods are the most robust and best performing in terms of pre…

MIS: Macro Icon System to generate macro algorithms for image analysis in parallel processing

1993

HERMIA: An Heterogeneous and Reconfigurable Machine for Image Analysis

1990

In this paper is described the general architecture of an Heterogeneous and Reconfigurable Machine for Image Analysis (HERMIA); the first prototype of the system has been developed at the University of Palermo. Conventional hardware has been used in order to emulate the machine and evaluate the system performance Preliminary results are presented and discussed.

Future is where concepts, theories and applications meet (also in fuzzy logic)

2015

No one knows where the future lies, and the idea of serendipity in science is now raised to something of a tropism. This does not impede our will to predict, if not the exact events, at least the short–term trends in the disciplines we live and breathe, and to point at the (subjective) glaring chances for a bright future. This volume is a clear example of the need that any living scientific discipline has for constant regrouping and redirection, in a never–ending process of consolidating results and finding new paths. In this contribution we will try and focus on a number of areas of fuzzy logic and, by extension, in the whole word of uncertainty, where (in our opinion) a number of interest…

Indexed Two-Dimensional String Matching

2016

Restoration of Vertical Line Scratches with a Distributed Genetic Algorithm

2006

This contribution approaches the problem of scratch restoration in old movies as a optimisation's problem. The functional based on the statistical properties of the image around the scratch is optimised using an ad-hoc genetic algorithm. Given the large amount of the computational time needed by genetic algorithms, a network of standard workstations with heterogeneous operating systems has been used. Each workstation in the network works on each scratch to perform the restoration, and a specific machine works as root node with the task of distributing jobs on the network and adding the outputted restored scratches back into the image.

Improving Harris corner selection strategy

2011

This study describes a corner selection strategy based on the Harris approach. Corners are usually defined as interest points for which intensity variation in the principal directions is locally maximised, as response from a filter given by the linear combination of the determinant and the trace of the autocorrelation matrix. The Harris corner detector, in its original definition, is only rotationally invariant, but scale-invariant and affine-covariant extensions have been developed. As one of the main drawbacks, corner detector performances are influenced by two user-given parameters: the linear combination coefficient and the response filter threshold. The main idea of the authors' approa…

Graph-based minimal path tracking in the skeleton of the retinal vascular network

2012

This paper presents a semi-automatic framework for minimal path tracking in the skeleton of the retinal vascular network. The method is based on the graph structure of the vessel network. The vascular network is represented based on the skeleton of the available segmented vessels and using an undirected graph. Significant points on the skeleton are considered nodes of the graph, while the edge of the graph is represented by the vessel segment linking two neighboring nodes. The graph is represented then in the form of a connectivity matrix, using a novel method for defining vertex connectivity. Dijkstra and Floyd-Warshall algorithms are applied for detection of minimal paths within the graph…

Speeding up the Consensus Clustering methodology for microarray data analysis

2010

Abstract Background The inference of the number of clusters in a dataset, a fundamental problem in Statistics, Data Analysis and Classification, is usually addressed via internal validation measures. The stated problem is quite difficult, in particular for microarrays, since the inferred prediction must be sensible enough to capture the inherent biological structure in a dataset, e.g., functionally related genes. Despite the rich literature present in that area, the identification of an internal validation measure that is both fast and precise has proved to be elusive. In order to partially fill this gap, we propose a speed-up of Consensus (Consensus Clustering), a methodology whose purpose…