14443677
An Embedding Algorithm for Multiple Watermarks
A new algorithm for embedding several watermarks into the same original source is proposed in this paper. Instead of conventional watermark embedding algorithms that embed one watermark in one specific domain, we propose algorithms for embedding multiple watermarks into different compression domains to protect the ownership of the original images. The proposed schemes for embedding and extraction in different domains vary from the existing methods reported in the literature. Simulation results show their robustness for surviving intentional attacks and, hence, their effectiveness in protecting copyrights. They are also easy to implement.
18319018
A Multiple-Instance Neural Networks based Image Content Retrieval System
In this paper, we proposed a multiple-instance neural network (MINN) for content-based image retrieval (CBIR). In order to represent the rich content of an image without precisely image segmentation, the image retrieval problem is considered as a multiple-instance learning problem. A set of exemplar images are selected by a user, each of which is labelled as conceptual related (positive) or conceptual unrelated (negative) image. Then, the proposed MINN is trained by using the proposed learning algorithm to learn the user's preferred image concept from the positive and negative examples. Experimental results show that: (1) without image segmentation and using only the color histogram as the image feature, the MINN without relevance feedback performs slightly inferior to some leading image retrieval methods, and (2) the MINN with the relevance feedback can significantly improve the retrieving performance from 40.3% to 59.3%, which outperforms to the results of some leading image retrieval methods
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.
16432489
Genetic watermarking based on transform-domain techniques
Abstract An innovative watermarking scheme based on genetic algorithms (GA) in the transform domain is proposed. It is robust against watermarking attacks, which are commonly employed in the literature. In addition, the watermarked image quality is also considered. In this paper, we employ GA for optimizing both the fundamentally conflicting requirements. Watermarking with GA is easy for implementation. We also examine the effectiveness of our scheme by checking the fitness function in GA, which includes both factors related to robustness and invisibility. Simulation results also show both the robustness under attacks, and the improvement in watermarked image quality with GA.
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
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.
7391844
Database of repetitive elements in complete genomes and data mining using transcription factor binding sites
Approximately 43% of the human genome is occupied by repetitive elements. Even more, around 51% of the rice genome is occupied by repetitive elements. The analysis presented here indicates that repetitive elements in complete genomes may have been very important in the evolutionary genomics. In this study, a database, called the Repeat Sequence Database, is first designed and implemented to store complete and comprehensive repetitive sequences. See http://rsdb.csie.ncu.edu.tw for more information. The database contains direct, inverted and palindromic repetitive sequences, and each repetitive sequence has a variable length ranging from seven to many hundred nucleotides. The repetitive sequences in the database are explored using a mathematical algorithm to mine rules on how combinations of individual binding sites are distributed among repetitive sequences in the database. Combinations of transcription factor binding sites in the repetitive sequences are obtained and then data mining techniques are applied to mine association rules from these combinations. The discovered associations are further pruned to remove insignificant associations and obtain a set of associations. The mined association rules facilitate efforts to identify gene classes regulated by similar mechanisms and accurately predict regulatory elements. Experiments are performed on several genomes including C. elegans, human chromosome 22, and yeast.
7951451
A New Test System for Stability Measurement of Marker Gene Selection in DNA Microarray Data Analysis
Microarray gene expression data contains informative features that reflect the critical processes controlling prominent biological functions. Feature selection algorithms have been used in previous biomedical research to find the “marker” genes whose expression value change corresponds to the most eminent difference between specimen classes. One problem encountered in such analysis is the imbalance between very large numbers of genes versus relatively fewer specimen samples. A common concern, therefore, is “overfitting” the data and deriving a set of marker genes with low stability over the entire set of possible specimens. To address this problem, we propose a new test environment in which synthetic data is perturbed to simulate possible variations in gene expression values. The goal is for the generated data to have appropriate properties that match natural data, and that are appropriate for use in testing the sensitivity of feature selection algorithms and validating the robustness of selected marker genes. In this paper, we evaluate a statistically-based resampling approach and a Principal Components Analysis (PCA)-based linear noise distribution approach. Our results show that both methods generate reasonable synthetic data and that the signal/noise rate (with variation weights at 5%, 10%, 20% and 30%) measurably impacts the classification accuracy and the marker genes selected. Based on these results, we identify the most appropriate marker gene selection and classification techniques for each type and level of noise we modeled.
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.
2981642
Placement of wavelength converters for minimal wavelength usage in WDM networks
An important goal of the design of WDM (wavelength division multiplexing) networks is to use less wavelengths to serve more communication needs. According to the wavelength conflict rule, we know that the number of wavelengths required in a WDM network is at least equal to the maximal number of channels over a fiber (called maximal link load) in the network. By placing wavelength converters at some nodes in the network, the number of wavelengths needed can be made equal to the maximal link load. In this paper we study the problem of placing the minimal number of converters in a network to achieve that the number of wavelengths in use is equal to the maximal link load. For duplex communication channels, we prove that an optimal solution can be obtained in polynomial-time. For unidirectional communication channels, which was proved to be NP-complete, we develop a set of lemmas which lead to an efficient approximation algorithm whose approximation ratio is two.
18861193
An agent-based system to discover protein-protein interactions, identify protein complexes and proteins with multiple peptide mass fingerprints
Proteins "work together" by actually binding to form multicomponent complexes that carry out specific functions. Proteomic analyses based on the mass spectrum are now key methods to determine the components in protein complexes. The protein-protein interaction or functional association may be known to exist among the extracted protein spots while analyzing the proteins on the 2D gel. In this study, we develop an agent-based system, namely AgentMultiProtIdent, which integrated two protein identification tools and a variety of databases storing relations among proteins and used to discover protein-protein interactions and protein functional associations, and identify protein complexes and proteins with multiple peptide mass fingerprints as input. The system takes Multiple Peptide Mass Fingerprints (PMFs) as a whole in the protein complex or protein identification. With the relations among proteins, it may greatly improve the accuracy of identification of protein complexes. Also, possible relationship of the multiple peptide mass fingerprints, such as ontology relation, can be discovered by our system, especially in the identification of protein complexes. The agent-based system is now available on the Web at http://dbms104.csie.ncu.edu.tw/ approximately protein/NEW2/.