Synthesis and characterization of novel quinazolinone-based azo disperse dyes: molecular docking, ADMET, <i>in vitro</i>, and dyeing performance on polyester fabric. [PDF]
RSC AdvNoser AA +7 more
europepmc +1 more source
Evaluating Sustainable Alternatives to Conventional Reduction Clearing in Polyester Dyeing. [PDF]
ACS OmegaSarwar Z +8 more
europepmc +1 more source
Covalent Immobilization of Phytosynthesized Silver Nanoparticles and Quaternary Ammonium Chitosan on Cotton Fabrics: Enhanced Antimicrobial Durability, Antioxidant Capacity, and Natural Dye Affinity. [PDF]
ACS OmegaYang H +8 more
europepmc +1 more source
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
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 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 +2 more sources