Object Recognition as Machine Translation: Learning a Lexicon for a Fixed Image Vocabulary
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part IV
Automatic image annotation and retrieval using cross-media relevance models
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
The Journal of Machine Learning Research
On image auto-annotation with latent space models
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
GCap: Graph-based Automatic Image Captioning
CVPRW '04 Proceedings of the 2004 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'04) Volume 9 - Volume 09
Multiple Class Machine Learning Approach for an Image Auto-Annotation Problem
ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 02
Multiple Bernoulli relevance models for image and video annotation
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
A stratification-based approach to accurate and fast image annotation
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Systematic evaluation of machine translation methods for image and video annotation
CIVR'05 Proceedings of the 4th international conference on Image and Video Retrieval
Improved Resulted Word Counts Optimizer for Automatic Image Annotation Problem
Fundamenta Informaticae - Advances in Artificial Intelligence and Applications
Improved Resulted Word Counts Optimizer for Automatic Image Annotation Problem
Fundamenta Informaticae - Advances in Artificial Intelligence and Applications
Hi-index | 0.00 |
A new model for the image auto-annotation task is presented. The model can be classified as a fast image auto-annotation one. The main idea behind the model is to avoid various problems with feature space clustering. Both the image segmentation and the auto-annotation process do not use any clustering algorithms. The method presented here simulates continuous feature space analysis with very dense discretization. The paper presents the new approach and discusses the results achieved with it.