Results 251 to 260 of about 874,018 (292)
Ultrablack wool textiles inspired by hierarchical avian structure. [PDF]
Nat CommunJayamaha H, Park K, Shepherd LM.
europepmc +1 more source
Fibers and Polymers, 2019 This paper focused on a novel approach for fastness testing. The changes in color properties of reactive dyed cotton fabrics after different sequential fastness test procedures were investigated.
Behcet Becerir
exaly +3 more sources
Analysis of Color Fastness and Shrinkage of Dyed and Printed Linen/Silk Fabrics [PDF]
Coatings, 2022 In this study, we analyzed the impact of the dyeing and the digital printing processes of linen/silk fabric (70% linen/30% silk) on its color fastness and shrinkage in the directions of warp and weft.
Daiva Milašienė +2 more
exaly +2 more sources
Fibers and Polymers, 2011 This paper focused on the assessment of the results of two color systems (CIELAB and Hunter) and five color difference equations (CIELAB 1976, Hunter, CIE94, CMC and CIEDE2000) under different illuminants (D65, A, F11 and F2) on disperse dyed nylon ...
Behcet Becerir
exaly +2 more sources
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 +2 more sources
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 +3 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 +2 more sources
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 +2 more sources