Search results for " graph"
showing 10 items of 1277 documents
Digital Image Processing in the Analysis of Astrometric Plates
1991
AbstractIn this paper, we display an improvement to our process of semi-automatic measuring of astrometric plates, in which the photometric sensor is substituted by a CCD system of image getting and digitalization. The advantages of this method are analyzed taking into account the possibilities of the image analysis in the space and frequency domain.
Multiple-plane image formation by Walsh zone plates.
2018
[EN] A radial Walsh filter is a phase binary diffractive optical element characterized by a set of concentric rings that take the phase values 0 or ¿, corresponding to the values + 1 or ¿1 of a given radial Walsh function. Therefore, a Walsh filter can be re-interpreted as an aperiodic multifocal zone plate, capable to produce images of multiple planes simultaneously in a single output plane of an image forming system. In this paper, we experimentally demonstrate for the first time the focusing capabilities of these structures. Additionally, we report the first achievement of images of multiple-plane objects in a single image plane with these aperiodic diffractive lenses.
A Color Image Database for Haze Model and Dehazing Methods Evaluation
2016
International audience; One of the major issues related to dehazing methods (single or multiple image based) evaluation is the absence of the haze-free image (ground-truth). This is also a problem when it concerns the validation of Koschmieder model or its subsequent dehazing methods. To overcome this problem, we created a database called CHIC (Color Hazy Image for Comparison), consisting of two scenes in controlled environment. In addition to the haze-free image, we provide 9 images of different fog densities. Moreover, for each scene, we provide a number of parameters such as local scene depth, distance from the camera of known objects such as Macbeth Color Checkers, their radiance, and t…
Ghost Detection and Removal for High Dynamic Range Images: Recent Advances
2012
23 pages; International audience; High dynamic range (HDR) image generation and display technologies are becoming increasingly popular in various applications. A standard and commonly used approach to obtain an HDR image is the multiple exposures fusion technique which consists of combining multiple images of the same scene with varying exposure times. However, if the scene is not static during the sequence acquisition, moving objects manifest themselves as ghosting artefacts in the final HDR image. Detecting and removing ghosting artefacts is an important issue for automatically generating HDR images of dynamic scenes. The aim of this paper is to provide an up-to-date review of the recentl…
Multifacet structure of observed reconstructed integral images.
2005
Three-dimensional images generated by an integral imaging system suffer from degradations in the form of grid of multiple facets. This multifacet structure breaks the continuity of the observed image and therefore reduces its visual quality. We perform an analysis of this effect and present the guidelines in the design of lenslet imaging parameters for optimization of viewing conditions with respect to the multifacet degradation. We consider the optimization of the system in terms of field of view, observer position and pupil function, lenslet parameters, and type of reconstruction. Numerical tests are presented to verify the theoretical analysis.
Dissecting and Reassembling Color Correction Algorithms for Image Stitching
2018
This paper introduces a new compositional framework for classifying color correction methods according to their two main computational units. The framework was used to dissect fifteen among the best color correction algorithms and the computational units so derived, with the addition of four new units specifically designed for this work, were then reassembled in a combinatorial way to originate about one hundred distinct color correction methods, most of which never considered before. The above color correction methods were tested on three different existing datasets, including both real and artificial color transformations, plus a novel dataset of real image pairs categorized according to …
Horizontal visibility graphs: exact results for random time series
2009
The visibility algorithm has been recently introduced as a mapping between time series and complex networks. This procedure allows us to apply methods of complex network theory for characterizing time series. In this work we present the horizontal visibility algorithm, a geometrically simpler and analytically solvable version of our former algorithm, focusing on the mapping of random series (series of independent identically distributed random variables). After presenting some properties of the algorithm, we present exact results on the topological properties of graphs associated with random series, namely, the degree distribution, the clustering coefficient, and the mean path length. We sh…
A GRASP heuristic for the mixed Chinese postman problem
2002
Abstract Arc routing problems (ARPs) consist of finding a traversal on a graph satisfying some conditions related to the links of the graph. In the Chinese postman problem (CPP) the aim is to find a minimum cost tour (closed walk) traversing all the links of the graph at least once. Both the Undirected CPP, where all the links are edges that can be traversed in both ways, and the Directed CPP, where all the links are arcs that must be traversed in a specified way, are known to be polynomially solvable. However, if we deal with a mixed graph (having edges and arcs), the problem turns out to be NP -hard. In this paper, we present a heuristic algorithm for this problem, the so-called Mixed CPP…
A tabu search algorithm for the bipartite drawing problem
1998
Graphs are used to represent reality in several areas of knowledge. This has generated considerable interest in graph drawing algorithms. Arc crossing minimization is a fundamental aesthetic criterion to obtain a readable map of a graph. The problem of minimizing the number of arc crossings in a bipartite graph (BDP) is NP-complete. In this paper we present a Tabu Search (TS) scheme for the BDP. Several algorithms can be obtained with this scheme by implementing different evaluators in the move definitions. In this paper we propose two variants. Computational results are reported on a set of 300 randomly generated test problems. The two algorithms have been compared with the best heuristics…
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm
2017
[EN] The Hierarchical Mixed Rural Postman Problem is defined on a mixed graph where arcs and edges that require a service are divided into clusters' that have to be serviced in a hierarchical order. The problem generalizes the Mixed Rural Postman Problem and thus is NP-hard. In this paper, we provide a polyhedral analysis of the problem and propose a branch-and-cut algorithm for its solution based on the introduced classes of valid inequalities. Extensive computational experiments are reported on benchmark instances. The exact approach allows to find the optimal solutions in less than 1 hour for instances with up to 999 vertices, 2678 links, and five clusters.