Sciweavers

2310 search results - page 45 / 462
» Coloring Random Graphs
Sort
View
PREMI
2009
Springer
14 years 3 months ago
Unsupervised Color Image Segmentation Using Compound Markov Random Field Model
Abstract. In this paper, we propose an unsupervised color image segmentation scheme using homotopy continuation method and Compound Markov Random Field (CMRF) model. The proposed s...
Sucheta Panda, P. K. Nanda
CAIP
2001
Springer
293views Image Analysis» more  CAIP 2001»
14 years 1 months ago
A Markov Random Field Image Segmentation Model Using Combined Color and Texture Features
In this paper, we propose a Markov random field (MRF) image segmentation model which aims at combining color and texture features. The theoretical framework relies on Bayesian est...
Zoltan Kato, Ting-Chuen Pong
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
14 years 20 days ago
Graph Coloring with Rejection
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
JCT
2008
81views more  JCT 2008»
13 years 9 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt
AIPR
2005
IEEE
14 years 2 months ago
Face Recognition Using Multispectral Random Field Texture Models, Color Content, and Biometric Features
Most of the available research on face recognition has been performed using gray scale imagery. This paper presents a novel two-pass face recognition system that uses a Multispect...
Orlando J. Hernandez, Mitchell S. Kleiman