scholarly journals Hybrid Image-Retrieval Method for Image-Splicing Validation

Symmetry ◽  
2019 ◽  
Vol 11 (1) ◽  
pp. 83 ◽  
Author(s):  
Nam Pham ◽  
Jong-Weon Lee ◽  
Goo-Rak Kwon ◽  
Chun-Su Park
Keyword(s):  
Image Retrieval ◽  
Zernike Moment ◽  
Invariant Property ◽  
Image Splicing ◽  
Scale Invariant ◽  
Retrieval Method ◽  
One Step ◽  
Sift Features ◽  
Scaling Invariant ◽  
Scale Invariant Feature

Recently, the task of validating the authenticity of images and the localization of tampered regions has been actively studied. In this paper, we go one step further by providing solid evidence for image manipulation. If a certain image is proved to be the spliced image, we try to retrieve the original authentic images that were used to generate the spliced image. Especially for the image retrieval of spliced images, we propose a hybrid image-retrieval method exploiting Zernike moment and Scale Invariant Feature Transform (SIFT) features. Due to the symmetry and antisymmetry properties of the Zernike moment, the scaling invariant property of SIFT and their common rotation invariant property, the proposed hybrid image-retrieval method is efficient in matching regions with different manipulation operations. Our simulation shows that the proposed method significantly increases the retrieval accuracy of the spliced images.

A car-face region-based image retrieval method with attention of SIFT features

2016 ◽  
Vol 76 (8) ◽  
pp. 10939-10958 ◽  
Author(s):  
Changyou Zhang ◽  
Xiaoya Wang ◽  
Jun Feng ◽  
Yu Cheng ◽  
Cheng Guo
Keyword(s):  
Image Retrieval ◽  
Retrieval Method ◽  
Face Region ◽  
Sift Features

scholarly journals THE LOW BACKSCATTERING OBJECTS CLASSIFICATION IN POLSAR IMAGE BASED ON BAG OF WORDS MODEL USING SUPPORT VECTOR MACHINE

2018 ◽  
Vol XLII-3 ◽  
pp. 2089-2091
Author(s):  
L. Yang ◽  
L. Shi ◽  
P. Li ◽  
J. Yang ◽  
L. Zhao ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Bare Soil ◽  
Radar Signal ◽  
Support Vector ◽  
Data Sets ◽  
Bag Of Words ◽  
Scale Invariant ◽  
Polarimetric Synthetic Aperture Radar ◽  
Sift Features ◽  
Scale Invariant Feature

Due to the forward scattering and block of radar signal, the water, bare soil, shadow, named low backscattering objects (LBOs), often present low backscattering intensity in polarimetric synthetic aperture radar (PolSAR) image. Because the LBOs rise similar backscattering intensity and polarimetric responses, the spectral-based classifiers are inefficient to deal with LBO classification, such as Wishart method. Although some polarimetric features had been exploited to relieve the confusion phenomenon, the backscattering features are still found unstable when the system noise floor varies in the range direction. This paper will introduce a simple but effective scene classification method based on Bag of Words (BoW) model using Support Vector Machine (SVM) to discriminate the LBOs, without relying on any polarimetric features. In the proposed approach, square windows are firstly opened around the LBOs adaptively to determine the scene images, and then the Scale-Invariant Feature Transform (SIFT) points are detected in training and test scenes. The several SIFT features detected are clustered using K-means to obtain certain cluster centers as the visual word lists and scene images are represented using word frequency. At last, the SVM is selected for training and predicting new scenes as some kind of LBOs. The proposed method is executed over two AIRSAR data sets at C band and L band, including water, bare soil and shadow scenes. The experimental results illustrate the effectiveness of the scene method in distinguishing LBOs.

scholarly journals Three Landmark Optimization Strategies for Mobile Robot Visual Homing

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3180 ◽  
Author(s):  
Xun Ji ◽  
Qidan Zhu ◽  
Junda Ma ◽  
Peng Lu ◽  
Tianhao Yan
Keyword(s):  
Mobile Robot ◽  
Target Location ◽  
Mobile Robot Navigation ◽  
Scale Invariant ◽  
Visual Homing ◽  
Vision Sensors ◽  
Homing Performance ◽  
Sift Features ◽  
Scale Invariant Feature ◽  
Input Form

Visual homing is an attractive autonomous mobile robot navigation technique, which only uses vision sensors to guide the robot to the specified target location. Landmark is the only input form of the visual homing approaches, which is usually represented by scale-invariant features. However, the landmark distribution has a great impact on the homing performance of the robot, as irregularly distributed landmarks will significantly reduce the navigation precision. In this paper, we propose three strategies to solve this problem. We use scale-invariant feature transform (SIFT) features as natural landmarks, and the proposed strategies can optimize the landmark distribution without over-eliminating landmarks or increasing calculation amount. Experiments on both panoramic image databases and a real mobile robot have verified the effectiveness and feasibility of the proposed strategies.

scholarly journals A Novel Optimization-Based Approach for Content-Based Image Retrieval

2013 ◽  
Vol 2013 ◽  
pp. 1-6
Author(s):  
Manyu Xiao ◽  
Jianghu Lu ◽  
Gongnan Xie
Keyword(s):  
Image Retrieval ◽  
Content Based Image Retrieval ◽  
Scale Invariant ◽  
Vocabulary Tree ◽  
Invariant Feature ◽  
Matching Technique ◽  
Real Performance ◽  
Tree Building ◽  
The Cost ◽  
Scale Invariant Feature

Content-based image retrieval is nowadays one of the possible and promising solutions to manage image databases effectively. However, with the large number of images, there still exists a great discrepancy between the users’ expectations (accuracy and efficiency) and the real performance in image retrieval. In this work, new optimization strategies are proposed on vocabulary tree building, retrieval, and matching methods. More precisely, a new clustering strategy combining classification and conventionalK-Means method is firstly redefined. Then a new matching technique is built to eliminate the error caused by large-scaled scale-invariant feature transform (SIFT). Additionally, a new unit mechanism is proposed to reduce the cost of indexing time. Finally, the numerical results show that excellent performances are obtained in both accuracy and efficiency based on the proposed improvements for image retrieval.

Merging grid maps of different resolutions by scaling registration

Robotica ◽  
2015 ◽  
Vol 34 (11) ◽  
pp. 2516-2531 ◽  
Author(s):  
Liang Ma ◽  
Jihua Zhu ◽  
Li Zhu ◽  
Shaoyi Du ◽  
Jingru Cui
Keyword(s):  
Objective Function ◽  
Superior Performance ◽  
Scale Invariant ◽  
Invariant Feature ◽  
Consistent Feature ◽  
Initial Transformation ◽  
Random Sample Consensus ◽  
Sift Features ◽  
Scale Invariant Feature ◽  
Ransac Algorithm

SUMMARYThis paper considers the problem of merging grid maps that have different resolutions. Because the goal of map merging is to find the optimal transformation between two partially overlapping grid maps, it can be viewed as a special image registration issue. To address this special issue, the solution considers the non-common areas and designs an objective function based on the trimmed mean-square error (MSE). The trimmed and scaling iterative closest point (TsICP) algorithm is then proposed to solve this well-designed objective function. As the TsICP algorithm can be proven to be locally convergent in theory, a good initial transformation should be provided. Accordingly, scale-invariant feature transform (SIFT) features are extracted for the maps to be potentially merged, and the random sample consensus (RANSAC) algorithm is employed to find the geometrically consistent feature matches that are used to estimate the initial transformation for the TsICP algorithm. In addition, this paper presents the rules for the fusion of the grid maps based on the estimated transformation. Experimental results carried out with publicly available datasets illustrate the superior performance of this approach at merging grid maps with respect to robustness and accuracy.

Implementation of Image Matching Algorithm Based on SIFT Features

2014 ◽  
Vol 602-605 ◽  
pp. 3181-3184 ◽  
Author(s):  
Mu Yi Yin ◽  
Fei Guan ◽  
Peng Ding ◽  
Zhong Feng Liu
Keyword(s):  
Image Matching ◽  
Implementation Process ◽  
Scale Invariant ◽  
Sift Algorithm ◽  
Matching Algorithm ◽  
Source Codes ◽  
Invariant Feature ◽  
Viewpoint Change ◽  
Sift Features ◽  
Scale Invariant Feature

With the aim to solve the implement problem in scale invariant feature transform (SIFT) algorithm, the theory and the implementation process was analyzed in detail. The characteristics of the SIFT method were analyzed by theory, combined with the explanation of the Rob Hess SIFT source codes. The effect of the SIFT method was validated by matching two different real images. The matching result shows that the features extracted by SIFT method have excellent adaptive and accurate characteristics to image scale, viewpoint change, which are useful for the fields of image recognition, image reconstruction, etc.

Sign in / Sign up

Export Citation Format

Share Document