Results 251 to 260 of about 3,742 (295)
Journal of Natural Fibers, 2017 Eleven natural pigments were selected for the production of environment-friendly cotton prints. Physicochemical properties pH, conductivity, viscosity of the printing pastes were measured in order to evaluate their stability and suitability for printing.
Nikolaos Nikolaidis
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Incidence coloring of Mycielskians with fast algorithm
Theoretical Computer Science, 2021An incidence of an undirected graph \(G\) is a pair \((v,e)\) where \(v\) is a vertex of \(G\) and \(e\) an edge of \(G\) incident with \(v\). Two incidences \((v,e) \) and \((w,f)\) are adjacent if one of the following holds: (i) \(v=w\), (ii) \(e=f\) or (iii) \(vw\in \{e.f\}\). An incidence coloring of \(G\) assigns a color to each incidence of \(G\)
Huimin Bi, Xin Zhang 0017
openaire +1 more source
A fast parallel algorithm to color a graph with Δ colors
Journal of Algorithms, 1988Summary: An NC algorithm for the \(\Delta\) vertex coloring problem is given. The polynomial algorithm implied by Brooks' theorem seems to be highly sequential. To exploit the power of parallel processing we introduce a novel partition of the graph which may find applications elsewhere.
Mauricio Karchmer, Joseph Naor
openaire +2 more sources
A Fast Algorithm for Color Image Segmentation
First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06), 2006Based on K-means and a two-layer pyramid structure, a fast algorithm is proposed for color image segmentation. The algorithm employs two strategies. Firstly, a two-layer structure of a color image is established. Then, an improved K-means with integer based lookup table implementation is applied to each layer.
Liju Dong +5 more
openaire +1 more source
Fast and adaptive color-to-grayscale conversion
ACM SIGGRAPH 2006 Sketches on - SIGGRAPH '06, 2006Methods and systems, including computer program products, for determining a plurality of color clusters based on a plurality of pixels associated with a color image, the clusters being fewer than the pixels. A grayscale value for each one of a plurality of points in a color space is determined.
Mark A. Ruzon +3 more
openaire +1 more source
Fast color image restoration with multisensors
International Journal of Imaging Systems and Technology, 2002AbstractIn this article, we consider restoring a single‐color image from two degraded frames of the same scene by a RGB sensor and a luminance sensor. The RGB‐to‐YIQ transformation, the classical Tikhonov regularization and the Neumann boundary condition are used in the restoration process.
Michael K. Ng 0001, Nirmal K. Bose
openaire +1 more source
Fast implementation of color constancy algorithms
SPIE Proceedings, 2009Color constancy is a feature of the human color perception system which ensures that the perceived color of objects remains relatively constant under varying illumination conditions, and therefore closer to the physical reflectance. This perceptual effect, discovered by Helmholtz, was formalized by Land and McCann in 1971, who formulated the Retinex
Jean-Michel Morel +2 more
openaire +1 more source
A fast parallel coloring of planar graphs with five colors
Information Processing Letters, 1987Abstract We have shown that coloring a planar graph with five colors is in complexity class NC. The crux of the algorithm is our ability to find a large set of independent vertices and change the colors of their neighbors so that each independent vertex can color itself. This improves the result of [2] which colors a planar graph with eight colors. A
openaire +2 more sources
cFAST: A fast color feature detector
2015 International Conference on Image Processing Theory, Tools and Applications (IPTA), 2015By extending the basic idea of FAST it is possible to create a detector that can operate directly on a RGB color image and on it detect a higher number of features. The higher number of points and the simplification of the metric put us in the position to impose an additional condition on the keypoints.
C. Robert Pech, Jens Vial, Andreas Zell
openaire +1 more source
Fast local color transfer via dominant colors mapping
ACM SIGGRAPH ASIA 2010 Sketches, 2010Color transfer is an image editing technique which arises various applications, from daily photo appearance enhancement to movie post-processing. An ideal color transfer algorithm should keep the scene from the source image and apply the color style of the target image.
Weiming Dong +3 more
openaire +1 more source