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.
15872873
Reversible Data Hiding for 3D Point Cloud Model
This paper proposes a reversible data hiding scheme for 3D point cloud model. It exploits the high correlation among neighbor vertices to embed data. It starts with creating a set of 8-neighbor vertices clusters with randomly selected seed vertices. Then an 8-point integer DCT is performed on these clusters and an efficient highest frequency coefficient modification technique is employed to modulate the watermark bit. In data extraction, the modified clusters are retrieved first, and other operations are the inverse process of the data hiding. The original model can be perfectly recovered if it is intact. Our scheme is suitable for some specific applications where content accuracy of the original model must be guaranteed. Moreover, the method can be used for 3D point cloud model authentication, e.g., hiding a hash sequence.
41865724
Improved Image Coding with Classified VQ and Side-Match VQ
A new scheme for vector quantization (VQ) is proposed in this paper. We employ side-match and classified criteria for designing VQ codebooks to combat blocking effects induced from high compression rates, and then we use the proposed algorithm to improve the reconstructed image quality. Simulation results demonstrate the better image quality to compare with that produced from conventional schemes objectively and subjectively, at the cost of reasonable encoding complexity.
7975589
Layered access control schemes on watermarked scalable media
Intellectual property (IP) protection is a critical element in multimedia transmission and delivery systems. Conventional IP protection can be categorized into encryption and watermarking. In this paper, a structure to perform layered access control of scalable media by combining encryption and robust watermarking is proposed and implemented. By taking advantage of the nature of both encryption and watermarking, copyrights of multimedia content can be well protected. In the summated example, we assume a scalable transmission scheme over the broadcasting environment and test the effectiveness of the proposed method. The embedded watermark can be extracted with high confidence. Then, the next temporal-layer keys can be perfectly decrypted and reconstructed. Finally, the media contents are recovered and the copyrights are assured.
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
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.
11189498
On the spanning connectivity of graphs
Abstract A k-container C ( u , v ) of G between u and v is a set of k internally disjoint paths between u and v . A k -container C ( u , v ) of G is a k * - container if it contains all vertices of G . A graph G is k * - connected if there exists a k * -container between any two distinct vertices. The spanning connectivity of G , κ * ( G ) , is defined to be the largest integer k such that G is w * -connected for all 1 ⩽ w ⩽ k if G is a 1 * -connected graph. In this paper, we prove that κ * ( G ) ⩾ 2 δ ( G ) - n ( G ) + 2 if ( n ( G ) / 2 ) + 1 ⩽ δ ( G ) ⩽ n ( G ) - 2 . Furthermore, we prove that κ * ( G - T ) ⩾ 2 δ ( G ) - n ( G ) + 2 - | T | if T is a vertex subset with | T | ⩽ 2 δ ( G ) - n ( G ) - 1 .
15818599
Efficient Registration of 3D SPHARM Surfaces
We present SHREC, an efficient algorithm for registration of 3D SPHARM (spherical harmonic) surfaces. SHREC follows the iterative closest point (ICP) registration strategy, and alternately improves the surface correspondence and adjusts the object pose. It establishes the surface correspondence by aligning the underlying SPHARM parameterization. It employs a rotational property of the harmonic expansion to accelerate its step for parameterization rotation. It uses a hierarchical icosahedron approach to sample the rotation space and searches for the best parameterization that matches the template. Our experimental results show that SHREC can not only create more accurate registration than previous methods but also do it efficiently. SHREC is a simple, efficient and general registration method, and has a great potential to be used in many shape modeling and analysis applications.
205231250
The Universal Protein Resource (UniProt)
The ability to store and interconnect all available information on proteins is crucial to modern biological research. Accordingly, the Universal Protein Resource (UniProt) plays an increasingly important role by providing a stable, comprehensive, freely accessible central resource on protein sequences and functional annotation. UniProt is produced by the UniProt Consortium, formed in 2002 by the European Bioinformatics Institute (EBI), the Protein Information Resource (PIR) and the Swiss Institute of Bioinformatics (SIB). The core activities include manual curation of protein sequences assisted by computational analysis, sequence archiving, development of a user-friendly UniProt web site and the provision of additional value-added information through cross-references to other databases. UniProt is comprised of three major components, each optimized for different uses: the UniProt Archive, the UniProt Knowledgebase and the UniProt Reference Clusters. An additional component consisting of metagenomic and environmental sequences has recently been added to UniProt to ensure availability of such sequences in a timely fashion. UniProt is updated and distributed on a bi-weekly basis and can be accessed online for searches or download at .
1404678
SpliceInfo: an information repository for mRNA alternative splicing in human genome
We have developed an information repository named SpliceInfo to collect the occurrences of the four major alternative-splicing (AS) modes in human genome; these include exon skipping, 5′-alternative splicing, 3′-alternative splicing and intron retention. The dataset is derived by comparing the nucleotide and protein sequences available for a given gene for evidence of AS. Additional features such as the tissue specificity of the mRNA, the protein domain contained by exons, the GC-ratio of exons, the repeats contained within the exons, and the Gene Ontology are annotated computationally for each exonic region that is alternatively spliced. Motivated by a previous investigation of AS-related motifs such as exonic splicing enhancer and exonic splicing silencer, this resource also provides a means of identifying motifs candidates and this should help to identify potential regulatory mechanisms within a particular exonic sequence set and its two flanking intronic sequence sets. This is carried out using motif discovery tools to identify motif candidates related to alternative splicing regulation and together with a secondary structure prediction tool, will help in the identification of the structural properties of such regulatory motifs. The integrated resource is now available on http://SpliceInfo.mbc.NCTU.edu.tw/.
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.