Space-variant approaches subject to local image characteristics are useful in practical image restoration because many natural images are nonstationary. Motivated by the success of denoising approaches in the wavelet domain, we propose a region-adaptive restoration approach which adopts a wavelet denoising technique in flat regions after an under-regularized constrained least squares restoration. Experimental results verify that this approach not only improves image quality in mean square error but also contributes to ringing reduction.

The reflection signal in the inverse synthetic aperture radar is measured in the polar coordinate defined by the object rotation angle and the frequency. The reconstruction of fixed scene images requires the coordinate transformation of the polar format data into the rectangular spatial frequency domain, which is then processed by the inverse Fourier transform. In this paper a fast and flexible method of coordinate transformation based on the nearest neighbor interpolation utilizing the Delauney triangulation is at first presented. Then, the induced errors in the transformed rectangular spatial frequency data and the resultant fixed scene images are investigated by simulation under the uniform plane wave transmit-receive mode over the swept frequency 120-160 GHz, and the results which demonstrate the validity of the current coordinate transformation are presented.

In this paper, two efficient codebook searching algorithms for vector quantization (VQ) are presented. The first fast search algorithm utilizes the compactness property of signal energy of orthogonal transformation. On the transformed domain, the algorithm uses geometrical relations between the input vector and codeword to discard many unlikely codewords. The second algorithm, which transforms principal components only, is proposed to alleviate some calculation overhead and the amount of storage. The relation between the principal components and the input vector is utilized in the second algorithm. Since both of the proposed algorithms reject those codewords that are impossible to be the nearest codeword, they produce the same output as conventional full search algorithm. Simulation results confirm the effectiveness of the proposed algorithms.

Most of the image restoration filters proposed so far include parameters that control the restoration properties. For bringing out the optimal restoration performance, these parameters should be determined so as to minimize a certain error measure such as the mean squared error (MSE) between the restored image and original image. However, this is not generally possible since the unknown original image itself is required for evaluating MSE. In this paper, we derive an estimator of MSE called the subspace information criterion (SIC), and propose determining the parameter values so that SIC is minimized. For any linear filter, SIC gives an unbiased estimate of the expected MSE over the noise. Therefore, the proposed method is valid for any linear filter. Computer simulations with the moving-average filter demonstrate that SIC gives a very accurate estimate of MSE in various situations, and the proposed procedure actually gives the optimal parameter values that minimize MSE.

By the growth of the Internet, the client's access to the Internet have been increasing. In order to meet those demands, asymmetric networks have become a great attraction. However, asymmetric networks composed of satellite and terrestrial links have not been enough investigated. Therefore, this paper proposes a new formula for TCP performance evaluation for the asymmetric networks. Using this evaluation formula, we calculate the throughput of TCP Reno over the asymmetric networks taking Slow Start into account. The calculation results are compared with the following: (1) the value based on an existing theoretical formula, (2) the outputs of simulation by NS (Network Simulator), and (3) the experimental results using VSAT (Very Small Aperture Terminal) satellite communication system for satellite links and the Internet for terrestrial links. As a result, it is shown that the new formula is more precise than the one already proposed.

We report on the demonstration of a fast restorable all-optical WDM network. This network consisted of four 44 optical cross-connects (OXC's) and four in-line optical amplifiers. These OXC's monitored not only the status of various network elements and quality of optical signals but also the optical path of each channel continuously. Thus, this network could automatically identify the causes of most network failures. For the fast restoration, we implemented these OXC's by using thermo-optic polymer switches (switching time: < 1.5 ms) and used hardware interrupt when LOS was detected. In addition, we used a pre-planned routing table made by using a simple heuristic routing and wavelength assignment algorithm. The results show that this network could be restored from any single link failure within 6 ms even when the restoration path was 400 km.

We report on the demonstration of a fast restorable all-optical WDM network. This network consisted of four 44 optical cross-connects (OXC's) and four in-line optical amplifiers. These OXC's monitored not only the status of various network elements and quality of optical signals but also the optical path of each channel continuously. Thus, this network could automatically identify the causes of most network failures. For the fast restoration, we implemented these OXC's by using thermo-optic polymer switches (switching time: < 1.5 ms) and used hardware interrupt when LOS was detected. In addition, we used a pre-planned routing table made by using a simple heuristic routing and wavelength assignment algorithm. The results show that this network could be restored from any single link failure within 6 ms even when the restoration path was 400 km.

In this paper, a Wiener filtering method in wavelet domain is proposed for restoring an image corrupted by additive white noise. The proposed method utilizes the multiscale characteristics of wavelet transform and the local statistics of each subband. The size of a filter window for estimating the local statistics in each subband varies with each scale. The local statistics for every pixel in each wavelet subband are estimated by using only the pixels which have a similar statistical property. Experimental results show that the proposed method has better performance over the Lee filter with a window of fixed size.

In this study, we consider a filtering method for image sequence degraded by additive Gaussian noise and/or impulse noise (i.e., mixed noise). For removing the mixed noise from the 1D/2D signal, weighted median filters are well known as a proper choice. We have also proposed a filtering tool based on the weighted median filter with a data-dependent method. We call this data-dependent weighted median (DDWM) filters. Nevertheless, the DDWM filter, its weights are controlled by some local information, is not enough performance to restore the image sequence degraded by the noise. The reason is that the DDWM filter is not able to obtain good filtering performance both in the still and moving regions of an image sequence. To overcome above drawback, we add motion information as a motion detector to the local information that controls the weights of the filters. This new filter is proposed as a Video-Data Dependent Weighted Median (Video-DDWM) filter. Through some simulations, the Video-DDWM filter is shown to give effective restoration results than that given by the DDWM filtering and the conventional filtering method with a motion-conpensation (MC).

This paper proposes a new restoration concept for ATM networks. It realizes the rapid and multiple reliability/cost level restoration required to support many different network services. First, the necessity in realizing rapid and multiple-reliability-level restoration in the future network is shown. The self-healing schemes that is based on distributed restoration mechanism satisfies the rapidity in restoration, but does not satisfy multiple reliability levels. Thus a new self-healing scheme that satisfies them is presented and a Multiple Reliability Level Virtual Path network concept is proposed based on the new self-healing scheme. Next, how to realize the new self-healing scheme is explained as an extension of the existing self-healing scheme with two new simple functions. Finally, evaluations confirm the effectiveness of the proposed scheme. These results show that the proposed new scheme realizes a network that fulfills the rapidity and multiple reliability requirements that are strongly required.

QoS restoration, a new approach to keep QoS of end-to-end ATM connections for failures is proposed. In a network with QoS restoration, each end-to-end connection's customer pre-defines the minimum QoS requirements such as minimum throughput. When a failure occurs, resources such as bandwidth of working connections are reallocated for restoration if they are dispensable to keep the minimum requirements along with the pre-assigned spare resources. This resource reallocation is done in a distributed manner and the result of the modification of a connection is notified to the customer of the connection to help him adjust the way of using it. The effect of the reallocation is mathematically evaluated. It is shown that the reallocation enables to achieve high restoration ratio with insufficient pre-assigned spare resources, such as to restore double-link failures with spare resources prepared for single-link failures, or even to restore single-link failures with no spare resources. It is also shown that pre-assigned spare resources can be reduced if the reallocation is considered in network design phase. The performance of the proposed distributed algorithm is evaluated with an event-driven simulator. The result shows that regardless of whether or not pre-assigned spare resources exist, a restoration ratio which is close to the theoretical maximum can be achieved. A proof-of-concept experimental system is developed by controlling commercial ATM switches via SNMP. The system shows it can effectively manage failures in WAN environment.

This paper proposes an optimal design scheme for photonic transport networks that interconnect multiple wavelength division multiplexing (WDM) self-healing ring systems by using optical cross connects (OXCs). To calculate the number of OXCs required in each hub to interconnect these ring systems, a virtual mesh network is generated, on which the route of each optical path (OP) going through multiple adjacent rings ("ring" is defined as circle in network topology) is determined based on a list of hubs. An integer-programming-based design problem is then formulated that minimizes the overall cost of facilities including OXCs as well as ring systems to accommodate a given demand. By solving this problem, we can simultaneously optimize required number of ring systems in each ring, wavelength assignment within each individual bidirectional ring system, required number of OXCs in each hub, and capacity to be allocated to each OP. Numerical examples show that the ring-based network is more cost-effective than the mesh restorable network when the cost of an OADM is lower than that of an OXC, and the OXC-to-fiber cost-coefficient ratio is sufficiently large.

The purpose of this letter is to modify the correlation least mean squares algorithm using a sum of the lagged squared errors as the cost function and extend the modified CLMS algorithm to two-dimensional domain. The effectiveness of the proposed algorithm is shown by the computer simulation.

In this letter, we remark a well-known nonlinear filtering technique realize immediate effect to suppress the influence of the additive measurement noise in the input to a set theoretic linear blind deconvolution scheme. Numerical examples show ε-separating nonlinear pre-filtering techniques work suitably to this noisy blind deconvolution problem.

A highly reliable and available network which automatically can restore itself from failures is an important concept for the future high capacity broadband networks. Self-healing algorithm, restoring the failed VPs (Virtual Paths) in the backbone ATM networks, is an indispensable technique to meet these requirements. In this paper we propose a coordination-based restoring self-healing algorithm called C-TRUS, which meets different requirements of service classes of survivability by using a simple rerouting and capacity reserving protocols. The simulation results show that the proposed algorithm can restore VPs quickly and improve the restoration time in case of multi-failures by using network resources very efficiently. Furthermore, C-TRUS outperforms the combination method in both restoration ratio and restoration time. In addition, the significant improvement of restoration ratio in the multi-failure scenario has been achieved.

Identification of motion parameters is an important issue in image restoration of a linear motion blur. Based on the human visual-motion sensing properties, an integrated approach with some known image processing techniques is proposed to the estimation of the direction and extent of motion on a linear motion blurred image. Experimental results confirm the feasibility of our approach.

A problem of obtaining an optimal file transfer on a file transmission net N is to consider how to transmit, with a minimum total cost, copies of a certain file of information from some vertices to others on N by the respective vertices' copy demand numbers. This problem is NP-hard for a general file transmission net. So far, some class of N on which polynomial time algorithms for obtaining an optimal file transfer are designed has been known. In addition, if we deal with restricted file transfers, i. e. , forest-type file transfers, we can obtain an optimal 'forest-type' file transfer on more general class of N. This paper proves that for such general nets it suffices to consider forest-type file transfers in order to obtain an optimal file transfer.

We describe an index for estimating the level of interest in Web pages. This "time-based interest" (TBI) index combinates an equation reflecting page accesses and an equation reflecting the decrease in interest over time. These equations work simultaneously by using a parameter that is based on the time since the last access. We experimentally estimated the decrease ratio of the TBI index and evaluated the characteristics of the TBI equation. We found that the index follows Zipf's distribution, indicating that reflects the change in popularity. We also introduce an access-log analysis system called CyberRanking that includes TBI analysis. CyberRanking analyzes the access logs of Web servers and presents the results in 2-D or 3-D graph on a Web browser.

The long spikes have been often recorded at the multiples of the electron cyclotron frequency in the ionograms of the topside sounders observed in low latitudes. There has not been sufficient explanation for the physical cause for occourrence of the long spike so far. Here, by interpreting this phenomenon as receiving the trapped cyclotron harmonic wave, some analyses for the length of spike are done not only from the viewpoint of the sweeping property of the frequency spectrum of the transmitted pulse but also from that of the mutual positional relation between the propagation path and the orbit of the sounder. The cause of forming a single spike and a graphical calculation method for the long spike are proposed, respectively. Thus, the cause and the fine structure of long spike consisting of superposed spikes are clarified.

Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast services. This is because satellite broadcasting is suitable for a large multicast group and a terrestrial network is suitable for a small multicast group. An ST network requires a multicast routing algorithm that can select the appropriate satellite and terrestrial routes. Conventional dynamic routing algorithms for terrestrial networks cannot construct an efficient multicast routing tree because they basically select a less-expensive route when a node is added. We have developed a dynamic routing algorithm, a virtual-cost-based algorithm, for ST networks that selects the route to use according to the multicast group size when a node is added to the group. Simulation showed that the proposed algorithm is advantageous when nodes are added to or removed from the multicast group during steady-state simulation.