• Journal of Information Processing Systems
• /
• v.17 no.6
• /
• pp.1170-1178
• /
• 2021

This paper proposed a versatile algorithm based on a dual-tree complex wavelet transform for intensifying the visual aspect of medical images. First, the decomposition of the input image into a high sub-band and low-sub-band image is done. Further, to improve the resolution of the resulting image, the high sub-band image is interpolated using Lanczos interpolation. Also, contrast enhancement is performed by singular value decomposition (SVD). Finally, the image reconstruction is achieved by using an inverse wavelet transform. Then, the Gaussian filter will improve the visual quality of the image. We have collected images from the hospital and the internet for quantitative and qualitative analysis. These images act as a reference image for comparing the effectiveness of the proposed algorithm with the existing state-of-the-art. We have divided the proposed algorithm into several stages: preprocessing, contrast enhancement, resolution enhancement, and visual quality enhancement. Both analyses show the proposed algorithm's effectiveness compared to existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.11
• /
• pp.2945-2965
• /
• 2023

The laser inertial measurement unit is a precision device widely used in rocket navigation system and other equipment, and its quality is directly related to navigation accuracy. In the quality evaluation of laser inertial measurement unit, there is inevitably uncertainty in the index input information. First, the input numerical information is in interval form. Second, the index input grade and the quality evaluation result grade are given according to different national standards. So, it is a key step to transform the interval information input by the index into the data form consistent with the evaluation result grade. In the case of uncertain input, this paper puts forward a method based on probability distribution to solve the problem of asymmetry between the reference grade given by the index and the evaluation result grade when evaluating the quality of laser inertial measurement unit. By mapping the numerical relationship between the designated reference level and the evaluation reference level of the index information under different distributions, the index evidence symmetrical with the evaluation reference level is given. After the uncertain input information is transformed into evidence of interval degree distribution by this method, the information fusion of interval degree distribution evidence is carried out by interval evidential reasoning algorithm, and the evaluation result is obtained by projection covariance matrix adaptive evolution strategy optimization. Taking a five-meter redundant laser inertial measurement unit as an example, the applicability and effectiveness of this method are verified.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1130-1133
• /
• 2003

The goal of this research is developing advanced lane detecting algorithm for unmanned vehicle. Previous lane detecting method to bring on error become of the lane loss and noise. Therefore, new algorithm developed to get exact information of lane. This algorithm can be used to AGV(Autonomous Guide Vehicle) and LSWS(Lane Departure Warning System), ACC(Adapted Cruise Control). We used 1/10 scale RC car to embody developed algorithm. A CCD camera is installed on top of vehicle. Images are transmitted to a main computer though wireless video transmitter. A main computer finds information of lane in road image. And it calculates control value of vehicle and transmit these to vehicle. This algorithm can detect in input image marked by 256 gray levels to get exact information of lane. To find the driving direction of vehicle, it search line equation by curve fitting of detected pixel. Finally, author used median filtering method to removal of noise and used characteristic part of road image for advanced of processing time.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.23-28
• /
• 2010

According to increasing projection order, the AP algorithm bas noise amplification problem in large background noise. This phenomenon degrades the performances of the AP algorithm. In this paper, we analyze convergence characteristic of the AP algorithm and then suggest a noise robust modified AP algorithm for reducing this problem. The proposed algorithm normalizes the update equation to reduce noise amplification of AP algorithm, by adding the multiplication of error power and projection order to auto-covariance matrix of input signal. By computer simulation, we show the improved performance than conventional AP algorithm.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3135-3137
• /
• 1999

We propose two robust blind equalization algorithms based on multi-stage clustering blind equalization algorithm, which are called a complex classification update algorithm(CCUA) and an error compensation algorithm(ECA). The first algorithm is a tap-updating algorithm which each computes classified real and imaginary parts in order to reduce computations and the complexity of implementation as a stage increase. The second one is a algorithm which can achieve faster convergence speed because error of equalizer input make always fixed. Test results confirm that the proposed algorithms with faster convergence and lower complexity outperforms both constant modulus algorithm (CMA) and conventional multi-stage blind clustering algorithm(MSA) in reducing the SER as well as the MSE at the equalizer output.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.11
• /
• pp.2292-2298
• /
• 2009

In this paper, the lossy image compression algorithm using the quad tree and the bandlets is proposed. The proposed algorithm transforms input images by the discrete wavelet transform (DWT) and represents the geometrical structures of high frequency bands using the bandlets with a 8 block- size. In addition, the proposed algorithm searches the position information of the significant coefficients by using the quad tree algorithm and computes the magnitude and the sign information of the significant coefficients by using the Embedded Image Coding using Zerotrees of Wavelet Coefficients (EZW) algorithm. The compression result by using the quad tree algorithm improves the PSNR performance of high frequency images up to 1 dB, compared to that of JPEG-2000 algorithm and that of S+P algorithm. The PSNR performance by using DWT and bandlets improves up to 7.5dB, compared to that by using only DWT.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.833-841
• /
• 1997

In this paper, the hybrid LB-TJW(Leaky Bucket-Triggered Jumping Window) algorithm for multimedia traffic control is proposed and its performance is evaluated and analyzed. Its architecture is composed of the peak bit rate controller and the average bit rate controller. Generally, the cell which violates the peak bit rate is discraded in LBalgorithm, and the average bit rate of JW or TJW algorithm is better than that of LB algorithm. However, the hybrid LB-TJW algorithm passes it though the network if the cell does not violate the peak bit rate. If the cell violates the peak bit rate, the hybrid LB-TJW algorithm passes it to the average bit rate controller which perforithm to monitor the average bit rate of input traffic. The TJW algorithm monitors the cell that violates the average bit rate. If the cell does not violate the average bit rare, the LB-TJW algorithm passes it through the network. As simulation results, the cell loss rate and the buffer size of the LB-TJW algorithm is reduced to half as much as those of LB algortihm.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.371-378
• /
• 2002

The EMFG (Extended Mark Flow Graph) is known as a graph model for representing the discrete event systems. In this paper, we introduce input/output matrixes representing the marking variance of input/output boxes when each transition fires in an EMFG, and compute an incidence matrix. We represent firing conditions of transitions to a firing condition matrix for computing a firable vector, and introduce the firing completion vector to decide completion of each transition’s firing. By using them, we improve an analysis algorithm of the EMFG’s operation to be represented all the process of EMFG’s operation mathematically. We apply the proposed algorithm to the system repeating the forward and reverse revolution, and then confirm that it is valid. The proposed algorithm is useful to analysis the variant discrete event systems.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.1
• /
• pp.45-50
• /
• 2015

In this paper, we confirm the effective adaptive algorithm for tha active noise contorl (ANC) though the performance comparison between adaptive algorithms. Generally, the normalized least mean square (NLMS) algorithm has been widely used for an adaptive algorithm thanks to its simplicity and having a fast convergence speed. However, the convergence performance of the NLMS algorithms is often deteriorated by colored input signals. To overcome this problem, the affine pojection (AP) algorithm that updates the weight vector based on a number of recent input vectors can be used for allowing a higher convergence speed than the NLMS algorithm, but it is computationally complex. Thus, the proper algorithm were determined by the comparison between NLMS and AP algorithms regarding as the convergence performance and complexity. Simulation results confirmed that the noise reduction performance of NLMS algorithm was comparable to AP algorithm with low complexity. Therefore the NLMS algorithm is more effective for ANC system.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.1-9
• /
• 1998

Temporal Databases store all of informations by time varying, so the temporal query processor has to process very large information. Therefore, we propose an efficient method of query processing by using the relevance checking algorithm of input query and view definition. The relevance checking algorithm of query investigates relevance between the input query of user about base relation and the execution tree of view definition stored in system catalog. And related input query with view definition have a process of the query translation to the execution tree of view. So temporal query processor is able to increase performance of query processor by reducing the number of tuple.