Name
Abstract | ||
|---|---|---|
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accomplished by introducing additional latent variables to the model, which can greatly increase its complexity. As a result, estimating the model parameters or computing the best maximum a posteriori (MAP) assignment becomes a computationally expensive task. In a series of experiments on the PASCAL and the MSRC datasets, we were unable to find evidence of a significant performance increase attributed to the introduction of such constraints. On the contrary, we found that similar levels of performance can be achieved using a much simpler design that essentially ignores these constraints. This more simple approach makes use of the same local and global features to leverage evidence from the image, but instead directly biases the preferences of individual pixels. While our investigation does not prove that spatial and consistency constraints are not useful in principle, it points to the conclusion that they should be validated in a larger context. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ICCV.2011.6126219 | ICCV |
Keywords | Field | DocType |
image segmentation,conditional random field model,global constraint,maximum a posteriori assignment,segmentation algorithm,spatial constraint | Conditional random field,Data modeling,Computer vision,Pattern recognition,Computer science,Segmentation,Support vector machine,Markov chain,Image segmentation,Latent variable,Artificial intelligence,Maximum a posteriori estimation | Conference |
Volume | Issue | ISSN |
2011 | 1 | 1550-5499 |
Citations | PageRank | References |
27 | 1.60 | 18 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aurelien Lucchi | 1 | 2419 | 89.45 |
| Yunpeng Li | 2 | 578 | 45.91 |
| Xavier Boix | 3 | 242 | 14.26 |
| Kevin Smith | 4 | 2430 | 88.78 |
| Pascal Fua | 5 | 12768 | 731.45 |