Image Segmentation with Monotonicity and Smoothness Constraints

Authors:
Danny Z. Chen;Jie Wang;Xiaodong Wu
Affiliations:
-;-;-
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2001

Citing 4
Cited 1

Segmentation through Variable-Order Surface Fitting

IEEE Transactions on Pattern Analysis and Machine Intelligence
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Segmentation problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Optimal Net Surface Problems with Applications

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Image segmentation with monotonicity and smoothness constraints has found applications in several areas such as biomedical image analysis and data mining. In this paper, we study the problem of segmenting monotone and smooth objects in 2-D and 3-D images. For the 2-D case of the problem, we present an O(IJ log J) time algorithm, improving the previously best known O(IJ2M) time algorithm by a factor of O(JM/log J) time, where the size of the input 2-D image is I × J and M is the smoothness parameter with 1 ≤ M ≤ J. Our algorithm is based on a combination of dynamic programming and divide-and-conquer strategy, and computes an optimal path in an implicitly represented graph. We also prove that a generalized version of the 3-D case of the problem is NP-hard.