2310 search results - page 166 / 462 » Coloring Random Graphs |
212
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
Herein, we propose a new Markov random field (MRF) image segmentation model which aims at combining color and texture features. The model has a multi-layer structure: Each feature...
188
click to vote
MICS
2010
15 years 4 months ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
190
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
173
click to vote
ICIP
1995
IEEE
16 years 7 months ago
1995
IEEE
In this paper, we address the problem of color image restoration. Here, we model the image as a Markov Random Field (MRF) and propose a restoration algorithm in a multiresolution ...
158
click to vote
ICMCS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we analyze the security of Least Significant Bit (LSB) embedding for hiding messages in high-color-depth digital images. We introduce a powerful steganalytic techni...