Increasing numbers of people use social networks for keeping consistent contact with social life and acquaintances; sharing experiences became one of the most important requirement driving social networks. Users mostl...
详细信息
Increasing numbers of people use social networks for keeping consistent contact with social life and acquaintances; sharing experiences became one of the most important requirement driving social networks. Users mostly use the media gathered during events, while sharing them socially. In this paper, we propose a semantic based model that involves several domain-based shared ontologies and use them to investigate image relationships among experiences. The proposed model is called Semantic Image Retrieval Model (SIRM) for sharing knowledge in social networks. In addition, we concentrate on a “Visit to zoo” scenario as a case study to show suitability and usability of the ontology based model for meeting requirements of sharing experiences among users of a social network. SIRM can also be used for different environments and scenarios in order to share experiences in a social network, build a knowledge-base of annotated media gathered during experiences by the people who visited the same site, or simply store the gathered media intelligently for future reference.
In this paper, a video watermarking scheme is proposed, which has high capacity and is robust against transcoding between MPEG2, MPEG4 and H.264. In the proposed scheme, the watermark is embedded into the DCT blocks a...
详细信息
In this paper, a video watermarking scheme is proposed, which has high capacity and is robust against transcoding between MPEG2, MPEG4 and H.264. In the proposed scheme, the watermark is embedded into the DCT blocks and the frames in the same GOP are watermarked with the same watermark. During the embedding, the spatial relationship of DCT coefficient between an 8*8 block and its four 4*4 sub-blocks is exploited to select out the coefficients which are affected slightly by compression and transcoding, and then, according to the textural property of each 4*4 block, the watermark is embedded into one of the selected-out DCT coefficients by even/odd quantization. In the detection, the majority voting method is used to make the watermark more robust. Simulation results show that this scheme has high watermark capacity, and it is robust to video compression and transcoding between different compression standards.
In the article the analysis of methods of compression of audio signals based on conversion and parametric coding, their advantages, disadvantages and scopes is carried out. For increasing the efficiency of compression...
详细信息
In the article the analysis of methods of compression of audio signals based on conversion and parametric coding, their advantages, disadvantages and scopes is carried out. For increasing the efficiency of compression of broadband broadcasting audio signals the variant of fractal compression method, which have been using in compression of images is offered.
In this paper, a new accelerating technique for content-based image retrieval is proposed, suitable for the Color and Edge Directivity Descriptor (CEDD). To date, the experimental results presented in the literature h...
详细信息
In this paper, a new accelerating technique for content-based image retrieval is proposed, suitable for the Color and Edge Directivity Descriptor (CEDD). To date, the experimental results presented in the literature have shown that the CEDD demonstrates high rates of successful retrieval in benchmark image databases. Although its storage requirements are minimal, only 54 bytes per image, the time required for the retrieval procedure may be practically too long when searching on large databases. The proposed technique utilizes the Binary Haar Wavelet transform in order to extract from the CEDD a smaller and more efficient descriptor, with a size of less than 2 bytes per image, speeding up retrieval from large image databases. This descriptor describes the CEDD, but not necessarily the image from which is extracted. The effectiveness of the proposed method is demonstrated through experiments performed with a known benchmark database.
This paper proposes a hybrid approximate pattern matching/transform-based compression engine. The idea is to use regular video interframe prediction as a pattern matching algorithm that can be applied to document codi...
详细信息
This paper proposes a hybrid approximate pattern matching/transform-based compression engine. The idea is to use regular video interframe prediction as a pattern matching algorithm that can be applied to document coding. We show that this interpretation may generate residual data that can be efficiently compressed by a transform-based encoder. The novelty of this approach is demonstrated by using H.264/AVC, the newest video compression standard, as a high quality book compressor. The proposed method uses segments of the originally independent scanned pages of a book to create a video sequence, which is encoded through regular H.264/AVC. Results show that the proposed method outperforms AVC-I (H.264/AVC operating in pure intra mode) and JPEG2000 by up to 4 dB and 7 dB, respectively. Superior subjective quality is also achieved.
In article questions of increasing of the efficiency of compression of video streams of TV images by codecs on a basis of wavelet transformations are considered, at the expense of application of an interframe differen...
详细信息
In article questions of increasing of the efficiency of compression of video streams of TV images by codecs on a basis of wavelet transformations are considered, at the expense of application of an interframe difference with indemnification of movement of blocks of the image experimental results of compression of images of the compensated interframe differences of various plots in relation to basic shots Are resulted.
By analyzing the relationship between the fore-scaling and post-scaling of the images' DC coefficients, this paper proposes a robust image watermarking arithmetic with scaling compatible in DCT domain. Hung togeth...
详细信息
By analyzing the relationship between the fore-scaling and post-scaling of the images' DC coefficients, this paper proposes a robust image watermarking arithmetic with scaling compatible in DCT domain. Hung together with the JPEG encoding course, this method embeds the watermark information into the DC coefficients after the discrete cosine transform and abstracts the corresponding information from the DC coefficients by dividing a content value at the detecting course. Experiment shows this arithmetic can detect the watermark well after the scaling operation, and it has a high detecting ratio in the normal image processing.
The goal of copy-move forgery detection is to find duplicated regions within the same image. Copy-move detection algorithms operate roughly as follows: extract blockwise feature vectors, find similar feature vectors, ...
详细信息
The goal of copy-move forgery detection is to find duplicated regions within the same image. Copy-move detection algorithms operate roughly as follows: extract blockwise feature vectors, find similar feature vectors, and select feature pairs that share highly similar shift vectors. This selection plays an important role in the suppression of false matches. However, when the copied region is additionally rotated or scaled, shift vectors are no longer the most appropriate selection technique. In this paper, we present a rotation-invariant selection method, which we call Same Affine transformation Selection (SATS). It shares the benefits of the shift vectors at an only slightly increased computational cost. As a byproduct, the proposed method explicitly recovers the parameters of the affine transformation applied to the copied region. We evaluate our approach on three recently proposed feature sets. Our experiments on ground truth data show that SATS outperforms shift vectors when the copied region is rotated, independent of the size of the image.
View synthesis using depth maps is a well-known technique for exploiting the redundancy between multi-view videos. In this paper, we deal with the bitrates of view synthesis at the decoder side of FTV that would use c...
详细信息
View synthesis using depth maps is a well-known technique for exploiting the redundancy between multi-view videos. In this paper, we deal with the bitrates of view synthesis at the decoder side of FTV that would use compressed depth maps and views. Both inherent depth estimation error and coding distortion would degrade synthesis quality. The focus is to reduce bitrates required for generating the high-quality virtual view. We employ a reliable view synthesis method which is compared with standard MPEG view synthesis software. The experimental results show that the bitrates required for synthesizing high-quality virtual view could be reduced by utilizing our enhanced view synthesis technique to improve the PSNR at medium bitrates.
The risk of copyright violation of multimedia data has increased due to the enormous growth of computer networks that provides fast and error free transmission of any unauthorized duplicate and possibly manipulated co...
详细信息
The risk of copyright violation of multimedia data has increased due to the enormous growth of computer networks that provides fast and error free transmission of any unauthorized duplicate and possibly manipulated copy of multimedia information. In order to be effective for copyright protection, digital watermark must be robust which are difficult to remove from the object in which they are embedded despite a variety of possible attacks. Several types of watermarking algorithms have been developed so far each of which has its own advantages and limitations. Among this recently Singular Value Decomposition (SVD) based watermarking has attracted researchers due to its simplicity and some attractive mathematical properties of SVD. SVD-DCT based watermarking given by Sverdlov has limitation to high angle rotation, large degree scaling. Also translation attack is not done. In proposed improved RST attacks invariant image watermarking based on joint SVD-DCT, a preprocessing step before the watermark extraction is proposed which makes the algorithm resilient to geometric attack i.e. RST attack. Performance of this watermarking scheme has been analyzed by evaluating the robustness of the algorithm against RST attacks and some other attacks. Experimental results have been compared with existing algorithm which seems to be promising.
暂无评论