• Journal of Broadcast Engineering
• /
• v.26 no.4
• /
• pp.429-440
• /
• 2021

With the recent development of deep convolutional neural network learning, deep learning techniques applied to single image super-resolution are showing good results. One of the existing deep learning-based super-resolution techniques is RDN(Residual Dense Network), in which the initial feature information is transmitted to the last layer using residual dense blocks, and subsequent layers are restored using input information of previous layers. However, if all hierarchical features are connected and learned and a large number of residual dense blocks are stacked, despite good performance, a large number of parameters and huge computational load are needed, so it takes a lot of time to learn a network and a slow processing speed, and it is not applicable to a mobile system. In this paper, we use the residual dense structure, which is a continuous memory structure that reuses previous information, and the residual dense channel attention block using the channel attention method that determines the importance according to the feature map of the image. We propose a method that can increase the depth to obtain a large receptive field and maintain a concise model at the same time. As a result of the experiment, the proposed network obtained PSNR as low as 0.205dB on average at 4× magnification compared to RDN, but about 1.8 times faster processing speed, about 10 times less number of parameters and about 1.74 times less computation.

• Journal of Astronomy and Space Sciences
• /
• v.24 no.4
• /
• pp.275-284
• /
• 2007

For the application to the numerical weather prediction (NWP) in active service, it is necessary to ensure that the GPS precipitable water vapor (PWV) data has less than one hour latency and three millimeter accuracy. The comparison and the verification between the daily products from GPS measurement by using the IGS final ephemeris and the conventional meteorological observation has been done in domestic researches. In case of using IGS final ephemeris, GPS measurements can be only post processed in daily basis in three weeks after the observation. Thus this method cannot be applied to any near real-time data processing. In this paper, a GPS data processing method to produce the PWV output with three mm accuracy and one hour latency for the data assimilation in NWP has been planned. For our new data processing strategy, IGS ultra-rapid ephemeris and the sliding window technique are applied. And the results from the new strategy has been verified. The GPS measurements during the first 10 days of January, April, July and October were processed. The results from the observations at Sokcho, where the GPS and radiosonde were collocated, were compared. As the results, a data processing strategy with 0.8 mm of mean bias and 1.7 mm of standard deviation in three minutes forty-three seconds has been established.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.413-420
• /
• 2006

Most vendors of digital signal processors (DSPs) support a Harvard architecture, which has two or more memory buses, one for program and one or more for data and allow the processor to access multiple words of data from memory in a single instruction cycle. We already addressed how to efficiently assign data to multi-memory banks in our previous work. This paper reports on our recent attempt to optimize run-time memory. The run-time environment for dual data memory banks (DBMBs) requires two run-time stacks to control activation records located in two memory banks corresponding to calling procedures. However, activation records of two memory banks for a procedure are able to have different size. As a consequence, dual run-time stacks can be unbalanced whenever a procedure is called. This unbalance between two memory banks causes that usage of one memory bank can exceed the extent of on-chip memory area although there is free area in the other memory bank. We attempt balancing dual run-time slacks to enhance efficiently utilization of on-chip memory in this paper. The experimental results have revealed that although our algorithm is relatively quite simple, it still can utilize run-time memories efficiently; thus enabling our compiler to run extremely fast, yet minimizing the usage of un-time memory in the target code.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.600-619
• /
• 2006

According to recent technical advances on sensors and mobile devices, processing of data streams generated by the devices is becoming an important research issue. The data stream of real values obtained at continuous time points is called streaming time-series. Due to the unique features of streaming time-series that are different from those of traditional time-series, similarity matching problem on the streaming time-series should be solved in a new way. In this paper, we propose an efficient algorithm for streaming time- series matching problem that supports normalization transform. While the existing algorithms compare streaming time-series without any transform, the algorithm proposed in the paper compares them after they are normalization-transformed. The normalization transform is useful for finding time-series that have similar fluctuation trends even though they consist of distant element values. The major contributions of this paper are as follows. (1) By using a theorem presented in the context of subsequence matching that supports normalization transform[4], we propose a simple algorithm for solving the problem. (2) For improving search performance, we extend the simple algorithm to use $k\;({\geq}\;1)$ indexes. (3) For a given k, for achieving optimal search performance of the extended algorithm, we present an approximation method for choosing k window sizes to construct k indexes. (4) Based on the notion of continuity[8] on streaming time-series, we further extend our algorithm so that it can simultaneously obtain the search results for $m\;({\geq}\;1)$ time points from present $t_0$ to a time point $(t_0+m-1)$ in the near future by retrieving the index only once. (5) Through a series of experiments, we compare search performances of the algorithms proposed in this paper, and show their performance trends according to k and m values. To the best of our knowledge, since there has been no algorithm that solves the same problem presented in this paper, we compare search performances of our algorithms with the sequential scan algorithm. The experiment result showed that our algorithms outperformed the sequential scan algorithm by up to 13.2 times. The performances of our algorithms should be more improved, as k is increased.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.742-757
• /
• 2001

Since database management systems(DBMSS) have limited lock resources, transactions requesting locks beyond the limit mutt be aborted. In the worst carte, if such transactions are aborted repeatedly, the DBMS can become paralyzed, i.e., transaction execute but cannot commit. Lock escalation is considered a solution to this problem. However, existing lock escalation methods do not provide a complete solution. In this paper, we prognose a new lock escalation method, adaptive lock escalation, that selves most of the problems. First, we propose a general model for lock escalation and present the concept of the unescalatable look, which is the major cause making the transactions to abort. Second, we propose the notions of semi lock escalation, lock blocking, and selective relief as the mechanisms to control the number of unescalatable locks. We then propose the adaptive lock escalation method using these notions. Adaptive lock escalation reduces needless aborts and guarantees that the DBMS is not paralyzed under excessive lock requests. It also allows graceful degradation of performance under those circumstances. Third, through extensive simulation, we show that adaptive lock escalation outperforms existing lock escalation methods. The results show that, compared to the existing methods, adaptive lock escalation reduces the number of aborts and the average response time, and increases the throughput to a great extent. Especially, it is shown that the number of concurrent transactions can be increased more than 16 ~256 fold. The contribution of this paper is significant in that it has formally analysed the role of lock escalation in lock resource management and identified the detailed underlying mechanisms. Existing lock escalation methods rely on users or system administrator to handle the problems of excessive lock requests. In contrast, adaptive lock escalation releases the users of this responsibility by providing graceful degradation and preventing system paralysis through automatic control of unescalatable locks Thus adaptive lock escalation can contribute to developing self-tuning: DBMSS that draw a lot of attention these days.

• Journal of Oral Medicine and Pain
• /
• v.30 no.1
• /
• pp.87-106
• /
• 2005

In order to evaluate the mechanism of transmission as well as processing of sensory information originating from low-threshold mechanoreceptor in oral and maxillofacial region at primary synaptic region of trigeminal nervous system, vibrissa afferent fibers of adult cat were labeled with intra-axonal HRP injection. Serial sections containing labeled boutons were obtained from the piece of trigeminal interpolar nucleus. Under electron microscope, total 30 labeled boutons were observed, and ultrastructural characteristics, frequency of occurence, synaptic organizations of vibrissa afferent terminals were analysed. The results were as follows: 1. Labeled boutons contained clear, spherical synaptic vesicles with diameter of 45$\sim$55nm. They formed asymmetrical synapse with dendrites showing definite postsynaptic density, larger synaptic cleft, multiple synaptic structures at various regions. With unlabeled axon terminals(p-ending) containing polymorphic synaptic vesicles, they formed symmetrical synapse showing indefinite postsynaptic density and narrower synaptic area. 2. Each labeled bouton formed 1 to 15 synapses, the average of 4.77$\pm$3.37 contacts per labeled bouton, with adjacent neuronal profiles. Relatively complex synaptic organization, which formed synapses with more than 5 neuronal profiles, was observed in a large number(46.7%, n=14) of labeled boutons. 3. Axo-somatic synapse was not observed. The number of axo-dendritic synapse was 1.83$\pm$1.37 per labeled bouton. Majority(85.0%) of axo-dendritic synapses were formed with dendritic shafts, nonprimary dendrites(n=47, 1.57$\pm$1.38/1 bouton), however, synapses formed with primary dendrites(n=6, 0.20$\pm$0.41/1 bouton) or dendritic spines(n=2, 0.07$\pm$0.25/1 bouton) were rare. 4. 76.7%(n=23) of labeled boutons formed axo-axonic synapse (2.93$\pm$2.36/1 bouton) with p-endings containing pleomorphic vesicles. Synaptic triad, in which p-endings formed synapses with labeled boutons and dendrites adjacent to the labeled boutons simultaneoulsy, were also observed in 60.0%(n=18) of labeled boutons. From the above results, vibrissa afferent terminals of adult cat showed distinctive synaptic organization in the trigeminal interpolar nucleus, thus, suggests their correlation with the function of the trigeminal interpolaris nucleus, which participates in processing of complex sensory information such as two-point discrimination and motivational-affective action. Further studies on physiologic functions such as quantitative analysis on ultrastructures of afferent terminals and nerve transmitters participating in presynaptic inhibition are required.

• Journal of KIISE:Software and Applications
• /
• v.37 no.1
• /
• pp.29-38
• /
• 2010

We propose an interactive projection technique to display details of a large image in a high resolution and brightness by tracking a portable projector. A closed-loop based tracking method is presented to update the projected image while a user changes the position of the detail area by moving the portable projector. A marker is embedded in the large image to indicate the position to be occupied by the detail image projected by the portable projector. The marker is extracted in sequential images acquired by a camera attached to the portable projector. The marker position in the large display image is updated under a constraint that the center positions of marker and camera frame coincide in every camera frame. The image and projective transformation for warping are calculated using the marker position and shape in the camera frame. The marker's four corner points are determined by a four-step segmentation process which consists of camera image preprocessing based on HSI, edge extraction by Hough transformation, quadrangle test, and cross-ratio test. The interactive projection system implemented by the proposed method performs at about 24fps. In the user study, the overall feedback about the system usability was very high.