• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.5
• /
• pp.1989-1998
• /
• 2013

As the importance of 'bike revitalization' has been emphasized in our society, many cities around the world put enormous efforts to create a bike-oriented transportation system. None the less, the results were not much productive and effective. In this study, to decide the location and number of the bike-parking facilities, the heuristic P-median algorithm has been applied with and without budget constraints. A test network with 30 candidate locations (centroids) were employed. The results show that the optimum number of bike parking lots with and without the budget limits are 9 and 20, respectively. Since the optimum locations determined in this study were congruous with the actual bike parking lots with high utilization rates, it is expected that the proposed methods can be applied for determining the optimum locations of the bike parking facilities elsewhere. Some limitations and future research agenda have also been discussed.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.1E
• /
• pp.14-21
• /
• 1995

This paper presents a parallel sorting algorithm suitable for the SIMD multiprocessor. The algorithm finds pivots for partitioning the data into ordered subsets. The data can be evenly distributed to be sorted since it uses the probability theory. For n data elements to be sorted on p processors, when $n{\geq}p^2$, the algorithm is shown to be asymptotically optimal. In practice, sorting 8 million data items on 64 processors achieved a 48.43-fold speedup, while the PSRS required a 44.4-fold speedup. On a variety of shared and distributed memory machines, the algorithm achieved better than half-linear speedups.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.77-85
• /
• 2015

This paper proposes a location algorithm that locates newly built p-facilities in the optimal area with minimum cost in a city of n districts. This problem has been classified as NP-hard, to which no polynomial time algorithm exists. The proposed algorithm improves the shortcomings of existing Myopic algorithm by constructing until p-facilities and exchanging locations of p-th facility for p=[1, n-1]. When applied to experimental data of n=5, 7, 10, 55, the proposed algorithm has obtained an approximate value nearest possible to the optimal solution take precedence of reverse-delete method. This algorithm is also simply executable using Excel.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.1
• /
• pp.57-70
• /
• 2004

Given a tree network on which each node has its own demand and also stands for a candidate location of a potential facility. such as plant or warehouse, the f-median problem on the network (PMPOT) is to select less than or equal to P number of facility locations so that the whole demand on a node is satisfied from only one facility and the total demand occurred on the network can be satisfied from those facilities with the minimum total cost, where the total cost Is the sum of transportation costs and the fixed costs of establishing facilities. Tamir(1996) developed an O(p n$^2$) algorithm for PMPOT which is known to be the best algorithm In terms of the time complexity, where n is the number of nodes in the network, but he didn't make any comments or explanation about implementation details for finding the optimal solution. In contrast to Tamir's work, Kariv and Hakimi(1979) developed O(p$^2$n$^2$) algorithm for PMPOT and presented O(n$^2$) algorithm for finding the optimal solution in detail. In this paper, we not only develop another O(p n$^2$) dynamic programming algorithm for PMPOT that is competitive to Tamir's algorithm in terms of the time complexity, but also present O(n) algorithm that is more efficient than kariv and Hakimi's algorithm in finding the optimal solution. finally, we implement our algorithm on a set of randomly generated problems and report the computational results.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.107-117
• /
• 2014

This paper proposed the method of removing baseline drift by eliminating local maxima such as P, R, T-wave signal region and local minima Q, S-wave signal region. We applied morphology-pair operations improved from morphology operation to the ECG signal. To eliminate overshoot in the result of morphology-pair operation, we apply median value operation to the result of morphology-pair operation. We use MIT/BIH database to estimate the proposed algorithm. Experiment result show that proposed algorithm removing baseline drift effectively without orignal ECG signal distortion.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.394-400
• /
• 2016

Currently, with the rapid development of the digital age, multimedia-related image devices become popular. However image deterioration is generated by multiple causes during the transmission process, with typical example of salt and pepper noise. When the noise of high density is added, existing methods are deteriorated in the characteristics of removal noise. After judging the noise condition to remove the salt and pepper noise, if the center pixel is the non-noise pixel, it is replaced with the original pixel. On the other hand, if it is the noise pixel, algorithm is suggested by the study, where the histogram of the corrupted image and the median filters are used. And for objective judgment, the proposed algorithm was compared with existing methods and PSNR(peak signal to noise ratio) was used as judgment standard. As the result of the simulation, The proposed algorithm shows a high PSNR of 32.57[dB] for Lena images that had been damaged of a high density salt and pepper noise(P=60%), Compared to the existing CWMF, A-TMF and AWMF there were improvements by 21.67[dB], 18.07[dB], and 20.13[dB], respectively.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.3
• /
• pp.106-115
• /
• 1999

본 연구에서는 충격잡음이 부가되는 비정상 신호 및 잡음 환경하에서 실시간 시지연 추정이 가능한 SLMPTDE와 ZFLMSTDE의 새로운 적응 시지연 추정 방법을 제안하였다. 본 연구에서 제안한 방법은 중간직교 척도를 바탕으로 임의의 SαS 확률과정에 강건하게 적용할 수 있도록 유도된 확률적 경사형적응 추정 알고리즘으로 구성되었으며, SαS 분포를 갖는 다양한 충격잡음을 대상으로 모의 실험하여 알고리즘의 통계적 수렴특성 및 우정 오차에 대해 분석하였으며, 기존의 LMSTDE 방법과 일정시지연의 경우와 시변시지연의 경우에 대해 실시간 시지연 추정능력을 비교, 분석하였다. 실험결과로부터, LMSTDE 방법은 α≥1.9인 가우시안 잡음에 대해서만 시지연 추정이 가능하였고 P=1로 설정한 SLMPTDE 방법은 1〈α≤2인 경우의 SαS 잡음에 대해 정확한 시지연 추정능력을 보였으며, ZFLMSTDE 방법은 0〈α≤2인 모든 경우의 잡음 환경에 대해 그 능력이 입증되었다.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.04a
• /
• pp.115-120
• /
• 2000

This study is on the application the image processing algorithm for inspection of the aluminium mill strip surface defect. The image of surface defect data was obtained using the CCD camera with the digital signal board. The edge was found from the difference of pixel intensity between the normal image and defect image. Two step were taken to find the edge in the image processing algorithm. First, noise was removed by using the median filter in the image. Second, the edge was sharpened in detail by using the sharpening convolution filter in the image. Canny algorithm was used to defect the exact edge. The defect section was separated from the original image is to find the coordination point p1 and p2 which include the defect image

• Journal of the Korean Society of Radiology
• /
• v.15 no.5
• /
• pp.591-602
• /
• 2021

Acute ischemic stroke(AIS) should be diagnosed within a few hours of onset of cerebral infarction symptoms using diagnostic radiology. In this study, we evaluated the clinical usefulness of SVD and the Bayesian algorithm to measure the volume of cerebral infarction using computed tomography perfusion(CTP) imaging and magnetic resonance diffusion-weighted imaging(MR DWI). We retrospectively included 50 patients (male : female = 33 : 17) who visited the emergency department with symptoms of AIS from September 2017 to September 2020. The cerebral infarct volume measured by SVD and the Bayesian algorithm was analyzed using the Wilcoxon signed rank test and expressed as a median value and an interquartile range of 25 - 75 %. The core volume measured by SVD and the Bayesian algorithm using was CTP imaging was 18.07 (7.76 - 33.98) cc and 47.3 (23.76 - 79.11) cc, respectively, while the penumbra volume was 140.24 (117.8 - 176.89) cc and 105.05 (72.52 - 141.98) cc, respectively. The mismatch ratio was 7.56 % (4.36 - 15.26 %) and 2.08 % (1.68 - 2.77 %) for SVD and the Bayesian algorithm, respectively, and all the measured values had statistically significant differences (p < 0.05). Spearman's correlation analysis showed that the correlation coefficient of the cerebral infarct volume measured by the Bayesian algorithm using CTP imaging and MR DWI was higher than that of the cerebral infarct volume measured by SVD using CTP imaging and MR DWI (r = 0.915 vs. r = 0.763 ; p < 0.01). Furthermore, the results of the Bland Altman plot analysis demonstrated that the slope of the scatter plot of the cerebral infarct volume measured by the Bayesian algorithm using CTP imaging and MR DWI was more steady than that of the cerebral infarct volume measured by SVD using CTP imaging and MR DWI (y = -0.065 vs. y = -0.749), indicating that the Bayesian algorithm was more reliable than SVD. In conclusion, the Bayesian algorithm is more accurate than SVD in measuring cerebral infarct volume. Therefore, it can be useful in clinical utility.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.7
• /
• pp.1383-1388
• /
• 2016

Although image signal processing is used in many fields, degradation takes place in the process of transmitting image data by several causes. CWMF, A-TMF, and AWMF are the typical methods to eliminate noises from image data damaged under salt and pepper noise environment. However, those filters are not effective for noise rejection under highly dense noise environment. In this respect, the present study proposed an algorithm to remove in salt and pepper noise. In case the center pixel is determined to be non-noise, it is replaced with original pixel. In case the center pixel is noise, it segments local mask into 4 directions and uses linear interpolation to estimate original pixel. And then it applies spatial weight to the estimated pixel. The proposed algorithm shows a high PSNR of 24.56[dB] for House images that had been damaged of salt and pepper noise(P = 50%), compared to the existing CWMF, A-TMF and AWMF there were improvements by 16.46[dB], 12.28[dB], and 12.32[dB], respectively.