Results 271 to 280 of about 2,206,810 (325)
Some of the next articles are maybe not open access.

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   +3 more sources

Effect of the particle size of fluorocarbon‐based finishing agents on fastness and color properties of 100% cotton knitted fabrics

open access: yesJournal of the Textile Institute, 2011
This study examines the effect of the particle size of fluorocarbon-based water-oil-soil-repellent finishing agents on color fastness and colorimetric properties by experimental analyses. Therefore, two finishing agents with different particle sizes were
Nihat ÇELİK, Halil İbrahim İçoğlu
exaly   +2 more sources

Screen-Printing of Cotton with Natural Pigments: Evaluation of Color and Fastness Properties of the Prints

open access: yesJournal 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

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   +5 more
openaire   +2 more sources

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   +3 more
openaire   +2 more sources

cFAST: A fast color feature detector

2015 International Conference on Image Processing Theory, Tools and Applications (IPTA), 2015
By 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, 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

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   +2 more
openaire   +2 more sources

A fast parallel coloring of planar graphs with five colors

Information Processing Letters, 1987
Abstract 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   +3 more sources

Color, Fastness, and Antimicrobial Properties of Wool Fabrics Dyed with Helichrysum Arenarium Subsp. Aucheri Extract

Journal of Natural Fibers, 2020
Natural dyestuffs are evaluated as innovative natural sources to color the fabric and give antibacterial properties in the textile industry. In this study, methanol extracts of Helichrysum arenarium subsp.
Mustafa Cuce   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy