Human perception based image retrieval using emergence index and fuzzy similarity measure
- Deb, Sagarmay, Kulkarni, Siddhivinayak
- Authors: Deb, Sagarmay , Kulkarni, Siddhivinayak
- Date: 2007
- Type: Text , Conference paper
- Relation: Paper presented at 3rd International Conference on Intelligent Sensors, Sensor Networks and Information, ISSNIP 2007, Melbourne, Victoria : 3rd-6th December 2007 p. 359-363
- Full Text:
- Description: The main concern dealing with content-based image retrieval (CBIR) is to bridge the semantic gap. The high level query posed by the user and low level features extracted by the machine illustrates the problem of semantic gap. To solve the problem of semantic gap, this paper presents a hybrid technique using an emergence index and fuzzy logic for efficient retrieval of images based on the colour feature. Emergence index (EI) is proposed to understand the hidden meaning of the image. Fuzzy similarity measure is developed to calculate the similarity between the target image and the images in the database. The images were ranked based on their similarity along with the fuzzy similarity distance measure. The preliminary experiments conducted on small set of images and promising results were obtained.
- Description: 2003004955
- Authors: Deb, Sagarmay , Kulkarni, Siddhivinayak
- Date: 2007
- Type: Text , Conference paper
- Relation: Paper presented at 3rd International Conference on Intelligent Sensors, Sensor Networks and Information, ISSNIP 2007, Melbourne, Victoria : 3rd-6th December 2007 p. 359-363
- Full Text:
- Description: The main concern dealing with content-based image retrieval (CBIR) is to bridge the semantic gap. The high level query posed by the user and low level features extracted by the machine illustrates the problem of semantic gap. To solve the problem of semantic gap, this paper presents a hybrid technique using an emergence index and fuzzy logic for efficient retrieval of images based on the colour feature. Emergence index (EI) is proposed to understand the hidden meaning of the image. Fuzzy similarity measure is developed to calculate the similarity between the target image and the images in the database. The images were ranked based on their similarity along with the fuzzy similarity distance measure. The preliminary experiments conducted on small set of images and promising results were obtained.
- Description: 2003004955
A fuzzy-neural approach for interpretation and fusion of colour and texture features for CBIR systems
- Verma, Brijesh, Kulkarni, Siddhivinayak
- Authors: Verma, Brijesh , Kulkarni, Siddhivinayak
- Date: 2004
- Type: Text , Journal article
- Relation: Journal of Applied Soft Computing Vol. 5, no. 1 (2004), p. 119-130
- Full Text:
- Reviewed:
- Description: This paper presents a fuzzy-neural approach for interpretation and fusion of colour and texture features for CBIR systems. The presented approach uses fuzzy logic to interpret queries expressed in natural language such as mostly red, many green, few red for colour feature. Tamura feature is used to represent the texture of an image in the database. A term set on each Tamura feature is generated using a fuzzy clustering algorithm to pose a query in terms of natural language. The query can be expressed as a logic combination of natural language terms and Tamura feature values. A fusion of multiple queries is incorporated into the proposed approach. The performance of the technique was evaluated on Brodatz texture benchmark database and it was noticed that there was a prominent increase in the confidence factor for the images. Fusion experiments were conducted using neurofuzzy, fuzzy AND and binary AND techniques. A comparative analysis showed that fuzzy-neural approach has significantly improved the performance of CBIR system.
- Description: C1
- Description: 2003002798
- Authors: Verma, Brijesh , Kulkarni, Siddhivinayak
- Date: 2004
- Type: Text , Journal article
- Relation: Journal of Applied Soft Computing Vol. 5, no. 1 (2004), p. 119-130
- Full Text:
- Reviewed:
- Description: This paper presents a fuzzy-neural approach for interpretation and fusion of colour and texture features for CBIR systems. The presented approach uses fuzzy logic to interpret queries expressed in natural language such as mostly red, many green, few red for colour feature. Tamura feature is used to represent the texture of an image in the database. A term set on each Tamura feature is generated using a fuzzy clustering algorithm to pose a query in terms of natural language. The query can be expressed as a logic combination of natural language terms and Tamura feature values. A fusion of multiple queries is incorporated into the proposed approach. The performance of the technique was evaluated on Brodatz texture benchmark database and it was noticed that there was a prominent increase in the confidence factor for the images. Fusion experiments were conducted using neurofuzzy, fuzzy AND and binary AND techniques. A comparative analysis showed that fuzzy-neural approach has significantly improved the performance of CBIR system.
- Description: C1
- Description: 2003002798
MapReduce neural network framework for efficient content based image retrieval from large datasets in the cloud
- Venkatraman, Sitalakshmi, Kulkarni, Siddhivinayak
- Authors: Venkatraman, Sitalakshmi , Kulkarni, Siddhivinayak
- Date: 2012
- Type: Text , Conference proceedings
- Full Text:
- Description: Recently, content based image retrieval (CBIR) has gained active research focus due to wide applications such as crime prevention, medicine, historical research and digital libraries. With digital explosion, image collections in databases in distributed locations over the Internet pose a challenge to retrieve images that are relevant to user queries efficiently and accurately. It becomes increasingly important to develop new CBIR techniques that are effective and scalable for real-time processing of very large image collections. To address this, the paper proposes a novel MapReduce neural network framework for CBIR from large data collection in a cloud environment. We adopt natural language queries that use a fuzzy approach to classify the colour images based on their content and apply Map and Reduce functions that can operate in cloud clusters for arriving at accurate results in real-time. Preliminary experimental results for classifying and retrieving images from large data sets were quite convincing to carry out further experimental evaluations. © 2012 IEEE.
- Description: 2003010699
- Authors: Venkatraman, Sitalakshmi , Kulkarni, Siddhivinayak
- Date: 2012
- Type: Text , Conference proceedings
- Full Text:
- Description: Recently, content based image retrieval (CBIR) has gained active research focus due to wide applications such as crime prevention, medicine, historical research and digital libraries. With digital explosion, image collections in databases in distributed locations over the Internet pose a challenge to retrieve images that are relevant to user queries efficiently and accurately. It becomes increasingly important to develop new CBIR techniques that are effective and scalable for real-time processing of very large image collections. To address this, the paper proposes a novel MapReduce neural network framework for CBIR from large data collection in a cloud environment. We adopt natural language queries that use a fuzzy approach to classify the colour images based on their content and apply Map and Reduce functions that can operate in cloud clusters for arriving at accurate results in real-time. Preliminary experimental results for classifying and retrieving images from large data sets were quite convincing to carry out further experimental evaluations. © 2012 IEEE.
- Description: 2003010699
Image retrieval based on fuzzy mapping of image database and fuzzy similarity distance
- Authors: Kulkarni, Siddhivinayak
- Date: 2007
- Type: Text , Conference paper
- Relation: Paper presented at 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007, Melbourne, Victoria : 11th-13th July 2007 p. 812-817
- Full Text:
- Description: The on-line image retrieval process consists of a query example image, given by the user as an input, from which low-level image features are extracted. These image features are used to find images in the database which are most similar to the query image. A drawback, however, is that these low level image features are often too restricted to describe images on a conceptual or semantic level. The gap between the high level query from the user and low level features extracted by a computer is known as the semantic gap. Translating or converting the question posed by a human to the low level features seen by the computer illustrates the problem in bridging the semantic gap. This paper proposes a novel fuzzy approach for mapping the fuzzy database while extracting the colour features from image and assigning the weights to this fuzzy content when calculating the similarity between the query image and the images in database. Number of experiments was conducted on a small colour image database and promising results were obtained.
- Description: 2003005444
- Authors: Kulkarni, Siddhivinayak
- Date: 2007
- Type: Text , Conference paper
- Relation: Paper presented at 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007, Melbourne, Victoria : 11th-13th July 2007 p. 812-817
- Full Text:
- Description: The on-line image retrieval process consists of a query example image, given by the user as an input, from which low-level image features are extracted. These image features are used to find images in the database which are most similar to the query image. A drawback, however, is that these low level image features are often too restricted to describe images on a conceptual or semantic level. The gap between the high level query from the user and low level features extracted by a computer is known as the semantic gap. Translating or converting the question posed by a human to the low level features seen by the computer illustrates the problem in bridging the semantic gap. This paper proposes a novel fuzzy approach for mapping the fuzzy database while extracting the colour features from image and assigning the weights to this fuzzy content when calculating the similarity between the query image and the images in database. Number of experiments was conducted on a small colour image database and promising results were obtained.
- Description: 2003005444
Hybrid technique for colour image classification and efficient retrieval based on fuzzy logic and neural networks
- Fernando, Ranisha, Kulkarni, Siddhivinayak
- Authors: Fernando, Ranisha , Kulkarni, Siddhivinayak
- Date: 2012
- Type: Text , Conference proceedings
- Full Text:
- Description: Developments in the technology and the Internet have led to increase in number of digital images and videos. Thousands of images are added to WWW every day. To retrieve the specific images efficiently from database or from Internet is becoming a challenge now a day. As a result, the necessity of retrieving images has emerged to be important to various professional areas. This paper proposes a novel fuzzy approach to classify the colour images based on their content, to pose a query in terms of natural language and fuse the queries based on neural networks for fast and efficient retrieval. Number of experiments was conducted for classification and retrieval of images on sets of images and promising results were obtained. The results were analysed and compared with other similar image retrieval system. © 2012 IEEE.
- Authors: Fernando, Ranisha , Kulkarni, Siddhivinayak
- Date: 2012
- Type: Text , Conference proceedings
- Full Text:
- Description: Developments in the technology and the Internet have led to increase in number of digital images and videos. Thousands of images are added to WWW every day. To retrieve the specific images efficiently from database or from Internet is becoming a challenge now a day. As a result, the necessity of retrieving images has emerged to be important to various professional areas. This paper proposes a novel fuzzy approach to classify the colour images based on their content, to pose a query in terms of natural language and fuse the queries based on neural networks for fast and efficient retrieval. Number of experiments was conducted for classification and retrieval of images on sets of images and promising results were obtained. The results were analysed and compared with other similar image retrieval system. © 2012 IEEE.
Colour image annotation using hybrid intelligent techniques for image retrieval
- Kulkarni, Siddhivinayak, Kulkarni, Pradnya
- Authors: Kulkarni, Siddhivinayak , Kulkarni, Pradnya
- Date: 2012
- Type: Text , Conference proceedings
- Full Text:
- Description: This paper presents a novel technique for colour image annotation based on neural networks and fuzzy logic. Neural network is proposed for classifying the images based on their contents and fuzzy logic is proposed for interpreting the content of an image in terms of natural language. One of the main aspects of this research is to avoid re-training of the neural networks by training the content of the image. Neural network is not trained on database of images; therefore image can be added or deleted from image database without affecting the training. The proposed hybrid technique is tested on real world colour image dataset and promising results are obtained. © 2012 IEEE.
- Description: 2003010700
- Authors: Kulkarni, Siddhivinayak , Kulkarni, Pradnya
- Date: 2012
- Type: Text , Conference proceedings
- Full Text:
- Description: This paper presents a novel technique for colour image annotation based on neural networks and fuzzy logic. Neural network is proposed for classifying the images based on their contents and fuzzy logic is proposed for interpreting the content of an image in terms of natural language. One of the main aspects of this research is to avoid re-training of the neural networks by training the content of the image. Neural network is not trained on database of images; therefore image can be added or deleted from image database without affecting the training. The proposed hybrid technique is tested on real world colour image dataset and promising results are obtained. © 2012 IEEE.
- Description: 2003010700
A new perceptual dissimilarity measure for image retrieval and clustering
- Authors: Shojanazeri, Hamid
- Date: 2018
- Type: Text , Thesis , PhD
- Full Text:
- Description: Image retrieval and clustering are two important tools for analysing and organising images. Dissimilarity measure is central to both image retrieval and clustering. The performance of image retrieval and clustering algorithms depends on the effectiveness of the dissimilarity measure. ‘Minkowski’ distance, or more specifically, ‘Euclidean’ distance, is the most widely used dissimilarity measure in image retrieval and clustering. Euclidean distance depends only on the geometric position of two data instances in the feature space and completely ignores the data distribution. However, data distribution has an effect on human perception. The argument that two data instances in a dense area are more perceptually dissimilar than the same two instances in a sparser area, is proposed by psychologists. Based on this idea, a dissimilarity measure called, ‘mp’, has been proposed to address Euclidean distance’s limitation of ignoring the data distribution. Here, mp relies on data distribution to calculate the dissimilarity between two instances. As prescribed in mp, higher data mass between two data instances implies higher dissimilarity, and vice versa. mp relies only on data distribution and completely ignores the geometric distance in its calculations. In the aggregation of dissimilarities between two instances over all the dimensions in feature space, both Euclidean distance and mp give same priority to all the dimensions. This may result in a situation that the final dissimilarity between two data instances is determined by a few dimensions of feature vectors with relatively much higher values. As a result, the dissimilarity derived may not align well with human perception. The need to address the limitations of Minkowski distance measures, along with the importance of a dissimilarity measure that considers both geometric distance and the perceptual effect of data distribution in measuring dissimilarity between images motivated this thesis. It studies the performance of mp for image retrieval. It investigates a new dissimilarity measure that combines both Euclidean distance and data distribution. In addition to these, it studies the performance of such a dissimilarity measure for image retrieval and clustering. Our performance study of mp for image retrieval shows that relying only on data distribution to measure the dissimilarity results in some situations, where the mp’s measurement is contrary to human perception. This thesis introduces a new dissimilarity measure called, perceptual dissimilarity measure (PDM). PDM considers the perceptual effect of data distribution in combination with Euclidean distance. PDM has two variants, PDM1 and PDM2. PDM1 focuses on improving mp by weighting it using Euclidean distance in situations where mp may not retrieve accurate results. PDM2 considers the effect of data distribution on the perceived dissimilarity measured by Euclidean distance. PDM2 proposes a weighting system for Euclidean distance using a logarithmic transform of data mass. The proposed PDM variants have been used as alternatives to Euclidean distance and mp to improve the accuracy in image retrieval. Our results show that PDM2 has consistently performed the best, compared to Euclidean distance, mp and PDM1. PDM1’s performance was not consistent, although it has performed better than mp in all the experiments, but it could not outperform Euclidean distance in some cases. Following the promising results of PDM2 in image retrieval, we have studied its performance for image clustering. k-means is the most widely used clustering algorithm in scientific and industrial applications. k-medoids is the closest clustering algorithm to k-means. Unlike k-means which works only with Euclidean distance, k-medoids gives the option to choose the arbitrary dissimilarity measure. We have used Euclidean distance, mp and PDM2 as the dissimilarity measure in k-medoids and compared the results with k-means. Our clustering results show that PDM2 has perfromed overally the best. This confirms our retrieval results and identifies PDM2 as a suitable dissimilarity measure for image retrieval and clustering.
- Description: Doctor of Philosophy
- Authors: Shojanazeri, Hamid
- Date: 2018
- Type: Text , Thesis , PhD
- Full Text:
- Description: Image retrieval and clustering are two important tools for analysing and organising images. Dissimilarity measure is central to both image retrieval and clustering. The performance of image retrieval and clustering algorithms depends on the effectiveness of the dissimilarity measure. ‘Minkowski’ distance, or more specifically, ‘Euclidean’ distance, is the most widely used dissimilarity measure in image retrieval and clustering. Euclidean distance depends only on the geometric position of two data instances in the feature space and completely ignores the data distribution. However, data distribution has an effect on human perception. The argument that two data instances in a dense area are more perceptually dissimilar than the same two instances in a sparser area, is proposed by psychologists. Based on this idea, a dissimilarity measure called, ‘mp’, has been proposed to address Euclidean distance’s limitation of ignoring the data distribution. Here, mp relies on data distribution to calculate the dissimilarity between two instances. As prescribed in mp, higher data mass between two data instances implies higher dissimilarity, and vice versa. mp relies only on data distribution and completely ignores the geometric distance in its calculations. In the aggregation of dissimilarities between two instances over all the dimensions in feature space, both Euclidean distance and mp give same priority to all the dimensions. This may result in a situation that the final dissimilarity between two data instances is determined by a few dimensions of feature vectors with relatively much higher values. As a result, the dissimilarity derived may not align well with human perception. The need to address the limitations of Minkowski distance measures, along with the importance of a dissimilarity measure that considers both geometric distance and the perceptual effect of data distribution in measuring dissimilarity between images motivated this thesis. It studies the performance of mp for image retrieval. It investigates a new dissimilarity measure that combines both Euclidean distance and data distribution. In addition to these, it studies the performance of such a dissimilarity measure for image retrieval and clustering. Our performance study of mp for image retrieval shows that relying only on data distribution to measure the dissimilarity results in some situations, where the mp’s measurement is contrary to human perception. This thesis introduces a new dissimilarity measure called, perceptual dissimilarity measure (PDM). PDM considers the perceptual effect of data distribution in combination with Euclidean distance. PDM has two variants, PDM1 and PDM2. PDM1 focuses on improving mp by weighting it using Euclidean distance in situations where mp may not retrieve accurate results. PDM2 considers the effect of data distribution on the perceived dissimilarity measured by Euclidean distance. PDM2 proposes a weighting system for Euclidean distance using a logarithmic transform of data mass. The proposed PDM variants have been used as alternatives to Euclidean distance and mp to improve the accuracy in image retrieval. Our results show that PDM2 has consistently performed the best, compared to Euclidean distance, mp and PDM1. PDM1’s performance was not consistent, although it has performed better than mp in all the experiments, but it could not outperform Euclidean distance in some cases. Following the promising results of PDM2 in image retrieval, we have studied its performance for image clustering. k-means is the most widely used clustering algorithm in scientific and industrial applications. k-medoids is the closest clustering algorithm to k-means. Unlike k-means which works only with Euclidean distance, k-medoids gives the option to choose the arbitrary dissimilarity measure. We have used Euclidean distance, mp and PDM2 as the dissimilarity measure in k-medoids and compared the results with k-means. Our clustering results show that PDM2 has perfromed overally the best. This confirms our retrieval results and identifies PDM2 as a suitable dissimilarity measure for image retrieval and clustering.
- Description: Doctor of Philosophy
Texture feature extraction and classification by combining statistical and neural based technique for efficient CBIR
- Kulkarni, Siddhivinayak, Kulkarni, Pradnya
- Authors: Kulkarni, Siddhivinayak , Kulkarni, Pradnya
- Date: 2012
- Type: Text , Conference paper
- Relation: 2012 Int. Conf. on MulGraB 2012, the 2012 Int. Conf. on BSBT 2012, and the 1st Int. Conf. on Intelligent Urban Computing, IUrC 2012, Held as Part of the Future Generation Information Technology Conference, FGIT 2012 Vol. 353 CCIS, p. 106-113
- Full Text:
- Reviewed:
- Description: This paper presents a technique based on statistical and neural feature extractor, classifier and retrieval for real world texture images. The paper is presented into two stages, texture image pre-processing includes downloading images, normalizing into specific rows and columns, forming non-overlapping windows and extracting statistical features. Co-occrance based statistical technique is used for extracting four prominent texture features from an image. Stage two includes, feeding of these parameters to Multi-Layer Perceptron (MLP) as input and output. Hidden layer output was treated as characteristics of the patterns and fed to classifier to classify into six different classes. Graphical user interface was designed to pose a query of texture pattern and retrieval results are shown. © 2012 Springer-Verlag.
- Description: 2003010656
- Authors: Kulkarni, Siddhivinayak , Kulkarni, Pradnya
- Date: 2012
- Type: Text , Conference paper
- Relation: 2012 Int. Conf. on MulGraB 2012, the 2012 Int. Conf. on BSBT 2012, and the 1st Int. Conf. on Intelligent Urban Computing, IUrC 2012, Held as Part of the Future Generation Information Technology Conference, FGIT 2012 Vol. 353 CCIS, p. 106-113
- Full Text:
- Reviewed:
- Description: This paper presents a technique based on statistical and neural feature extractor, classifier and retrieval for real world texture images. The paper is presented into two stages, texture image pre-processing includes downloading images, normalizing into specific rows and columns, forming non-overlapping windows and extracting statistical features. Co-occrance based statistical technique is used for extracting four prominent texture features from an image. Stage two includes, feeding of these parameters to Multi-Layer Perceptron (MLP) as input and output. Hidden layer output was treated as characteristics of the patterns and fed to classifier to classify into six different classes. Graphical user interface was designed to pose a query of texture pattern and retrieval results are shown. © 2012 Springer-Verlag.
- Description: 2003010656
A Hybrid data dependent dissimilarity measure for image retrieval
- Shojanazeri, Hamid, Teng, Shyh, Lu, Guojun
- Authors: Shojanazeri, Hamid , Teng, Shyh , Lu, Guojun
- Date: 2017
- Type: Text , Unpublished work
- Full Text:
- Description: Abstract— In image retrieval, an effective dissimilarity measure is required to retrieve the perceptually similar images. Minkowski-type (lp ) distance is widely used for image retrieval, however it has its limitations. It focuses on distance between image features and ignores the data distribution of the image features, which can play an important role in measuring perceptual similarity of images. !! also favours the most dominant components in calculating the total dissimilarity. A data dependent measure, named !! -dissimilarity, which estimates the dissimilarity using the data distribution, has been proposed recently. Rather than relying on geometric distance, it measures the dissimilarity between two instances in each dimension as a probability mass in a region that encloses the two instances. It considers two instances in a sparse region to be more similar than in a dense region. Using the probability of data mass enables all the dimensions of feature vectors to contribute in the final estimate of dissimilarity, so it does not just heavily bias towards the most dominant components. However, relying only on data distribution and completely ignoring the geometric distance raise another limitation. This can result in finding two instances similar only due to being in a sparse region, however if the geometric distance between them is large then they are not perceptually similar. To address this limitation we proposed a new hybrid data dependent dissimilarity (HDDD) measure that considers both data distribution as well as geometric distance. Our experimental results using Corel database and Caltech 101 show that (HDDD) leads to higher image retrieval performance than lp distance (lpD) and mp.
- Authors: Shojanazeri, Hamid , Teng, Shyh , Lu, Guojun
- Date: 2017
- Type: Text , Unpublished work
- Full Text:
- Description: Abstract— In image retrieval, an effective dissimilarity measure is required to retrieve the perceptually similar images. Minkowski-type (lp ) distance is widely used for image retrieval, however it has its limitations. It focuses on distance between image features and ignores the data distribution of the image features, which can play an important role in measuring perceptual similarity of images. !! also favours the most dominant components in calculating the total dissimilarity. A data dependent measure, named !! -dissimilarity, which estimates the dissimilarity using the data distribution, has been proposed recently. Rather than relying on geometric distance, it measures the dissimilarity between two instances in each dimension as a probability mass in a region that encloses the two instances. It considers two instances in a sparse region to be more similar than in a dense region. Using the probability of data mass enables all the dimensions of feature vectors to contribute in the final estimate of dissimilarity, so it does not just heavily bias towards the most dominant components. However, relying only on data distribution and completely ignoring the geometric distance raise another limitation. This can result in finding two instances similar only due to being in a sparse region, however if the geometric distance between them is large then they are not perceptually similar. To address this limitation we proposed a new hybrid data dependent dissimilarity (HDDD) measure that considers both data distribution as well as geometric distance. Our experimental results using Corel database and Caltech 101 show that (HDDD) leads to higher image retrieval performance than lp distance (lpD) and mp.
A new image dissimilarity measure incorporating human perception
- Shojanazeri, Hamid, Teng, Shyh, Aryal, Sunil, Zhang, Dengsheng, Lu, Guojun
- Authors: Shojanazeri, Hamid , Teng, Shyh , Aryal, Sunil , Zhang, Dengsheng , Lu, Guojun
- Date: 2018
- Type: Text , Unpublished work
- Full Text:
- Description: Pairwise (dis) similarity measure of data objects is central to many applications of image anlaytics, such as image retrieval and classification. Geometric distance, particularly Euclidean distance ((
- Authors: Shojanazeri, Hamid , Teng, Shyh , Aryal, Sunil , Zhang, Dengsheng , Lu, Guojun
- Date: 2018
- Type: Text , Unpublished work
- Full Text:
- Description: Pairwise (dis) similarity measure of data objects is central to many applications of image anlaytics, such as image retrieval and classification. Geometric distance, particularly Euclidean distance ((
An enhancement to the spatial pyramid matching for image classification and retrieval
- Karmakar, Priyabrata, Teng, Shyh, Lu, Guojun, Zhang, Dengsheng
- Authors: Karmakar, Priyabrata , Teng, Shyh , Lu, Guojun , Zhang, Dengsheng
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 22463-22472
- Full Text:
- Reviewed:
- Description: Spatial pyramid matching (SPM) is one of the widely used methods to incorporate spatial information into the image representation. Despite its effectiveness, the traditional SPM is not rotation invariant. A rotation invariant SPM has been proposed in the literature but it has many limitations regarding the effectiveness. In this paper, we investigate how to make SPM robust to rotation by addressing those limitations. In an SPM framework, an image is divided into an increasing number of partitions at different pyramid levels. In this paper, our main focus is on how to partition images in such a way that the resulting structure can deal with image-level rotations. To do that, we investigate three concentric ring partitioning schemes. Apart from image partitioning, another important component of the SPM framework is a weight function. To apportion the contribution of each pyramid level to the final matching between two images, the weight function is needed. In this paper, we propose a new weight function which is suitable for the rotation-invariant SPM structure. Experiments based on image classification and retrieval are performed on five image databases. The detailed result analysis shows that we are successful in enhancing the effectiveness of SPM for image classification and retrieval. © 2013 IEEE.
- Authors: Karmakar, Priyabrata , Teng, Shyh , Lu, Guojun , Zhang, Dengsheng
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 22463-22472
- Full Text:
- Reviewed:
- Description: Spatial pyramid matching (SPM) is one of the widely used methods to incorporate spatial information into the image representation. Despite its effectiveness, the traditional SPM is not rotation invariant. A rotation invariant SPM has been proposed in the literature but it has many limitations regarding the effectiveness. In this paper, we investigate how to make SPM robust to rotation by addressing those limitations. In an SPM framework, an image is divided into an increasing number of partitions at different pyramid levels. In this paper, our main focus is on how to partition images in such a way that the resulting structure can deal with image-level rotations. To do that, we investigate three concentric ring partitioning schemes. Apart from image partitioning, another important component of the SPM framework is a weight function. To apportion the contribution of each pyramid level to the final matching between two images, the weight function is needed. In this paper, we propose a new weight function which is suitable for the rotation-invariant SPM structure. Experiments based on image classification and retrieval are performed on five image databases. The detailed result analysis shows that we are successful in enhancing the effectiveness of SPM for image classification and retrieval. © 2013 IEEE.
A performance review of recent corner detectors
- Awrangjeb, Mohammad, Lu, Guojun
- Authors: Awrangjeb, Mohammad , Lu, Guojun
- Date: 2013
- Type: Text , Conference paper
- Relation: International Conference on Digital Image Computing: Techniques and Applications, 26 November 2013 to 28 November 2013 p. 157-164
- Full Text:
- Reviewed:
- Description: Contour-based corner detectors directly or indirectly estimate a significance measure (eg, curvature) on the points of a planar curve and select the curvature extrema points as corners. A number of promising contour-based corner detectors have recently been proposed. They mainly differ in how the curvature is estimated on each point of the given curve. As the curvature on a digital curve can only be approximated, it is important to estimate a curvature that remains stable against significant noises, for example, geometric transformations and compression, on the curve. Moreover, in many applications, for instance, in content-based image retrieval, a fast corner detector is a prerequisite. So, it is also a primary characteristic that how much time a corner detector takes for corner detection in a given image. In addition, different authors evaluated their detectors on different platforms using different evaluation systems. Evaluation systems that depend on human judgements and visual identification of corners are manual and too subjective. Application of a manual system on a large test database will be expensive. Therefore, it is important to evaluate the detectors on a common platform using an automatic evaluation system. This paper first reviews six most recent and highly performed corner detectors and analyse their theoretical running time. Then it uses an automatic evaluation system to analyse their performance. Both the robustness to noise and efficiency are estimated to rank the detectors.
- Authors: Awrangjeb, Mohammad , Lu, Guojun
- Date: 2013
- Type: Text , Conference paper
- Relation: International Conference on Digital Image Computing: Techniques and Applications, 26 November 2013 to 28 November 2013 p. 157-164
- Full Text:
- Reviewed:
- Description: Contour-based corner detectors directly or indirectly estimate a significance measure (eg, curvature) on the points of a planar curve and select the curvature extrema points as corners. A number of promising contour-based corner detectors have recently been proposed. They mainly differ in how the curvature is estimated on each point of the given curve. As the curvature on a digital curve can only be approximated, it is important to estimate a curvature that remains stable against significant noises, for example, geometric transformations and compression, on the curve. Moreover, in many applications, for instance, in content-based image retrieval, a fast corner detector is a prerequisite. So, it is also a primary characteristic that how much time a corner detector takes for corner detection in a given image. In addition, different authors evaluated their detectors on different platforms using different evaluation systems. Evaluation systems that depend on human judgements and visual identification of corners are manual and too subjective. Application of a manual system on a large test database will be expensive. Therefore, it is important to evaluate the detectors on a common platform using an automatic evaluation system. This paper first reviews six most recent and highly performed corner detectors and analyse their theoretical running time. Then it uses an automatic evaluation system to analyse their performance. Both the robustness to noise and efficiency are estimated to rank the detectors.
Enhanced colour image retrieval with cuboid segmentation
- Murshed, Manzur, Karmakar, Priyabrata, Teng, Shyh, Lu, Guojun
- Authors: Murshed, Manzur , Karmakar, Priyabrata , Teng, Shyh , Lu, Guojun
- Date: 2018
- Type: Text , Conference proceedings , Conference paper
- Relation: 2018 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2018; Canberra, Australia; 10th-13th December 2018
- Full Text:
- Reviewed:
- Description: In this paper, we further investigate our recently proposed cuboid image segmentation algorithm for effective image retrieval. Instead of using all cuboids (i.e. segments), we have proposed two approaches to choose different subsets of cuboids appropriately. With the experimental results on eBay dataset, we have shown that our proposals outperform retrieval performance of the existing technique. In addition, we have investigated how many segments are required for the most effective image retrieval and provide a quick method to determine the suitable number of cuboids.
- Description: 2018 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2018
- Authors: Murshed, Manzur , Karmakar, Priyabrata , Teng, Shyh , Lu, Guojun
- Date: 2018
- Type: Text , Conference proceedings , Conference paper
- Relation: 2018 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2018; Canberra, Australia; 10th-13th December 2018
- Full Text:
- Reviewed:
- Description: In this paper, we further investigate our recently proposed cuboid image segmentation algorithm for effective image retrieval. Instead of using all cuboids (i.e. segments), we have proposed two approaches to choose different subsets of cuboids appropriately. With the experimental results on eBay dataset, we have shown that our proposals outperform retrieval performance of the existing technique. In addition, we have investigated how many segments are required for the most effective image retrieval and provide a quick method to determine the suitable number of cuboids.
- Description: 2018 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2018
- «
- ‹
- 1
- ›
- »