Search

The article offers information on miscellaneous topics including papers and research published by the editorial board and their submission; writing style for manuscripts, illustrations; and information regarding the copyright policies of the journal.

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM PUBLISHER]

Provides instructions and guidelines to prospective authors who wish to submit manuscripts. [ABSTRACT FROM AUTHOR]

With the rapid development of network media, increasing research on reversible watermarking has focused on improving its robustness to resisting attacks during digital media transmission. There are some other reversible watermarking schemes that work in the encrypted domain for preserving the privacy of the cover image. The robustness of the watermarking and the privacy preserving of the cover image have become the key factors of reversible watermarking. However, there are few robust reversible watermarking schemes in the encrypted domain that could resist common attacks (such as JPEG compression, noise addition) and preserve privacy at the same time. In addition, the embedding capacity of a robust watermark and the efficiency of the encryption method must be considered. Recently, cloud computing technology has led to the rapid growth of network media, and many multimedia properties are owned by multiple parties, such as a film’s producer and multiple distributors. Multi-party watermarking has become an important demand for network media to protect all parties’ rights. In this paper, a Robust Reversible Watermarking scheme in Encrypted Image with Secure Multi-party (RRWEI-SM) based on lightweight cryptography is first proposed. Additive secret sharing and block-level scrambling are developed to generate the encrypted image. Then, the robust reversible watermarking based on significant bit Prediction Error Expansion (PEE) is performed by Secure Multi-party Computation (SMC). For applications with high robustness, a Modified RRWEI-SM is proposed by exploiting two-stage architecture. Furthermore, both the RRWEI-SM scheme and Modified RRWEI-SM scheme are separable and can be applied to multiparty copyright protection. The experimental results and theoretical analysis demonstrate here that the RRWEI-SM and the Modified RRWEI-SM are secure, robust and effective. [ABSTRACT FROM AUTHOR]

This paper presents a blind dual watermarking mechanism for digital color images in which invisible robust watermarks are embedded for copyright protection and fragile watermarks are embedded for image authentication. For the purpose of copyright protection, the first watermark is embedded using the discrete wavelet transform in YCbCr color space, and it can be extracted blindly without access to the host image. However, fragile watermarking is based on an improved least significant bits’ replacement approach in RGB components for image authentication. The authenticity and integrity of a suspicious image can be verified blindly without the host image and the original watermark. The combination of robust and fragile watermarking makes the proposed mechanism suitable for protecting valuable original images. The experimental results indicated that the proposed watermarking mechanism can withstand various processing attacks and accurately locate the tampered area of an image. [ABSTRACT FROM PUBLISHER]

Content-based video copy detection is undoubtedly one of the most effective solutions to video content tracing and copyright protection. It extracts features from videos and determines whether a copy occurs by comparing the extracted features. While a lot of work has been reported to address this problem with good performance, very few considered it from the perspective of a dynamic searching process. In this paper, we treat the copy detection in video streams as a sequential matching problem and take into consideration the connections between temporary results and forthcoming input. Specifically, we propose a video copy detection system that involves a novel frame fusion scheme and an adaptive search strategy. The proposed frame fusion scheme relies on path merging in a graph model, which is able to work in an online manner and provide informative temporary fusion results. Based on these temporary results, query content predictions can be generated, which will be fed back to the frame search engine to instruct it to adaptively adjust the search strategy. The experimental results show that the proposed frame fusion scheme achieves competitive detection and localization accuracies compared with the state-of-the-art methods. Meanwhile, with the assistance of the adaptive search strategy, the computational complexity of frame similarity search is dramatically reduced at a cost of a slight decrease in accuracy. [ABSTRACT FROM PUBLISHER]

The article offers information for readers and authors on the details of paper submission for the periodical which includes types of papers which could be submitted, style of manuscript to be followed, and copyright information.

Provides instructions and guidelines to prospective authors who wish to submit manuscripts. [ABSTRACT FROM PUBLISHER]

The article presents information for the authors regarding several requirements for publishing of their articles including style of manuscripts, transaction letters and copyright.

The widespread use of digital multimedia data has increased the need for effective means of copyright protection. Watermarking has attracted much attention, as it allows the embedding of a signature in a digital document in an imperceptible manner. In practice, watermarking is subject to various attacks, intentional or unintentional, which degrade the embedded information, rendering it more difficult to detect. A very common, but not malicious, attack is quantization, which is unavoidable for the compression and transmission of digital data. The effect of quantization attacks on the nearly optimal Cauchy watermark detector is examined in this paper. The quantization effects on this detection scheme are examined theoretically, by treating the watermark as a dither signal. The theory of dithered quantizers is used in order to correctly analyze the effect of quantization attacks on the Cauchy watermark detector. The theoretical results are verified by experiments that demonstrate the quantization effects on the detection and error probabilities of the Cauchy detection scheme. [ABSTRACT FROM AUTHOR]

We present an efficient and accurate method for duplicate video detection in a large database using video fingerprints. We have empirically chosen the color layout descriptor, a compact and robust frame-based descriptor, to create fingerprints which are further encoded by vector quantization (VQ). We propose a new nonmetric distance measure to find the similarity between the query and a database video fingerprint and experimentally show its superior performance over other distance measures for accurate duplicate detection. Efficient search cannot be performed for high-dimensional data using a nonmetric distance measure with existing indexing techniques. Therefore, we develop novel search algorithms based on precomputed distances and new dataset pruning techniques yielding practical retrieval times. We perform experiments with a database of 38 000 videos, worth 1600 h of content. For individual queries with an average duration of 60 s (about 50% of the average database video length), the duplicate video is retrieved in 0.032 s, on Intel Xeon with CPU 2.33 GHz, with a very high accuracy of 97.5%. [ABSTRACT FROM AUTHOR]

The characterization of a video segment by a digital signature is a fundamental task in video processing. It is necessary for video indexing and retrieval, copyright protection, and other tasks. Semantic video signatures are those that are based on high-level content information rather than on low-level features of the video stream. The major advantage of such signatures is that they are highly invariant to nearly all types of distortion. A major semantic feature of a video is the appearance of specific persons in specific video frames. Because of the great amount of research that has been performed on the subject of face detection and recognition, the extraction of such information is generally tractable, or will be in the near future. We have developed a method that uses the pre-extracted output of face detection and recognition to perform fast semantic query-by-example retrieval of video segments. We also give the results of the experimental evaluation of our method on a database of real video. One advantage of our approach is that the evaluation of similarity is convolution-based, and is thus resistant to perturbations in the signature and independent of the exact boundaries of the query segment. [ABSTRACT FROM AUTHOR]