Results 121 to 130 of about 1,930 (163)
Some of the next articles are maybe not open access.

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

Fast local color transfer via dominant colors mapping

ACM SIGGRAPH ASIA 2010 Sketches, 2010
Color 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   +2 more sources

Fast Color Change with Photochromic Fused Naphthopyrans

The Journal of Organic Chemistry, 2015
Photochromic molecules can reversibly develop color upon irradiation with UV light. These smart molecules, mainly in the naphthopyran family, have been applied with success to ophthalmic lenses that darken quickly under sunlight and revert to the uncolored state after several minutes in the dark.
Sousa, C.M.   +4 more
openaire   +3 more sources

Fast Trellis-Coded Color Quantization of Images

Real-Time Imaging, 2002
Summary: We examine color quantization of images using trellis-coded quantization (TCQ) in both the RGB domain and YUV domain. Together with a simple dithering scheme, an eight-bit trellis-coded color quantizer reproduces images that are visually indistinguishable from the 24-bit originals.
Samuel S. Cheng 0001   +2 more
openaire   +2 more sources

Fast Algorithm for HDR Color Conversion

2016 Data Compression Conference (DCC), 2016
The paper addresses a problem of perceptual artifacts that appear in Y'CbCr non-linear luminance 4:2:0 HDR video. A computationally inexpensive method is proposed for converting the 4:4:4 HDR video to Y'CbCr 4:2:0 nonconstant luminance format. The method removes artifacts in areas with saturated colors.
openaire   +2 more sources

Fast reversible coding and indexing of colorations

Computing, 1976
Given a non-branched tree withn vertices. Then, by ann-g-coloration we understand a partition of the set of vertices into no more thang classes, such that adjacent vertices belong to different classes. Supposed the set\(\mathfrak{S}\) of alln-g-colorations (for givenn andg) is lexicographically ordered, here are given two algorithms: the first directly
openaire   +2 more sources

Interactive Manga Colorization with Fast Flat Coloring

SIGGRAPH Asia 2021 Posters, 2021
Delong Ouyang   +5 more
openaire   +1 more source

Fast Approximation of Color Morphology

2021
Vivek Sridhar   +2 more
openaire   +1 more source

Enhancement stability and color fastness of natural dye: A review

Open Engineering, 2021
Aditya Rio Prabowo   +2 more
exaly  

Colored-QRNet: Fast QR Code Color Image Embedding

2022 30th European Signal Processing Conference (EUSIPCO), 2022
Karelia Pena-Pena   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy