• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.5
• /
• pp.549-560
• /
• 1989

In this paper, the method of determining the initial weighting vlaues fuctioning as a filter under the Directional Constrained Minimization of Power(DCMP) algorithm is presented. By analyzing the sideband beamformer with the Finite Impulse Response (FIR) filter concepts, the constraints of any desired directions are obtained and the initial weighing values with fast adaptation time are formulated from those constraints. By applying this proposed initial weighting values to the DCMP and the spatial averaging processor, the interference of a desired direction and the coherent noises are eliminated at the same time. The improvement of this method compared with the existing algorithm is confirmed by computer simulation.

• Journal of the Korea Computer Graphics Society
• /
• v.28 no.3
• /
• pp.113-123
• /
• 2022

Ray tracing-based rendering creates by far more realistic images than the traditional rasterization-based rendering. However, it is still burdensome when implemented for a Head-Mounted Display (HMD) system that demands a wide field of view and a high display refresh rate. Furthermore, for presenting high-quality images on the HMD screen, a sufficient number of ray sampling should be carried out per pixel to alleviate visually annoying spatial and temporal aliases. In this paper, we extend the recent selective foveated ray tracing technique by Kim et al. [1], and propose an improved real-time rendering technique that realizes the rendering effect of the classic Whitted-style ray tracing on the HMD system. In particular, by combining the ray tracing hardware-based acceleration technique and time-constrained rendering scheme, we show that fast HMD ray tracing is possible that is well suited to human visual systems.

• Current Optics and Photonics
• /
• v.1 no.2
• /
• pp.107-112
• /
• 2017

An adaptive optics system can be simulated or analyzed to predict its closed-loop performance. However, this type of prediction based on various assumptions can occasionally produce outcomes which are far from actual experience. Thus, every adaptive optics system is desired to be tested in a closed loop on an optical test bench before its application to a telescope. In the close-loop test bench, we need an atmospheric simulator that simulates atmospheric disturbances, mostly in phase, in terms of spatial and temporal behavior. We report the development of an atmospheric turbulence simulator consisting of two point sources, a commercially available deformable mirror with a $12{\times}12$ actuator array, and two random phase plates. The simulator generates an atmospherically distorted single or binary star with varying stellar magnitudes and angular separations. We conduct a simulation of a binary star by optically combining two point sources mounted on independent precision stages. The light intensity of each source (an LED with a pin hole) is adjustable to the corresponding stellar magnitude, while its angular separation is precisely adjusted by moving the corresponding stage. First, the atmospheric phase disturbance at a single instance, i.e., a phase screen, is generated via a computer simulation based on the thin-layer Kolmogorov atmospheric model and its temporal evolution is predicted based on the frozen flow hypothesis. The deformable mirror is then continuously best-fitted to the time-sequenced phase screens based on the least square method. Similarly, we also implement another simulation by rotating two random phase plates which were manufactured to have atmospheric-disturbance-like residual aberrations. This later method is limited in its ability to simulate atmospheric disturbances, but it is easy and inexpensive to implement. With these two methods, individually or in unison, we can simulate typical atmospheric disturbances observed at the Bohyun Observatory in South Korea, which corresponds to an area from 7 to 15 cm with regard to the Fried parameter at a telescope pupil plane of 500 nm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4439-4455
• /
• 2021

Compared with two-stage object detection algorithms, one-stage algorithms provide a better trade-off between real-time performance and accuracy. However, these methods treat the intermediate features equally, which lacks the flexibility to emphasize meaningful information for classification and location. Besides, they ignore the interaction of contextual information from different scales, which is important for medium and small objects detection. To tackle these problems, we propose an image pyramid network based on dual attention mechanism (DAIPNet), which builds an image pyramid to enrich the spatial information while emphasizing multi-scale informative features based on dual attention mechanisms for one-stage object detection. Our framework utilizes a pre-trained backbone as standard detection network, where the designed image pyramid network (IPN) is used as auxiliary network to provide complementary information. Here, the dual attention mechanism is composed of the adaptive feature fusion module (AFFM) and the progressive attention fusion module (PAFM). AFFM is designed to automatically pay attention to the feature maps with different importance from the backbone and auxiliary network, while PAFM is utilized to adaptively learn the channel attentive information in the context transfer process. Furthermore, in the IPN, we build an image pyramid to extract scale-wise features from downsampled images of different scales, where the features are further fused at different states to enrich scale-wise information and learn more comprehensive feature representations. Experimental results are shown on MS COCO dataset. Our proposed detector with a 300 × 300 input achieves superior performance of 32.6% mAP on the MS COCO test-dev compared with state-of-the-art methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.8
• /
• pp.329-335
• /
• 2018

Satellite images, which are widely used in various applications, are very useful for monitoring the surface of the earth. Since satellite data is obtained from a remote sensor, it contains a lot of noise and errors depending on observation weather conditions during data acquisition and sensor malfunction status. Since the accuracy of the data affects the accuracy and reliability of the data analysis results, noise removal and data restoration for high quality data is important. In this study, we propose a reconstruction system that models the time dependent dynamic characteristics of satellite data using a multi-period harmonic model and performs adaptive data restoration considering the spatial correlation of data. The proposed method is a real-time restoration method and thus can be employed as a preprocessing algorithm for real-time reconstruction of satellite data. The proposed method was evaluated with both simulated data and MODIS NDVI data for six years from 2011 to 2016. Experimental results show that the proposed method has the potentiality for reconstructing high quality satellite data.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.79-88
• /
• 2009

The volume of memory to store real-time data stream is varied dynamically. Continuous queries processing the data stream must manage the storage volume dynamically. In previous research, according to current volume of data a general memory manager which allocates and releases memory by a page unit is researched.However, the method frequently executes page allocation and release to store data stream. Moreover, particularly delayed queries can monopolize many of pages because the method directly allocates pages when a query has not enough memory. Focusing on the problems in memory management systems, this research proposes a memory management method which reduces the frequency of allocation and release and uniformly distributes pages for queries. The method can reduce the frequency of allocation and release through allocation based on utilization ratio of pages in each query and prevent memory monopoly through memory allocation which considers query delay.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.47-53
• /
• 2007

True motion estimation is necessary for deinterlacing, frame-rate conversion, and film judder compensation. There have been several block-based approaches to find true motion vectors by tracing minimum sum-of-absolute-difference (SAD) values by considering spatial and temporal consistency. However, the algorithms cannot find robust motion vectors when the texture of objects is changed. To find the robust motion vectors in the region, a recursive vector selection scheme and an adaptive weighting parameter are proposed. Previous frame vectors are recursively averaged to be utilized for motion error region. The weighting parameter controls fidelity to input vectors and the recursively averaged ones, where the input vectors come from the conventional estimators. If the input vectors are not reliable, then the mean vectors of the previous frame are used for temporal consistency. Experimental results show more robust motion vectors than those of the conventional methods in time-varying texture objects.

• Journal of Positioning, Navigation, and Timing
• /
• v.5 no.1
• /
• pp.1-9
• /
• 2016

Range-based wireless localization system must measure accurate range between a mobile node (MN) and reference nodes. However, non-line-of-sight (NLOS) error caused by the spatial structures disturbs the localization system obtaining the accurate range measurements. Localization methods using the range measurements including NLOS error yield large localization error. But filter-based localization methods can provide comparatively accurate location solution. Motivated by the accuracy of the filter-based localization method, a filter residual-based NLOS error estimation method is presented in this paper. Range measurement-based residual contains NLOS error. By considering this factor with NLOS error properties, NLOS error is mitigated. Also a process noise covariance matrix tuning method is presented to reduce the time-delay estimation error caused by the single dynamic model-based filter when the speed or moving direction of a MN changes, that is the used dynamic model is not fit the current dynamic of a MN. The presented methods are evaluated by simulation allowing direct comparison between different localization methods. The simulation results show that the presented filter is more accurate than the iterative least squares- and extended Kalman filter-based localization methods.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.1
• /
• pp.25-32
• /
• 2018

In this paper, we propose an edge detection algorithm for auto focus of infrared camera. We designed and implemented the edge detection of infrared image by using a spatial filter on FPGA. The infrared camera should be designed to minimize the image processing time and usage of hardware resource because these days surveillance systems should have the fast response and be low size, weight and power. we applied the $3{\times}3$ mask filter which has an advantage of minimizing the usage of memory and the propagation delay to process filtering. When we applied Laplacian filter to extract contour data from an image, not only edge components but also noise components of the image were extracted by the filter. These noise components make it difficult to determine the focus state. Also a bad pixel of infrared detector causes a problem in detecting the edge components. So we propose an adaptive edge detection filter that is a method to extract only edge components except noise components of an image by analyzing a variance of pixel data in $3{\times}3$ memory area. And we can detect the bad pixel and replace it with neighboring normal pixel value when we store a pixel in $3{\times}3$ memory area for filtering calculation. The experimental result proves that the proposed method is effective to implement the edge detection for auto focus in infrared camera.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.6 s.312
• /
• pp.60-70
• /
• 2006

Currently, Scalable Video Coding (SVC) is being standardized. By using scalability of SVC, QoS managed video streaming service is enabled in heterogeneous networks even with only one original bitstream. But current SVC is insufficient to dynamic video conversion for the scalability, thereby the adaptation of bitrate to meet a fluctuating network condition is limited. In this paper, we propose dynamic full-scalability conversion method for QoS adaptive video streaming in H.264/AVC SVC. To accomplish full scalability dynamic conversion, we propose corresponding bitstream extraction, encoding and decoding schemes. On the encoder, we newly insert the IDR NAL to solve the problems of spatial scalability conversion. On the extractor, we analyze the SVC bitstream to get the information which enable dynamic extraction. By using this information, real time extraction is achieved. Finally, we develop the decoder so that it can manage changing bitrate to support real time full-scalability. The experimental results showed that dynamic full-scalability conversion was verified and it was necessary for time varying network condition.