• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.39-44
• /
• 2010

In this paper, we derive the channel capacity in order to transmit an additional data by using digital watermarking method in generalized-K fading channel. Spread spectrum watermarking is one of the digital watermarking methods which is the most promising technique due to it's very robustness to the channel noise and easy achieving of the signal detection by correlators at the receiver. It is important to analyze the channel capacity to transmit an additional data through wireless channel because the transmitted data would be affected by the channel fading effects. From the results, we confirm that the channel capacity of the SSW system can be determined by the HWR, WNR, PN length and host sampling frequency. Also, we verified that the level of HWR and WNR can be determined by the derived capacity formula. The results of this paper can be applied to general spread spectrum watermarking system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1409-1415
• /
• 2010

In this paper we proposed the watermarking technique using the markspace which is selected by tree-structure between the subbands in the wavelet domain and feature information in the spatial domain. The watermarking candidate region in the wavelet domain is obtained by the markspace selection algorithm divides the highest frequency subband to several segments and calculates theirs energy and the averages value of the total energy of the subband. Also the markspace of the spatial domain is obtained by the boundary information of a image. The final markspace is selected by the markspaces of the wavelet and spatial domain. The watermark is embedded into the selected markspace using the random addresses by LFSR. Finally the watermarking image is generated using the inverse wavelet transform. The proposed watermarking algorithm shows the robustness against the attacks such as JPEG, blurring, sharpening, and gaussian noise.

• Geophysics and Geophysical Exploration
• /
• v.8 no.2
• /
• pp.170-176
• /
• 2005

Recently the velocity stack inversion is having many attentions as an useful way to perform various seismic data processing. In order to be used in various seismic data processing, the inversion method used should have properties such as robustness to noise and parsimony of the velocity stack result. The IRLS (Iteratively Reweighted Least-Squares) method that minimizes ${L_1}-norm$ is the one used mostly. This paper introduce another method, CGG (Conjugate Guided Gradient) method, which can be used to achieve the same goal as the IRLS method does. The CGG method is a modified CG (Conjugate Gradient) method that minimizes ${L_1}-norm$. This paper explains the CGG method and compares the result of it with the one of IRSL methods. Testing on synthetic and real data demonstrates that CGG method can be used as an inversion method f3r minimizing various residual/model norms like IRLS methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.12
• /
• pp.69-75
• /
• 2004

In the paper, system is combined multiband system with DS-UWB techniques with properties including low peak-to-average power ratio, robustness to multiuser interference and excellent security. Because each sub-band is not satisfied with coherence bandwidth, rake receiver in each sub-band is applied to the Proposed system receiver. Output of rake receiver is combined by using Maximal Ratio combining technology. In this paper we mathematically analyse the BER of the DS-UWB system with singleband and multiband systems in the narrow interference channel condition and multi user interference channel condition, the simulation results show that proposed scheme is getting robuster with increasing of the number of subbands.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.3
• /
• pp.156-163
• /
• 2003

Most watermarking techniques insert watermarks into transform coefficients in the frequency domain because we can consider robust or imperceptible frequency bands against malicious attacks to remove them. However, parameterization of 3-D data is not easy because of irregular attribution of connectivity information, while 1-I) or 2-D data is regular. In this paper we propose a new watermarking scheme for 3-D polygonal mesh models in the DCT domain. After we generate triangle strips by traversing the 3-D model and transform its vertex coordinates into the DCT domain, watermark signals are inserted into mid-frequency bands of AC coefficients for robustness and imperceptibility. We demonstrate that our scheme is robust against additive random noise, the affine transformation, and geometry compression by the MPEG-4 SNHC standard.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.4
• /
• pp.16-22
• /
• 2012

In this paper, the forensic marking algorithm is proposed using psychoacoustic model II and MDCT for high-quality audio. The proposed forensic marking method, that inserts the user fingerprinting code of the audio content into the selected sub-band, in which audio signal energy is lower than the spectrum masking level. In the range of the one frame which has 2,048 samples for FFT of original audio signal, the audio forensic marking is processed in 3 sub-bands. According to the average attack of the fingerprinting codes, one frame's SNR is measured on 100% trace ratio of the collusion codes. When the lower strength 0.1 of the inserted fingerprinting code, SNR is 38.44dB. And in case, the added strength 0.5 of white gaussian noise, SNR is 19.09dB. As a result, it confirms that the proposed audio forensic marking algorithm is maintained the marking robustness of the fingerprinting code and the audio high-quality.

• Journal of Communications and Networks
• /
• v.9 no.1
• /
• pp.18-27
• /
• 2007

The conventional normalized least mean square (NLMS) algorithm is the most widely used for adaptive identification within a non-stationary input context. The convergence of the NLMS algorithm is independent of environmental changes. However, its steady state performance is impaired during input sequences with low dynamics. In this paper, we propose a new NLMS algorithm which is, in the steady state, insensitive to the time variations of the input dynamics. The square soot (SR)-NLMS algorithm is based on a normalization of the LMS adaptive filter input by the Euclidean norm of the tap-input. The tap-input power of the SR-NLMS adaptive filter is then equal to one even during sequences with low dynamics. Therefore, the amplification of the observation noise power by the tap-input power is cancelled in the misadjustment time evolution. The harmful effect of the low dynamics input sequences, on the steady state performance of the LMS adaptive filter are then reduced. In addition, the square root normalized input is more stationary than the base input. Therefore, the robustness of LMS adaptive filter with respect to the input non stationarity is enhanced. A performance analysis of the first- and the second-order statistic behavior of the proposed SR-NLMS adaptive filter is carried out. In particular, an analytical expression of the step size ensuring stability and mean convergence is derived. In addition, the results of an experimental study demonstrating the good performance of the SR-NLMS algorithm are given. A comparison of these results with those obtained from a standard NLMS algorithm, is performed. It is shown that, within a non-stationary input context, the SR-NLMS algorithm exhibits better performance than the NLMS algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.1
• /
• pp.49-59
• /
• 2009

In this paper a watermarking algorithm is proposed to optimize the capacity of the digital watermark insertion in an experimental threshold using the characteristics of human visual system(HVS), adaptive scale factors, and weight functions based on discrete wavelet transform. After the original image is decomposed by a 3-level discrete wavelet transform, the watermarks for capacity optimization are inserted into all subbands except the baseband, by applying the important coefficients from the experimental threshold in the wavelet region. The adaptive scale factors and weight functions based on HVS are considered for the capacity optimization of the digital watermark insertion in order to enhance the robustness and invisibility. The watermarks are consisted of gaussian random sequences and detected by correlation. The experimental results showed that this algorithm can preserve a fine image quality against various attacks such as the JPEG lossy compression, noise addition, cropping, blurring, sharpening, linear and non-linear filtering, etc.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.4
• /
• pp.180-186
• /
• 2012

In this paper, a method of edge detection from low contrast and noisy images which contain hexagonal shape is proposed. This method is based on the combination of laplacian gaussian filter and an idea of filters which are dependent on the shape. First, an algorithm which has six masks as its extractors to detect the hexagonal edges especially in the comers is used. Here, two tricom filters are used to detect the tricom joints of hexagons and other four masks are used to enhance the line segments of hexagonal edges. As a natural image, a corneal endothelial cell image which usually has a regular hexagonal shape is selected. The edge detection of hexagonal shapes in this corneal endothelial cell is important for clinical diagnosis. Next, The proposal algorithm and other conventional methods are applied to noisy hexagonal images to evaluate each efficiency. As a result, this proposal algorithm shows a robustness against noises and better detection ability in the aspects of the signal to noise ratio, the edge coineidence ratio and the detection accuracy factor as compared with other conventional methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1496-1521
• /
• 2012

Uncertainty is ubiquitous in target tracking wireless sensor networks due to environmental noise, randomness of target mobility and other factors. Sensing results are always unreliable. This paper considers unreliability as it occurs in wireless sensor networks and its impact on target-tracking accuracy. Firstly, we map intersection pairwise sensors' uncertain boundaries, which divides the monitor area into faces. Each face has a unique signature vector. For each target localization, a sampling vector is built after multiple grouping samplings determine whether the RSS (Received Signal Strength) for a pairwise nodes' is ordinal or flipped. A Fault-Tolerant Target-Tracking (FTTT) strategy is proposed, which transforms the tracking problem into a vector matching process that increases the tracking flexibility and accuracy while reducing the influence of in-the-filed factors. In addition, a heuristic matching algorithm is introduced to reduce the computational complexity. The fault tolerance of FTTT is also discussed. An extension of FTTT is then proposed by quantifying the pairwise uncertainty to further enhance robustness. Results show FTTT is more flexible, more robust and more accurate than parallel approaches.