Markov random fields for image modelling and analysis
Modelling and applications of stochastic processes
Evolutionary trees: An integer multicommodity max-flow-min-cut theorem
Advances in Applied Mathematics
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Markov random field modeling in computer vision
Markov random field modeling in computer vision
Enhanced hypertext categorization using hyperlinks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
An improved approximation algorithm for multiway cut
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Minimum 0-extensions of graph metrics
European Journal of Combinatorics
Rounding algorithms for a geometric embedding of minimum multiway cut
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Segmentation by Grouping Junctions
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Markov Random Fields with Efficient Approximations
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Parameter-Free Spatial Data Mining Using MDL
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Improved embeddings of graph metrics into random trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On earthmover distance, metric labeling, and 0-extension
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Ramsey-type theorems for metric spaces with applications to online problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Approximate Labeling via Graph Cuts Based on Linear Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient inference with cardinality-based clique potentials
Proceedings of the 24th international conference on Machine learning
Approximation algorithms for labeling hierarchical taxonomies
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Metric clustering via consistent labeling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A graph-theoretic approach to webpage segmentation
Proceedings of the 17th international conference on World Wide Web
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Extracting and ranking viral communities using seeds and content similarity
Proceedings of the nineteenth ACM conference on Hypertext and hypermedia
GA, MR, FFNN, PNN and GMM based models for automatic text summarization
Computer Speech and Language
Limited view CT reconstruction and segmentation via constrained metric labeling
Computer Vision and Image Understanding
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Opinion Mining and Sentiment Analysis
Foundations and Trends in Information Retrieval
Hardness of Embedding Metric Spaces of Equal Size
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Packing multiway cuts in capacitated graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Quantifying inefficiency in cost-sharing mechanisms
Journal of the ACM (JACM)
A survey on sentiment detection of reviews
Expert Systems with Applications: An International Journal
Distributed resource management and matching in sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
TextGraphs-1 Proceedings of the First Workshop on Graph Based Methods for Natural Language Processing
Beyond the pipeline: discrete optimization in NLP
CONLL '05 Proceedings of the Ninth Conference on Computational Natural Language Learning
Constrained optimization for human pose estimation from depth sequences
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part I
Sign recognition using constrained optimization
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Variational segmentation algorithms with label frequency constraints
Pattern Recognition and Image Analysis
Metrical task systems and the k-server problem on HSTs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Identifying, attributing and describing spatial bursts
Proceedings of the VLDB Endowment
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials
The Journal of Machine Learning Research
NP-hardness of approximately solving linear equations over reals
Proceedings of the forty-third annual ACM symposium on Theory of computing
Optimal allocation in combinatorial auctions with quadratic utility functions
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Submodular cost allocation problem and applications
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Geometric rounding: a dependent randomized rounding scheme
Journal of Combinatorial Optimization
A Counterexample to Strong Parallel Repetition
SIAM Journal on Computing
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Fast Approximate Energy Minimization with Label Costs
International Journal of Computer Vision
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for graph homomorphism problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Multiclass image labeling with semidefinite programming
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Combinatorial auctions with restricted complements
Proceedings of the 13th ACM Conference on Electronic Commerce
Computer Science Review
A study of the quadratic semi-assignment polytope
Discrete Optimization
Minimizing Energies with Hierarchical Costs
International Journal of Computer Vision
Parameter-lite clustering algorithm based on MST and fuzzy similarity merging
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Leveraging relationships in social networks for sentiment analysis
Proceedings of the 18th Brazilian symposium on Multimedia and the web
Migrating operator placement for compositional stream graphs
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Generic cuts: an efficient algorithm for optimal inference in higher order MRF-MAP
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
InfoGather+: semantic matching and annotation of numeric and time-varying attributes in web tables
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
On discrete preferences and coordination
Proceedings of the fourteenth ACM conference on Electronic commerce
Simplex partitioning via exponential clocks and the multiway cut problem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Inference Methods for CRFs with Co-occurrence Statistics
International Journal of Computer Vision
Hi-index | 0.01 |
In a traditional classification problem, we wish to assign one of k labels (or classes) to each of n objects, in a way that is consistent with some observed data that we have about the problem. An active line of research in this area is concerned with classification when one has information about pairwise relationships among the objects to be classified; this issue is one of the principal motivations for the framework of Markov random fields, and it arises in areas such as image processing, biometry, and document analysis. In its most basic form, this style of analysis seeks to find a classification that optimizes a combinatorial function consisting of assignment costs---based on the individual choice of label we make for each object---and separation costs---based on the pair of choices we make for two "related" objects.We formulate a general classification problem of this type, the metric labeling problem; we show that it contains as special cases a number of standard classification frameworks, including several arising from the theory of Markov random fields. From the perspective of combinatorial optimization, our problem can be viewed as a substantial generalization of the multiway cut problem, and equivalent to a type of uncapacitated quadratic assignment problem.We provide the first nontrivial polynomial-time approximation algorithms for a general family of classification problems of this type. Our main result is an O(log k log log k)-approximation algorithm for the metric labeling problem, with respect to an arbitrary metric on a set of k labels, and an arbitrary weighted graph of relationships on a set of objects. For the special case in which the labels are endowed with the uniform metric---all distances are the same---our methods provide a 2-approximation algorithm.