Search results for " image processing."
showing 10 items of 2265 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…
3D Map Computation from Historical Stereo Photographs of Florence
2018
The analysis of early photographic sources is fundamental for documenting and understanding the evolution of a city so rich in history and art as Florence. Indeed, by the 1860s several photographers used to work in town, and their images (often obtained through stereoscopic set-ups) can help us to reconstruct Florence in 3D as it was by the time of the Italian unification. The first and most delicate part of such reconstruction process is the computation of disparity maps from the historical stereo pairs. This is a very challenging task for fully-automatic computer vision algorithms, since XIX century photographs are affected by several problems—ranging from superficial damages to asynchron…
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…
Verification of Symbolic Distributed Protocols for Networked Embedded Devices
2020
The availability of versatile and interconnected embedded devices makes it possible to build low-cost networks with a large number of nodes running even complex applications and protocols in a distributed manner. Common tools used for modeling and verification, such as simulators, present some limitations as application correctness is checked off-board and only focuses on source code. Execution in the real network is thus excluded from the early stages of design and verification. In this paper, a system for modeling and verification of symbolic distributed protocols running on embedded devices is introduced. The underlying methodology is rooted in a symbolic programming paradigm that makes …
Embedded Coprocessors for Native Execution of Geometric Algebra Operations
2016
Clifford algebra or geometric algebra (GA) is a simple and intuitive way to model geometric objects and their transformations. Operating in high-dimensional vector spaces with significant computational costs, the practical use of GA requires dedicated software and/or hardware architectures to directly support Clifford data types and operators. In this paper, a family of embedded coprocessors for the native execution of GA operations is presented. The paper shows the evolution of the coprocessor family focusing on the latest two architectures that offer direct hardware support to up to five-dimensional Clifford operations. The proposed coprocessors exploit hardware-oriented representations o…
360° Tracking Using a Virtual PTZ Camera
2017
Object tracking using still or PTZ cameras is a hard task for large spaces and needs several devices to completely cover the area or to track multiple subjects. The introduction of \(360^{\circ }\) camera technology offers a complete view of the scene in a single image and can be useful to reduce the number of devices needed in the tracking problem. In this paper we present a framework using \(360^{\circ }\) cameras to simulate an unlimited number of PTZ cameras and to be used for tracking. The proposed method to track a single target process an equirectangular view of the scene and obtains a model of the moving object in the image plane. The target is tracked analyzing the next frame of th…
Towards a Smart Campus Through Participatory Sensing
2018
In recent years, the percentage of the population owning a smartphone has increased significantly. These devices provide users with more and more functions that make them real sensing platforms. Exploiting the capabilities offered by smartphones, users can collect data from the surrounding environment and share them with other entities in the network thanks to existing communication infrastructures, i.e., 3G/4G/5G or WiFi. In this work, we present a system based on participatory sensing paradigm using smartphones to collect and share local data in order to monitor make a campus 'smart'. In particular, our system infers the activities performed by users (e.g., students) in a campus in order …
The four types of self-adaptive systems: A metamodel
2017
The basic ideas of self-adaptive systems are not a novelty in computer science. There are plenty of systems that are able of monitoring their operative context to take run-time decisions. However, more recently a new research discipline is trying to provide a common framework for collecting theory, methods, middlewares, algorithms and tools for engineering such software systems. The aim is to collect and classify existing approaches, coming from many different research areas. The objective of this work is providing a unified metamodel for describing the various categories of adaptation.
Probabilistic squares and hexagons of opposition under coherence
2017
Various semantics for studying the square of opposition and the hexagon of opposition have been proposed recently. We interpret sentences by imprecise (set-valued) probability assessments on a finite sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square and of the hexagon in terms of acceptability. Then, we show how to construct probabilistic versions of the square and of the hexagon of opposition by forming suitable tripartitions of the set of all coherent assessments on a finite sequence of conditional events. Finally, as an application, we present new versions of the square and of the…
Inverse procedural modeling of 3D models for virtual worlds
2016
This course presents a collection of state-of-the-art approaches for modeling and editing of 3D models for virtual worlds, simulations, and entertainment, in addition to real-world applications. The first contribution of this course is a coherent review of inverse procedural modeling (IPM) (i.e., proceduralization of provided 3D content). We describe different formulations of the problem as well as solutions based on those formulations. We show that although the IPM framework seems under-constrained, the state-of-the-art solutions actually use simple analogies to convert the problem into a set of fundamental computer science problems, which are then solved by corresponding algorithms or opt…