• Journal of the Korean Society for information Management
• /
• v.18 no.2
• /
• pp.7-30
• /
• 2001

The characteristics of the short document representatives and short queries of OPAC systems need the different ranking algorithms from IR systems. This study tested and analyzed the effectiveness of four sorting schemes and four ranking algorithms and the six effectiveness measurements for the ranked Boolean OPAC systems. The sorting by publication year was better but without significant difference. The cover density ranking was significantly better than the frequency-based ranking of the Fuzzy or DNF models. The simple effectiveness measurement based on the average rank of relevant documents retrieved was as good as the others and better than the precision P.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.2
• /
• pp.52-58
• /
• 2014

Exact histogram specification (EHS) transforms the histogram of an input image into the specified histogram. In the conventional EHS techniques, the pixels are first sorted according to their graylevels, and the pixels that have the same graylevel are further differentiated according to the local average of the pixel values and the edge strength. The strictly ordered pixels are then mapped to the desired histogram. However, since the conventional sorting method is inherently dependent on the initial graylevel-based sorting, the contrast enhancement capability of the conventional EHS algorithms is restricted. We propose a modified EHS algorithm considering the just noticeable difference. In the proposed algorithm, the edge pixels are pre-processed such that the output edge pixels obtained by the modified EHS can result in the local contrast enhancement. Moreover, we introduce a new sorting method for the pixels that have the same graylevel. Experimental results show that the proposed algorithm provides better image enhancement performance compared to the conventional EHS algorithms.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.6
• /
• pp.705-713
• /
• 2006

For the analysis of multiunit extracellular neural signals as multiple spike trains, neural spike sorting is essential. Existing algorithms for the spike sorting have been unsatisfactory when the signal-to-noise ratio(SNR) is low, especially for implementation of fully-automated systems. We present a novel method that shows satisfactory performance even under low SNR, and compare its performance with a recent method based on principal component analysis(PCA) and fuzzy c-means(FCM) clustering algorithm. Our system consists of a spike detector that shows high performance under low SNR, a feature extractor that utilizes projection pursuit based on negentropy maximization, and an unsupervised classifier based on Gaussian mixture model. It is shown that the proposed feature extractor gives better performance compared to the PCA, and the proposed combination of spike detector, feature extraction, and unsupervised classification yields much better performance than the PCA-FCM, in that the realization of fully-automated unsupervised spike sorting becomes more feasible.

• Journal of Power Electronics
• /
• v.17 no.2
• /
• pp.346-357
• /
• 2017

The Modular Multilevel Converter (MMC) is particularly attractive for medium and high power applications such as High-Voltage Direct Current (HVDC) systems. In order to reach a high voltage, the number of cascaded submodules (SMs) is generally very large. Thus, in the applications with hundreds or even thousands of SMs such as MMC-HVDCs, the sorting algorithm of the conventional voltage balancing strategy is extremely slow. This complicates the controller design and increases the hardware cost tremendously. This paper presents a Two-Way Merge Sort (TWMS) strategy based on the prediction of the capacitor voltages under ideal conditions. It also proposes an innovative Insertion Sort Correction for the TWMS (ISC-TWMS) to solve issues in practical engineering under non-ideal conditions. The proposed sorting methods are combined with the features of the MMC-HVDC control strategy, which significantly accelerates the sorting process and reduces the implementation efforts. In comparison with the commonly used quicksort algorithm, it saves at least two-thirds of the sorting execution time in one arm with 100 SMs, and saves more with a higher number of SMs. A 501-level MMC-HVDC simulation model in PSCAD/EMTDC has been built to verify the validity of the proposed strategies. The fast speed and high efficiency of the algorithms are demonstrated by experiments with a DSP controller (TMS320F28335).

• Journal of the Korea Computer Industry Society
• /
• v.5 no.2
• /
• pp.325-330
• /
• 2004

The Big O notation of a sorting algorithm analysis is an asymptotic algorithm analysis which gives information of a rough mathematical function with an infinite increase of a sample size, without any specification of a probabilistic model. Hence. in an application with a limited finite number of data, it is necessary to test efficiencies of sorting algorithms. I estimated probabilistic models which analyze the number of exchanges varying input sizes to sort. The estimated models to explain the relationship of sorting efficiency on the sample size (N of the sample size and S of the number of exchange of elements) are S=0.9305 $N^{1.339}$ for Quick sort algorithm with O(nlogn) time complexity, and S=0.2232 $N^{2.0130}$ for Insertion sort algorithm with O( $n^2$) time complexity. Furthermore, there are strongly supports that more than 99% of the above relationship could be explained by the estimated models (p＜0.001). These findings suggest it is necessary to analyze sorting algorithm efficiency in applications with a finite number of data or a newly developed sorting algorithm.

• Journal of Biosystems Engineering
• /
• v.30 no.3 s.110
• /
• pp.172-178
• /
• 2005

Grading and sorting an indeterminate form of agricultural products such as sweet potatoes and potatoes are a labor intensive job because its shape and size are various and complicate. It costs a great deal to sort sweet potato in an indeterminate forms. There is a great need for an automatic grader fur the potatoes. Machine vision is the promising solution for this purpose. The optical indices for qualifying weight and appearance quality such as shape, color, defects, etc. were obtained and an on-line sorting system was developed. The results are summarized as follows. Sorting system combined with an on-line inspection device was composed of 5 sections, human inspection, feeding, illumination chamber, image processing & control, and grading & discharging. The algorithms to compute geometrical parameters related to the external guality were developed and implemented for sorting the deformed sweet potatoes. Grading accuracy by image processing was $96.4\%$ and the processing capacity was 10,800 pieces per hour.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1858-1861
• /
• 2005

Automatic nut sorting machine used to calculate the size of inserted nut and detect the black spot defection is introduced in this paper. Because most of farm products are imported from the underdeveloped countries, domestic farm products have no place to be sold in market. To overcome this critical situation, lowering the productivity cost is strongly demanded to compete with foreign corps. Imaged processed nut sorting algorithm is developed to the automatic nut sorting machine to remove the sorting time which takes lots of man power. This system is composed of mainly two parts, mechanical parts and vision system. The purpose of mechanical part is supplying the nuts automatically to make computer system capture the images of objects. Simplified mechanical system was assembled followed by 3D simulation by Pro/E design for the adaptive cost effects. Several image processing algorithms are designed to detect the spot defects and calculate the size of nuts. Test algorithm shows good results to the designed automatic nut sorting system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.1
• /
• pp.33-42
• /
• 1999

지금까지의 bitonic sorting 에 대한 연구는 N 개의 key를 정렬하기 위해서는 N/2(or N)개의 프로세서가 필요하였다. 여기서는 프로세서의 수가 정렬하고자 하는 key 수에 독립적이고 또한 N/2개 이하인 경우를 고려하였다. 따라서 본 연구에서는 공유 메모리 병렬 컴퓨터 환경에서 N 개의 Key를 고정도니 수의 프로세서를 사용하여 O(log2N) 시간에 정렬 할 수 있는 두 종류의 범용 bitonic sorting 알고리즘을 구현하였다. 첫째로, VITURAL-GPBS 알고리즘은 하나의 프로세서를 사용하여 여러 개의 프로세서가 하는 역할을 모방하므로써 정렬을 수행하도록 하였다. 둘째로, VIRTUAL-GPBS 알고리즘보다 좀 더 효율적이고 빠른 FAST-GPBS 알고리즘을 소개하였다. 두 알고리즘의 주요 차이점은 FAST-GPBS 알고리즘에서는 각각의 프로세서에 배정된 여러 개의 key를 각 프로세서 내에서 가장 빠른 순차 정렬 알고리즘을 사용하면서 먼저 지역적으로 정렬을 함으로써 VIRTUAL-GPBS 보다 효율이 50% 이상 향상된 정렬을 수행할 수 있도록 하였다. FAST-GPBS 알고리즘은 compare-exchange 대신 merge-split 작업을 함으로써 컴퓨터의 사용 효율을 향상시킬 수 있다.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.1
• /
• pp.70-78
• /
• 2010

Elitist nondominated sorting genetic algorithm (NSGA-II) is adopted and improved for multiobjective optimal reactive power flow (ORPF) problem. Multiobjective ORPF, formulated as a multiobjective mixed integer nonlinear optimization problem, minimizes real power loss and improves voltage profile of power grid by determining reactive power control variables. NSGA-II-based ORPF is tested on standard IEEE 30-bus test system and compared with four other state-of-the-art multiobjective evolutionary algorithms (MOEAs). Pareto front and outer solutions achieved by the five MOEAs are analyzed and compared. NSGA-II obtains the best control strategy for ORPF, but it suffers from the lower convergence speed at the early stage of the optimization. Several problem-specific local search strategies (LSSs) are incorporated into NSGA-II to promote algorithm's exploiting capability and then to speed up its convergence. This enhanced version of NSGA-II (ENSGA) is examined on IEEE 30 system. Experimental results show that the use of LSSs clearly improved the performance of NSGA-II. ENSGA shows the best search efficiency and is proved to be one of the efficient potential candidates in solving reactive power optimization in the real-time operation systems.

• Journal of IKEEE
• /
• v.23 no.3
• /
• pp.978-983
• /
• 2019

Under the influence of Autonomous Driving and AI, it is important to accurately recognize and judge objects through cameras. In particular, since a method of recognizing an object using a camera can obtain a large amount of information visually compared to other methods, many image signal processing methods have been studied to extract an accurate image. In addition, a lot of research is being carried out to implementation about hardware. In this work, we compare the principles and characteristics of the sorting algorithms that are frequently used in image signal processing and summarize the performance evaluation. Based on this, we define an efficient algorithm when implemented in hardware among efficient sorting algorithms.