Search results for "image processing"
showing 10 items of 3285 documents
An Enhanced Detector of Blurred and Noisy Edges
2007
Detecting edges in digital images is a tricky operation in image processing since images may contain areas with different degrees of noise, blurring and sharpness. Such operation represents an important step of the whole process of similarity shape analysis and retrieval.
RADIUS - rapid particle analysis of digital images by ultra-high-resolution scanning of thin sections
2005
RADIUS is a newly developed particle-size measurement technique, based on evaluation of digital images of thin sections. Analyses are performed with sub-millimetre sample resolution and are thus designed to work on a single lamina of laminated sediments. The method covers grain sizes from medium silt to coarse sand. The application contains pattern-recognition modules that allow the detection of typical particle distributions of loess, organic detritus, turbidites and tephra layers. Cutting and hiding effects of particles on thin sections are corrected by empirical correction matrices. The calculated analysis results are compared with manually counted and measured samples to calibrate the a…
Efficiency of a digital particle image velocimetry (DPIV) method for monitoring the surface velocity of hyper-concentrated flows
2018
Digital particle image velocimetry records high resolution images and allows the identification of the position of points in different time instants. This paper explores the efficiency of the digital image-technique for remote monitoring of surface velocity and discharge measurement in hyper-concentrated flow by the way of laboratory experiment. One of the challenges in the application of the image-technique is the evaluation of the error in estimating surface velocity. The error quantification is complex because it depends on many factors characterizing either the experimental conditions or/and the processing algorithm. In the present work, attention is devoted to the estimation error due …
Sparse Image Representation by Directionlets
2010
Despite the success of the standard wavelet transform (WT) in image processing in recent years, the efficiency and sparsity of its representation are limited by the spatial symmetry and separability of its basis functions built in the horizontal and vertical directions. One-dimensional discontinuities in images (edges or contours), which are important elements in visual perception, intersect too many wavelet basis functions and lead to a non-sparse representation. To capture efficiently these elongated structures characterized by geometrical regularity along different directions (not only the horizontal and vertical), a more complex multidirectional (M-DIR) and asymmetric transform is requi…
Universal Design of Information Sharing Tools for Disaster Risk Reduction
2019
International audience; Disaster information sharing tools are an important aspect of disaster resilience, and it is of utmost importance that these tools are accessible and usable for as many potential users as possible. In this paper, we evaluate the accessibility of a selection of tools for crowdsourcing disaster situation information. As our evaluation shows that the selected tools are not fully accessible, we provide recommendations for mitigation, as well as highlight the importance of further research in this area.
Aggregation of Risk Level Assessments Based on Fuzzy Equivalence Relation
2017
The paper deals with the problem of aggregation of risk level assessments. We describe the technique of a risk level evaluation taking into account values of the risk level obtained for objects which are in some sense equivalent. For this purpose we propose to use the construction of a general aggregation operator based on the corresponding fuzzy equivalence relation. Numerical example of the investment risk level aggregation using an equivalence relation obtained on the basis of different macroeconomic factors for countries of one region is considered.
On fixed points of the Burrows-Wheeler transform
2017
The Burrows-Wheeler Transform is a well known transformation widely used in Data Compression: important competitive compression software, such as Bzip (cf. [1]) and Szip (cf. [2]) and some indexing software, like the FM-index (cf. [3]), are deeply based on the Burrows Wheeler Transform. The main advantage of using BWT for data compression consists in its feature of "clustering" together equal characters. In this paper we show the existence of fixed points of BWT, i.e., words on which BWT has no effect. We show a characterization of the permutations associated to BWT of fixed points and we give the explicit form of fixed points on a binary ordered alphabet a, b having at most four b's and th…
$(BV,L^p)$-decomposition, $p=1,2$, of Functions in Metric Random Walk Spaces
2019
In this paper we study the $(BV,L^p)$-decomposition, $p=1,2$, of functions in metric random walk spaces, a general workspace that includes weighted graphs and nonlocal models used in image processing. We obtain the Euler-Lagrange equations of the corresponding variational problems and their gradient flows. In the case $p=1$ we also study the associated geometric problem and the thresholding parameters.
Capabilities of Ultrametric Automata with One, Two, and Three States
2016
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.
Unavoidable sets and circular splicing languages
2017
Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. They are defined by a finite alphabet A, an initial set I of circular words, and a set R of rules. In this paper, we focus on the still unknown relations between regular languages and circular splicing systems with a finite initial set and a finite set R of rules represented by a pair of letters ( ( 1 , 3 ) -CSSH systems). When R = A × A , it is known that the set of all words corresponding to the splicing language belongs to the class of pure unitary languages, introduced by Ehrenfeucht, Haussler, Rozenberg in 1983. They also provided a characteriza…