Sciweavers

5052 search results - page 27 / 1011
» On the Complexity of Ordered Colorings
Sort
View
PR
2007
194views more  PR 2007»
13 years 8 months ago
Decolorize: Fast, contrast enhancing, color to grayscale conversion
We present a new contrast enhancing color to grayscale conversion algorithm which works in real-time. It incorporates novel techniques for image sampling and dimensionality reduct...
Mark Grundland, Neil A. Dodgson
ICIP
2006
IEEE
14 years 10 months ago
Psnr-Based Optimization of JPEG Baseline Compression on Color Images
A fast rate-distortion analytical framework for the PSNR-based optimization of JPEG baseline compression on color images is proposed in this paper. The analysis is conducted in th...
Linfeng Guo, Yan Meng
ICIP
2002
IEEE
14 years 10 months ago
Hierarchical approach to enhanced active shape model for color video tracking
Tracking and recognizing non-rigid objects in video image sequences are complex tasks of increasing importance to many applications. In this paper, we present a hierarchical reali...
SangKyu Kang, Joon Ki Paik, Besma R. Abidi, Yan Zh...
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
14 years 1 months ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik
DAM
2006
116views more  DAM 2006»
13 years 8 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...