• Journal of Information Processing Systems
• /
• 제15권5호
• /
• pp.1108-1118
• /
• 2019

Non-local means (NLM) algorithm is an effective and successful denoising method, but it is computationally heavy. To deal with this obstacle, we propose a novel NLM algorithm with fuzzy metric (FM-NLM) for image denoising in this paper. A new feature metric of visual features with fuzzy metric is utilized to measure the similarity between image pixels in the presence of Gaussian noise. Similarity measures of luminance and structure information are calculated using a fuzzy metric. A smooth kernel is constructed with the proposed fuzzy metric instead of the Gaussian weighted L2 norm kernel. The fuzzy metric and smooth kernel computationally simplify the NLM algorithm and avoid the filter parameters. Meanwhile, the proposed FM-NLM using visual structure preferably preserves the original undistorted image structures. The performance of the improved method is visually and quantitatively comparable with or better than that of the current state-of-the-art NLM-based denoising algorithms.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 춘계종합학술대회 A
• /
• pp.386-393
• /
• 2008

시간이 부족한 현대인과 보살핌이 부족한 고령화 인구의 증가로 인해 비교적 가벼운 질병을 방치해 더 큰 고통을 겪는 경우가 발생하여 직접 병원에 가지 않고 자신의 건강 상태를 파악할 수 있는 시스템의 개발이 필요하게 되었다. 하지만 질병의 특성상, 증상의 차이와 구분에 의해 같은 질병이라도 다른 치료와 예방이 필요하고 다른 질병으로 세부 도출될 가능성이 있다. 따라서 증상의 차이를 고려하지 않고 단순한 증상의 선택만으로 도출된 결과는 상황을 더욱 악화시킬 가능성이 있다. 본 논문에서는 ART2 알고리즘을 이용하여 질병을 도출하고 증상의 차이를 구분하기 위해서 애매한 증상의 정도를 퍼지 소속 함수로 표현하고 퍼지 추론 방법을 적용하여 더욱더 정확한 질병 상세를 도출 할 수 있는 개선된 자가진단 시스템을 제시한다. 본 논문에서 제안한 방법을 전문의에게 분석을 의뢰한 결과, 본 논문에서 제안된 자가진단 시스템 방법이 이전의 방법보다, 지능형 자가 보조 진단 시스템으로서 사용자에게 더욱 효과적인 도움을 줄 수 있다는 가능성을 확인하였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2015년도 추계학술발표대회
• /
• pp.1289-1291
• /
• 2015

본 논문에서는 충치 환자의 진단을 위해 구강 영상에서 충치를 추출하는 방법을 제안한다. 먼저 구강은 붉은색을 띄고 치아는 흰색을 띈다는 특징이 있기 때문에, 구강 영상을 YCbCr 컬러모델로 변환한다. YCbCr 컬러모델에 임계치를 설정하여 붉은 영역을 검출해내고, 검출된 붉은 영역에 대해 이진화하여 치아 영역을 추출한다. 그 후, 모폴로지 기법을 이용하여 잡음 제거 및 치아의 빈 공간을 채운다. 치아 영역 추출 시 영상에 따라 치아 사이를 잇는 모서리 부분이 손실된 경우가 발생할 수 있기 때문에 치아 사이의 손실된 부분을 연결 한다. 치아 영역에 ART2 알고리즘을 적용하여 클러스터링하고 충치 후보 영역을 추출한다. 충치 후보 영역에 8방향 윤곽선 추적 기법을 적용하여 충치를 분석 및 추출한다. 실험 결과 81%의 추출 성공률을 보였고 다양한 형태의 충치를 효과적으로 추출할 수 있는 것을 확인하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.127.1-127
• /
• 2001

In this paper we propose an input/output model based fault diagnosis method to detect and isolate single faults in the robot arm control system. The proposed algorithm is functionally composed of three main parts-parameter estimation, fault detection, and isolation, When a change in the system occurs, the errors between the system output and the estimated output cross a predetermined threshold, and once a fault in the system is detected, and in this zone the estimated parameters are transferred to the fault classifier by ART2(adaptive resonance theory 2) neural network for fault isolation. Since ART2 neural network is an unsupervised neural network fault classifier does not require the knowledge of all possible faults to isolate the faults occurred in the system. Simulations are carried out to evaluate the performance of the proposed ...

• 대한전자공학회논문지SP
• /
• 제38권4호
• /
• pp.381-391
• /
• 2001

본 논문은 영상 시퀸스로부터 이미지 모자이킹의 구성을 위한 효율적인 알고리즘을 기술한다. 영상의 기하학적인 특징을 이용하거나 비선형 방정식을 풀었던 기존의 알고리즘과는 달리, 제안한 알고리즘은 4개의 유사특징점을 이용해 영상간 사영 변환식의 8개 파라미터를 직접 계산한다. 본 논문에서 정의된 유사특징점은 영상의 그레이레벨의 분산을 기반으로 하고, 두 영상의 중첩 영역에서만 결정된다. 또한 선택된 4개의 유사특징점에 대한 대응점 검출을 위해 카메라 이동 및 조명 변화에 의한 영상의 변화를 고려한 블록 정합 알고리즘을 적용한다. 제안된 알고리즘은 다양한 영상에 적용하여 그 성능을 평가하였다. 모의 실험 결과는 제안된 알고리즘이 기존의 알고리즘에 비해 계산량을 감소시키면서, 정확한 사영 변환식을 유도하여 모자이킹 영상을 구성하는 것을 보여주고 있다.

• KIEAE Journal
• /
• 제14권2호
• /
• pp.21-28
• /
• 2014

This paper provides the up to date review of the shading effects on PV module performance and the associated detection algorithm related to the maximum power point tracking. It includes the brief explanations of the MMP variations due to the shading occurrence on the PV modules. Review of experimental and simulation studies highlighting the significant impacts of shading on PV efficiencies were presented. The literature indicates that even the partial shading of a single cell can greatly drop the entire module voltage and power efficiency. The MMP tracking approaches were also reviewed in this study. Both conventional and advanced soft computing methods such as ANN, FLC and EA were described for the proper tracking of MMP under shaded conditions. This paper would be the basic source and the comprehensive information associated with the shading effects and relevant MPP tracking technique.

• International Journal of Korean Welding Society
• /
• 제1권1호
• /
• pp.31-38
• /
• 2001

For the horizontal fillet welding with one plate in a vertical position, there will be a higher tendency of weld metal falling down rather than for the butt-welding in flat position. Such phenomenon could bring about the overlap or deflection of weld pool, and consequently induce the poor mechanical strength of weldments. Therefore, a precise position control of welding torch in conjunction with the weld qualify plays an important role in welding robot applications. In the present study, an experimental method was proposed for deriving a mathematical model between the leg length and the welding conditions. Finally, an algorithm was proposed for weld seam tracking and improvement of the weld quality. The reliability of the proposed algorithm was evaluated through various experiments, which showed that the proposed algorithm can be very effective for tracking the weld line and simultaneously achieving the sound weld bead.

• 로봇학회논문지
• /
• 제19권3호
• /
• pp.281-286
• /
• 2024

This paper describes the solution method of Team AIRLAB used to participate in the League of Robot Runners Competition which tackles the problem of Lifelong Multi-agent Pathfinding (MAPF). In lifelong MAPF, multiple agents are tasked to navigate to their respective goal locations where new goals are consecutively revealed once they reach initial goals. The agents need to avoid collisions and deadlock situations while they navigate to perform tasks. Our method consists of (i) Puzzle Heuristics, (ii) MAPF-LNS2, and (iii) RHCR. The Puzzle Heuristics is our own algorithm that generates a compact heuristic table contributing to reduce memory consumption and computation time. MAPF-LNS2 and RHCR are state-of-the-art algorithms for MAPF. By combining these three algorithms, our method can improve the efficiency of paths for all agents significantly.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.656-658
• /
• 2006

This study deals with the part-machine grouping (PMG) that considers realistic manufacturing factors, such as the machine duplication, operation sequences with multiple visits to the same machine, and production volumes of parts. Basically, this study is an extension of Won(2006) that has adopted fuzzy ART neural network to group parts and machines. The proposed fuzzy ART neural network algorithm is implemented with an ancillary procedure to enhance the block diagonal solution by rearranging the order of input presentation. Computational experiments applied to large-size PMG data sets with a psuedo-replicated clustering procedure show effectiveness of the proposed approach.

• ETRI Journal
• /
• 제45권6호
• /
• pp.1035-1045
• /
• 2023

We propose a novel graphics processing unit (GPU) algorithm that can handle a large-scale 3D fast Fourier transform (i.e., 3D-FFT) problem whose data size is larger than the GPU's memory. A 1D FFT-based 3D-FFT computational approach is used to solve the limited device memory issue. Moreover, to reduce the communication overhead between the CPU and GPU, we propose a 3D data-transposition method that converts the target 1D vector into a contiguous memory layout and improves data transfer efficiency. The transposed data are communicated between the host and device memories efficiently through the pinned buffer and multiple streams. We apply our method to various large-scale benchmarks and compare its performance with the state-of-the-art multicore CPU FFT library (i.e., fastest Fourier transform in the West [FFTW]) and a prior GPU-based 3D-FFT algorithm. Our method achieves a higher performance (up to 2.89 times) than FFTW; it yields more performance gaps as the data size increases. The performance of the prior GPU algorithm decreases considerably in massive-scale problems, whereas our method's performance is stable.