Image Annotation by Semi-Supervised Clustering Constrained by SIFT Orientation Information

Date

2008-10-29

Author

Sayar, Ahmet
Yarman-Vural, Fatos T.

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

190
views

0
downloads

Methods developed for image annotation usually make use of region clustering algorithms. Visual codebooks are generated from the region clusters of low level features. These codebooks are then, matched with the words of the text document related to the image, in various ways. In this paper, we supervise the clustering process by using the orientation information assigned to each interest point of Scale-invariant feature transform (SIFT) features to generate a visual codebook. The orientation information provides a set of constraints in a semi-supervised k-means region clustering algorithm. Consequently, in clustering of regions not only SIFT features are normalized along the dominant orientation, but also orientation information itself is used. Experimental results show that image annotation with added orientation information by semi-supervised clustering is more successful compared to the one that uses SIFT features alone. The proposed algorithm is implemented in a parallel computation environment.

URI

https://hdl.handle.net/11511/65461

DOI

https://doi.org/10.1109/iscis.2008.4717882

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Image Annotation With Semi-Supervised Clustering Sayar, Ahmet; Yarman Vural, Fatoş Tunay (2009-09-16) Methods developed for image annotation usually make use of region clustering algorithms. Visual codebooks are generated from the region clusters of low level features. These codebooks are then, matched with the words of the text document related to the image, in various ways. In this paper, we supervise the clustering process by using three types of side information. The first one is the topic probability information obtained from the text document associated with the image. The second is the orientation an...
Image segmentation with unified region and boundary characteristics within recursive shortest spanning tree Esen, E.; Alp, Y. K. (2007-06-13) The lack of boundary information in region based image segmentation algorithms resulted in many hybrid methods that integrate the complementary information sources of region and boundary, in order to increase the segmentation performance. In compliance with this trend, we propose a novel method to unify the region and boundary characteristics within the canonical Recursive Shortest Spanning Tree algorithm. The main idea is to incorporate the boundary information in the distance metric of RSST with minor cha...
Feature extraction from acoustic and hyperspectral data by 2d local discriminant bases search Kalkan, Habil; Kalkan, Habil; Department of Information Systems (2008) In this thesis, a feature extraction algorithm based on 2D Local Discriminant Bases (LDB) search is developed for acoustic and hyperspectral data. The developed algorithm extracts the relevant features by both eliminating the irrelevant ones and/or by merging the ones that do not provide extra information on their own. It is implemented on real world data to separate aflatoxin contaminated or high risk hazelnuts from the sound ones by using impact acoustic and hyperspectral data. Impact acoustics data is us...
Attitude estimation and magnetometer calibration using reconfigurable TRIAD plus filtering approach Söken, Halil Ersin (Elsevier BV, 2020-04-01) This paper proposes using TRIAD and Unscented Kalman Filter (UKF) algorithms in a sequential architecture as a part of a small satellite attitude estimation algorithm. This TRIAD+UKF approach can both provide accurate attitude estimates for the satellite and calibrate the magnetometers in real-time. A complete calibration model for the magnetometers, considering bias, scale factor, soft iron and nonorthogonality errors, is assumed. In the algorithm's first stage, the TRIAD uses the available vector measurem...
Image segmentation by fusion of low level and domain specific information via Markov Random Fields Karadag, Ozge Oztimur; Yarman Vural, Fatoş Tunay (2014-09-01) We propose a new segmentation method by fusing a set of top-down and bottom-up segmentation maps under the Markov Random Fields (MRF) framework. The bottom-up segmentation maps are obtained by varying the parameters of an unsupervised segmentation method, such as Mean Shift. The top-down segmentation maps are constructed from some priori information, called domain specific information (DSI), received from a domain expert in the form of general properties about the image dataset. The properties are then used...

Citation Formats

A. Sayar and F. T. Yarman-Vural, “Image Annotation by Semi-Supervised Clustering Constrained by SIFT Orientation Information,” 2008, p. 152, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65461.