Abstract The data hiding technique is used to hide a secret message into a cover image which is then sent to a receiver without raising any suspicions. With a reversible (lossless) data hiding method, a receiver can extract a secret message and exactly restore an original cover image from an embedded image. This paper presents a novel reversible data embedding scheme... The data hiding technique is used to hide a secret message into a cover image which is then sent to a receiver without raising any suspicions. With a reversible (lossless) data hiding method, a receiver can extract a secret message and exactly restore an original cover image from an embedded image. This paper presents a novel reversible data embedding scheme for color images. The proposed scheme mostly embeds two secret bits into one cover pixel by replacing the cover pixel with its permutation whose Euclidean distance is closest to the cover pixel. The experimental results show that the proposed scheme can achieve a high embedding rate while maintaining the visual quality of stego color images in comparison with other methods Read More Read Less

Abstract We address a new class of Information hiding on lossless data compression. In our model, secret information is embedded into a compressed data (e.g. ZIP) in a way that the compressed data can still be decompressed by regular decompression process (e.g. UNZIP). The entity with secret key can extract the secret information from the compressed data. In this paper, we... We address a new class of Information hiding on lossless data compression. In our model, secret information is embedded into a compressed data (e.g. ZIP) in a way that the compressed data can still be decompressed by regular decompression process (e.g. UNZIP). The entity with secret key can extract the secret information from the compressed data. In this paper, we formally define the above model of information hiding on lossless data compression. Then, we focus on a particular compression method, namely LZSS, which is used in ZIP/LHA. We propose a new method, called IH-LZSS, which controls the trade-off between the maximum embeddable data size and compression rate. Some experimental results are also shown. Read More Read Less

Abstract For the watermarking technique, which embeds the watermark in the dc components of the discrete cosine transform (DCT) based image using the method presented by Huang et al. [1], we present two methods to remove the watermark from the carrier image. In our first method, it removes the watermark via varying the energies in the transform domain and redeeming the... For the watermarking technique, which embeds the watermark in the dc components of the discrete cosine transform (DCT) based image using the method presented by Huang et al. [1], we present two methods to remove the watermark from the carrier image. In our first method, it removes the watermark via varying the energies in the transform domain and redeeming the luminance in the spatial domain. And in the second method, it removes the watermark through diversifying the intensity of dc components in the transform domain. These two methods both can remove the watermark and pass the watermark detection as the images without hidden watermarks. In addition, though we remove the watermark from the watermarked image, the peak signal-to-noise ratio (PSNR) of the cleaned image, in comparison with the original carrier image, is still high. Read More Read Less

Abstract In recent literature, the issue of biometric template protection was raised. Some schemes were proposed to solve the contradiction between the fuzzy biometric information and accurate cryptography functions to achieve the protection of biometric template via cryptography method. In this paper, a novel methodology to achieve the security of the biometric templates in biometric systems is proposed. An adaptive non-uniform... In recent literature, the issue of biometric template protection was raised. Some schemes were proposed to solve the contradiction between the fuzzy biometric information and accurate cryptography functions to achieve the protection of biometric template via cryptography method. In this paper, a novel methodology to achieve the security of the biometric templates in biometric systems is proposed. An adaptive non-uniform quantization (ANUQ) algorithm is introduced to eliminate the contradiction between the fuzziness of the biometric information and the sensitive of the Hash function. The ANUQ algorithm maps different biometric feature vectors from the same individual to a unique quantized feature vector. Then the quantized feature vector can be saved and identified by its hash and the biometric system can be free from the risk of the leakage of users’ privacy information. Based on the ANUQ algorithm, two biometric template protection scheme are designed to meet different applications. Scheme-I involved a single quantizing template while scheme-II use a quantizing template array. The comparison of the two schemes are raised. Further, the testing of these schemes are carried out on an iris recognition algorithm. The results show the feasibility of the ANUQ-based schem Read More Read Less

Abstract In this work, the frame-layer bit allocation problem is studied for H.264 video. We first impose a GOP (Group of Pictures) structure on the underlying H.264 video, and then develop a two-pass rate control algorithm based on the Lagrange optimization framework. The proposed algorithm estimates the rates and the distortions of all frames in a GOP by preencoding them using... In this work, the frame-layer bit allocation problem is studied for H.264 video. We first impose a GOP (Group of Pictures) structure on the underlying H.264 video, and then develop a two-pass rate control algorithm based on the Lagrange optimization framework. The proposed algorithm estimates the rates and the distortions of all frames in a GOP by preencoding them using a constant quantization parameter (QP) in the first pass. The target number of bits of each frame is determined by searching the Lagrange multiplier that meets the bit budget constraint for the GOP. The proposed algorithm is useful for nonconversational applications such as video streaming where video sources can be encoded off-line. Experimental results demonstrate that the proposed algorithm achieves substantially higher picture quality than the rate control algorithm in the H.264 reference encoder. Read More Read Less

Abstract In this paper, we discuss a method of splitting one audio stream into two equal-quality streams and recover the original audio stream from only one of the split streams. From a mathematical consideration, it is found that the sum of errors of two recovered signals is equal to the power of the original signal if simple recovery is carried out.... In this paper, we discuss a method of splitting one audio stream into two equal-quality streams and recover the original audio stream from only one of the split streams. From a mathematical consideration, it is found that the sum of errors of two recovered signals is equal to the power of the original signal if simple recovery is carried out. Next, we describe the optimum recovery transform. This method utilizes the covariance matrix of the signal to minimize the error of the recovered signal. We carried out several experiments to recover a signal from one of the split signals. The result showed that the optimum recovery transform gave better results than the simple recovery, while the best splitting transform differed according to the signal to be processed. Read More Read Less

Abstract The paper presents a smoke-detection method for early fire-alarming system based on video processing. The basic strategy of smoke-pixel judgment is composed of two decision functions: a chromaticitybased decision function in static characteristic and a diffusion-based decision function in dynamic characteristic. The chromatic decision rule is deduced by grayish color of smoke and the dynamic decision rule is dependent on... The paper presents a smoke-detection method for early fire-alarming system based on video processing. The basic strategy of smoke-pixel judgment is composed of two decision functions: a chromaticitybased decision function in static characteristic and a diffusion-based decision function in dynamic characteristic. The chromatic decision rule is deduced by grayish color of smoke and the dynamic decision rule is dependent on the diffusion attribute of smoke. To give an appropriate alarm, a fuzzy scheme is introduced to enhance the reliability of alarming by checking if the quantity of smoke extracted increases with the checking time. Experimental results show that the proposed method can provide an early alarm at a lower false alarm rate before the fire burns up, and hence is very attractive for the important places, social security, commercial applications, and so on. Read More Read Less

Abstract In this paper, we propose a novel parallel feature fusion based maximum margin criterion, namely discriminant parallel feature fusion, for pattern classification. The advantage of algorithm lies in: 1) A constrained optimization problem based on maximum margin criterion is created to solve the optimal fusion coefficients, which causes that fused data has the largest class discriminant in the fused feature... In this paper, we propose a novel parallel feature fusion based maximum margin criterion, namely discriminant parallel feature fusion, for pattern classification. The advantage of algorithm lies in: 1) A constrained optimization problem based on maximum margin criterion is created to solve the optimal fusion coefficients, which causes that fused data has the largest class discriminant in the fused feature space. 2) An unique solution of optimization problem is transformed to an eigenvalue problem, which causes the proposed fusion strategy to perform a consistent performance. Besides of the detailed theory derivation, many experimental evaluations also are presented in this paper. Read More Read Less

Abstract A robust video watermarking method is described that can embed watermarks immune to not only rotation, scaling, and translation but also to random geometric distortion and any of their combinations. It can detect watermarks without any search for canceling the effect of random distortion. Rotation, scale, and translation are canceled by searching for the angle, size, and origin of the... A robust video watermarking method is described that can embed watermarks immune to not only rotation, scaling, and translation but also to random geometric distortion and any of their combinations. It can detect watermarks without any search for canceling the effect of random distortion. Rotation, scale, and translation are canceled by searching for the angle, size, and origin of the original picture. The search for the angle and size is combinatorial but is independent of the search for the origin. That is, the angle and size of the target picture can be restored without restoring the picture’s origin. Furthermore, the search for the origin is divided into horizontal and vertical searches that can be carried out independently. The number of searches is thus drastically reduced, making the processing speed high enough for practical application. Experimental evaluation using actual video samples demonstrated that the proposed method can embed watermarks immune to all four types of transformations. Read More Read Less

Abstract Several problems exist with traditional HMM based approaches for Web information extraction (IE) due to the lack of consideration on Web-specific features. To address this issue we present a Generalized Hidden Markov Model (GHMM) that extends HMMs by making use of Web-specific information for Web IE. In GHMM based approach, Web content blocks instead of terms are used as basic... Several problems exist with traditional HMM based approaches for Web information extraction (IE) due to the lack of consideration on Web-specific features. To address this issue we present a Generalized Hidden Markov Model (GHMM) that extends HMMs by making use of Web-specific information for Web IE. In GHMM based approach, Web content blocks instead of terms are used as basic extraction unit. Besides, instead of using the traditional sequential state transition order, GHMM decides the state transition order based on layout structure of the corresponding web page. Furthermore, GHMM uses multiple emission features derived from Web information instead of single emission feature. Experimental study shows that GHMM based approach can effectively improve Web IE comparing to traditional HMM based approaches. Read More Read Less

Abstract The explosive growth of online data and the diversity of goals that may be pursued over the web have significantly increased the monetary value of the web traffic. To tap into this accelerating market, web site operators try to increase their traffic by customizing their sites to the needs of specific users. Web site customization involves three great challenges: (i)... The explosive growth of online data and the diversity of goals that may be pursued over the web have significantly increased the monetary value of the web traffic. To tap into this accelerating market, web site operators try to increase their traffic by customizing their sites to the needs of specific users. Web site customization involves three great challenges: (i) the accurate identification of the user interests in the sites’ content (ii) the detection of the user goals in their site visits and (iii) the encapsulation of the user interests and goals into the sites’ presentation and content. In this paper, we study how we can effectively identify the user interests and goals in their site visits and we evaluate their correlation as this is exemplified in the users’ navigational patterns and the site’s semantic content and structure. Based on our findings we propose a novel recommendation mechanism that employs web mining techniques for suggesting customized site views that satisfy both the user preferences and goals. Our experimental evaluation shows that the user site interests and interaction goals can be accurately detected from the users’ navigational behavior and that our recommendation model, which uses the identified user preferences and goals yields significant improvements in the sites’ usability. Read More Read Less

Abstract Password based authentication schemes are commonly used to authenticate remote users. Many schemes have been proposed both with and without smart cards but each have its own merits and demerits. This paper analyzes the security of an enhanced Dynamic ID based remote user authentication scheme and shows that the enhanced scheme has major security weaknesses. The paper also presents a... Password based authentication schemes are commonly used to authenticate remote users. Many schemes have been proposed both with and without smart cards but each have its own merits and demerits. This paper analyzes the security of an enhanced Dynamic ID based remote user authentication scheme and shows that the enhanced scheme has major security weaknesses. The paper also presents a new scheme which overcomes the weaknesses and provides better security strength. Read More Read Less

Abstract We present in this paper the new concept of “actor databases” (DB-Act) being studied at the INI institute (Act21 project) where we are developing a parallel main memory database system based on an actor like data model. To achieve data distribution we use a Scalable Distributed Data Structures (SDDS) called “distributed Compact Trie Hashing” (CTH*) currently in development at the... We present in this paper the new concept of “actor databases” (DB-Act) being studied at the INI institute (Act21 project) where we are developing a parallel main memory database system based on an actor like data model. To achieve data distribution we use a Scalable Distributed Data Structures (SDDS) called “distributed Compact Trie Hashing” (CTH*) currently in development at the same project. Transaction management and recovery techniques are adapted for the combination of actors and SDDS in Act21. An adaptation of the nested transaction model to the actor paradigm is presented, as well as a recovery techniques using a fuzzy checkpointing tailored to the SDDS needs. Read More Read Less