Results 221 to 230 of about 2,007 (263)

Progressive applications of synthesized isatin-based reactive dye: fabrics dyeing, corrosion inhibition, and antimicrobial activity. [PDF]

Sci Rep
El-Sedik M, Elmegied SA, Aysha T, Abdel-Karim AM, Gaber B, Mahmoud SA.   +5 more
europepmc   +1 more source

Development of a biodegradable and eco-friendly novel printing composite using biomaterials on textile substrate and assessing the characterization. [PDF]

Sci Rep
Tahsin AA, Saha T, Saha S, Saha S, Ahamed F.   +4 more
europepmc   +1 more source

Extraction, characterization, and efficacy enhancement of natural dye from locally grown plant impatiens tinctoria. [PDF]

Sci Rep
Assefa M, Muhammed A.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Incidence coloring of Mycielskians with fast algorithm

Theoretical Computer Science, 2021
An 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, 1988
Summary: 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

Fast color image restoration with multisensors

International Journal of Imaging Systems and Technology, 2002
AbstractIn 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

A Fast Algorithm for Color Image Segmentation

First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06), 2006
Based 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, Philip Ogunbona, Wanqing Li 0001, Ge Yu 0001, Linan Fan, Gang Zheng   +5 more
openaire   +1 more source

Fast and adaptive color-to-grayscale conversion

ACM SIGGRAPH 2006 Sketches on - SIGGRAPH '06, 2006
Methods 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, Scott Cohen, Gregg Wilensky, Martin E. Newell   +3 more
openaire   +1 more source

Fast implementation of color constancy algorithms

SPIE Proceedings, 2009
Color 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, Ana Belén Petro, Catalina Sbert   +2 more
openaire   +1 more source