Frame Interpolation Based on Visual Correspondence and Coherency Sensitive Hashing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locality Sensitive Hashing Based Clustering

Definition In learning systems with kernels, the shape and size of a kernel plays a critical role for accuracy and generalization. Most kernels have a distance metric parameter, which determines the size and shape of the kernel in the sense of a Mahalanobis distance. Advanced kernel learning tune every kernel’s distance metric individually, instead of turning one global distance metric for all ...

متن کامل

Indexing Algorithm Based on Improved Sparse Local Sensitive Hashing

In this article, we propose a new semantic hashing algorithm to address the new-merging problems such as the difficulty in similarity measurement brought by highdimensional data. Based on local sensitive hashing and spectral hashing, we introduce sparse principal component analysis (SPCA) to reduce the dimension of the data set which exclude the redundancy in the parameter list, and thus make h...

متن کامل

Efficient Incremental Near Duplicate Detection Based on Locality Sensitive Hashing

In this paper, we study the problem of detecting near duplicates for high dimensional data points in an incremental manner. For example, for an image sharing website, it would be a desirable feature if near-duplicates can be detected whenever a user uploads a new image into the website so that the user can take some action such as stopping the upload or reporting an illegal copy. Specifically, ...

متن کامل

Lattice-based Locality Sensitive Hashing is Optimal

Locality sensitive hashing (LSH) was introduced by Indyk and Motwani (STOC ‘98) to give the first sublinear time algorithm for the c-approximate nearest neighbor (ANN) problem using only polynomial space. At a high level, an LSH family hashes “nearby” points to the same bucket and “far away” points to different buckets. The quality of measure of an LSH family is its LSH exponent, which helps de...

متن کامل

Key-Frame Based Robust Video Hashing Using Isometric Feature Mapping

In order to identify videos on the Internet, a robust video hashing based on key frames and Isometric Feature Mapping (ISOMAP) is proposed in this paper. In this method, key frames extraction and hash generation are two major components. During the video hashing, key frame extraction is achieved by a uniform distribution vector and video tomography analysis, while hash generation is accomplishe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2013

ISSN: 1024-123X,1563-5147

DOI: 10.1155/2013/453278