Search results for "ComputingMethodologies_COMPUTERGRAPHICS"
showing 10 items of 306 documents
Stronger proprioceptive BOLD-responses in the somatosensory cortices reflect worse sensorimotor function in adolescents with and without cerebral pal…
2020
Graphical abstract
Ultra-high-pressure liquid chromatography tandem mass spectrometry method for the determination of 9 organophosphate flame retardants in water samples
2016
Few methods are available for comprehensive organophosphate flame retardants (PFRs) detection in water and wastewater. Gas chromatography has been employed previously, but this approach is less selective, not amenable for use with deuterated standards and can suffer unfavorable fragmentation. Ultra-high-pressure liquid chromatography tandem mass spectrometry (UHPLC-QqQ-MS/MS) has become the most promising platform, already applied successfully for analysis of selected PFRs in some environmental matrices like water and wastewater. However, the presence of some interferences from the dissolvent, the equipment and the used materials should be taken into account. The procedure involves: The fir…
Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs
2009
AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vertices by their sets of colors. Minimum numbers of colors for such colorings are determined for cycles, complete graphs and complete bipartite graphs. A variation in which the color sets assigned to edges have to form cyclic intervals is also studied and similar results are given.
Mathematical Morphology for Color Images: An Image-Dependent Approach
2012
This paper proposes one possibility to generalize the morphological operations (particularly, dilation, erosion, opening, and closing) to color images. First, properties of a desirable generalization are stated and a brief review is done on former approaches. Then, the method is explained, which is based on a total ordering of the colors in an image induced by its color histogram; this is valid for just one image and may present problems in smoothly coloured images. To solve these drawbacks a refinement consisting of smoothing the histogram and using a joint histogram of several images is presented. Results of applying the so-defined morphological operations on several sets of images are sh…
A Gamut Preserving Color Image Quantization
2007
International audience; We propose a new approach for color image quantization which preserves the shape of the color gamut of the studied image. Quantization consists to find a set of color representative of the color distribution of the image. We are looking here for an optimal LUT (look up table) which contains information on the image's gamut and on the color distribution of this image. The main motivation of this work is to control the reproduction of color images on different output devices in order to have the same color feeling, coupling intrinsic informations on the image gamut and output device calibration. We have developped a color quantization algorithm based on an image depend…
On the uniform sampling of CIELAB color space and the number of discernible colors
2013
This paper presents a useful algorithmic strategy to sample uniformly the CIELAB color space based on close packed hexagonal grid. This sampling scheme has been used successfully in different research works from computational color science to color image processing. The main objective of this paper is to demonstrate the relevance and the accuracy of the hexagonal grid sampling method applied to the CIELAB color space. The second objective of this paper is to show that the number of color samples computed depends on the application and on the color gamut boundary considered. As demonstration, we use this sampling to support a discussion on the number of discernible colors related to a JND.
Approximation of piecewise smooth functions and images by edge-adapted (ENO-EA) nonlinear multiresolution techniques
2008
Abstract This paper introduces and analyzes new approximation procedures for bivariate functions. These procedures are based on an edge-adapted nonlinear reconstruction technique which is an intrinsically two-dimensional extension of the essentially non-oscillatory and subcell resolution techniques introduced in the one-dimensional setting by Harten and Osher. Edge-adapted reconstructions are tailored to piecewise smooth functions with geometrically smooth edge discontinuities, and are therefore attractive for applications such as image compression and shock computations. The local approximation order is investigated both in L p and in the Hausdorff distance between graphs. In particular, i…
Generic attribute deviation metric for assessing mesh simplification algorithm quality
2002
International audience; This paper describes an efficient method to compare two triangular meshes. Meshes considered here contain geometric features as well as other surface attributes such as material colors, texture, temperature, radiation, etc. Two deviation measurements are presented to assess the differences between two meshes. The first measurement, called geometric deviation, returns geometric differences. The second measurement , called attribute deviation, returns attribute differences regardless of the attribute type. In this paper we present an application of this method to the Mesh Simplification Algorithm (MSA) quality assessment according to the appearance attributes. This ass…
Efficiently using connectivity information between triangles in a mesh for real-time rendering
2004
Triangle meshes are the most popular standard model used to represent polygonal surfaces. Drawing these meshes as a set of independent triangles involves sending a vast amount of information to the graphics system. Taking advantage of the connectivity information between the triangles in a mesh dramatically diminishes the amount of information the graphics system must handle. Multiresolution Triangle Strips (MTS) represent a triangle mesh as a collection of multiresolution triangles strips. These strips are the basis of both the storage and the rendering stage. The coherence between the extraction of two levels of detail is used in the model in order to decrease the visualisation time.
Spline histogram method for reconstruction of probability density function of clusters of galaxies
2003
We describe the spline histogram algorithm which is useful for visualization of the probability density function setting up a statistical hypothesis for a test. The spline histogram is constructed from discrete data measurements using tensioned cubic spline interpolation of the cumulative distribution function which is then differentiated and smoothed using the Savitzky-Golay filter. The optimal width of the filter is determined by minimization of the Integrated Square Error function. The current distribution of the TCSplin algorithm written in f77 with IDL and Gnuplot visualization scripts is available from http://www.virac.lv/en/soft.html