Abstract
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pair-wise relations is image understanding, where the underlying assumption is that physically close pixels are likely to belong to the same object.
In this paper we consider a variant of this problem, we will call Parallel Imaging, where instead of directly observing the noisy data, the data undergoes a simple linear transformation first, such as adding different images. This class of problems arises in a wide range of imaging problems. Our study has been motivated by the Parallel Imaging problem in Magnetic Resonance Image (MRI) reconstruction. We give a constant factor approximation algorithm for the case of speedup of two with the truncated linear metric, motivated by the MRI reconstruction problem. Our method uses local search and graph cut techniques.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Archer, A., Fakcharoenphol, J., Harrelson, C., Krauthgamer, R., Talvar, K., Tardos, E.: Approximate Classification via Earthmover Metrics. In: Proc. SODA 2004 (2004)
Chuzhoy, J., Naor, S.: The Hardness of Metric Labeling. In: Proc. FOCS 2004 (2004)
Boykov, Y., Veksler, O., Zabih, R.: Markov Random Fields with efficient approximations. In: Proc. CVPR 1998 (1998)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. In: Proc. ICCV 1999 (1999)
Chekuri, C., Khanna, S., Naor, S., Zosin, L.: A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. SIAM J. on Discrete Mathematics, 606–635 (2004)
Gupta, A., Tardos, E.: A Constant Factor Approximation Algorithm for a Class of Classification Problems. In: Proc. STOC 2000 (2000)
Ishikawa, H., Geiger, D.: Segmentation by grouping junctions. In: Proc. CVPR 1998 (1998)
Kleinberg, J., Tardos, E.: Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Partitioning and Markov Random Fields. J. ACM 49(5), 616–639 (2002)
Li, S.: Makrov Random Field modeling in Computer Vision. Springer, Heidelberg (1995)
Raj, A., Singh, G., Zabih, R.: MRF’s for MRI’s: Bayesian Reconstruction of MR Images via Graph Cuts. In: Proc. CVPR 2006 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, T., Tardos, É. (2008). Parallel Imaging Problem. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-87744-8_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87743-1
Online ISBN: 978-3-540-87744-8
eBook Packages: Computer ScienceComputer Science (R0)