38419730
Combined Encryption and Watermarking Approaches for Scalable Multimedia Coding
Intellectual Property (IP) protection is a critical element in a multimedia transmission system. Conventional IP protection schemes can be categorized into two major branches: encryption and watermarking. In this paper, a structure to perform layered access protection by combining encryption and robust watermarking is proposed and implemented. By taking advantage of the nature of cryptographic schemes and digital watermarking, the copyright of multimedia contents can be well protected. We adopt the scalable transmission method over the broadcasting environment. The embedded watermark can be thus extracted with high confidence. Then, the next-layer secrets can be perfectly decrypted and reconstructed. Finally, the media contents are recovered.
7106859
Vector quantization based on genetic simulated annealing
Genetic algorithm (GA) has been successfully applied to codebook design for vector quantization (VQ). However, most conventional GA-based codebook design methods need long runtime because candidate solutions must be "ne tuned by LBG. In this paper, a partition-based GA is applied to codebook design, which is referred to as genetic vector quantization (GVQ). In addition, simulated annealing (SA) algorithm is also used in GVQ to get more promising results and the corresponding method is referred to as GSAVQ. Both GVQ and GSAVQ use the linear scaling technique during the calculation of objective functions and use special crossover and mutation operations in order to obtain better codebooks in much shorter CPU time. Experimental results show that both of them save more than 71}87% CPU time compared to LBG. For di!erent codebook sizes, GVQ outperforms LBG by 1.1}2.1 dB in PSNR, and GSAVQ outperforms LBG by 1.2}2.2 dB in PSNR. In addition, GVQ and GSAVQ need a little longer CPU time than, the maximum decent (MD) algorithm, but they outperform MD by 0.2}0.5 dB in PSNR. 2001 Elsevier Science B.V. All rights reserved.
13572740
Image Texture Segmentation with Ant Colony Systems
A new scheme for texture segmentation based on ant colony systems (ACS) is proposed in this paper. Texture segmentation is one of the important branches in image pattern recognition, which provides usefulness in many applications. Until now, how to find an effective way for accomplishing texture segmentation in practical applications is still a major task. In this paper, we employ wavelet coefficients and characteristics of different subbands to serve as the basis of characteristic vectors, and we use three feature-extraction elements, namely, the extrema, entropy, and energy, to compose the characteristic vector. To alleviate segmentation fragments caused from the information in high frequency bands of texture images, we integrate the fourth element, the mean variance, into the characteristic vector. Finally, we use ACS to find a trade-off between texture segmentation and fragments. Simulation results demonstrate the effectiveness and practicability of the proposed algorithm
45740416
Automated Information Mining on Multimedia TV News Archives
This paper addresses an integrated information mining techniques for multimedia TV-news archive. The utilizes techniques from the fields of acoustic, image, and video analysis, for information retrieval on news story title, newsman and scene identification. The goal is to construct a compact yet meaningful abstraction of broadcast news video, allowing users to browse through large amounts of data in a non-linear fashion with flexibility and efficiency. By using acoustic analysis, the system can classify video into news versus commercials, with 90% accuracy on a data set of 400 hours TV-news recorded off the air from July 2003 to August of 2004. By applying speaker identification and/or image detection techniques, each news stories can be segmented with an accuracy of 96%. On screen captions or subtitles are recognized by OCR techniques to produce the text title of each news stories. The extracted title words can be used to link or to navigate more related News contents on the WWW. In cooperation with facial and scene analysis and recognition techniques, OCR results can provide users with multimodality query for specific news stories. Some experimental results are presented and discussed for the system reliability and performance evaluation and comparison.
35266077
VQ-Based Gray Watermark Hiding Scheme and Genetic Index Assignment
A vector quantisation (VQ) based watermarking scheme for hiding the gray watermark is presented. It expands the watermark size, and employs VQ index assignment procedure with genetic algorithm, called genetic index assignment (GIA), for watermarking. The gray watermark is coded by VQ, and obtained indices are translated into a binary bitstream with a much smaller size. We partition the codebook into two sub-codebooks, and use either one of them based on the value of the bit for embedding. Next, GIA is employed to find better imperceptibility of watermarked image. Experimental results show that the proposed method possesses advantages over other related methods in literature.
10859494
Adaptive watermarking using relationships between wavelet coefficients
We propose an approach that hides watermarks in relationships between wavelet coefficients. This approach minimizes the perceptual distortion of watermarked images, measured by PSNR or just noticeable distortion (JND). Therefore, the strength of watermarks can be enlarged to increase the robustness of the watermarks, while keeping the quality of watermarked images visually acceptable. Experimental results show that the watermark is still detectable after common image processing operations such as JPEG compression, Gaussian filtering and sharpening.
12419359
Primer design for multiplex PCR using a genetic algorithm
Multiplex Polymerase Chain Reaction (PCR) experiments are used for amplifying several segments of the target DNA simultaneously and thereby to conserve template DNA, reduce the experimental time, and minimize the experimental expense. The success of the experiment is dependent on primer design. However, this can be a dreary task as there are many constrains such as melting temperatures, primer length, GC content and complementarity that need to be optimized to obtain a good PCR product. Motivated by the lack of primer design tools for multiplex PCR genotypic assay, we propose a multiplex PCR primer design tool using a genetic algorithm, which is a stochastic approach based on the concept of biological evolution, biological genetics and genetic operations on chromosomes, to find an optimal selection of primer pairs for multiplex PCR experiments. The presented experimental results indicate that the proposed algorithm is capable of finding a series of primer pairs that obeies the design properties in the same tube.
21610257
Physical-layer design for next-generation cellular wireless systems
The conventional cellular architecture will remain an integral part of next-generation wireless systems, providing high-speed packet data services directly to mobile users and also backhaul service for local area networks. In this paper, we present several proposals addressing the challenges associated with the critical design issues for the next-generation cellular wireless physical layer. These proposals include an orthogonal frequency division multiplexed (OFDM) or multicarrier code division multiple access (MC-CDMA) air interface for wide channel bandwidths, considerations for resource allocation, multiple antenna techniques, a hybrid duplexing technique combining the benefits of time division and frequency division duplexing, and coordinated networks for reducing intercell interference and increasing overall spectral efficiency.
635773
Surface Alignment of 3D Spherical Harmonic Models: Application to Cardiac MRI Analysis
The spherical harmonic (SPHARM) description is a powerful surface modeling technique that can model arbitrarily shaped but simply connected 3D objects and has been used in many applications in medical imaging. Previous SPHARM techniques use the first order ellipsoid for establishing surface correspondence and aligning objects. However, this first order information may not be sufficient in many cases; a more general method for establishing surface correspondence would be to minimize the mean squared distance between two corresponding surfaces. In this paper, a new surface matching algorithm is proposed for 3D SPHARM models to achieve this goal. This algorithm employs a useful rotational property of spherical harmonic basis functions for a fast implementation. Applications of medical image analysis (e.g., spatio-temporal modeling of heart shape changes) are used to demonstrate this approach. Theoretical proofs and experimental results show that our approach is an accurate and flexible surface correspondence alignment method.
3010311
On the spanning w-wide diameter of the star graph
Let u and v be any two distinct nodes of an undirected graph G, which is k -connected. A container C(u, v ) between u and v is a set of internally disjoint paths {P1, P2, . . . , Pw } between u and v where 1 ≤ w ≤ k . The width of C(u, v ) is w and the length of C(u, v ) {written as l [C(u, v )]} is max{l (Pi ) | 1 ≤ i ≤ w }. A w -container C(u, v ) is a container with width w . The w -wide distance between u and v , dw (u, v ), is min{l (C(u, v )) | C(u, v ) is a w -container}. A w -container C(u, v ) of the graph G is a w ∗-container if every node of G is incident with a path in C(u, v ). That means that the w -container C(u, v ) spans the whole graph. Let Sn be the n-dimensional star graph with n ≥ 5. It is known that Sn is bipartite. In this article, we show that, for any pair of distinct nodes u and v in different partite sets of Sn , there exists an (n − 1)∗-container C(u, v ) and the (n − 1)-wide distance d(n−1)(u, v ) is less than or equal to n! n−2 + 1. In addition, we also show the existence of a 2∗-container C(u, v ) and the 2-wide distance d2(u, v ) is bounded above by n! 2 + 1. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(4), 235–249 2006
5664354
Association analysis with one scan of databases
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves better performance and efficiency than Apriori-like algorithms. However the database still needs to be scanned twice to get the FP-tree. This can be very time-consuming when new data are added to an existing database because two scans may be needed for not only the new data but also the existing data. This paper presents a new data structure P-tree, Pattern Tree, and a new technique, which can get the P-tree through only one scan of the database and can obtain the corresponding FP-tree with a specified support threshold. Updating a P-tree with new data needs one scan of the new data only, and the existing data do not need to be re-scanned.