• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.975-981
• /
• 2007

In this paper, we propose a spatially adaptive image restoration algorithm using local and statistics and estimated noise. The ratio of local mean, variance, and maximum values with different window size is used to constrain the solution space, and these parameters are computed at each iteration step using partially restored image. In addition, the additive noise estimated from partially restored image and the local constraints are used to determine a parameter for controlling the degree of local smoothness on the solution. The resulting iterative algorithm exhibits increased convergence speed when compared to the non-adaptive algorithm. In addition, a smooth solution with a controlled degree of smoothness is obtained without a prior knowledge about the noise. Experimental results demonstrate that the proposed algorithm requires the similar iteration number to converge, but there is the improvement of SNR more than 0.2 dB comparing to the previous approach.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1424-1436
• /
• 2020

Although huge progress has been made in current image segmentation work, there are still no efficient segmentation strategies for tree image which is taken from natural environment and contains complex background. To improve those problems, we propose a method for tree image segmentation combining adaptive mean shifting with image abstraction. Our approach perform better than others because it focuses mainly on the background of image and characteristics of the tree itself. First, we abstract the original tree image using bilateral filtering and image pyramid from multiple perspectives, which can reduce the influence of the background and tree canopy gaps on clustering. Spatial location and gray scale features are obtained by step detection and the insertion rule method, respectively. Bandwidths calculated by spatial location and gray scale features are then used to determine the size of the Gaussian kernel function and in the mean shift clustering. Furthermore, the flood fill method is employed to fill the results of clustering and highlight the region of interest. To prove the effectiveness of tree image abstractions on image clustering, we compared different abstraction levels and achieved the optimal clustering results. For our algorithm, the average segmentation accuracy (SA), over-segmentation rate (OR), and under-segmentation rate (UR) of the crown are 91.21%, 3.54%, and 9.85%, respectively. The average values of the trunk are 92.78%, 8.16%, and 7.93%, respectively. Comparing the results of our method experimentally with other popular tree image segmentation methods, our segmentation method get rid of human interaction and shows higher SA. Meanwhile, this work shows a promising application prospect on visual reconstruction and factors measurement of tree.

• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.1
• /
• pp.8-16
• /
• 2012

An image obtained from a low light environment results in a low-exposure problem caused by non-ideal camera settings, i.e. aperture size and shutter speed. Of particular note, the multiple color-filter aperture (MCA) system inherently suffers from low-exposure problems and performance degradation in its image classification and registration processes due to its finite size of the apertures. In this context, this paper presents a novel method for the color enhancement of low-exposure images and its application to color shift model-based MCA system for image refocusing. Although various histogram equalization (HE) approaches have been proposed, they tend to distort the color information of the processed image due to the range limits of the histogram. The proposed color enhancement algorithm enhances the global brightness by analyzing the basic cause of the low-exposure phenomenon, and then compensates for the contrast degradation artifacts by using an adaptive histogram specification. We also apply the proposed algorithm to the preprocessing step of the refocusing technique in the MCA system to enhance the color image. The experimental results confirm that the proposed method can enhance the contrast of any low-exposure color image acquired by a conventional camera, and is suitable for commercial low-cost, high-quality imaging devices, such as consumer-grade camcorders, real-time 3D reconstruction systems, digital, and computational cameras.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.4
• /
• pp.11-22
• /
• 1999

Least-mean-square(LMS) adaptive filters have proven to be extremely useful in a number of signal processing tasks. However LMS adaptive filter suffer from a slow rate of convergence for a given steady-state mean square error as compared to the behavior of recursive least squares adaptive filter. In this paper an efficient signal interference control technique is introduced to improve the convergence speed of LMS algorithm with tap weighted vectors updating which were controled by reusing data which was abandoned data in the Adaptive transversal filter in the scheme with data recycling buffers. The computer simulation show that the character of convergence and the value of MSE of proposed algorithm are faster and lower than the existing LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having the same condition of LMS algorithm.

• Progress in Medical Physics
• /
• v.22 no.1
• /
• pp.42-51
• /
• 2011

Nuclear medicine images (SPECT, PET) were widely used tool for assessment of myocardial viability and perfusion. However it had difficult to define accurate myocardial infarct region. The purpose of this study was to investigate methodological approach for automatic measurement of rat myocardial infarct size using polar map with adaptive threshold. Rat myocardial infarction model was induced by ligation of the left circumflex artery. PET images were obtained after intravenous injection of 37 MBq $^{18}F$-FDG. After 60 min uptake, each animal was scanned for 20 min with ECG gating. PET data were reconstructed using ordered subset expectation maximization (OSEM) 2D. To automatically make the myocardial contour and generate polar map, we used QGS software (Cedars-Sinai Medical Center). The reference infarct size was defined by infarction area percentage of the total left myocardium using TTC staining. We used three threshold methods (predefined threshold, Otsu and Multi Gaussian mixture model; MGMM). Predefined threshold method was commonly used in other studies. We applied threshold value form 10% to 90% in step of 10%. Otsu algorithm calculated threshold with the maximum between class variance. MGMM method estimated the distribution of image intensity using multiple Gaussian mixture models (MGMM2, ${\cdots}$ MGMM5) and calculated adaptive threshold. The infarct size in polar map was calculated as the percentage of lower threshold area in polar map from the total polar map area. The measured infarct size using different threshold methods was evaluated by comparison with reference infarct size. The mean difference between with polar map defect size by predefined thresholds (20%, 30%, and 40%) and reference infarct size were $7.04{\pm}3.44%$, $3.87{\pm}2.09%$ and $2.15{\pm}2.07%$, respectively. Otsu verse reference infarct size was $3.56{\pm}4.16%$. MGMM methods verse reference infarct size was $2.29{\pm}1.94%$. The predefined threshold (30%) showed the smallest mean difference with reference infarct size. However, MGMM was more accurate than predefined threshold in under 10% reference infarct size case (MGMM: 0.006%, predefined threshold: 0.59%). In this study, we was to evaluate myocardial infarct size in polar map using multiple Gaussian mixture model. MGMM method was provide adaptive threshold in each subject and will be a useful for automatic measurement of infarct size.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.2
• /
• pp.243-251
• /
• 2010

The military has been putting great efforts into applying data communication on existing voice communication systems being used in NCW(Network Centric Warfare). Data communication will be an effective choice in one of many effort to yield a minimum kill chain, comparing to legacy voice communications, when tactical units conduct their missions. However, the required budget will be enormous, in case of the replacement of a lot of legacy communication systems with new one. As a cost-effective alternative, the tactical data communication systems using the conventional radio systems instead of the development of new radio systems has been proposed. It is mandatory, though, to ensure QoS while maintaining data communication by making use of legacy radio systems already in use. This paper focuses on the performance issues experimented and analyzed for tactical data communication through the legacy radio systems as the first step towards guaranteed QoS. We have conducted various experiments such as the transmission error rate on certain tactical messages, performance evaluation of redundant transfers, the relationship between the transmission frame size and rate of error, the identification of error points in the transmission frame, and techniques to reduce the errors in both hopping and non-hopping modes. As a result of the performance experiments, The adaptive communication module which decides the redundant transmission or the Forward Error Correction(FEC) technique by analyzing channel status and current transmission status(hopping/non-hopping) of the legacy radio should be designed. the FEC technique in non-hopping, and the redundant transmission technique in hopping mode was recommended from the result of experiment with the frame size is 20bytes in non-hopping and 10Bytes frame size in hopping mode.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.139-145
• /
• 2015

This paper compare the VSCA (Variable stepsize Square Contour Algorithm) and VSDA (Variable stepsize Square contour Decision directed Algorithm) adaptive equalization algorithm that is used for the minimization of the intersymbol interference which occurs in the time dispersive channel for the transmission of 16-QAM signal.. In the SCA, it is possible to compensates the amplitude and phase in the received signal that are mixed with the intersymbol interference by the constellatin dependent constant by using the 2nd order statistics of the transmitted signal. But in the VSCA and VSDA, it is possible to the improving the equalization performance by varing the stepsize using the concept of distance adjusted approach for constellation matching. We compare the performance of the VSCA and VSDA algorithm by the computer simulation. For this, the equalizer output signal constellation, residual isi, maximum distortion and MSE were used in the performace index. As a result of computer simulation, the VSCA algorithm has better than the VSDA in every performance index.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.2
• /
• pp.105-110
• /
• 2018

This paper compare the adaptive equalization performance of NM-MMA (Novel Mixed-MMA) algorithm which using the mixed const function by scaling factor values. The mixed cost function of NM-MMA composed of the appropriate weighted addition of gradient vector in the MMA and SE-MMA cost function, and updating the tap coefficient based on these function, it is possible to improve the convergence speed and MSE value of current algorithm. The computer simulation was performed in the same channel, step size, SNR environment by changing the scaling factor, and its performance were compared appling the equalizer output constellation, residual isi, MD, MSE, SER. As a result of computer simulation, the residual values of performance index were reduced in case of the scaling factor of MMA cost function was greater than the scaling factor of SE-MMA. and the convergence speed was improved in case of the scaling factor of SE-MMA was greater than the MMA.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.2
• /
• pp.103-108
• /
• 2020

This paper related with the performance evaluation of mDSE-MMA adaptive equalization algorithm which is possible to reduce the distortion that occurs in nonlinear communication channel like as additive noise, intersymbol interference and fading when transmitting the QAM signal. The DSE-MMA algorithm is possible to reduce the computational load compared to the presently MMA algorithm, it has the degraded equalization performance by this. In order to improve the performance degradation of DSE-MMA, the mDSE-MMA controls the step size according to the existence of arbitrary radius circle of equalizer output is centered at transmitted symbol point. The performance of proposed mDSE-MMA algorithm were compared to present DSE-MMA using the same channel and noise environment by computer simulation. For this, the recoverd signal constellation which is the output of equalizer, residual isi and MD, MSE learning curve which is represents the convergence performance and SER were applied as performance index. As a result of simulation, the mDSE-MMA has more superior to the DSE-MMA in every performance index.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.2
• /
• pp.95-98
• /
• 2013

The LMS(Least Mean Square) algorithm, one of the most famous, is generally used because of tenacity and high mating spots and simplicity of realization, But it has trade-off between nonuniform collection and EMSE(Excess mean square error). To overcome this weakness, a variable step size is used widely, but it needs a lot of calculation loads. In this paper, we suggest changed algorithm in case of environment changes of cars and reduce amount of calculation as it uses original signal and noise signal of IGC(Instantaneous Gain Control) algorithm. In this paper, logarithmic function is removed because of real-time processing IGC. The performance of proposed algorithm is tested to adaptive noise canceller in automobile.