• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.402-404
• /
• 2003

We present two methods for the automatic selection of the threshold values in unsupervised change detection. Both methods consist of the same two procedures: 1) to determine the parameters of Gaussian mixtures from a difference image or ratio image, 2) to determine threshold values using the Bayesian rule for minimum error. In the first method, the Expectation-Maximization algorithm is applied for estimating the parameters of the Gaussian mixtures. The second method is based on the iterative thresholding that successively employs thresholding and estimation of the model parameters. The effectiveness and applicability of the methods proposed here are illustrated by an experiment on the multi-temporal KOMPAT-1 EOC images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2A
• /
• pp.112-120
• /
• 2010

In this paper, we propose semi-ML adaptive parallel QRDM (APQRDM) and iterative QRDM (AIQRDM) algorithms based on set grouping. Using the set grouping, the tree-search stage of QRDM algorithm is divided into partial detection phases (PDP). Therefore, when the treesearch stage of QRDM is divided into 4 PDPs, the APQRDM latency is one fourth of that of the QRDM, and the hardware requirements of AIQRDM is approximately one fourth of that of QRDM. Moreover, simulation results show that in $4{\times}4$ system and at Eb/N0 of 12 dB, APQRDM decreases the average computational complexity to approximately 43% of that of the conventional QRDM. Also, at Eb/N0 of 0dB, AIQRDM reduces the computational complexity to about 54% and the average number of metric comparisons to approximately 10% of those required by the conventional QRDM and AQRDM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9A
• /
• pp.917-923
• /
• 2008

The D-STTD system obtains the diversity gain through the STTD scheme and the Multiplexing gain through parallel structure of the encoder using the STTD scheme known Alamouti Code. We are difficult to use Combining scheme of the STTD scheme for the D-STTD detection in the decoder because the D-STTD system transmits mutually different data in each other STTD encoder for multiplexing gain. Therefore, in this paper we combine the D-STTD system with Linear algorithm, SIC algorithm and OSIC algorithm known multiplexing detection scheme based on MMSE scheme and compare the performance of each system. And we propose the detection scheme of the D-STTD using MAP Algorithm and analyze the performance of each system. The simulation results show that the detector using iterative algorithm has better performance than Linear MMSE Detector. Especially, we show that the detector using MAP algorithm outperforms conventional detector.

• Korean Journal of Remote Sensing
• /
• v.31 no.5
• /
• pp.361-370
• /
• 2015

Various algorithms such as Chronochrome(CC), Principle Component Analysis(PCA), and spectral unmixing have been studied for hyperspectral change detection. Change detection by spectral unmixing offers useful information on the nature of the change compared to the other change detection methods which provide only the locations of changes in the scene. However, hyperspectral change detection by spectral unmixing is still in an early stage. This research proposed a new approach to extract endmembers, which have identical properties in temporally different images, by Iterative Error Analysis (IEA) and Spectral Angle Mapper(SAM). The change map obtained from the difference of abundance efficiently showed the changed pixels. Simulated images generated from Compact Airborne Spectrographic Imager (CASI) and Hyperion were used for change detection, and the experimental results showed that the proposed method performed better than CC, PCA, and spectral unmixing using N-FINDR. The proposed method has the advantage of automatically extracting endmembers without prior information, and it could be applicable for the real images composed of many materials.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_3
• /
• pp.1427-1443
• /
• 2018

Object-based image analysis (OBIA) allows higher computation efficiency and usability of information inherent in the image, as it reduces the complexity of the image while maintaining the image properties. Superpixel methods oversegment the image with a smaller image unit than an ordinary object segment and well preserve the edges of the image. SLIC (Simple linear iterative clustering) is known for outperforming the previous superpixel methods with high image segmentation quality. Although the input parameter for SLIC, number of superpixels has considerable influence on image segmentation results, impact analysis for SLIC parameter has not been investigated enough. In this study, we performed optimal parameter analysis and evaluation of change detection for SLIC-based superpixel techniques using KOMPSAT data. Forsuperpixel generation, three superpixel methods (SLIC; SLIC0, zero parameter version of SLIC; SNIC, simple non-iterative clustering) were used with superpixel sizes in ranges of $5{\times}5$ (pixels) to $50{\times}50$ (pixels). Then, the image segmentation results were analyzed for how well they preserve the edges of the change detection reference data. Based on the optimal parameter analysis, image segmentation boundaries were obtained from difference image of the bi-temporal images. Then, DBSCAN (Density-based spatial clustering of applications with noise) was applied to cluster the superpixels to a certain size of objects for change detection. The changes of features were detected for each superpixel and compared with reference data for evaluation. From the change detection results, it proved that better change detection can be achieved even with bigger superpixel size if the superpixels were generated with high regularity of size and shape.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8C
• /
• pp.522-528
• /
• 2011

The iterative detection and decoding (IDD) has been shown to dramatically improve the bit error rate (BER) performance of the multiple-input multiple-output (MIMO) communication systems. However, these techniques require a high computational complexity since it is required to compute the soft decisions for each bit. In this paper, we show IDD comprised of sphere decoder with low-density parity check (LDPC) codes and present the tree search strategy, called a layer symbol search (LSS), to obtain soft decisions with a low computational complexity. In addition, an adaptive early termination is proposed to reduce the computational complexity during an iteration between an inner sphere decoder and an outer LDPC decoder. It is shown that the proposed approach can achieve the performance similar to an existing algorithm with 70% lower computational complexity compared to the conventional algorithms.

• Journal of Advanced Navigation Technology
• /
• v.13 no.3
• /
• pp.385-392
• /
• 2009

Simplified minimum mean square error (MMSE) detection technique combined with soft interference cancellation(SoIC) is proposed for iterative receivers in multiple antenna systems. To avoid repeated matrix inversions required to obtain the MMSE filter coefficients during the iteration between the soft detector and decoder, simplified matrix inversion techniques are applied to calculate the filter coefficient matrix. Simulation results show that the proposed MMSE detections with SoIC indicate a comparable or slightly degraded detection performance while achieving a significantly reduced complexity as compared to the conventional MMSE detection with SoIC.

• Smart Structures and Systems
• /
• v.4 no.6
• /
• pp.779-794
• /
• 2008

Observer-based fault detection and isolation (FDI) filter design method is a model-based method. By carefully choosing the observer gain, the residual outputs can be projected onto different independent subspaces. Each subspace corresponds to the monitored structural element so that the projected residual will be nonzero when the associated structural element is damaged and zero when there is no damage. The key point of detection filter design is how to find an appropriate observer gain. This problem can be interpreted in a geometric framework and is found to be equivalent to the problem of finding a decentralized static output feedback gain. But, it is still a challenging task to find the decentralized controller by either analytical or numerical methods because its solution set is, generally, non-convex. In this paper, the concept of detection filter and iterative LMI technique for decentralized controller design are combined to develop an algorithm to compute the observer gain. It can be used to monitor structural element state: healthy or damaged. The simulation results show that the developed method can successfully identify structural damages.

• Nuclear Engineering and Technology
• /
• v.55 no.12
• /
• pp.4350-4356
• /
• 2023

Radiation detection systems working at high count rates suffer from the overlapping of their output electric pulses, known as pulse pile-up phenomenon, resulting in spectrum distortion and degradation of the energy resolution. Pulse tail extrapolation is a pile-up correction method which tries to restore the shifted baseline of a piled-up pulse by extrapolating the overlapped part of its preceding pulse. This needs a mathematical model which is almost always nonlinear, fitted usually by a nonlinear least squares (NLS) technique. NLS is an iterative, potentially time-consuming method. The main idea of the present study is to replace the NLS technique by an integration-based non-iterative method (NIM) for pulse tail extrapolation by an exponential model. The idea of linear extrapolation, as another non-iterative method, is also investigated. Analysis of experimental data of a NaI(Tl) radiation detector shows that the proposed non-iterative method is able to provide a corrected spectrum quite similar with the NLS method, with a dramatically reduced computation time and complexity of the algorithm. The linear extrapolation approach suffers from a poor energy resolution and throughput rate in comparison with NIM and NLS techniques, but provides the shortest computation time.

• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.973-982
• /
• 2003

This paper presents an efficient method for automatically detecting objects in a given image. The GHT is a robust template matching algorithm for automatic object detection in order to find objects of various shapes. Many different templates are applied by the GHT in order to find objects of various shapes and size. Every boundary detected by the GHT scan be used as an initial outline for more precise contour-finding techniques. The main weakness of the GHT is the excessive time and memory requirements. In order to overcome this drawback, the proposed algorithm uses a multiresolution search by scaling down the original image to half-sized and quarter-sized images. Using the information from the first iterative GHT on a quarter-sized image, the range of nuclear sizes is determined to limit the parameter space of the half-sized image. After the second iterative GHT on the half-sized image, nuclei are detected by the fine search and segmented with edge information which helps determine the exact boundary. The experimental results show that this method gives reduction in computation time and memory usage without loss of accuracy.