An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...
Hui Kong, Metin Gurcan, and Kamel Belkacem-Boussai...
Many applications in computer vision require comparisons
between two images of the same scene. Comparison
applications usually assume that corresponding regions in
the two image...
In this paper, a wavelet-based technique for the demosaicking of Color Filter Arrays (CFA) is proposed. Conventional demosaicking techniques perform interpolation of the missing p...
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...