Hidden Markov Tree Research Articles

Scaling Terrain-Aware Spatial Machine Learning for Flood Mapping on Large Scale Earth Imagery Data

The accurate and prompt mapping of flood-affected regions is important for effective disaster management, including damage assessment and relief efforts. While high-resolution optical imagery from satellites during disasters presents an opportunity for automated flood inundation mapping, existing segmentation models face challenges due to noises like cloud cover and tree canopies. Thanks to the digital elevation model (DEM) data readily available from sources such as United States Geological Survey (USGS), terrain guidance was utilized by recent graphical models such as hidden Markov trees (HMTs) to improve segmentation quality. Unfortunately, these methods either can only handle a small area where water levels at different locations are assumed to be consistent, or require restricted assumptions such as there is only one river channel. This paper presents an algorithm for flood extent mapping on large-scale Earth imagery, applicable to a large geographic area with multiple river channels. Since water level can vary a lot from upstream to downstream, we propose to detect river pixels in order to partition the remaining pixels into localized zones, each with a unique water level. In each zone, water at all locations flow to the same river entry point. Pixels in each zone are organized by an HMT to capture water flow directions guided by elevations. Moreover, a novel regularization scheme is designed to enforce inter-zone consistency by penalizing pixel-pairs of adjacent zones that violate terrain guidance. Efficient parallelization is made possible by coloring the zone adjacency graph to identify zones and zone-pairs that have no dependency and hence can be processed in parallel, and incremental one-pass terrain-guided scanning is conducted wherever applicable to reuse computations. Experiments demonstrate that our solution is more accurate than existing solutions, and can efficiently and accurately map out flooding pixels in a giant area of size 24,805 × 40,129. Despite the imbalanced workloads caused by a few large zonal HMTs dominating the serial computing time, our parallelization approach is effective and manages to achieve up to 14.3 × speedup on a machine with Intel Xeon Gold 6126 CPU @ 2.60GHz (24 cores, 48 threads) using 32 threads.

Color image watermarking using vector SNCM-HMT

An image watermarking scheme is typically evaluated using three main conflicting characteristics: imperceptibility, robustness, and capacity. Developing a good image watermarking method is challenging because it requires a trade-off between these three basic characteristics. In this paper, we proposed a statistical color image watermarking based on robust discrete nonseparable Shearlet transform (DNST)-fast quaternion generic polar complex exponential transform (FQGPCET) magnitude and vector skew-normal-Cauchy mixtures (SNCM)-hidden Markov tree (HMT). The proposed watermarking system consists of two main parts: watermark inserting and watermark extraction. In watermark inserting, we first perform DNST on R, G, and B components of color host image, respectively. We then compute block FQGPCET of DNST domain color components, and embed watermark signal in DNST-FQGPCET magnitudes using multiplicative approach. In watermark extraction, we first analyze the robustness and statistical characteristics of local DNST-FQGPCET magnitudes of color image. We then observe that, vector SNCM-HMT model can capture accurately the marginal distribution and multiple strong dependencies of local DNST-FQGPCET magnitudes. Meanwhile, vector SNCM-HMT parameters can be computed effectively using variational expectation–maximization (VEM) parameter estimation. Motivated by our modeling results, we finally develop a new statistical color image watermark decoder based on vector SNCM-HMT and maximum likelihood (ML) decision rule. Experimental results on extensive test images demonstrate that the proposed statistical color image watermarking provides a performance better than that of most of the state-of-the-art statistical methods and some deep learning approaches recently proposed in the literature.

Statistical learning based blind image watermarking approach

Image watermarking technology poses a significant challenge, requiring a delicate balance between robustness, imperceptibility, and capacity. To solve the balancing problem, a statistical learning based blind image watermarking technique is proposed in this paper. The idea of the proposed method to solve the balancing problem is to enhance imperceptibility and robustness while accommodating sufficient watermarks. Firstly, the local low-order pseudo-Zernike moments (PZM) magnitude in the discrete non-separable Shearlet transform (DNST) domain is constructed as the embedding domain. To ensure stability in embedding positions, we propose an edge embedding strategy. Secondly, by analyzing the statistical characteristics and multi-correlations of DNST-PZM magnitudes, a multi-correlation vector model based on the skew student's-t mixture (SSM) and hidden Markov tree (HMT) is designed. Finally, leveraging the vector SSM-HMT model and the maximum likelihood (ML) criterion, we derive the closed-form decoder expression. Comparative analysis with state-of-the-art methods demonstrates the superior imperceptibility and robustness of our proposed approach in accommodating the same capacity watermark.

Image watermarking using DNST-PHFMs magnitude domain vector AGGM-HMT

Invisibility, robustness and payload are three indispensable and contradictory properties for any image watermarking systems. Therefore, in this paper a novel statistical image watermark decoder based on robust discrete nonseparable Shearlet transform (DNST)-polar harmonic Fourier moments (PHFMs) magnitude and effective vector anisotropic generalized Gaussian mixtures (AGGM)-hidden Markov tree (HMT). We begin with a detailed study on the robustness and statistical characteristics of local DNST- PHFMs magnitudes of natural images. This study reveals the excellent robustness, highly non-Gaussian marginal statistics and strong dependencies of local DNST-PHFMs magnitudes. We also find that conditioned on their generalized neighborhoods, the local DNST-PHFMs magnitudes can be approximately modeled as anisotropic generalized Gaussian variables. Based on these findings, we model local DNST-PHFMs magnitudes using a vector AGGM-HMT that can capture all interscale, interdirection, and interlocation dependencies. Meanwhile, model parameters can be estimated effectively by using localization clues guided expectation–maximization (LCGEM) approach. Finally, we develop a new statistical image watermark decoder using the vector AGGM-HMT and maximum likelihood (ML) decision rule. Extensive experimental results show the superiority of the proposed watermark decoder over several state-of-the-art statistical watermarking methods and some approaches based on convolutional neural networks.

Statistical image watermark decoder using NSM-HMT in NSCT-FGPCET magnitude domain

The image watermarking technology is an effective technology for protecting image copyright at present. Image watermarking techniques have a constraint relationship between imperceptibility, robustness, and watermark capacity. Balancing imperceptibility, robustness, and watermark capacity becomes a tricky problem. This paper proposes a statistical image watermarking scheme using nonsubsampled Contourlet transform (NSCT) domain fast generic polar complex exponential transform (FGPCET) magnitudes and nonsymmetric mixtures (NSM) based hidden Markov tree (HMT). In the embedding part, to enhance robustness and imperceptibility, we insert the watermark signal into the robust local NSCT domain FGPCET magnitudes through the multiplicative method. In the decoding part, a statistical image watermarking decoder is designed using the NSM-HMT model and maximum likelihood criterion. Here, marginal characteristics and strong correlations of local NSCT domain FGPCET magnitudes are described by NSM-HMT. In addition, the generalized expectation-maximization (GEM)-clusterized method of moments (CMM) approach is used for accurate parameters. Extensive Monte Carlo experiments validate the better performance of the proposed image watermarking method compared to other well-known methods.

Statistical image watermark decoder using high-order difference coefficients and bounded generalized Gaussian mixtures-based HMT

Imperceptibility, robustness and data payload are three main requirements of any image watermarking systems to guarantee desired functionalities, but there is a tradeoff among them from the information-theoretic perspective. In order to achieve this balance, in this paper, we propose a new statistical image watermarking scheme in nonsubsampled Shearlet transform (NSST) domain, which is based on high-order difference coefficients and bounded generalized Gaussian mixture model (BGGMM) based hidden Markov tree (HMT). In embedding process, NSST is firstly performed on host image and NSST highpass subband is divided into no-overlapping blocks. Then high-order differences of NSST coefficient blocks are computed. And finally, watermark signal is inserted into robust high-order difference coefficients through non-linear multiplicative approach. In extraction phase, robust high-order difference coefficients are firstly modeled by employing BGGMM based HMT, which can capture accurately both marginal distributions and strong dependencies of high-order difference coefficients. Statistical model parameters are then estimated by combining the approach of minimizing the higher bound on data negative log-likelihood function and upward–downward algorithm. And finally, an image watermark decoder is developed using BGGMM based HMT and maximum likelihood decision. Experimental results on some test images and comparison with well-known existing methods demonstrate the efficacy and superiority of the proposed scheme.

DOA Estimation Aided by Magnitude Measurements

This correspondence discusses the estimation of direction-of-arrival (DOA) in a magnitude-aided antenna array (MA-AA), where magnitude-only radio frequency (RF) chains are introduced into the classical AA to acquire magnitude measurements. DOAs are initially estimated by the multiple signal classification (MUSIC) algorithm based on the complex-valued measurements from the conventional antennas. After griding the neighborhoods of these initial DOAs, the DOA estimation problem with the hybrid observations in MA-AA is converted as the recovery problem of sparse signals, which can be resolved by generalized approximate message passing (GAMP). Due to the “spatial leakage” effect, non-zero clusters appear around true DOAs. Their positions (i.e., non-zero supports) provide DOAs estimations. Moreover, DOAs and supports remain unchanged in several snapshots, then common supports are shared. Therefore, the cluster-sparse property of sparse signals is exploited by modeling a hidden Markov-tree (HMT) in the shared supports, on which belief propagation (BP) is executed to recover the binary probabilities of supports. Some unknown hyper-parameters in GAMP and BP are learned by expectation-maximization (EM). In comparison to existing estimators, EM-BP-GAMP shows advantages on DOA estimation, computational complexity, and DOA resolution. With the EM-BP-GAMP estimator, MA-AA is more energy-efficient than the classical AA. These advantages are successfully validated by experimental results.

A Hidden Markov Tree Model for Flood Extent Mapping in Heavily Vegetated Areas based on High Resolution Aerial Imagery and DEM: A Case Study on Hurricane Matthew Floods

ABSTRACT Flood extent mapping plays a crucial role in disaster management and national water forecasting. In recent years, high-resolution optical imagery becomes increasingly available with the deployment of numerous small satellites and drones. However, analysing such imagery data to extract flood extent poses unique challenges due to the rich noise and shadows, obstacles (e.g. tree canopies, clouds), and spectral confusion between pixel classes (flood, dry) due to spatial heterogeneity. Existing machine-learning techniques often focus on spectral and spatial features from raster images without fully incorporating the geographic terrain within classification models. In contrast, we recently proposed a novel machine-learning model called geographical hidden Markov tree (HMT) that integrates spectral features of pixels and topographic constraint from Digital Elevation Model (DEM) data (i.e. water flow directions) in a holistic manner. This paper evaluates the model through case studies on high-resolution aerial imagery from National Oceanic and Atmospheric Administration (NOAA) National Geodetic Survey (NGS) together with DEM. Three scenes are selected in heavily vegetated floodplains near the cities of Grimesland and Kinston in North Carolina during Hurricane Matthew floods in 2016. Results show that the proposed HMT model outperforms several state of the art machine-learning algorithms (e.g. random forests, gradient-boosted model) by an improvement of F-score (the harmonic mean of the user’s accuracy and producer’s accuracy) from around 70% to 80% to over 95% on our datasets.

Statistical Modeling with a Hidden Markov Tree and High-resolution Interpolation for Spaceborne Radar Reflectivity in the Wavelet Domain

With the increasing availability of precipitation radar data from space, enhancement of the resolution of spaceborne precipitation observations is important, particularly for hazard prediction and climate modeling at local scales relevant to extreme precipitation intensities and gradients. In this paper, the statistical characteristics of radar precipitation reflectivity data are studied and modeled using a hidden Markov tree (HMT) in the wavelet domain. Then, a high-resolution interpolation algorithm is proposed for spaceborne radar reflectivity using the HMT model as prior information. Owing to the small and transient storm elements embedded in the larger and slowly varying elements, the radar precipitation data exhibit distinct multiscale statistical properties, including a non-Gaussian structure and scale-to-scale dependency. An HMT model can capture well the statistical properties of radar precipitation, where the wavelet coefficients in each sub-band are characterized as a Gaussian mixture model (GMM), and the wavelet coefficients from the coarse scale to fine scale are described using a multiscale Markov process. The state probabilities of the GMM are determined using the expectation maximization method, and other parameters, for instance, the variance decay parameters in the HMT model are learned and estimated from high-resolution ground radar reflectivity images. Using the prior model, the wavelet coefficients at finer scales are estimated using local Wiener filtering. The interpolation algorithm is validated using data from the precipitation radar onboard the Tropical Rainfall Measurement Mission satellite, and the reconstructed results are found to be able to enhance the spatial resolution while optimally reproducing the local extremes and gradients.

Contourlet domain locally optimum image watermark decoder using Cauchy mixtures based vector HMT model

Digital image watermarking has become a necessity in many applications such as data authentication, broadcast monitoring on the Internet and ownership identification. Various watermarking schemes have been proposed to protect the copyright information. There are three indispensable, yet contrasting requirements for a watermarking scheme: imperceptibility, robustness and payload. Therefore, a watermarking scheme should provide a trade-off among these requirements from the information-theoretic perspective. Generally, in order to enhance the imperceptibility, robustness and payload simultaneously, the human visual system (HVS) and the statistical properties of the image signal should be fully taken into account. The statistical model-based transform domain multiplicative watermarking scheme embodies the above ideas, and therefore the detection and extraction of the multiplicative watermarks have received a great deal of attention. The performance of a statistical model-based watermark detector or decoder is highly influenced by the accuracy of the statistical model itself and the applicability of decision rule. In this paper, we firstly propose a new hidden Markov trees (HMT) statistical model in Contourlet domain, namely Cauchy mixtures-based vector HMT (vector CMM–HMT), by describing the marginal distribution with Cauchy mixture model (CMM) and grouping Contourlet coefficients into a vector, which can capture both the subband marginal distributions and the strong dependencies across scales and orientations of the Contourlet coefficients. Then, by modeling the Contourlet coefficients with vector CMM–HMT and employing locally most powerful (LMP) test, we develop a locally optimum image watermark decoder in Contourlet domain. We conduct extensive experiments to evaluate the performance of the proposed blind watermark decoder, in which encouraging results validate the effectiveness of the proposed technique, in comparison with the state-of-the-art approaches recently proposed in the literature.

Texture image segmentation using Vonn mixtures-based hidden Markov tree model and relative phase

Texture segmentation is a frequently occurring and challenging problem in many computer vision and pattern recognition applications. The importance of phase information for texture analysis has been earlier established for many image processing. Undecimated dual tree complex wavelet transform (UDTCWT) is a new image decomposition. It not only provides exact translational invariance and rich directional selectivity, but also offers perfect consistent relative phase relationships across scales. In this paper, we propose a novel texture image segmentation framework using Vonn mixtures-based hidden Markov trees (HMT) and UDTCWT domain relative phase. Firstly, we analyze the robustness and marginal distribution of UDTCWT relative phases, and various strong dependencies between UDTCWT relative phases. Then, we propose a new HMT statistical model in UDTCWT domain, namely Vonn mixtures-based HMT, by describing the UDTCWT relative phases statistical distribution with Vonn mixtures (VM), which can capture both the subband marginal distributions and the strong dependencies across scales of the UDTCWT relative phases. Finally, we develop a texture image segmentation framework using the Vonn mixtures-based HMT model of UDTCWT domain relative phases, in which expectation–maximization (EM) parameter estimation, Bayesian multiscale raw segmentation, and context based multiscale fusion are used. Comparing to the state-of-the-art techniques, the proposed method can not only produce high-quality segmentation results in a more efficient way, but also keep a lot of boundary details in the segmentation results.

A new watermark decoder in DNST domain using singular values and gaussian-cauchy mixture-based vector HMT

There are three indispensable, yet contrasting requirements for a watermarking scheme: imperceptibility, robustness, and payload. Therefore, it is a challenge to obtain a tradeoff among above requirements in image watermark detection. In this paper, we propose a new statistical watermark decoder in discrete non-separable Shearlet transform (DNST) domain using singular values and Gaussian-Cauchy mixture-based vector hidden Markov tree (HMT). Our method can obtain great performance in imperceptibility, robustness and payload, and it is necessary for image copyright protection. We first perform DNST on the host image, and apply singular value decomposition (SVD) to the significant DNST domain high entropy blocks. We then embed the digital watermark into the DNST high entropy blocks by modifying the robust singular values. At the receiver, by combining the Gaussian-Cauchy mixture-based vector HMT and maximum likelihood (ML) decision, we propose a new blind image watermark decoder in DNST domain. Here, robust DNST domain singular values are firstly modeled by using Gaussian-Cauchy mixture-based vector HMT, where the Gaussian-Cauchy mixture marginal distribution and various strong dependencies of DNST domain singular values are incorporated. Then the statistical model parameters of Gaussian-Cauchy mixture-based vector HMT are estimated using parameter-expanded expectation–maximization (PXEM) approach. And finally, a blind image watermark decoder is developed using Gaussian-Cauchy mixture-based vector HMT and ML decision rule. The major contribution of this paper is the use of singular value, Gaussian-Cauchy mixture-based vector HMT and PXEM algorithms, which enhances the performance of watermarking scheme. Experimental results on some test images and comparison with well-known existing methods demonstrate the efficacy and superiority of the proposed method.

Blind Image Watermark Decoder in UDTCWT Domain Using Weibull Mixtures-Based Vector HMT

As one promising solution, digital watermarking has been proposed to resolve image copyright protection and content authentication, and has been applied successfully in many fields. Owing to their excellent description capability and invariance property, statistical models have become a popular tool for the image watermarking resulting in favorable trade-offs among imperceptibility, robustness and data payload. By modeling the robust undecimated dual tree complex Wavelet transform (UDTCWT) coefficient magnitudes with the Weibull mixtures based vector hidden Markov trees (HMT) and employing maximum likelihood (ML) test criterion, we propose a new image watermarking approach in UDTCWT domain in this paper. Our image watermarking approach consists of two parts, namely, embedding and extracting. In the embedding process, we compute the robust UDTCWT coefficient magnitudes with UDTCWT domain real/imaginary parts, and insert the digital watermark into the significant UDTCWT coefficient magnitude subband. In the extracting phase, robust UDTCWT coefficient magnitudes are firstly modeled by employing the Weibull mixture-based vector HMT, where the statistical properties of UDTCWT magnitudes are captured accurately. Then the expectation/conditional maximization (ECM) approach is introduced to estimate the statistical model parameters. Finally, an image watermark decoder for multiplicative watermarking is developed using the Weibull mixtures based vector HMT and ML test. The experiments show that the proposed method not only improves the imperceptibility, but also increases the robustness performance and outperforms state-of-the-art methods on a set of standard test images.

Image NSST-HMT model with associated multi-state coefficients

In recent years, due to its anisotropy, multi-directional capture characteristics,and translation invariance, the non-subsampled shearlet transform (NSST) hasplayed an important stabilizing role inthe process of image restoration. In this study, weanalyze an images NSST coefficients, including the relationship betweencoefficients in the same subband, the relationship between“father-son” coefficients, and the relationship between “brotherhood”coefficients in different subbands. The results reveal that thecoefficients in the NSST subbands are sparse, and both “father-sonrelationship” and “brotherhood relationship” coefficients exhibitaggregation and transitivity. On this basis, a hidden Markov tree (HMT)model with associated multi-state coefficients (M-NSST-HMT) isproposed. This model estimates the reconstructed coefficientsusing “father-son relationship” and “brotherhood relationship”of the NSST subband coefficients as joint states of guiding thecoefficients transfer between subbands. In addition, the model integrates thereconstructed coefficients using the mutual information betweenthese two associated states. Finally, the proposed model is appliedto image denoising with favorable results. The results indicatethat the proposed model can reveal the relationship ofcoefficients in NSST subbands and improve the prediction accuracy ofcoefficients more effectively than the traditional HMT model.

Effective payload and improved security using HMT Contourlet transform in medical image steganography

This paper implements a novel approach for image steganography based on Hidden Markov Tree (HMT) Contourlet transform. In this paper, the biomedical image considers as a cover image and it is mapped to a specific frequency domain by applying HMT Contourlet transform. Then canny edge detection method implemented to detect the smooth edges to hide the secret data. The secret data is encrypted by using Paillier cryptosystem in a new location of the cover image. Particle Swarm Optimization (PSO) algorithm developed for the selection of the best place to locate the number of particles in a new location. The proposed method prevents the medical image from the various attacks such as rotate, crop, histogram, salt & pepper, blur and resize provides the robustness, thereby reduces to 8.19%, 10.88%, 24.03%, 15.27%, 13.21% and 14.35%. The performance measures of Peak Signal to Noise Ratio (PSNR), Mean Square Error (MSE) are calculated to show the better performance compared with the existing techniques.

Wavelet Based Video Denoising using Probabilistic Models

Wavelet based image processing techniques do not strictly follow the conventional probabilistic models that are unrealistic for real world images. However, the key features of joint probability distributions of wavelet coefficients are well captured by HMT (Hidden Markov Tree) model. This paper presents the HMT model based technique consisting of Wavelet based Multiresolution analysis to enhance the results in image processing applications such as compression, classification and denoising. The proposed technique is applied to colored video sequences by implementing the algorithm on each video frame independently. A 2D (Two Dimensional) DWT (Discrete Wavelet Transform) is used which is implemented on popular HMT model used in the framework of Expectation-Maximization algorithm. The proposed technique can properly exploit the temporal dependencies of wavelet coefficients and their non-Gaussian performance as opposed to existing wavelet based denoising techniques which consider the wavelet coefficients to be jointly Gaussian or independent. Denoised frames are obtained by processing the wavelet coefficients inversely. Comparison of proposed method with the existing techniques based on CPSNR (Coloured Peak Signal to Noise Ratio), PCC (Pearson’s Correlation Coefficient) and MSSIM (Mean Structural Similarity Index) has been carried out in detail.The proposed denoising method reveals improved results in terms of quantitative and qualitative analysis for both additive and multiplicative noise and retains nearly all the structural contents of a video frame.

A dynamic texture based segmentation method for ultrasound images with Surfacelet, HMT and parallel computing

To segment regions of interest (ROIs) from ultrasound images, one novel dynamic texture based algorithm is presented with surfacelet transform, hidden Markov tree (HMT) model and parallel computing. During surfacelet transform, the image sequence is decomposed by pyramid model, and the 3D signals with high frequency are decomposed by directional filter banks. During HMT modeling, distribution of coefficients is described with Gaussian mixture model (GMM), and relationship of scales is described with scale continuity model. From HMT parameters estimated through expectation maximization, the joint probability density is calculated and taken as feature value of image sequence. Then ROIs and non-ROIs in collected sample videos are used to train the support vector machine (SVM) classifier, which is employed to identify the divided 3D blocks from input video. To improve the computational efficiency, parallel computing is implemented with multi-processor CPU. Our algorithm has been compared with the existing texture based approaches, including gray level co-occurrence matrix (GLCM), local binary pattern (LBP), Wavelet, for ultrasound images, and the experimental results prove its advantages of processing noisy ultrasound images and segmenting higher accurate ROIs.

SAR image segmentation algorithm based on Contourlet domain AFMRF model

Combining the advantage of Contourlet transform with adaptive fuzzy Markov random field (MRF) model, a novel segmentation algorithm is proposed in this study to achieve precise and continuous division for synthetic aperture radar (SAR) image. The classical MRF model is modified to obtain the edge and process adaptive label factor. The adaptive fuzzy MRF (AFMRF) model is proposed to equilibrate the smooth regions segmentation with texture regions segmentation. At the same time, Contourlet domain hidden Markov tree (HMT) model is introduced to perform multi-scale directional filtering and intra-scale training on the coefficients of SAR images to achieve precise texture segmentation at each scale. Finally, the AFMRF model is integrated into inter-scale and intra-scale HMT training results and the segmented image can be obtained. To verify the validity of the proposed algorithm, several SAR images are experimented and compared with the state-of-the-art algorithms. The experimental results and analysis show that the proposed algorithm can achieve better results on noise suppression, smoothness of target regions, precise and continuous segmentation of fuzzy texture.

A hidden Markov tree model for testing multiple hypotheses corresponding to Gene Ontology gene sets

BackgroundTesting predefined gene categories has become a common practice for scientists analyzing high throughput transcriptome data. A systematic way of testing gene categories leads to testing hundreds of null hypotheses that correspond to nodes in a directed acyclic graph. The relationships among gene categories induce logical restrictions among the corresponding null hypotheses. An existing fully Bayesian method is powerful but computationally demanding.ResultsWe develop a computationally efficient method based on a hidden Markov tree model (HMTM). Our method is several orders of magnitude faster than the existing fully Bayesian method. Through simulation and an expression quantitative trait loci study, we show that the HMTM method provides more powerful results than other existing methods that honor the logical restrictions.ConclusionsThe HMTM method provides an individual estimate of posterior probability of being differentially expressed for each gene set, which can be useful for result interpretation. The R package can be found on https://github.com/k22liang/HMTGO.

Implementing Efficient Audio and Image Watermarking Using Multi-resolution Dual Wavelet and Fireflies Approach in Wireless Network

Watermarking is the process of embedding the particular information into the audio signal for managing the ownership copyrights through wireless network. During the watermarking process, the audio signal consumes high energy, conflicting problem of robustness and imperceptibility, signal to noise ratio, bit error rate and normalized correlation. To overcome these issues present in the audio watermarking process, novel wavelet decomposition and evolutionary algorithm is utilized. Initially the input information or message has been split into two and the spillted message is watermarked using the audio and the image in wireless network. The first half of the message is watermarked with the help of the image and the next half of the image is watermarked by audio. Initially the watermarked image is transferred into YIQ image, from the transferred image the scrambled image is generated with the help of the Hidden Markov tree counter let wavelet transform method for generating the watermarking image. Then the next part of information is watermarked by audio signal which is decomposed into various sub bands using the Multi-resolution complex dual tree wavelet method. From the decomposed audio signal, the message authentication code based watermarks have been embedded in the lower frequency coefficients. Then the embedded process is performed by using the Dead zone quantization process which is optimized with the help of the Fireflies algorithm for enhancing the quality of the watermarking process. Finally both watermarking process is embedded for improving the security to the information with efficient manner through wireless network. In addition the efficient watermarking process through wireless network reduces the various attacks while extracting the water marker. Thus the optimized wavelet and quantization process improves the image and audio watermarking through wireless network and efficiency of the proposed system is evaluated using the experimental results in terms of the Signal to noise ratio, normalized correlation and bit error rate.