-
[show abstract]
[hide abstract]
ABSTRACT: Transmission power optimization is the most significant factor in prolonging the lifetime and maintaining the connection quality of wireless sensor networks. Un-optimized transmission power of nodes either interferes with or fails to link neighboring nodes. The optimization of transmission power depends on the expected node degree and node distribution. In this study, an optimization approach to an energy-efficient and full reachability wireless sensor network is proposed. In the proposed approach, an adjustment model of the transmission range with a minimum node degree is proposed that focuses on topology control and optimization of the transmission range according to node degree and node density. The model adjusts the tradeoff between energy efficiency and full reachability to obtain an ideal transmission range. In addition, connectivity and reachability are used as performance indices to evaluate the connection quality of a network. The two indices are compared to demonstrate the practicability of framework through simulation results. Furthermore, the relationship between the indices under the conditions of various node degrees is analyzed to generalize the characteristics of node densities. The research results on the reliability and feasibility of the proposed approach will benefit the future real deployments.
Sensors 01/2013; 13(3):3951-74. · 1.74 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper we proposed a dynamic bandwidth detection scheme to adaptively switch the transportation quality of video streaming. Also an IPTV service system with a Video on Demand and Live video broadcast system is implemented to examine the performance of the dynamic bandwidth scheme. The result shows that it can adapt to the network environment to provide an appropriate video quality without suffering high delay or interruption.
Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on; 01/2011
-
7th International Conference on Information Assurance and Security, IAS 2011, Melacca, Malaysia, December 5-8, 2011; 01/2011
-
Inf. Sci. 01/2011; 181:3379-3396.
-
Third International Conference on Intelligent Human Computer Interaction, Prague, Poland; 01/2011
-
Computational Collective Intelligence. Technologies and Applications - Second International Conference, ICCCI 2010, Kaohsiung, Taiwan, November 10-12, 2010, Proceedings, Part II; 01/2010
-
Computational Collective Intelligence. Technologies and Applications - Second International Conference, ICCCI 2010, Kaohsiung, Taiwan, November 10-12, 2010. Proceedings, Part I; 01/2010
-
[show abstract]
[hide abstract]
ABSTRACT: A hybrid optimization algorithm based on Cat Swarm Optimization (CSO) and Artificial Bee Colony (ABC) is proposed in this
chapter. CSO is an optimization algorithm designed to solve numerical optimization problems, and ABC is an optimization algorithm
generated by simulating the behavior of bees finding foods. By hybridizing these two algorithms, the hybrid algorithm called
Hybrid PCSOABC is presented. Five benchmark functions are used to evaluate the accuracy, convergence, the speed, and the stabilization
of the Hybrid PCSOABC. In this chapter, the literature review regarding CSO, AS, ACS, BF, PSO, ABC, and the parallel version
of CSO are given at the beginning. The proposed hybrid framework combining different algorithms is given in the fourth section.
And the experimental results are presented at the end of the chapter with the conclusions.
12/2009: pages 421-449;
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, we propose a novel scheme of data hiding for halftone image which is extended from Fu and Oscar's DHSPT method (data hiding smart pair toggling), it is named as DHADPT (data hiding by absolute difference pair toggling). In this method, we embed the binary data into the halftone image with reference to the original multitone image by evaluating the absolute difference between the neighboring gray-level pixels. The location with minimum sum of the absolute differences of the eight neighboring locations will be the candidate to hide bit data. Experimental results prove its superiority to the original DHSPT method (with higher modified peak signal-to-noise ratio [MPSNR]).
Intelligent Information Hiding and Multimedia Signal Processing, 2008. IIHMSP '08 International Conference on; 09/2008
-
[show abstract]
[hide abstract]
ABSTRACT: The rising recognition rate is prominent in the rapid development of face recognition. However, much information shows that illumination, expression, and disguise are still a challenge needed to be conquered. In this paper, we propose an algorithm which could decrease the effect of illumination. We use Sobel as preprocess and median filtering to promote the accuracy of covariance matrix. After that, eigen value and vectors are calculated. Finally, we use eigen vectors to project the Sobel face into Eigen face. We use ORL and YALE databases to test the algorithm. The experiment show that our algorithm has better result than PCA, 2DPCA, and LDA, especially in YALE database.
Intelligent Information Hiding and Multimedia Signal Processing, 2008. IIHMSP '08 International Conference on; 09/2008
-
[show abstract]
[hide abstract]
ABSTRACT: We investigate a parallel structure of cat swarm optimization (CSO) in this paper, and we call it parallel cat swarm optimization (PCSO). In the experiments, we compare particle swarm optimization (PSO) with CSO and PCSO. The experimental results indicate that both CSO and PCSO perform well. Moreover, PCSO is an effective scheme to improve the convergent speed of cat swarm optimization in case the population size is small and the whole iteration is less.
Machine Learning and Cybernetics, 2008 International Conference on; 08/2008
-
[show abstract]
[hide abstract]
ABSTRACT: The partitioning or clustering method is an important research branch in data mining area, and it partitions the dataset into an arbitrary number k of clusters according to the correlation attribute of all elements of the dataset. Most datasets have the original clusters number, which is estimated with cluster validity index. But most current cluster validity index methods give the error estimation for most real datasets. In order to solve this problem, this paper applies the optimization technology of genetic algorithm to the new adaptive cluster validity index, which is called the gene index (GI). The algorithm applies genetic algorithm to adjust the weight value of the valuation function of adaptive cluster validity index to train an optimal cluster validity index. The algorithm is tested with many real datasets, and results show the proposed algorithm can give higher performance and accurately estimate the original cluster number of real datasets compared with the current cluster validity index methods.
Intelligent Information Hiding and Multimedia Signal Processing, 2007. IIHMSP 2007. Third International Conference on; 12/2007
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, we proposed a parity modulation based digital image watermarking scheme in DWT domain, focusing on resisting cropping attack. The watermark embedded the LI<sub>3</sub>, subband coefficients of DWT by the parity modulation method. Experimental results show that the proposed watermarking method can resist not only cropping attack, but also some common signal processing attacks, such as JPEG compression, Gaussian noise, and filtering etc.
Innovative Computing, Information and Control, 2007. ICICIC '07. Second International Conference on; 10/2007
-
[show abstract]
[hide abstract]
ABSTRACT: Visible watermarking is a technique to embed a perceivable image in a host image for copyright protection. Existing visible watermarking methods mainly concern about continuous-tone images, however, few attention is paid to two-tone images. This paper proposes a visible watermarking scheme for halftone images called joint halftoning and visible watermarking (JHVW). JHVW embeds data during halftoning, namely the host image is a continuous-tone image and the watermarked image is a halftone image. The watermarked halftone image contains recognizable but unobtrusive watermark information, and the details of the host image still be maintained. Our schemes can be used in applications such as in advertisement or as a restriction.
Intelligent Information Hiding and Multimedia Signal Processing, 2006. IIH-MSP '06. International Conference on; 01/2007
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, a robust VQ-based digital image watermarking scheme for Fritchman channel model is proposed. Before transmission, a novel VQ-based watermarking scheme with genetic codebook partition is adopted to get higher PSNR values between the original and watermarked images, and then the genetic algorithm is adopted to jointly optimize the channel distortion and the bit-correct-rate of the extracted watermarks. The performance comparison of IA for BSC model and Fritchman model is presented, the simulation results also show that the genetic algorithm based jointly optimized method is effective.
Systems, Man and Cybernetics, 2006. SMC '06. IEEE International Conference on; 11/2006
-
[show abstract]
[hide abstract]
ABSTRACT: Digital watermarking had been well recognized as an effective measure for the copyright protection of multimedia data. Numerous schemes in the domain of vector quantization had been proposed to achieve the desired goal. A new scheme, also in the domain of vector quantization, is developed and presented in this article. The proposed approach use genetic algorithms to reassign the indices of code words. As a result, embedded information is diffused more evenly across the image to be protected, and therefore possible security leakage can be avoided. Experimental results reveal that the proposed scheme is free from the potential limitations in previous approaches, while maintaining the robustness against various kinds of attacks
Innovative Computing, Information and Control, 2006. ICICIC '06. First International Conference on; 10/2006
-
[show abstract]
[hide abstract]
ABSTRACT: Subspace analysis is an effective technique for feature extraction, which aims at finding a low-dimensional space of high-dimensional data. In this paper, a novel subspace analysis method based on data-dependent kernel discriminant analysis (DDKDA) is proposed for dimension reduction. The procedure of DDKDA contains two stages: one is to find the optimal combination coefficients by solving a constrained optimization function which transformed to an eigenvalue problem; other is to implement KDA under the optimal data-dependent kernel with Fisher criterion. DDKDA is more adaptive to the input data than KDA owing to the optimization of projection from input space to feature space with the data-dependent kernel, which enhances the performance of KDA. Experiments on the ORL and Yale face databases demonstrate the good performance of the proposed algorithm
Information Acquisition, 2006 IEEE International Conference on; 09/2006
-
[show abstract]
[hide abstract]
ABSTRACT: This work presents an image watermarking method for two purposes: one is to notify the copyright owner with a visible watermark, and the other is to protect the copyright with an invisible watermark. These two watermarks are embedded in different domains with different techniques. An innovative watermarking scheme based on tabu search (TS) algorithms in both the spatial domain and the transform domain is proposed. The fidelity performance of an existing image watermarking scheme is enhanced through the TS optimization. The experimental results show that the proposed techniques can improve the degraded image quality greatly. Simulation results show that the proposed method may improve the PSNR for embedding the visible watermark and enhance the robustness of the invisible watermark.
Circuits and Systems, 2004. Proceedings. The 2004 IEEE Asia-Pacific Conference on; 01/2005
-
Knowledge-Based Intelligent Information and Engineering Systems, 9th International Conference, KES 2005, Melbourne, Australia, September 14-16, 2005, Proceedings, Part II; 01/2005
-
[show abstract]
[hide abstract]
ABSTRACT: Vector quantization (VQ) has been distinguished for its high compression rate in lossy data compression applications. And VQ-based watermarking plays a newly developed branch in digital watermarking research fields. In this paper, we propose optimized schemes for VQ-based image watermarking. We overcome the VQ index assignment problem with genetic algorithm, which is suitable for transmitting the watermarked image over noisy channels. We obtain better robustness of the watermarking algorithm against the effects caused by channel noise in our simulations after inspecting the results from several test images. In addition, to compare with existing schemes in literature, the watermarked image quality in our scheme has approximately the same quality, with better performance in robustness, to the schemes proposed by other researchers. This also proves the effectiveness of our proposed schemes in VQ-based image watermarking for copyright protection.
Circuits and Systems, 2004. ISCAS '04. Proceedings of the 2004 International Symposium on; 06/2004
