scholarly journals Improving Shape Retrieval by Integrating AIR and Modified MutualkNN Graph

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Nouman Qadeer ◽  
Dongting Hu ◽  
Xiabi Liu ◽  
Shahzad Anwar ◽  
Malik Saad Sultan
Keyword(s):  
Image Retrieval ◽  
Shape Matching ◽  
Contextual Information ◽  
Similarity Score ◽  
Feature Representation ◽  
Shape Retrieval ◽  
Computational Time ◽  
Integration Scheme ◽  
Invariant Representation ◽  
Face Datasets

In computer vision, image retrieval remained a significant problem and recent resurgent of image retrieval also relies on other postprocessing methods to improve the accuracy instead of solely relying on good feature representation. Our method addressed the shape retrieval of binary images. This paper proposes a new integration scheme to best utilize feature representation along with contextual information. For feature representation we used articulation invariant representation; dynamic programming is then utilized for better shape matching followed by manifold learning based postprocessing modified mutualkNN graph to further improve the similarity score. We conducted extensive experiments on widely used MPEG-7 database of shape images by so-called bulls-eye score with and without normalization of modified mutualkNN graph which clearly indicates the importance of normalization. Finally, our method demonstrated better results compared to other methods. We also computed the computational time with another graph transduction method which clearly shows that our method is computationally very fast. Furthermore, to show consistency of postprocessing method, we also performed experiments on challenging ORL and YALE face datasets and improved baseline results.

scholarly journals Deep Hash with Improved Dual Attention for Image Retrieval

Information ◽  
2021 ◽  
Vol 12 (7) ◽  
pp. 285
Author(s):  
Wenjing Yang ◽  
Liejun Wang ◽  
Shuli Cheng ◽  
Yongming Li ◽  
Anyu Du
Keyword(s):  
Image Retrieval ◽  
Contextual Information ◽  
Quantization Error ◽  
Feature Representation ◽  
Semantic Features ◽  
Average Value ◽  
Hash Code ◽  
Feature Information ◽  
Learning To Hash ◽  
Study Designs

Recently, deep learning to hash has extensively been applied to image retrieval, due to its low storage cost and fast query speed. However, there is a defect of insufficiency and imbalance when existing hashing methods utilize the convolutional neural network (CNN) to extract image semantic features and the extracted features do not include contextual information and lack relevance among features. Furthermore, the process of the relaxation hash code can lead to an inevitable quantization error. In order to solve these problems, this paper proposes deep hash with improved dual attention for image retrieval (DHIDA), which chiefly has the following contents: (1) this paper introduces the improved dual attention mechanism (IDA) based on the ResNet18 pre-trained module to extract the feature information of the image, which consists of the position attention module and the channel attention module; (2) when calculating the spatial attention matrix and channel attention matrix, the average value and maximum value of the column of the feature map matrix are integrated in order to promote the feature representation ability and fully leverage the features of each position; and (3) to reduce quantization error, this study designs a new piecewise function to directly guide the discrete binary code. Experiments on CIFAR-10, NUS-WIDE and ImageNet-100 show that the DHIDA algorithm achieves better performance.

scholarly journals Weighted statistical binary patterns for facial feature representation

2021 ◽  
Author(s):  
Hung Phuoc Truong ◽  
Thanh Phuong Nguyen ◽  
Yong-Guk Kim
Keyword(s):  
Comprehensive Evaluation ◽  
Facial Feature ◽  
Input Image ◽  
Feature Representation ◽  
Illumination Variation ◽  
Straight Line ◽  
Mean And Variance ◽  
The Mean ◽  
Face Datasets ◽  
Degraded Images

AbstractWe present a novel framework for efficient and robust facial feature representation based upon Local Binary Pattern (LBP), called Weighted Statistical Binary Pattern, wherein the descriptors utilize the straight-line topology along with different directions. The input image is initially divided into mean and variance moments. A new variance moment, which contains distinctive facial features, is prepared by extracting root k-th. Then, when Sign and Magnitude components along four different directions using the mean moment are constructed, a weighting approach according to the new variance is applied to each component. Finally, the weighted histograms of Sign and Magnitude components are concatenated to build a novel histogram of Complementary LBP along with different directions. A comprehensive evaluation using six public face datasets suggests that the present framework outperforms the state-of-the-art methods and achieves 98.51% for ORL, 98.72% for YALE, 98.83% for Caltech, 99.52% for AR, 94.78% for FERET, and 99.07% for KDEF in terms of accuracy, respectively. The influence of color spaces and the issue of degraded images are also analyzed with our descriptors. Such a result with theoretical underpinning confirms that our descriptors are robust against noise, illumination variation, diverse facial expressions, and head poses.

THE NORMALIZED WAVELET DESCRIPTOR FOR SHAPE RETRIEVAL

2008 ◽  
Vol 06 (01) ◽  
pp. 25-36 ◽  
Author(s):  
KIMCHENG KITH ◽  
BAREND J. VAN WYK ◽  
MICHAËL A. VAN WYK
Keyword(s):  
Image Analysis ◽  
Image Retrieval ◽  
Shape Descriptor ◽  
Scale Space ◽  
Experimental Results ◽  
Shape Retrieval ◽  
Fourier Descriptor ◽  
Curvature Scale Space ◽  
Wavelet Descriptor

In many image analysis applications, such as image retrieval, the shape of an object is of primary importance. In this paper, a new shape descriptor, namely the Normalized Wavelet Descriptor (NWD), which is a generalization and extension of the Wavelet Descriptor (WD), is introduced. The NWD is compared to the Fourier Descriptor (FD), which in image retrieval experiments conducted by Zhang and Lu, outperformed even the Curvature Scale Space Descriptor (CSSD). Image retrieval experiments have been conducted using a dataset containing 2D-contours of 1400 objects extracted from the standard MPEG7 database. For the chosen dataset, our experimental results show that the NWD outperforms the FD.

scholarly journals Hybrid Method for Detecting Duplicate Image by Using Image Retrieval Technique in Data Mining

2021 ◽  
Vol 09 (04) ◽  
Author(s):  
Dr. S. Thavamani ◽  
Keyword(s):  
Data Mining ◽  
Image Retrieval ◽  
Hybrid Method ◽  
Video Retrieval ◽  
New Method ◽  
Computational Time ◽  
Storage Space ◽  
Copy Detection ◽  
Retrieval Technique ◽  
Improved Accuracy

Duplicated images cause several problems in online sites, so these demand special attention. To address the disadvantages of frames copy detection, the Hybrid Method of Detecting Duplicate Image by Using Image Retrieval Technique in Data Mining was proposed. We use the new method of eliminating duplicates in this example. To address the disadvantages of frames copy detection, the Hybrid Method of Detecting Duplicate Image by Using Image Retrieval Technique in Data Mining was proposed. The new method of eliminating duplicates in this example has proposed. Using this method, you can get rid of frames that aren't relevant to the video. This makes for more precise and faster video retrieval with fewer duplicates. As a back end, this technique is implemented in C# and SQL. The findings are put to the test and compared to the current SIFT process. The results showed that the output improved accuracy while reducing storage space, computational time, and memory use.

A New Unconditionally Stable Time Integration Method for Analysis of Nonlinear Structural Dynamics

2013 ◽  
Vol 80 (2) ◽  
Author(s):  
Ali Akbar Gholampour ◽  
Mehdi Ghassemieh ◽  
Mahdi Karimi-Rad
Keyword(s):  
Time Integration ◽  
Second Order ◽  
Numerical Dispersion ◽  
Computational Time ◽  
Numerical Dissipation ◽  
Integration Scheme ◽  
Time Step ◽  
Similar Time ◽  
Unconditionally Stable ◽  
Average Acceleration

A new time integration scheme is presented for solving the differential equation of motion with nonlinear stiffness. In this new implicit method, it is assumed that the acceleration varies quadratically within each time step. By increasing the order of acceleration, more terms of the Taylor series are used, which are expected to have responses with better accuracy than the classical methods. By considering this assumption and employing two parameters δ and α, a new family of unconditionally stable schemes is obtained. The order of accuracy, numerical dissipation, and numerical dispersion are used to measure the accuracy of the proposed method. Second order accuracy is achieved for all values of δ and α. The proposed method presents less dissipation at the lower modes in comparison with Newmark's average acceleration, Wilson-θ, and generalized-α methods. Moreover, this second order accurate method can control numerical damping in the higher modes. The numerical dispersion of the proposed method is compared with three unconditionally stable methods, namely, Newmark's average acceleration, Wilson-θ, and generalized-α methods. Furthermore, the overshooting effect of the proposed method is compared with these methods. By evaluating the computational time for analysis with similar time step duration, the proposed method is shown to be faster in comparison with the other methods.

Text-Image Retrieval With Salient Features

2021 ◽  
Vol 32 (4) ◽  
pp. 1-13
Author(s):  
Xia Feng ◽  
Zhiyi Hu ◽  
Caihua Liu ◽  
W. H. Ip ◽  
Huiying Chen
Keyword(s):  
Image Retrieval ◽  
Recall Rate ◽  
Image Features ◽  
Feature Representation ◽  
Image Feature ◽  
Text And Image ◽  
Retrieval Task ◽  
Retrieval Method ◽  
Salient Features ◽  
Object Level

In recent years, deep learning has achieved remarkable results in the text-image retrieval task. However, only global image features are considered, and the vital local information is ignored. This results in a failure to match the text well. Considering that object-level image features can help the matching between text and image, this article proposes a text-image retrieval method that fuses salient image feature representation. Fusion of salient features at the object level can improve the understanding of image semantics and thus improve the performance of text-image retrieval. The experimental results show that the method proposed in the paper is comparable to the latest methods, and the recall rate of some retrieval results is better than the current work.

scholarly journals Channel and Spatial Attention Regression Network for Cup-to-Disc Ratio Estimation

Electronics ◽  
2020 ◽  
Vol 9 (6) ◽  
pp. 909
Author(s):  
Shuo Li ◽  
Chiru Ge ◽  
Xiaodan Sui ◽  
Yuanjie Zheng ◽  
Weikuan Jia
Keyword(s):  
Spatial Attention ◽  
Structural Changes ◽  
Contextual Information ◽  
Feature Representation ◽  
Feature Maps ◽  
Global Features ◽  
Discriminative Ability ◽  
Deep Learning Network ◽  
Relationship Of ◽  
Cup To Disc Ratio

Cup-to-disc ratio (CDR) is of great importance during assessing structural changes at the optic nerve head (ONH) and diagnosis of glaucoma. While most efforts have been put on acquiring the CDR number through CNN-based segmentation algorithms followed by the calculation of CDR, these methods usually only focus on the features in the convolution kernel, which is, after all, the operation of the local region, ignoring the contribution of rich global features (such as distant pixels) to the current features. In this paper, a new end-to-end channel and spatial attention regression deep learning network is proposed to deduces CDR number from the regression perspective and combine the self-attention mechanism with the regression network. Our network consists of four modules: the feature extraction module to extract deep features expressing the complicated pattern of optic disc (OD) and optic cup (OC), the attention module including the channel attention block (CAB) and the spatial attention block (SAB) to improve feature representation by aggregating long-range contextual information, the regression module to deduce CDR number directly, and the segmentation-auxiliary module to focus the model’s attention on the relevant features instead of the background region. Especially, the CAB selects relatively important feature maps in channel dimension, shifting the emphasis on the OD and OC region; meanwhile, the SAB learns the discriminative ability of feature representation at pixel level by capturing the relationship of intra-feature map. The experimental results of ORIGA dataset show that our method obtains absolute CDR error of 0.067 and the Pearson’s correlation coefficient of 0.694 in estimating CDR and our method has a great potential in predicting the CDR number.

scholarly journals Orientation Feature Transform Model for Image Retrieval in Sketch Based Image Retrieval System

2018 ◽  
Vol 7 (2.24) ◽  
pp. 159
Author(s):  
Durga Prasad K ◽  
Manjunathachari K ◽  
Giri Prasad M.N
Keyword(s):  
Image Retrieval ◽  
Retrieval System ◽  
Recognition Performance ◽  
Low Complexity ◽  
Feature Representation ◽  
Image Retrieval System ◽  
Conventional Models ◽  
Orientation Feature ◽  
Region Representation ◽  
Resource Environment

This paper focus on Image retrieval using Sketch based image retrieval system. The low complexity model for image representation has given the sketch based image retrieval (SBIR) a optimal selection for next generation application in low resource environment. The SBIR approach uses the geometrical region representation to describe the feature and utilize for recognition. In the SBIR model, the features represented define the image. Towards the improvement of SBIR recognition performance, in this paper a new invariant modeling using “orientation feature transformed modeling” is proposed. The approach gives the enhancement of invariant property and retrieval performance improvement in transformed domain. The experimental results illustrate the significance of invariant orientation feature representation in SBIR over the conventional models.  

scholarly journals Emotion-Semantic-Enhanced Bidirectional LSTM with Multi-Head Attention Mechanism for Microblog Sentiment Analysis

Information ◽  
2020 ◽  
Vol 11 (5) ◽  
pp. 280
Author(s):  
Shaoxiu Wang ◽  
Yonghua Zhu ◽  
Wenjing Gao ◽  
Meng Cao ◽  
Mengyao Li
Keyword(s):  
Sentiment Analysis ◽  
Short Term Memory ◽  
Syntactic Structure ◽  
Contextual Information ◽  
Research Field ◽  
Attention Mechanism ◽  
Feature Representation ◽  
Mechanism Model ◽  
Hidden Layer ◽  
The Impact

The sentiment analysis of microblog text has always been a challenging research field due to the limited and complex contextual information. However, most of the existing sentiment analysis methods for microblogs focus on classifying the polarity of emotional keywords while ignoring the transition or progressive impact of words in different positions in the Chinese syntactic structure on global sentiment, as well as the utilization of emojis. To this end, we propose the emotion-semantic-enhanced bidirectional long short-term memory (BiLSTM) network with the multi-head attention mechanism model (EBILSTM-MH) for sentiment analysis. This model uses BiLSTM to learn feature representation of input texts, given the word embedding. Subsequently, the attention mechanism is used to assign the attentive weights of each words to the sentiment analysis based on the impact of emojis. The attentive weights can be combined with the output of the hidden layer to obtain the feature representation of posts. Finally, the sentiment polarity of microblog can be obtained through the dense connection layer. The experimental results show the feasibility of our proposed model on microblog sentiment analysis when compared with other baseline models.

Sign in / Sign up

Export Citation Format

Share Document