• International Journal of Aeronautical and Space Sciences
• /
• v.3 no.1
• /
• pp.39-49
• /
• 2002

This paper presents a robust tracker design method that is specific to the trajectories of target aircraft. This method assumes that representative trajectories of the target aircraft are available. The exact trajectories known to the tracker enables the incorporation of the exact data in the tracker design instead of the measurement data. An estimator is designed to have acceptable performance in tracking a finite number of different target trajectories with a capability to trade off the mean and maximum errors between the exact trajectories and the estimated or predicted trajectories. Constant estimator gains that minimize the cost functions related to the estimation or prediction error are computed off-line from an iterative algorithm. This tracker design method is applied to the longitudinal motion tracking of target aircraft.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.1-11
• /
• 2015

In this paper, the transmission of an improper-complex second-order stationary data sequence is considered over a strictly band-limited frequency-selective channel. It is assumed that the transmitter employs linear modulation and that the channel output is corrupted by additive proper-complex cyclostationary noise. Under the average transmit power constraint, the problem of minimizing the mean-squared error at the output of a widely linear receiver is formulated in the time domain to find the optimal transmit and receive waveforms. The optimization problem is converted into a frequency-domain problem by using the vectorized Fourier transform technique and put into the form of a double minimization. First, the widely linear receiver is optimized that requires, unlike the linear receiver design with only one waveform, the design of two receive waveforms. Then, the optimal transmit waveform for the linear modulator is derived by introducing the notion of the impropriety frequency function of a discrete-time random process and by performing a line search combined with an iterative algorithm. The optimal solution shows that both the periodic spectral correlation due to the cyclostationarity and the symmetric spectral correlation about the origin due to the impropriety are well exploited.

• Wind and Structures
• /
• v.33 no.6
• /
• pp.423-435
• /
• 2021

Although existing algorithms can predict wind speed using historical observation data, for engineering feasibility, most use moment methods and probability density functions to estimate fitted parameters. However, extreme wind speed prediction accuracy for long-term return periods is not always dependent on how the optimized frequency distribution curves are obtained; long-term return periods emphasize general distribution effects rather than marginal distributions, which are closely related to potential extreme values. Moreover, there are different wind speed parent sample types; how to theoretically select the proper extreme value distribution is uncertain. The influence of different sampling time intervals has not been evaluated in the fitting process. To overcome these shortcomings, updated steps are introduced, involving parameter sensitivity analysis for different sampling time intervals. The extreme value prediction accuracy of unknown parent samples is also discussed. Probability analysis of mean wind is combined with estimation of the probability plot correlation coefficient and the maximum likelihood method; an iterative estimation algorithm is proposed. With the updated steps and comparison using a Monte Carlo simulation, a fitting policy suitable for different parent distributions is proposed; its feasibility is demonstrated in extreme wind speed evaluations at Longhua and Chuansha meteorological stations in Shanghai, China.

• Korean Journal of Remote Sensing
• /
• v.29 no.2
• /
• pp.173-182
• /
• 2013

The early Sea-viewing Wide Field-of-view Sensor(SeaWiFS) atmospheric correction algorithm which is the basis of the atmospheric correction algorithm for Geostationary Ocean Color Imager(GOCI) assumes that water-leaving radiances is negligible at near-infrared(NIR) wavelengths. For this reason, all of the satellite measured radiances at the NIR wavelengths are assigned to aerosol radiances. However that assumption would cause underestimation of water-leaving radiances if it were applied to turbid Case-2 waters. To overcome this problem, Management Unit of the North Sea Mathematical Models(MUMM) atmospheric correction algorithm has been developed for turbid waters. This MUMM algorithm introduces new parameter ${\alpha}$, representing the ratio of water-leaving reflectance at the NIR wavelengths. ${\alpha}$ is calculated by statistical method and is assumed to be constant throughout the study area. Using this algorithm, we can obtain comparatively accurate water-leaving radiances in the moderately turbid waters where the NIR water-leaving reflectance is less than approximately 0.01. However, this algorithm still underestimates the water-leaving radiances at the extremely turbid water since the ratio of water-leaving radiance at two NIR wavelengths, ${\alpha}$ is changed with concentration of suspended particles. In this study, we modified the MUMM algorithm to calculate appropriate value for ${\alpha}$ using an iterative technique. As a result, the accuracy of water-leaving reflectance has been significantly improved. Specifically, the results show that the Root Mean Square Error(RMSE) of the modified MUMM algorithm was 0.002 while that of the MUMM algorithm was 0.0048.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.103-110
• /
• 2006

Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations Is increases in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using variance values of noise derived from mean values of LLR in turbo decoder, the proposed algorithm can largely reduce the computation and average number of iterations without BER performance degradation. As a result of simulations, the computation of the proposed algorithm is reduced by about $66{\sim}80%$ compared to conventional algorithm. The average number of iterations is reduced by about $13.99%{\sim}15.74%$ compared to CE algorithm and about $17.88%{\sim}18.59%$ compared to SCR algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.6
• /
• pp.621-626
• /
• 2010

For geometric correction of high-resolution images, the authors matched corresponding objects between a large-scale digital map and a QuickBird image to obtain the coefficients of the first order polynomial. Proximity corrections were performed, using the Boolean operation, to perform automated matching accurately. The modified iterative closest point (ICP) algorithm was used between the point data of the surface linear objects and the point data of the edge objects of the image to determine accurate transformation coefficients. As a result of the automated geometric correction for the study site, an accuracy of 1.207 root mean square error (RMSE) per pixel was obtained.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.447-456
• /
• 2005

This paper describes iterative restoration method of restoring blurred images using the LOG compansion function and Conjugate Gradient method. Conventional restoration methods results satisfy the requirement performance for restoring blurred images. but iteration number and convergence velocity increase. This paper proposed an opmtimised iteration restoration method for the images degraded by blurring effect, using the LOG compansion function and Conjugate Gradient method. Here, the LOG compansion function used to improve local properties of the image being restored, made the visual character and convergence velocity of the restored image improved. Throught the simulation results, the author showed that proposed algorithm produced superior performance results by conventional methods.

• Nuclear Engineering and Technology
• /
• v.53 no.1
• /
• pp.199-207
• /
• 2021

This paper deals with accurate image reconstruction of gamma camera using a coded-aperture mask based on pixel-type CsI(Tl) scintillator coupled with silicon photomultipliers (SiPMs) array. Coded-aperture imaging (CAI) system typically has a smaller effective viewing angle than Compton camera. Thus, if the position of the gamma source to be searched is out of the fully-coded field-of-view (FCFOV) region of the CAI system, artifacts can be generated when the image is reconstructed by using the conventional cross-correlation (CC) method. In this work, we propose an effective method for more accurate reconstruction in CAI considering the source distribution of partially-coded field-of-view (PCFOV) in the reconstruction in attempt to overcome this drawback. We employed an iterative algorithm based on compressed-sensing (CS) and compared the reconstruction quality with that of the CC algorithm. Both algorithms were implemented and performed a systematic Monte Carlo simulation to demonstrate the possiblilty of the proposed method. The reconstructed image qualities were quantitatively evaluated in sense of the root mean square error (RMSE) and the peak signal-to-noise ratio (PSNR). Our simulation results indicate that the proposed method provides more accurate location information of the simulated gamma source than the CC-based method.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.10
• /
• pp.487-492
• /
• 2017

Clustering is a technique which is used to measure similarities between data in big data analysis and data mining field. Among various clustering methods, k-Modes algorithm is representatively used for categorical data. To increase the performance of iterative-centric tasks such as k-Modes, a distributed and concurrent framework Spark has been received great attention recently because it overcomes the limitation of Hadoop. Spark provides an environment that can process large amount of data in main memory using the concept of abstract objects called RDD. Spark provides Mllib, a dedicated library for machine learning, but Mllib only includes k-means that can process only continuous data, so there is a limitation that categorical data processing is impossible. In this paper, we design RDD for k-Modes algorithm for categorical data clustering in spark environment and implement an algorithm that can operate effectively. Experiments show that the proposed algorithm increases linearly in the spark environment.

• Korean Journal of Remote Sensing
• /
• v.37 no.3
• /
• pp.475-491
• /
• 2021

With the recent increase in available high-resolution (< ~1 m) satellite SAR images, the demand for precise registration of SAR images is increasing in various fields including change detection. The registration between high-resolution SAR images acquired in different look angle is difficult due to speckle noise and geometric distortion caused by the characteristics of SAR images. In this study, registration is performed in two stages, coarse and fine, using the x-band SAR data imaged at staring spotlight mode of TerraSAR-X. For the coarse registration, a method combining the adaptive sampling method and SAR-SIFT (Scale Invariant Feature Transform) is applied, and three rigid methods (NCC: Normalized Cross Correlation, Phase Congruency-NCC, MI: Mutual Information) and one non-rigid (Gefolki: Geoscience extended Flow Optical Flow Lucas-Kanade Iterative), for the fine registration stage, was performed for performance comparison. The results were compared by using RMSE (Root Mean Square Error) and FSIM (Feature Similarity) index, and all rigid models showed poor results in all image combinations. It is confirmed that the rigid models have a large registration error in the rugged terrain area. As a result of applying the Gefolki algorithm, it was confirmed that the RMSE of Gefolki showed the best result as a 1~3 pixels, and the FSIM index also obtained a higher value than 0.02~0.03 compared to other rigid methods. It was confirmed that the mis-registration due to terrain effect could be sufficiently reduced by the Gefolki algorithm.