• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.12 no.2
• /
• pp.176-188
• /
• 1987

This paper presents a method for Digital Image Motion Restoration by inverse filtering. In order to onstruct optimal Restoration filter, We exactly have to model the degradation process, and therefrom, derive the inverse filter which has inverse charateristics of the degradation model. An Image taken from object which moves fast, is o suffer blurring. it can be modeled by integration process mathematically and analyzed to convolve a rectangular window over an image. in this paper, We analyzed it in the frequency domain, and studied a method for motion restoration using inverse filter has a directional Sinc property.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.2
• /
• pp.67-76
• /
• 1996

In the present paper we propose two new improved iterative restoration algorithms. One is to accelerate convergence of the steepest descent method using the improved search directions, while the other accelerates convergence by using preconditioners. It is also shown that the proposed preconditioned algorithm can accelerate iteration-adaptive iterative image restoration algorithm. The preconditioner in the proposed algorithm can be implemented by using the FIR filter structure, so it can be applied to practical application with manageable amount of computation. Experimental results of the proposed methods show good perfomance improvement in the sense of both convergence speed and quality of the restored image. Although the proposed methods cannot be directly included in spatially-adaptive restoration, they can be used as pre-processing for iteration-adaptive algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1158-1168
• /
• 1994

The paper proposes a distributed control self-healing algorithm for a line failure to improve the restoration time. This proposed self-healing algorithm acquired the fast restoration time by reducing the number of control messages and the queueing delay. And the reduction of queueing delay was attained by the ASC_NULL(Available Spare Channel_NULL) message which informs neighbor nodes that a source node has no available spare channel to reduce the waste of time during the rerouting. It is difficult for this proposed self-healing algorithm to be compared with other self-healing algorithms, because each self-healing algorithm has different simulation conditions. So, the performance of the proposed self-healing algorithm was compared with only NETRATS(NETwork Restoration Algorithm for Telecommunication Systems). The results of the simulation showed that the proposed self-healing algorithm was better than NETRATS in the restoration time.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.713-718
• /
• 1987

In this paper, an iterative restoration algorithm from power spectral density with 1 bit sign information of real part of two dimensional Fourier transform of image corrupted by additive white Gaussian noise is proposed. This method is a modified version of image reconstruction algorithm from power spectral density. From the results of computer simulation with original 32 gray level imgae of 64x64 pixels, we can find that restorated image after each iteration converge to original image very fast, and SNR gain be at least 8[dB] after 10th iteration for corrupted image with additive white Gaussian noise.

• Journal of Internet Computing and Services
• /
• v.4 no.2
• /
• pp.1-9
• /
• 2003

Path restoration, which is needed to increase network survivability in MPLS networks, is a technology of supplying reliable service by delivering the traffics through restoring the paths when links or nodes of a working path are failed. In this paper, we propose a path restoration method using duplication of working paths for link failure as a method of restoring paths for the high priority traffics. The existing path restoration method transmits the traffics to the path restoration uniformly in regardless of the priority while link obstacle. It has a problem to take a long time to restore the connection of the high priority traffics. On the other hand, the suggested restoration method establishes the duplication path for the working path, which transmits the high priority traffics and transmit the traffics through the duplication path. It has a strong point to restore the connection quickly. Also, through simulation we analyze the performance of the restoration system using the duplication path and prove that the proposed restoration method is superior in performance to the existing restoration methods regarding to the high priority traffics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2744-2754
• /
• 1997

Recently, the Multi-Layer Restoration(MLR) algorithm was proposed by British Telecom(BT) to restore the network failures in Digital Cross-connect System(DCS) mesh survival network[1, 2]. This algorithm has multi restoration stage which is composed of the pre-planned and dynamic restoration. This algorithm is effective its ability in link or node failures. This reason is that it does not restore in the pre-planned rstoration stage but in dynamic restoration stage. In this paper, we propose the MLR with pre-planned Multi-Chooser(PMC) and successive restoration ratio algorithm. This proposed algorithm has a excellent performance for restortion time and ratio, spare channel availability and fast restoration from multiple link failure or node failure. This paper proposed the modeling and restoration algorithm, and analyzed the performance of the algorithm by simulation using OPNET(OPtimized Network Engineering Tools).

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.2
• /
• pp.41-51
• /
• 2014

This paper describes a method to estimate the noise power using the minimum statistics approach, which was originally proposed for audio processing. The proposed minimum statistics-based method separates a noisy image into multiple frequency bands using the three-level discrete wavelet transform. By assuming that the output of the high-pass filter contains both signal detail and noise, the proposed algorithm extracts the region of pure noise from the high frequency band using an appropriate threshold. The region of pure noise, which is free from the signal detail part and the DC component, is well suited for minimum statistics condition, where the noise power can be extracted easily. The proposed algorithm reduces the computational load significantly through the use of a simple processing architecture without iteration with an estimation accuracy greater than 90% for strong noise at 0 to 40dB SNR of the input image. Furthermore, the well restored image can be obtained using the estimated noise power information in parametric image restoration algorithms, such as the classical parametric Wiener or ForWaRD image restoration filters. The experimental results show that the proposed algorithm can estimate the noise power accurately, and is particularly suitable for fast, low-cost image restoration or enhancement applications.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.2
• /
• pp.191-196
• /
• 2010

Power system restoration following a massive or complete blackout starts with energizing the primary restorative transmission system. During this primary restoration process, unexpected overvoltage may happen due to nonlinear interaction between the unloaded transformer and the transmission system. In the case of the Myanmar electric power system, there are so many wide outage experiences, including complete blackout cases, caused by 230kV line faults and so on. Consequently, Myanmar's system operators have been well trained to deal with wide blackouts. Howver, system blackout restoration has been conducted by relying on the experience of only a few specialists. So, more scientific analysis is required to meet the requirements necessary to ensure fast and reliable system restoration. This paper presents analytical results on the primary restorative transmission system of Myanmar, focusing on the problems during the early restoration process. Methodologies are presented that handle load pick-up, terminal voltage and the reactive capability limitation of black-start generators to compensate the Ferranti effect. Static and dynamic simulation with the PSSolution and EMTDC programs respectively for the six cases are performed in order to select the primary restorative transmission lines.

• Journal of Adhesion and Interface
• /
• v.13 no.4
• /
• pp.171-181
• /
• 2012

The demand characteristics of the conventional 12 kinds of epoxy resins which have been used for restoration of the ceramic relics were investigated to provide standards of the effective materials in this study. The result of durability analysis showed that a liquid type is more effective in ceramic relics (low damage, high strength), and a paste type is more effective in earthenware relics (high damage, low strength). The result of workability analysis appears that the liquid type is higher than the paste type, and a slow curing type is higher than a fast curing type in surface hardness. Therefore, in the case of the liquid type which is hard to reprocess due to high surface hardness, it is necessary to conduct a study on improving physical properties by adding filler. The result of the gloss analysis on epoxy resins showed that the liquid type (colorless) has higher gloss than the paste type, and the slow curing type has higher gloss than the fast curing type in liquid types. CDK-520A/520B and Araldite SV 427-2/HV 427-1 showed the most similar gloss to $700^{\circ}C$ earthenware, Devcon 5 minute, EPO-TEK 301-2, and Quik Wood showed the most similar gloss to celadon and whiteware, Quik Wood, EPO-TEK 301-2, and Devcon 5 minute showed the most similar gloss to buncheongware. It is necessary for conservator to decide the range of the restoration surface by predicting the increase and decrease of the restoration surface because most of the epoxy resins caused the volume change in curing process.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.155-162
• /
• 2003

Fast restoration time and service guarantee are the important goals to achieve the network reliability. In the protection switching scheme, one way to guarantee service fro an application session if a network happens to fail is to establish the restoration path that amounts to the same bandwidth of the working path of the session at the same time. When we setup the restoration path, we can reduce the bandwidth consumption by the restoration path if the path can share the bandwidth required by the other paths. This paper explains the methods how to determine the shared bandwidth of the restoration path in the protection switching scheme, given the maximum bandwidth assigned to a link along the working path. We point out that such sharing algorithm can not reduce the bandwidth consumption by the restoration paths in some cases, which contradict the general conception. We explain why this can happen, and show the simulation results in real network topologies to prove our arguments. We explain the reason of the failure of the sharing effect by the simple sharing algorithm. Finally we propose the way of how we can overcome the failure of the sharing effect, using the complete sharing algorithm based on the link database and showing the results.