Results 261 to 270 of about 3,742 (295)
Some of the next articles are maybe not open access.
Fast Color Change with Photochromic Fused Naphthopyrans
The Journal of Organic Chemistry, 2015Photochromic 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 Algorithm for HDR Color Conversion
2016 Data Compression Conference (DCC), 2016The 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 +1 more source
Fast Trellis-Coded Color Quantization of Images
Real-Time Imaging, 2002Summary: 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 reversible coding and indexing of colorations
Computing, 1976Given 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 +1 more source
Interactive Manga Colorization with Fast Flat Coloring
SIGGRAPH Asia 2021 Posters, 2021Delong Ouyang +5 more
openaire +1 more source
Fast and effective color-based object tracking by boosted color distribution
Pattern Analysis and Applications, 2013In this paper, we propose a novel tracking algorithm, boosted color distribution (BCD), for tracking color objects. There exist three contributions in this paper. First, we propose a novel online gentle boost (OGB) algorithm for online learning. The essential idea of OGB is composed of two aspects: online updating candidate weak classifiers, and then ...
Dong Wang 0004 +3 more
openaire +1 more source
Fast color image processing using quantized color instruction set
Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing, 2004The paper describes the Quantized Color Pack eXtension (QCPX) instruction set that can accelerate color-image processing applications. QCPX employs heterogeneous-subword-parallel instructions, which utilize the microprocessor's 16-bit wide datapaths to process a packed, quantized 16-bit color data type in YCbCr (Y: luminance, Cr and Cb: chrominance ...
Jongmyon Kim +2 more
openaire +1 more source
Fast algorithms for edge-coloring planar graphs
Journal of Algorithms, 1989We present two algorithms which color edges of every planar graph G with max(\(\Delta\) (G),19) colors. Therefore both algorithms produce an optimal coloring if \(\Delta\) (G)\(\geq 19\). The first one is a linear-time sequential algorithm. The second one is a parallel EREW PRAM algorithm which runs in \(O(\log^ 2n)\) time using O(n) processors.
Marek Chrobak, Moti Yung
openaire +2 more sources
A fast algorithm for color image quantization using only 256 colors
Systems and Computers in Japan, 1988AbstractIn the recent workstation for CAD and CG, a color map display is often used, which can display 256 colors selected from 224 (approx. 16000000) colors using a look‐up table. Even in the computer system with such a color display with such a limited number of colors, it is desired that the continuous color image should be processed. In most cases,
openaire +1 more source