Polynomial-time solutions to image segmentation

Authors:
Tetsuo Asano;Danny Z. Chen;Naoki Katoh;Takeshi Tokuyama
Affiliations:
Dept. of Engr. Informatics, Osaka Electra-Communication, University, Neyagawa 572 Japan;Dept. of Computer Science and Engr., University of Notre Dame, Notre Dame, IN;Dept. of Management Science, Kobe University of Commerce, Kobe 651-21, Japan;IBM Tokyo Reaearh Laboratory, Yamato 242, Japan
Venue:
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Year:
1996

Citing 8
Cited 15

Probing convex polytopes

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A robust method for picture segmentation based on split-and-merge procedure

Computer Vision, Graphics, and Image Processing
A parametric characterization and an &egr;-approximating scheme for the minimization of a quasiconcave program

Discrete Applied Mathematics - Discrete applied mathematics in Japan
A survey of thresholding techniques

Computer Vision, Graphics, and Image Processing
Segmentation through Variable-Order Surface Fitting

IEEE Transactions on Pattern Analysis and Machine Intelligence
Integrating Region Growing and Edge Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract)

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

Journal of the ACM (JACM)

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
Data Mining with optimized two-dimensional association rules

ACM Transactions on Database Systems (TODS)
Efficient Construction of Regression Trees with Range and Region Splitting

Machine Learning
Implementation and Evaluation of Decision Trees with Rangeand Region Splitting

Constraints
Optimal roundings of sequences and matrices

Nordic Journal of Computing
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient Construction of Regression Trees with Range and Region Splitting

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
On Classification and Regression

DS '98 Proceedings of the First International Conference on Discovery Science
Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming

DS '99 Proceedings of the Second International Conference on Discovery Science
SOM Ensemble-Based Image Segmentation

Neural Processing Letters
Balls hierarchy: image segmentation by graph spanner

ISBI'09 Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro
SOM based image segmentation

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Optimizing feature extraction for the camera mouse using genetic algorithms

ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Object detection by admissible region search

AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Polynomial-time solutions to image segmentation

Quantified Score

Visualization

Abstract