Search results for "algorithm"
showing 10 items of 4887 documents
Introducing Pseudo-Singularity Points for Efficient Fingerprints Classification and Recognition
2010
Fingerprint classification and matching are two key issues in automatic fingerprint recognition. Generally, fingerprint recognition is based on a set of relevant local characteristics, such as ridge ending and bifurcation (minutiae). Fingerprint classification is based on fingerprint global features, such as core and delta singularity points. Unfortunately, singularity points are not always present in a fingerprint image: the acquisition process is not ideal, so that the fingerprint is broken, or the fingerprint belongs to the arch class. In the above cases, pseudo-singularity-points will be detected and extracted to make possible fingerprint classification and matching. As result, fingerpr…
Video Indexing Using MPEG Motion Compensation Vectors
2003
In the last years a lot of work has been done on color, textural, structural and semantic indexing of "content-based" video databases. Motion-based video indexing has been less explored, with approaches generally based on the analysis of optical flows. Compressed videos require the decompression of the sequences and the computation of optical flows, two steps computationally heavy. In this paper we propose some methods to index videos by motion features (mainly related to camera motion) and by motion-based spatial segmentation of frames, in a fully automatic way. Our idea is to use MPEG motion vectors as an alternative to optical flows. Their extraction is very simple and fast; it doesn't r…
Video indexing using optical flow field
2002
The increasing development of advanced multimedia applications requires new technologies for organizing and retrieving by content databases of digital video. Several content based features (color, texture, motion, etc.) are needed to perform a reliable content based retrieval. We present a method for automatic motion based video indexing and retrieval. A prototypal system has been developed to prove the validity of our approach. Our system automatically splits a video into a sequence of shots, extracts a few representative frames (said r-frames) from each shot and computes some motion based features related to the optical flow field. Motion based queries are then performed either in a quali…
Blood Vessel Detection Algorithm for Tissue Engineering and Quantitative Histology.
2021
AbstractImmunohistochemistry for vascular network analysis plays a fundamental role in basic science, translational research and clinical practice. However, identifying vascularization in histological tissue images is time consuming and markedly depends on the operator’s experience. In this study, we present “blood vessel detection—BVD”, an automatic algorithm for quantitative analysis of blood vessels in immunohistochemical images. BVD is based on extraction and analysis of low-level image features and spatial filtering techniques, which do not require a training phase. BVD algorithm performance was comparatively evaluated on histological sections from three different in vivo experiments. …
Noise Filtering Using Edge-Driven Adaptive Anisotropic Diffusion
2008
This paper presents a method aimed to noise removal in MRI (Magnetic Resonance Imaging). We propose an improvement of Perona and Malik's anisotropic diffusion filter. In our schema, the diffusion equation of the filter has been modified to take into account the edges direction, This allows the filter to blur uniform areas, while it better preserves the edges. Both quantitative and qualitative evaluation is presented and the results are compared with other methods.
Pedestrian Tracking in 360 Video by Virtual PTZ Cameras
2018
Since the data acquired by a PTZ camera change while adjusting the pan, tilt and zoom parameters, the results of tracking algorithms are difficult to reproduce; such diffi- culty limits the development and the comparison of tracking algorithms with PTZ cameras. The recently introduced 360- degree cameras acquire spherical views of the environment, generally stored as equirectangular images. Each pixel of an equirectangular image corresponds to a point on the spherical surface. A gnomonic projection can be used to project the points on the spherical surface onto a plane tangent to the sphere. Such tangent plane can be interpreted as the image plane of a virtual PTZ camera oriented towards th…
Texture Synthesis for Digital Restoration in the Bit-Plane Representation
2007
In this paper we propose a new approach to handle the problem of restoration of grayscale textured images. The purpose is to recovery missing data of a damaged area. The key point is to decompose an image in its bit-planes, and to process bits rather than pixels. We propose two texture synthesis methods for restoration. The first one is a random generation process, based on the conditional probability of bits in the bit-planes. It is designed for images with stochastic textures. The second one is a best-matching method, running on each bit-plane, that is well suited to synthesize periodic patterns. Results are compared with a state-of-the-art restoration algorithm.
Morphological exponential entropy driven-HUM.
2006
This paper presents an improvement to the Ex- ponential Entropy Driven - Homomorphic Unsharp Masking (E 2 D − HUM ) algorithm devoted to illumination artifact sup- pression on Magnetic Resonance Images. E 2 D−HUM requires a segmentation step to remove dark regions in the foreground whose intensity is comparable with background, because strong edges produce streak artifacts on the tissues. This new version of the algorithm keeps the same good properties of E 2 D − HUM without a segmentation phase, whose parameters should be chosen in relation to the image. I. INTRODUCTION Most of the studies on illumination correction found in literature are oriented to brain (18) magnetic resonance images (…
A distributed Bayesian approach to fault detection in sensor networks
2012
Sensor networks are widely used in industrial and academic applications as the pervasive sensing module of an intelligent system. Sensor nodes may occasionally produce incorrect measurements due to battery depletion, dust on the sensor, manumissions and other causes. The aim of this paper is to develop a distributed Bayesian fault detection algorithm that classifies measurements coming from the network as corrupted or not. The computational complexity is polynomial so the algorithm scales well with the size of the network. We tested the approach on a synthetic dataset and obtained significant results in terms of correctly labeled measurements.
QoS-Aware Fault Detection in Wireless Sensor Networks
2013
Wireless sensor networks (WSNs) are a fundamental building block of many pervasive applications. Nevertheless the use of such technology raises new challenges regarding the development of reliable and fault-tolerant systems. One of the most critical issues is the detection of corrupted readings amidst the huge amount of gathered sensory data. Indeed, such readings could significantly affect the quality of service (QoS) of the WSN, and thus it is highly desirable to automatically discard them. This issue is usually addressed through “fault detection” algorithms that classify readings by exploiting temporal and spatial correlations. Generally, these algorithms do not take into account QoS re…