The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we propose to use Bag-of-Words (BoW) model based methods for the remotely sensed images classification, and also attempt to do research about the image quality and algorithm evaluation. We introduce the Locality-constrained Linear Coding (LLC) for the remotely sensed image classification, and the hard vector quantization and soft vector quantization are adopted for experiments. Regards...
Recently, sparse coding-based algorithms have achieved high performance on several popular scene classification benchmarks. Yet extensive efforts along this direction focus on strategies for coding and dictionary learning, few works have addressed the problem of optimal pooling regions selection. In this work, we show that the Viola-Jones algorithm, which is well-known in face detection, can be tailored...
The researches on Human Visual System (HVS) lead to more comprehension in the visual perceptibility of human eyes and make dramatic contribution in image quality assessment. However, few perceptual hashing algorithms take the visual perceptibility into account. In this paper, we propose a new visual threshold adjustable perceptual hashing method under the guidance of Watson's visual model. This method...
Although image robust hashing has drawn many attentions as a promising image authentication technique, the tamper detection and localization of robust hash algorithm has not been explored thoroughly. The most important difficulty is the conflict that the hash value is supposed to be robust to common content-preserving manipulations (CPM), such as lossy compression, but sensitive to malicious tamper...
Spoof detection is a critical function for iris recognition because it reduces the risk of iris recognition systems being forged. Despite various counterfeit artifacts, cosmetic contact lens is one of the most common and difficult to detect. In this paper, we proposed a novel fake iris detection algorithm based on improved LBP and statistical features. Firstly, a simplified SIFT descriptor is extracted...
A novel image perceptual hashing method is proposed on the intermediate hashing stage. It first uses the iterative geometric techniques to get main geometric features. Then, by the observation that the distances of feature points are invariant in the polar coordinate under arbitrary rotation, a novel processing method is proposed to arrange the two-dimensional distribution to a one-dimensional feature...
Perceptual hashing as a new technique for the multimedia content security have been widely discussed.However, the robustness requirement of perceptual hashing brings big challenges to its security. In this paper, we propose a secure enhancement scheme for image perceptual hashing based on error correction coding. By employing error correcting code, images with similar perceptual contents can be mapped...
Data compression is used operationally to reduce bandwidth and storage requirements. JPEG2000 is the famous compression standard for still image coding. A study is presented for the lossless and lossy compression of MODIS image based on JPEG2000. We introduced the characteristic of MODIS data firstly and used some compression methods for the data. Experiments showed for lossless compression JPEG2000...
A novel image perceptual hashing algorithm is proposed on the intermediate hashing stage. It first uses an iterative geometric technique to extract significant geometry preserving feature points. Then, the fuzzy distance matching method is proposed based on the observation that the distances of feature points are invariant in the polar coordinate under arbitrary rotation. It is verified that the proposed...
An arbitrarily rotated image should not be recognized as a different one, but the conventional image perceptual hashing algorithms can only deal with this partially. Different to watermarking, image perceptual hashing does not need to embed information into the image content, this make it possible that perceptual hashing can treat the synchronization problem in a new manner. In this paper, three cyclic...
SPIHT (set partitioning in hierarchical trees) has given excellent results in terms of compression performance for majority images. However, it is not guaranteed to be optimal since the algorithm is not designed to explicitly consider the human visual system (HVS) characteristics. Extensive HVS research has shown that there are three perceptually significant activity blocks in an image: smooth, edge,...
Set partitioning in hierarchical trees (SPIHT) is considered the premier state-of-the-art algorithm in image compression, but it is not designed to explicitly consider the human visual system (HVS) characteristics. Extensive HVS research has shown that there are three perceptually significant activity blocks in an image: smooth, edge, and texture blocks. The paper uses the shape parameters of generalized...
Traditionally, the proposed perceptual hashing algorithms are mainly focused on the feature extraction and coding stages. But they only concerned parts of perception information, and take a certain type of features to obtain codes, which makes them to be biased on resisting some varieties of attacks. On the other hand, HVS (Human Visual System) as one of best methods simulating the image cognitive...
This paper presents a blind watermark algorithm in mixed transform domain by using chaotic sequence for the watermark locating. After DWT, the DCT is applied on the low frequency and chaotic sequence is used to locate the position of the watermark information in DCT domain. The watermark information is embedded by comparing the frequency coefficients. With favorable transparency, the experimental...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.