Applied Mechanics and Materials Vols. 321-324

Paper Title Page

Abstract: The encryption is not be able to protect intellectual properties of audio file completely. Therefore, a technique of audio watermarking is launched to improve the previous technique of the protection. In this paper, we analysis and implements a system that be able to protect a copyright of an audio file by using wavelet-SVD based on watermarking Approach. IWT-SVD produces the best rate of inaudibility compared with DCT-SVD and DWT-SVD, but total processing time of watermarking using DWT-SVD is faster than others.
1191
Abstract: In order to improve the performance of muti-digital rights protection, a multiple watermarking algorithm based on Discrete Cosine Transform (DCT) and spread-spectrum technique is proposed. First, the host image is divided into subblock and each block is manipulated by DCT. Second, two watermarks are encrypted by Arnold scrambling. Third, the watermarks are modulated by by utilizing two kinds of strategies, and then are embedded in middle frequency coefficients of DCT domain. Experimental results show that the proposed algorithm is efficient to resist traditional signal processing attacks and has better security and robustness, higher capacity.
1196
Abstract: Moving human detection and tracking are challenging tasks in computer vision. Human motion is usually non-linear and non-Gaussian, and thus many common algorithms are not appropriate for tracking. In this paper we propose a robust tracking algorithm based on particle filter. Multiple moving human in a video sequence are detected using frame difference and morphological operation. Then feature points of every person are extracted using a Harris Corner detection algorithm. Finally, Histogram of Oriented Gradient (HOG) is calculated for each feature point and feature points of the corresponding person are tracked using particle filter. Experimental results demonstrate that our method is efficient to improve the performance of tracking.
1200
Abstract: To resolve QoS problem in video conference system, a kind of architecture for video conference system was designed, which combined centralized signaling based on SIP with media transport based on P2P. In addition, an improved quantum genetic algorithm was used to solve the multipath routing selection problem. The method broke the shackles of the single-path transmission and adopted multipath transmission mechanism, not only avoiding the underlying network routing errors but effectively improving the reliability of the media transmission.
1205
Abstract: A web replay method is proposed in this paper for highlights in soccer videos. Firstly, automatically detection and fine-grained semantic annotation are introduced for soccer highlights. Secondly, an adaptive grass color model and several heuristic rules are used to improve the performance of the method. Finally, a database for highlights is established for web service. Experimental results show that the proposed method has excellent analyzing speed, accuracy and practicability.
1209
Abstract: In HV segmentationthe IFS records the compression transform parameters which reflect thecross-scale redundancy features between different regions of a natural imageand have better adaptability. This paper proposed a new image fast fractalencoding method based on HV Segmentation, and brings forward the Similarityjudgment formula. This method significantly improved the retrieval effect withdecoding quality assurance. The experimentation shows the accurate-completeretrieval rating of this method is obviously superior to the color histogrammethod.
1213
Abstract: In order to improve the compression performance of Bayer CFA images exposed continuously, a new high performance remainder set near-lossless compression method is presented. Based on channel-separated-filtering, several typical Bayer CFA image compression methods are compared with the proposed remainder set algorithm. It is proved that the remainder set algorithm has not only the better compression performance, i.e., the lower bits per pixel (average about 2.16bpp), but also the better reconstructed CFA image PSNR (average about 52.31dB). Finally, the proposed method is employed in a multiple channel CMOS image sampling system and some test results are given.
1219
Abstract: In order to overcome the shortcomings that GVF model is susceptible to structures with slender topology, an improved watershed algorithm is proposed to determine initial contour of GVF Snake model. The organs in medical CT images often were irregular and had deep boundary concavities, and CT serial images were up to hundreds pieces. Firstly, in a CT image the improved watershed algorithm grows an organ from a seed block by the principle of the similarity between gray scale and texture, then using its edge as the start contour of the adjacent CT sequence, with GVF algorithm segment the organ from a sequence of images, the process is repeated until get all slices of the entire abdomen. Experiment results which are the basic of 3-D reconstruction and cancer detection show that the new contour initialization algorithm can obtain segmentation result efficiently, accurately and cost less time.
1225
Abstract: An algorithm of adaptive video denoising base on spatio-temporal combination is demonstrated. The adaptive threshold function is obtained through unary linear regression analysis combining interval estimation and hypothesis test. By motion detection to multi-frame images, still regions and motion regions of video image are distinguished through the adaptive threshold. Temporal weighted average filter to the still regions and spatial ANL filter to the motion regions are used separately. Experimental results show that the proposed algorithm works well.
1230
Abstract: It has been well accepted that compression is essential to the real-time visualization of large-terrain elevation data. To achieve efficient performance, a terrain compression method featuring high decoding speed is proposed in this paper. A combined prediction scheme is applied in the prediction stage. Golomb-Rice coding is then used to encode the residuals after the prediction stage. The style of the codeword is tailored to make the decoding process amenable to a GPU implementation. Then batching is used to further improve the decoding speed. The proposed method is easy to implement and simple to integrate into existing systems. Experiments show that the compression rate is better than PNG. In terms of decompression efficiency, this method archives a decoding speed of over 5.8 Gpix/s, which is much faster than most existing systems.
1234

Showing 241 to 250 of 610 Paper Titles