World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
Special Issue on The Mexican Conference on Pattern Recognition; Guest Editors: José Fco. Martínez-Trinidad (National Institute of Astrophysics, Optics and Electronics, Mexico), Jesús Ariel Carrasco-Ochoa (National Institute of Astrophysics, Optics and Electronics, Mexico), Víctor Ayala-Ramírez (University of Guanajuato, Mexico) and José Arturo Olvera-López (Autonomous University of Puebla (BUAP), Mexico)No Access

Image Annotation by a Hierarchical and Iterative Combination of Recognition and Segmentation

    https://doi.org/10.1142/S0218001418600145Cited by:1 (Source: Crossref)

    Automatic image annotation and image segmentation are two prominent research fields of Computer Vision, that are getting higher attention these days to accomplish image analysis and scene understanding. In this work, we present an annotation algorithm based on a hierarchical image partition, that makes use of Markov Random Fields (MRFs) to model spatial and hierarchical relations among regions in the image. In this way, we can capture local, global and contextual information. Also, we combine the processes of annotation and segmentation in an iterative way so that each process benefits from the other. Furthermore, we investigate the selection of the starting segmentation level for the hierarchical annotation process, to show its relevance for the final results. We experimentally validate our approach in three well-known datasets: CorelA, Stanford Background and MSRC-21 datasets. In these datasets, we achieved better or comparable results to other state-of-the-art algorithms, improving our base classifier in all cases.