Entropy regularization, automatic model selection, and unsupervised image segmentation

Authors:
Zhiwu Lu;Xiaoqing Lu;Zhiyuan Ye
Affiliations:
Institute of Computer Science and Technology, Peking University, Beijing, China;Institute of Computer Science and Technology, Peking University, Beijing, China;Institute of Computer Science and Technology, Peking University, Beijing, China
Venue:
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2007

Citing 9
Cited 0

Image segmentation by a dynamic thresholding using edge detection based on cascaded uniform filters

Signal Processing
Comparison of the mixture and the classification maximum likelihood in cluster analysis with binary data

Computational Statistics & Data Analysis - Special issue on classification
Blobworld: Image Segmentation Using Expectation-Maximization and Its Application to Image Querying

IEEE Transactions on Pattern Analysis and Machine Intelligence
A regularized minimum cross-entropy algorithm on mixtures of experts for time series prediction and curve detection

Pattern Recognition Letters
Entropy Regularized Likelihood Learning on Gaussian Mixture: Two Gradient Implementations for Automatic Model Selection

Neural Processing Letters
Automatic seeded region growing for color image segmentation

Image and Vision Computing
A gradient entropy regularized likelihood learning algorithm on gaussian mixture with automatic model selection

ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
A soft relevance framework in content-based image retrieval systems

IEEE Transactions on Circuits and Systems for Video Technology
Optimal adaptive k-means algorithm with dynamic adjustment of learning rate

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In region-based image retrieval, the key problem of unsupervised image segmentation is to automatically determine the number of regions for each image in a database. Though we can solve this kind of model selection problem with some statistical criteria such as the minimum description length (MDL) through implementing the EM algorithm, the process of evaluating these criteria may incur a large computational cost. From competitive learning perspective, some more efficient approaches such as rival penalized competitive learning (RPCL) have also been developed for unsupervised image segmentation. However, the segmentation results are not satisfactory and the object of interest may be merged with other regions, since the RPCL algorithm is sensitive to the rival learning rate. In order to solve such problems, we then propose an iterative entropy regularized likelihood (ERL) learning algorithm for unsupervised image segmentation based on the finite mixture model, which can make automatic model selection through introducing entropy regularization into maximum likelihood (ML) estimation. Some segmentation experiments on the Corel image database further demonstrate that the iterative ERL learning algorithm outperforms the MDL based EM (MDL-EM) algorithm and the RPCL algorithm, and leads to some promising results.