• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.2957-2980
• /
• 2020

Ensemble clustering commonly integrates multiple basic partitions to obtain a more accurate clustering result than a single partition. Specifically, it exists an inevitable problem that the incomplete transformation from the original space to the integrated space. In this paper, a novel ensemble clustering algorithm using a newly reconstructed mapping coefficient (ECRMC) is proposed. In the algorithm, a newly reconstructed mapping coefficient between objects and micro-clusters is designed based on the principle of increasing information entropy to enhance effective information. This can reduce the information loss in the transformation from micro-clusters to the original space. Then the correlation of the micro-clusters is creatively calculated by the Spearman coefficient. Therefore, the revised co-association graph between objects can be built more accurately because the supplementary information can well ensure the completeness of the whole conversion process. Experiment results demonstrate that the ECRMC clustering algorithm has high performance, effectiveness, and feasibility.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1995년도 추계학술대회
• /
• pp.193-196
• /
• 1995

An algorithm using topological mapping has been developed for a real-time detection of the QRS complexes of ECG signals. As a measurement of QRS complex energy, we used topological mapping from one dimensional sampled ECG signals to two dimensional vectors. These vectors are reconstructed with the sampled ECG signals and the delayed ones. In this method, the detection rates of CRS complex vary with the parameters such as R-R interval average and peak detection threshold coefficient. We use mean, median, and iterative method to determint R-R interval average and peak estimation. We experiment on various value of search back coefficient and peak detection threshold coefficient to find optimal rule.

• 전자공학회논문지B
• /
• 제33B권11호
• /
• pp.62-71
• /
• 1996

In this paper we propose a method that improves PSNR at low bit rate and reduces computational complexity in fractal image coding based on discrete wavelet transform. The proposed method, which uses significant coefficient tree, improves PSNR of the reconstructed image and reduces computational comlexity of mapping domain block onto range block by matching only the significant coefficients of range block to coefficients of domain block. Also, the proposed method reduces error propagation form lower resolution subbands to higher resolution subbands by correcting error of lower resolution subbands. Some experimental results confirm that the proposed method reduces encoding and decoding time significantly and has fine reconstructed images having no blocking effect and clear edges at low bit rate.

• 한국통신학회논문지
• /
• 제37권2A호
• /
• pp.128-134
• /
• 2012

본 논문에서는 커브형 집적영상 시스템에서 부분적으로 가려진 먼 거리 3차원 물체의 인식 향상을 위한 새로운 direct pixel-mapping (DPM)방법을 제안한다. 제안 방법은 커브형 집적영상 시스템에서 DPM 방법에 의해 먼 거리에 위치한 3차원 물체로부터 픽업된 요소영상배열 (elemental image array, EIA)은 가시적으로 가까운 거리에서 픽업한 것과 같은 새로운 요소영상배열을 생성한다. 이러한 특성은 재생한 3차원 물체 영상의 해상도를 향상 시킬 수 있고, 이로 인하여 먼 거리에 위치한 3차원 물체에 대한 인식 성능을 향상 시킬 수 있다. 컴퓨터적 실험결과와 기존 방법과의 비교를 통하여 제안방법으로 재생한 물체의 PSNR과 NCC의 값이 평균 1.75dB와 4.56% 향상됨을 확인할 수 있었다.