• 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.

• IE interfaces
• /
• v.2 no.2
• /
• pp.15-24
• /
• 1989

When we design, plan, and schedule for group technology, the limitation on the machine cells and cell size may occur. The purpose of this study is to find machine cells and part families to minimize the exceptional elements, constraining both the number of machine cells and the cell size. To solve this problem, the algorithm extending Kusiak's p-median method is proposed. In the proposed algorithm, the method finding initial solution and reducing the number of constraints is presented for computational efficiency. The proposed algorithm is evaluated and compared with well-known algorithms for machine-part group formation in terms of the exceptional elements. An example is shown to illustrate the proposed algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.1-9
• /
• 2005

This paper proposes the heuristic algorithm for the generalized GT problems to consider the restrictions which are given the number of machine cell and maximum number of machines in machine cell as well as minimum number of machines in machine cell. This approach is split into two phase. In the first phase, we use the similarity coefficient which proposes and calculates the similarity values about each pair of all machines and sort these values descending order. If we have a machine pair which has the largest similarity coefficient and adheres strictly to the constraint about birds of a different feather (BODF) in a machine cell, then we assign the machine to the machine cell. In the second phase, we assign parts into machine cell with the smallest number of exceptional elements. The results give a machine-part grouping. The proposed algorithm is compared to the Modified p-median model for machine-part grouping.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.23-36
• /
• 1997

In the design of telecommunication network, the network configuration using hubbing topology is useful for designing and managing the network efficiently : i. e. all of central offices (COs) are grouped into clusters. Each cluster has one hub consisting of large-scale transmission facilities like digital cross-connect systems and ATMs. In clustering process, the community of interest and geographical factor should be considered. However, there exists a tradeoff between two factors. One is to minimize total link costs for geographical factor and the other is to maximize the total intra-cluster traffics for community of interest. Hence, this can be solved by multiobjective linear programming techniques. In this paper, the problem under considerations is formulated as two p-median subproblems taking into considerations total costs and total intra-traffics, respectively. Then we propose the algorithm to solve the problem based on the concept of cost-traffic tradeoff. The algorithm enables to identify efficient cost-traffic tradeoff pairs. An illustration is also presented.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.20-26
• /
• 2005

This paper proposes the heuristic algorithm for the generalized GT problems to consider the restrictions which are given the number of machine cell and maximum number of machines in machine cell as well as minimum number of machines in machine cell. This approach is split into two phase. In the first phase, we use the similarity coefficient which proposes and calculates the similarity values about each pair of all machines and sort these values descending order. If we have a machine pair which has the largest similarity coefficient and adheres strictly to the constraint about birds of a different feather (BODF) in a machine cell, then we assign the machine to the machine cell. In the second phase, we assign parts into machine cell with the smallest number of exceptional elements. The results give a machine-part grouping. The proposed algorithm is compared to the Modified p-median model for machine-part grouping.

• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.05
• /
• pp.320-324
• /
• 1996

Digital fetal monitoring system based on the personal computer combined with the digital signal processing board was implemented. The DSP board acquires and digitally processes ultrasound fetal Doppler signal for digital rectification, FIR filtering, autocorrelation function calculation, its peak detection and MEDIAN filtering. The personal computer interfaced with the DSP board is in charge of graphic display, hardcopy, data transmission and on-line analysis of fetal heart rate change including and variability. I used a recursive technique for autocorrelation function computation method and MEDIAN filter which can greatly reduce the amount of calculation and accuracy. I also implemented analysis algorithm of fetal heart rate change based on normal fetal sample data in order to exact diagnosis.

• 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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.295-301
• /
• 2014

In the absence of a sorting algorithm faster than O(n log n), Quicksort remains the best and fastest of its kind in practice. For given n data, Quicksort records running in O(n log n) at best and $O(n^2)$ at its worst. In this paper, I propose an algorithm by which 3-points average P=(L+M+H)/3 is set as a pivot for first array L=a[s], last array H=a[e], and middle array $M=a[{\lfloor}(s+e)/2{\rfloor}]$ in order to find the more fast than Quicksort. Test results prove that the proposed 3-points average pivot Quicksort has the time complexity of O(n log n) at its best, average, and worst cases. And the proposed algorithm can be reduce the $O(n^2)$ time of Quicksort to O(n log n).

• Tuberculosis and Respiratory Diseases
• /
• v.85 no.1
• /
• pp.89-95
• /
• 2022

Background: With the introduction of Xpert MTB/RIF assay (Xpert), its incorporation into tuberculosis (TB) diagnostic algorithm has become an important issue. The aim of this study was to evaluate the performance of the Xpert assay in comparison with a commercial polymerase chain reaction (PCR) assay. Methods: Medical records of patients having results of both Xpert and AdvanSure TB/NTM real-time PCR (AdvanSure) assays using the same bronchial washing specimens were retrospectively reviewed. Results: Of the 1,297 patients included in this study, 205 (15.8%) were diagnosed with pulmonary TB. Using mycobacterial culture as the reference method, sensitivity of the Xpert assay using smear-positive specimens was 97.5%, which was comparable to that of the AdvanSure assay (96.3%, p=0.193). However, the sensitivity of the Xpert assay using smear-negative specimens was 70.6%, which was significantly higher than that of the AdvanSure assay (52.9%, p=0.018). Usng phenotypic drug susceptibility testing as the reference method, sensitivity and specificity for detecting rifampicin resistance were 100% and 99.1%, respectively. Moreover, a median turnaround time of the Xpert assay was 1 day, which was significantly shorter than 3 days of the AdvanSure assay (p<0.001). Conclusion: In comparison with the AdvanSure assay, the Xpert assay had a higher sensitivity using smear-negative specimens, a shorter turnaround time, and could reliably predict rifampin resistance. Therefore, the Xpert assay might be preferentially recommended over TB-PCR in Korean TB diagnostic algorithm.

• 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.