• Journal of Electrical Engineering and information Science
• /
• v.2 no.5
• /
• pp.1-8
• /
• 1997

The main purpose of the Boolean equivalence problem is to verify that two Boolean expressions have the same functionality. Simulation has been extensively used as the standard method for the equivalence problem. Obviously, the number of tests required to perform a satisfactory coverage grows exponentially with the number of input variables. However, formal methods as opposed to simulation are getting more attention from the community. We propose a new algorithm called the Cover-Merge Algorithm based on a derivational method using the concept of cover and merge for the equivalence problem and investigate its theoretical aspects. Because of the difficulty of the problem, we emphasize simplification techniques in order to reduce the search space or problem size. Heuristics based on types of merges are developed to speed up the derivation process by allowing simplifications. In comparison with widely used technique called Binary Decision Diagram or BDD, the algorithm proposed outperforms BDD in nearly all cases of input including standard benchmark problems.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.518-521
• /
• 2015

컴퓨터 비전이나 감시영상 시스템에서 유동인구 수 측정은 보안 및 경제적 측면에서 중요한 과제이다. 본 논문에서는 RGB센서와 Depth센서를 이용해서 유동 인체를 식별하고 추적하며, 유동인구 수를 측정하는 방법을 제안한다. 제안된 방법은 받아온 영상에서 유동인체를 검출하고, 검출된 인체를 추적한다. 추적된 정보는 이동방향 인식을 하기 위해 사용된다. 중첩에 대한 문제를 해결하기 위해 Merge&Separate 방법과 Kinect Merge&Separate방법을 제안한다. 검출된 유동인체에 대한 정보는 다양한 변수들로 저장된다. 또한 RGB센서와 Depth센서의 장단점을 상호 보완할 수 있는 인체 매칭 시스템을 제안한다. 본 논문의 실험은 자체적으로 제작한 영상을 사용하여 실험을 진행하였다. 실험을 통하여 제안된 유동인구 수 측정 시스템이 유동인구 검출률을 향상시킬 수 있음을 보여준다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.10 no.5 s.23
• /
• pp.45-51
• /
• 2002

The goal of image merging techniques are to enhance the resolution of low-resolution images using the detail information of the high-resolution images. Among the several image merging methods, wavelet-based image merging techniques have the advantages of efficient decorrelation of image bands and time-scale analysis. However, they have no regard for spatial information between the bands. In other words, multiresolution data merging methods merge the same information-the detail information of panchromatic image-with other band images, without considering specific characteristics. Therefore, a merged image contains much unnecessary information. In this paper, we discussed this 'mixing' effect and, proposed a method to classify the detail information of the panchromatic image according to the spatial and spectral characteristics, and to minimize distortion of the merged image.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1325-1328
• /
• 2002

최근 고속 데이터 전송과 멀티미디어 서비스에 대한 요구의 증가로 인한 문제점을 해결하고 서로 다른 서비스별 QoS를 보장 하고자 새로운 방안이 필요하게 되었다. MPLS는 이러한 요구사항에 부응하는 기술로 레이블이라는 짧고 고정된 길이의 식별자를 사용하여 패킷 포워딩을 하는 3계층 스위칭 방법이다. MPLS망에서 Differentiated Service를 지원함으로써 QoS를 보장하며 또한 동일한 서비스를 받는 PHB(Per-Hop Behavior)별로 VC merging을 함으로써 라우터가 관리하는 레이블의 수를 효율적으로 사용하여 망의 확장성을 높일 수 있다. 본 논문에서는 ATM기반 MPLS 망에서 Diffserv를 지원하며 트래픽의 QoS에 따른 VC merging과 Non VC merging 기술을 시뮬레이션을 통해 각각 비교 분석하고 VC merging 스케쥴러를 모델링하여 검증하였다.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1739-1748
• /
• 2008

When we conduct a data mining procedure on sample data sources, several rules are generated. But some rules are redundant or logically disjoint and therefore they can be removed. We suggest a new rule minimization algorithm inspired from logic synthesis to improve comprehensibility and eliminate redundant rules. The method can merge several relevant rules into one based on data mining and logic synthesis without high loss of accuracy. In case of two or more rules are candidates to be merged, we merge the rules with the attribute having the lowest information gain. To show the proposed method could be a reasonable solution, we applied the proposed approach to a problem domain constructing user preferred ontology in anti-spam systems.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.180-181
• /
• 2018

본 논문에서는 JEM(Joint Exploration Model)의 부호화기 계산 복잡도 감소를 위한 CU 조기 결정 방법을 제시한다. 기존의 JEM 의 경우 현재 CU(Coding Unit)의 RDO(Rate Distortion Optimization)를 통한 최적의 예측 모드가 Merge SKIP 모드이고 BT(Binary Tree)의 깊이가 2 또는 3 이상일 때 CU 결정을 조기 종료한다. 제안하는 방법에서는 현재 CU 의 최적의 예측모드가 Merge SKIP 이고 BT 일 경우 통계적 분석을 통한 왜곡 값, CU 샘플 수, 시간적 계층 순서, 양자화 파라미터를 고려한 문턱 값을 이용하여 CU 를 조기 결정한다. 실험결과로써 제안하는 방법이 JEM 7.1 대비 Y, U, V 각각 평균 0.86%, 0.08%, 0.18%의 BD-rate 손실이 발생하고 평균 16% 부호화 속도를 개선시킨다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.257-259
• /
• 2018

최근 JVET(Joint Video Experts Team)는 새로운 비디오 압축 표준을 VVC(Versatile Video Coding)으로 이름 짓고 2020 년 완료를 목표로 그 표준화를 시작하였다. HEVC 및 VVC 에서는 화면간 예측의 부호화 효율을 위하여 공간적/시간적 주변블록의 움직임 정보로부터 Merge/AMVP(Advanced Motion Vector Prediction)의 후보 리스트를 구성하고 최적의 움직임 정보를 활용한다. 본 논문에서는 Merge/AMVP 의 후보 리스트를 유도할 때, 현재블록의 모양을 고려하여 상관성이 높은 주변블록의 움직임 정보를 우선 순위로 유도하는 기법을 제안한다. 실험을 통하여 VTM(VVC TM) 대비 제안기법의 성능을 확인한다.

• Journal of Information Processing Systems
• /
• v.15 no.5
• /
• pp.1055-1067
• /
• 2019

In view of the deficiencies of existing weighted similarity indexes, a hierarchical clustering method initialize-expand-merge (IEM) is proposed based on the similarity of common neighbors for community discovery in weighted networks. Firstly, the similarity of the node pair is defined based on the attributes of their common neighbors. Secondly, the most closely related nodes are fast clustered according to their similarity to form initial communities and expand the communities. Finally, communities are merged through maximizing the modularity so as to optimize division results. Experiments are carried out on many weighted networks, which have verified the effectiveness of the proposed algorithm. And results show that IEM is superior to weighted common neighbor (CN), weighted Adamic-Adar (AA) and weighted resources allocation (RA) when using the weighted modularity as evaluation index. Moreover, the proposed algorithm can achieve more reasonable community division for weighted networks compared with cluster-recluster-merge-algorithm (CRMA) algorithm.

• 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 Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.7-14
• /
• 2005

In this paper we proposed the block-based color image segmentation method using the cylindrical metric to solve the problems such as long processing time and over segmentation due to noise and texture properties in the conventional methods. In the proposed method we define the new similarity function and the merge condition between regions to merge initial regions with the same size considering the color and texture properties of chromatic and achromatic regions which is defined according to the HSI color values, and we continue to merge boundary blocks into the adjacent region already segmented to maintain edges until the size of block is one. In the simulation results the proposed method is better than the conventional methods in the evaluation of the segmented regions of texture and edge region, and we found that the processing time is decreased by factor of two in the proposed method.