Distributed memory parallel Markov random fields using graph partitioning.
Colleen HeinemannTalita PercianoDaniela UshizimaE. Wes BethelPublished in: IEEE BigData (2017)
Keyphrases
- distributed memory
- markov random field
- graph partitioning
- image segmentation
- shared memory
- min cut
- message passing
- parallel implementation
- ibm sp
- graph cuts
- belief propagation
- random fields
- higher order
- parameter estimation
- energy function
- energy minimization
- graph model
- weighted graph
- potential functions
- parallel machines
- parallel computers
- conditional random fields
- maximum a posteriori
- clustering algorithm
- pairwise
- spectral clustering
- segmentation method
- multiscale
- superpixels
- parallel algorithm
- image processing
- parallel processing
- data objects
- object segmentation
- data clustering
- segmentation algorithm
- active contours
- level set
- np hard
- objective function