Abstract: In this paper, we are interested in the problem of
finding similar images in a large database. For this purpose we
propose a new algorithm based on a combination of the 2-D
histogram intersection in the HSV space and statistical moments. The
proposed histogram is based on a 3x3 window and not only on the
intensity of the pixel. This approach overcome the drawback of the
conventional 1-D histogram which is ignoring the spatial distribution
of pixels in the image, while the statistical moments are used to
escape the effects of the discretisation of the color space which is
intrinsic to the use of histograms. We compare the performance of
our new algorithm to various methods of the state of the art and we
show that it has several advantages. It is fast, consumes little memory
and requires no learning. To validate our results, we apply this
algorithm to search for similar images in different image databases.
Abstract: ‘Steganalysis’ is one of the challenging and attractive interests for the researchers with the development of information hiding techniques. It is the procedure to detect the hidden information from the stego created by known steganographic algorithm. In this paper, a novel feature based image steganalysis technique is proposed. Various statistical moments have been used along with some similarity metric. The proposed steganalysis technique has been designed based on transformation in four wavelet domains, which include Haar, Daubechies, Symlets and Biorthogonal. Each domain is being subjected to various classifiers, namely K-nearest-neighbor, K* Classifier, Locally weighted learning, Naive Bayes classifier, Neural networks, Decision trees and Support vector machines. The experiments are performed on a large set of pictures which are available freely in image database. The system also predicts the different message length definitions.
Abstract: Extended Kalman Filter (EKF) is probably the most
widely used estimation algorithm for nonlinear systems. However,
not only it has difficulties arising from linearization but also many
times it becomes numerically unstable because of computer round off
errors that occur in the process of its implementation. To overcome
linearization limitations, the unscented transformation (UT) was
developed as a method to propagate mean and covariance
information through nonlinear transformations. Kalman filter that
uses UT for calculation of the first two statistical moments is called
Unscented Kalman Filter (UKF). Square-root form of UKF (SRUKF)
developed by Rudolph van der Merwe and Eric Wan to
achieve numerical stability and guarantee positive semi-definiteness
of the Kalman filter covariances. This paper develops another
implementation of SR-UKF for sequential update measurement
equation, and also derives a new UD covariance factorization filter
for the implementation of UKF. This filter is equivalent to UKF but
is computationally more efficient.