When dealing with document similarity many methods exist today, like cosine similarity. More complex methods are also available based on the semantic analysis of textual information, which are computationally expensive and rarely used in the real time feeding of content as in enterprisewide search environments. To address these real-time constraints, we developed a new measure of document simil...

with the increase of communication and financial transaction through internet, on-line signature verification is an accepted biometric technology for access control and plays a significant role in authenticity and authorization in modernized society. therefore, fast and precise algorithms for the signature verification are very attractive. the goal of this paper is modeling of velocity signal t...

The discrete cosine transform (DCT) is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using only real numbers. It is equivalent to a DFT of roughly twice the length, operating on real data with even symmetry (since the Fourier transform of a real and even function is real and even), where in some variants the input and/or output data are shifted by half a sampl...

Each Discrete Cosine Transform uses N real basis vectors whose components are cosines. In the DCT-4, for example, the jth component of v k is cos(j + 1 2)(k + 1 2) N. These basis vectors are orthogonal and the transform is extremely useful in image processing. If the vector x gives the intensities along a row of pixels, its cosine series P c k v k has the coeecients c k = (x; v k)=N. They are q...

In this paper a reversible discrete cosine transform (RDCT) is presented. N-point reversible transform is firstly presented, then 8-point RDCT is obtained by substituting the 2 and 4point reversible transforms for 2 and 4-point transforms which compose 8-point discrete cosine transform (DCT), respectively. Integer input signal can be losslessly recovered, although the transform coefficients are...

Discrete frequency transforms provide a method to obtain a global view of data within a window. Discrete cosine transform is the frequency transform for practical image processing because of its excellent energy compaction property. Another reason for its popularity is the existence of a fast implementation for the algorithm. In this article, the basics of the discrete cosine transform, its use...

We construct bivariate biorthogonal cosine wavelets on a twooverlapping rectangular grid with bell functions not necessary of tensor product type. The biorthogonal system as well as frame and Riesz basis conditions are given explicitly. Our methods are based on the properties of bivariate total folding and unfolding operators.

The local cosine/sine basis is a localized version of the cosine/sine basis with a window function which can have arbitrary smoothness. It has orthogonality and good time and frequency localization properties. The adaptive local cosine/sine basis is a best-basis obtained from an overabundant library of cosine/sine packets based on a costfunctional. We propose a 2D semi-adaptive (time-adaptive o...

The neutrosophic cubic set can contain much more information to express its interval neutrosophic numbers and single-valued neutrosophic numbers simultaneously in indeterminate environments. Hence, it is a usual tool for expressing much more information in complex decision-making problems. Unfortunately, there has been no research on similarity measures of neutrosophic cubic sets so far. Since ...