Ming Shi Wang

A fuzzy c-means clustering-based fragile watermarking scheme for image authentication

In recent years, various fragile watermarking schemes have been proposed for image authentication and integrity verification. In this paper, a novel block-based fragile watermarking scheme for image authentication and tamper proofing is proposed. Realizing that block-wise dependency is a basic requirement for fragile watermarking schemes to withstand counterfeiting attacks, the proposed scheme uses the fuzzy c-means (FCM) clustering technique to create the relationship between image blocks. The effectiveness of the proposed scheme is demonstrated through a series of attack simulations. Experimental results show that the proposed scheme not only provides satisfactory imperceptibility, but also achieves superior tamper detection and localization accuracy under different attacks, such as the cut-and-paste attack and the vector quantization (VQ) attack.

A majority-voting based watermarking scheme for color image tamper detection and recovery

This paper presents a novel color image watermarking scheme for both tamper detection and tampered image recovery. The proposed scheme embeds watermarks consisting of the authentication data and the recovery data into image blocks. In the tamper detection process, instead of independently examining each embedded authentication data, we take all the authentication data embedded in an image into account and utilize a majority-voting technique to determine the legitimacy of image blocks. Experimental results show that the proposed scheme can effectively thwart collage attack and vector quantization (VQ) attack, while sustaining superior accuracy of tamper localization. Furthermore, the results reveal that the tampered images can be successfully recovered with acceptable visual quality.

A hybrid DWT-SVD copyright protection scheme based on k-means clustering and visual cryptography

In this paper, a novel copyright protection scheme that combines the discrete wavelet transform (DWT) and the singular value decomposition (SVD) is proposed. Instead of modifying the original host image to conceal a secret image, the proposed scheme first extracts the image features from the host image by applying the DWT and the SVD. The extracted features are then classified into two clusters by employing the k-means clustering technique, and a master share is generated using the clustering result. Finally, the master share is used together with a secret image to construct an ownership share according to a two-out-of-two visual cryptography (VC) technique. When rightful ownership needs to be determined, the secret image for ownership identification can be revealed by stacking the master share and the ownership share. Experimental results demonstrate that the proposed scheme can effectively resist several common attacks. In addition, the revealed watermark can be easily recognized by human eyes, even if the host image has undergone severe attacks.

Broadcast scheduling in wireless sensor networks using fuzzy Hopfield neural network

In this paper we describe fuzzy Hopfield neural network (FHNN) technique to solve the TDMA (time division multiple access) broadcast scheduling problem in wireless sensor networks (WSN). We formulate it as discrete energy minimization problem and map it into Hopfield neural network with the fuzzy c-means strategy to find the TDMA schedule for nodes in a communication network. The broadcast scheduling problem for wireless sensor networks is an NP-complete problem. Each time slot is regarded as a data sample and every node is taken as a cluster. Time slots are adequately distributed to the dedicated node while satisfying the constraints. The aim is to minimize the TDMA cycle length and maximize the node transmissions avoiding both primary and secondary conflicts. The FHNN reduces the processing time and increases the convergence rate for Broadcast Scheduling Problem. Simulation results show that the FHNN improves performance substantially through solving well-known benchmark problems.

Digital image copyright protection scheme based on visual cryptography and singular value decomposition

A digital image copyright protection scheme based on visual cryptography VC and singular value decomposition SVD techniques is proposed. In the proposed scheme, a master share is first constructed by applying SVD to a host image. Then, the master share is used to- gether with a secret image to construct an ownership share, according to a two-out-of-two VC scheme. The secret image for ownership identifica- tion can be revealed by stacking the master share, and the ownership share. The proposed scheme embeds the secret image without modify- ing the host image. In addition, the hidden secret image can be extracted without resorting to the original host image and the aid of computers. Experimental results show that the proposed scheme, compared with existing schemes, achieves stronger robustness against several com- mon attacks.

Fuzzy logic weighted multi-criteria of dynamic route lifetime for reliable multicast routing in ad hoc networks

In this paper, we proposed the fuzzy logic modified AODV routing (FMAR) protocol for multicast routing in mobile ad hoc networks. The fuzzy logic weighted multi-criteria of the protocol is used to dynamically evaluate the active route lifetime in order to determine the appropriate routes. Multiple routing paths are established to provide extra schemas of video streaming or multicast transmission and enhance the robust transmission against unreliability and limited bandwidth of wireless links. Due to frequent node movements, the topologies of mobile ad hoc networks change rapidly. The evaluation of dynamic route lifetime is challenging in the wireless networks. The fuzzy weighted logic multi-criteria are based on the remained energies of the nodes on the routes, the number of hop-counts and the sent controlled packages. The simulation results of the FMAR show that the protocol is quite efficient and superior to AODV with the respects to the node mobility, the packet delivery ratio, average route acquisition latency delay, the routing overhead and the average end-to-end delay.

A Vision Based Top-View Transformation Model for a Vehicle Parking Assistant

This paper proposes the Top-View Transformation Model for image coordinate transformation, which involves transforming a perspective projection image into its corresponding birds eye vision. A fitting parameters searching algorithm estimates the parameters that are used to transform the coordinates from the source image. Using this approach, it is not necessary to provide any interior and exterior orientation parameters of the camera. The designed car parking assistant system can be installed at the rear end of the car, providing the driver with a clearer image of the area behind the car. The processing time can be reduced by storing and using the transformation matrix estimated from the first image frame for a sequence of video images. The transformation matrix can be stored as the Matrix Mapping Table, and loaded into the embedded platform to perform the transformation. Experimental results show that the proposed approaches can provide a clearer and more accurate birds eye view to the vehicle driver.

Reliable transmission of multimedia streaming using a connection prediction scheme in cluster-based ad hoc networks

Cluster-based routes help data transmission by acting as backbone paths in wireless ad hoc networks. Some mobile users form a cluster to obtain common multimedia services. However, node mobility does not guarantee multimedia transmission in a network with a dynamic topology. This study first presents a novel measure of cluster-based routes stability according to a prediction of connection probability at a specific time in future, helping transmit multimedia streams across many clusters in a network. The selected route is sufficiently stable to enable cluster-based mobile users to receive time-consuming multimedia streaming in future. Secondly, inter-cluster connectivity maintenance schemes, including forward and backward connectivity methods to protect nonstop multimedia streams, are developed to maintain inter-cluster links. Finally, analytical and evaluation results indicate that the cluster-based route chosen according to the connection probability scheme is more effective than routes chosen by other flat on-demand routing protocols for transmitting multimedia streaming in ad hoc networks.

An (3, 3)-Visual Secret Sharing Scheme for Hiding Three Secret Data

Visual cryptography is one kind of image encrypting. It is different from traditional cryptography, because it does not need complex computation to decrypt. In current technology, most of visual cryptography are embedded a secret using two shares is limited. This paper proposes a new approach of (3, 3)visual secret sharing scheme to embed more information and have more secure than traditional visual cryptography.

Image encryption algorithm based on chaotic maps

In this paper, we proposed a new image encryption algorithm, that is based on Arnold cat map and logistic chaotic system to improve the security of the image transmission. An input image can be shuffled by iterative using Arnold cat map operations. But, after several iterations the shuffle image will return to the original image. It is obvious that we cannot using the Arnold cat map only to promise the system security. If we applied the logistic map algorithm to shuffled the original image. Then encrypted the shuffled results of the logistic map algorithm by the Arnold cat map. It will improve the system security largely.