• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.10
• /
• pp.46-52
• /
• 1992

This paper considers uncertain systems with closed-loop poles in a polygonal region. A method is presented which is applicable to computing the perturbation of a pole-located region due to parameter uncertainties. A method is also proposed to calculate the bound on parameter uncertainties which allow the closed-loop poles to remain in a specified region. They provide useful robustness measures on the closed-loop poles of uncertain systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12A
• /
• pp.2100-2108
• /
• 2001

A digital image watermarking algorithm is proposed that uses human visual system (HVS) and discrete wavelet transform (DWT). In this algorithm, an image is decomposed into four-level by DWT which reveals the characteristics of the human eyes and watermark is embedded into DWT coefficients using HVS. For robustness, the lowest level subbands which represent the highest frequency component are excluded in watermark embedding step and watermark is embedded into the perceptually significant coefficients (PSCs) of the rest subbands. PSCs of the baseband are selected according to the amplitude of the coefficients and PSCs of the high frequency subbands are selected by successive subband quantization (SSQ). Watermark is embedded into the PSCs of the baseband and high frequency subbands by Weber\`s law and spatial masking effect, respectively, for the invisibility and robustness. We tested the performance of the proposed algorithm compared with the conventional watermarking algorithm by computer simulation. Experimental results show that the proposed watermarking algorithm produces a better invisibility and robustness than the conventional algorithm.

• Spatial Information Research
• /
• v.21 no.3
• /
• pp.31-43
• /
• 2013

Although the vector map data possesses much higher values than other types of multimedia, the data copyright and the protection against illegal duplication are still far away from the attention. This paper proposes a novel watermarking technique which is both robust to diverse attacks and optimized to a vector map structure. Six approaches are proposed for the design of the watermarking algorithm: point-based approach, building a minimum perimeter triangle, watermark embedding in the length ratio, referencing to the pixel position of the watermark image, grouping, and using the one-way function. Our method preserves the characteristics of watermarking such as embedding effectiveness, fidelity, and false positive rate, while maintaining robustness to all types of attack except a noise attack. Furthermore, our method is a blind scheme in which robustness is independent of the map data. Finally, our method provides a solution to the challenging issue of degraded robustness under severe simplification attacks.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.175-183
• /
• 2011

Performance of digital video watermarking is an assessment that hides a lot of information in digital videos. Therefore, it is required to find a way that enables to store lots of bits of data into a high quality video of the frequency area of digital contents. Hence, this paper designs a watermarking system improving security with an enhancing watermarking based on invisible watermarking and embedding an watermarking on LH and HL subband and its subband by transforming wavelet after the extraction of luminance component from the frames of video by compromising robustness and invisible of watermarking elements. The performance analysis of security of watermarking is carried out with a statistic method, and makes an assessment of robustness against variety of attacks to invisible watermarking. We can verify the security of watermarking against variety of attacks by testing robustness and invisible through carrying out general signal processing like noise addition, lossy compression, and Low-Pass filtering.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.81-87
• /
• 2016

This paper analysis the AM-SCS-MMA (Adaptive Modulus-Soft Constraint Satisfaction-MMA) based on the adaptive modulus and minimus-disturbance technique in order to improve the stability and robustness in low signal to noise power of current MMA adaptive equalization algorithm. In AM-SCS-MMA, it updates the filter coefficient applying the adaptive modulus and minimum-disturbance technique of deterministic optimization problem instead of LMS or gradient descend algorithm for obtain the minimize the cost function of adaptive equalization. It is possible to improve the equalizer filter stability, robustness to the various noise characteristic and simultaneous reducing the intersymbol interference due to the amplitude and phase distortion occurred at channel. The computer simulation were performed for confirming the improved performance of SCS-MMA. For these, the output signal constellation of equalizer, residual isi, MSE, EMSE (Excess MSE) which means the channel traking capability and SER which means the robustness were applied. As a result of computer simulation, the AM-SCS-MMA have slow convergence time and less residual quantities after steady state, more good robustness in the poor signal to noise ratio, but poor in channel tracking capabilities was confirmed than MMA.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.6
• /
• pp.248-262
• /
• 2008

As the number of large size multimedia files increases and the importance of individual's digital data grows, storage devices have been advanced to store more data into smaller spaces. In such circumstances, a physical damage in a storage device can destroy large amount of important data. Therefore, it is needed to verify the robustness of various physical faults in storage device before certain systems are used. We developed SOAR(Storage Reliability Analyzer), Storage Reliability Analyzer, to detect physical faults in diverse kinds of HDD hardware components and to recover the systems from those faults. This is a useful tool to verify robustness and reliability of a disk. SOAR uses three unique methods of creating physical damages on a disk and two unique techniques to apply the same feature on file systems. In this paper, we have performed comprehensive tests to verify the robustness and reliability of storage device with SOAR, and from the verification result we could confirm SOAR is a very efficient tool.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.5
• /
• pp.535-543
• /
• 2014

In the robust optimization field, the robustness of the objective function emphasizes an insensitive design. In general, the robustness of the objective function can be achieved by reducing the change of the objective function with respect to the variation of the design variables and parameters. However, in conventional methods, when an insensitive design is emphasized, the performance of the objective function can be deteriorated. Besides, if the numbers of the design variables are increased, the numerical cost is quite high in robust optimization for nonlinear programming problems. In this research, the robustness index for the objective function and a process of robust optimization are proposed. Moreover, a method using the supremum of linearized functions is also proposed to reduce the computational cost. Mathematical examples are solved for the verification of the proposed method and the results are compared with those from the conventional methods. The proposed approach improves the performance of the objective function and its efficiency.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.81-92
• /
• 2006

This paper proposes a robustness watermarking for 3D mesh model based on projection onto convex sets (POCS). After designing the convex sets for robustness and invisibility among some requirements for watermarking system, a 3D-mesh model is projected alternatively onto two constraints convex sets until the convergence condition is satisfied. The robustness convex set are designed for embedding the watermark into the distance distribution of the vertices to robust against the attacks, such as mesh simplification, cropping, rotation, translation, scaling, and vertex randomization. The invisibility convex set are designed for the embedded watermark to be invisible. The decision values and index that the watermark was embedded with are used to extract the watermark without the original model. Experimental results verify that the watermarked mesh model has invisibility and robustness against the attacks, such as translation, scaling, mesh simplification, cropping, and vertex randomization.

• Korean Journal of Construction Engineering and Management
• /
• v.19 no.3
• /
• pp.33-42
• /
• 2018

In the aftermath of an earthquake, seismic-damaged infrastructure systems loss estimation is the first step for the disaster response. However, lifeline systems' ability to supply service can be volatile by external factors such as disturbances of nearby facilities, and not by own physical issue. Thus, this research develops the bayesian model for probabilistic inference on common-cause and cascading failure of seismic-damaged lifeline systems. In addition, the authors present network robustness estimation metrics in the context of failure propagation. In order to quantify the functional loss and observe the effect of the mitigation plan, power and water supply system in Daegu-Gyeongbuk in South Korea is selected as case network. The simulation results show that reduction of cascading failure probability allows withstanding the external disruptions from a perspective of the robustness improvement. This research enhances the comprehensive understanding of how a single failure propagates to whole lifeline system performance and affected region after an earthquake.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.498-504
• /
• 2004

This paper presents a new text classifier based on a feature projection technique. In feature projections, training documents are represented as the projections on each feature. A classification process is based on individual feature projections. The final classification is determined by the sum from the individual classification of each feature. In our experiments, the proposed classifier showed high performance. Especially, it have fast execution speed and robustness with noisy data in comparison with k-NN and SVM, which are among the state-of-art text classifiers. Since the algorithm of the proposed classifier is very simple, its implementation and training process can be done very simply. Therefore, it can be a useful classifier in text classification tasks which need fast execution speed, robustness, and high performance.