• Title/Summary/Keyword: 0처리 오류

Search Result 137, Processing Time 0.029 seconds

A Study on the Serialized Event Sharing System for Multiple Telecomputing User Environments (원격.다원 사용자 환경에서의 순차적 이벤트 공유기에 관한 연구)

  • 유영진;오용선
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2003.05a
    • /
    • pp.344-350
    • /
    • 2003
  • In this paper, we propose a novel sharing method ordering the events occurring between users collaborated with the common telecomputing environment. We realize the sharing method with multimedia data to improve the coworking effect using teleprocessing network. This sharing method advances the efficiency of communicating projects such as remote education, tele-conference, and co-authoring of multimedia contents by offering conveniences of presentation, group authoring, common management, and transient event productions of the users. As for the conventional sharing white board system, all the multimedia contents segments should be authored by the exclusive program, and we cannot use any existing contents or program. Moreover we suffer from the problem that ordering error occurs in the teleprocessing operation because we do not have any line-up technology for the input ordering of commands. Therefore we develop a method of retrieving input and output events from the windows system and the message hooking technology which transmits between programs in the operating system In addition, we realize the allocation technology of the processing results for all sharing users of the distributed computing environment without any error. Our sharing technology should contribute to improve the face-to-face coworking efficiency for multimedia contents authoring, common blackboard system in the area of remote educations, and presentation display in visual conference.

  • PDF

Error Recovery by the Classification of Candidate Motion Vectors for H.263 Video Communications (후보벡터 분류에 의한 영상 에러 복원)

  • Son, Nam-Rye;Lee, Guee-Sang
    • The KIPS Transactions:PartB
    • /
    • v.10B no.2
    • /
    • pp.163-168
    • /
    • 2003
  • In transmitting compressed video bit-stream over Internet, packet loss causes error propagation in both spatial and temporal domain, which in turn leads to severe degradation in image quality. In this paper, a new approach for the recovery of lost or erroneous Motion Vector(MV)s by classifying the movements of neighboring blocks by their homogeneity is proposed. MVs of neighboring blocks are classified according to the direction of MVs and a representative value for each class is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in many cases than existing methods.

Algorithm and Performance Evaluation of High-speed Distinction for Condition Recognition of Defective Nut (불량 너트의 상태인식을 위한 고속 판별 알고리즘 및 성능평가)

  • Park, Tae-Jin;Lee, Un-Seon;Lee, Sang-Hee;Park, Man-Gon
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.7
    • /
    • pp.895-904
    • /
    • 2011
  • In welding machine that executes existing spot welding, wrong operation of system has often occurs because of their mechanical motion that can be caused by a number of supply like the welding object. In exposed working environment for various situations such as worker or related equipment moving into any place that we are unable to exactly distinguish between good and not condition of nut. Also, in case of defective welding of nut, it needs various evaluation and analysis through image processing because the problem that worker should be inspected every single manually. Therefore in this paper, if the object was not stabilization state correctly, we have purpose to algorithm implementation that it is to reduce the analysis time and exact recognition as to improve system of image processing. As this like, as image analysis for assessment whether it is good or not condition of nut, in his paper, implemented algorithms were suggested and list by group and that it showed the effectiveness through more than one experiment. As the result, recognition rate of normality and error according to the estimation time have been shown as 40%~94.6% and 60%~5.4% from classification 1 of group 1 to classification 11 of group 5, and that estimation time of minimum, maximum, and average have been shown as 1.7sec.~0.08sec., 3.6sec.~1.2sec., and 2.5sec.~0.1sec.

Restoration of Missing Data in Satellite-Observed Sea Surface Temperature using Deep Learning Techniques (딥러닝 기법을 활용한 위성 관측 해수면 온도 자료의 결측부 복원에 관한 연구)

  • Won-Been Park;Heung-Bae Choi;Myeong-Soo Han;Ho-Sik Um;Yong-Sik Song
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.29 no.6
    • /
    • pp.536-542
    • /
    • 2023
  • Satellites represent cutting-edge technology, of ering significant advantages in spatial and temporal observations. National agencies worldwide harness satellite data to respond to marine accidents and analyze ocean fluctuations effectively. However, challenges arise with high-resolution satellite-based sea surface temperature data (Operational Sea Surface Temperature and Sea Ice Analysis, OSTIA), where gaps or empty areas may occur due to satellite instrumentation, geographical errors, and cloud cover. These issues can take several hours to rectify. This study addressed the issue of missing OSTIA data by employing LaMa, the latest deep learning-based algorithm. We evaluated its performance by comparing it to three existing image processing techniques. The results of this evaluation, using the coefficient of determination (R2) and mean absolute error (MAE) values, demonstrated the superior performance of the LaMa algorithm. It consistently achieved R2 values of 0.9 or higher and kept MAE values under 0.5 ℃ or less. This outperformed the traditional methods, including bilinear interpolation, bicubic interpolation, and DeepFill v1 techniques. We plan to evaluate the feasibility of integrating the LaMa technique into an operational satellite data provision system.

Automatic Left Ventricle Segmentation Algorithm using K-mean Clustering and Graph Searching on Cardiac MRI (K-평균 클러스터링과 그래프 탐색을 통한 심장 자기공명영상의 좌심실 자동분할 알고리즘)

  • Jo, Hyun-Wu;Lee, Hae-Yeoun
    • The KIPS Transactions:PartB
    • /
    • v.18B no.2
    • /
    • pp.57-66
    • /
    • 2011
  • To prevent cardiac diseases, quantifying cardiac function is important in routine clinical practice by analyzing blood volume and ejection fraction. These works have been manually performed and hence it requires computational costs and varies depending on the operator. In this paper, an automatic left ventricle segmentation algorithm is presented to segment left ventricle on cardiac magnetic resonance images. After coil sensitivity of MRI images is compensated, a K-mean clustering scheme is applied to segment blood area. A graph searching scheme is employed to correct the segmentation error from coil distortions and noises. Using cardiac MRI images from 38 subjects, the presented algorithm is performed to calculate blood volume and ejection fraction and compared with those of manual contouring by experts and GE MASS software. Based on the results, the presented algorithm achieves the average accuracy of 6.2mL${\pm}$5.6, 2.9mL${\pm}$3.0 and 2.1%${\pm}$1.5 in diastolic phase, systolic phase and ejection fraction, respectively. Moreover, the presented algorithm minimizes user intervention rates which was critical to automatize algorithms in previous researches.

Multi-view Video Coding using View Interpolation (영상 보간을 이용한 다시점 비디오 부호화 방법)

  • Lee, Cheon;Oh, Kwan-Jung;Ho, Yo-Sung
    • Journal of Broadcast Engineering
    • /
    • v.12 no.2
    • /
    • pp.128-136
    • /
    • 2007
  • Since the multi-view video is a set of video sequences captured by multiple array cameras for the same three-dimensional scene, it can provide multiple viewpoint images using geometrical manipulation and intermediate view generation. Although multi-view video allows us to experience more realistic feeling with a wide range of images, the amount of data to be processed increases in proportion to the number of cameras. Therefore, we need to develop efficient coding methods. One of the possible approaches to multi-view video coding is to generate an intermediate image using view interpolation method and to use the interpolated image as an additional reference frame. The previous view interpolation method for multi-view video coding employs fixed size block matching over the pre-determined disparity search range. However, if the disparity search range is not proper, disparity error may occur. In this paper, we propose an efficient view interpolation method using initial disparity estimation, variable block-based estimation, and pixel-level estimation using adjusted search ranges. In addition, we propose a multi-view video coding method based on H.264/AVC to exploit the intermediate image. Intermediate images have been improved about $1{\sim}4dB$ using the proposed method compared to the previous view interpolation method, and the coding efficiency have been improved about 0.5 dB compared to the reference model.

Comparison of Cognitive Response Time according to Ageing and Cognitive Ability (노화 및 인지 능력에 따른 인지반응시간 비교)

  • Kim, Eun-Mi;Kim, Jung-Wan
    • Therapeutic Science for Rehabilitation
    • /
    • v.10 no.4
    • /
    • pp.81-94
    • /
    • 2021
  • Objective : Response time plays a prominent part in research on cognitive ability and the aging effect. This study aimed to identify the impact of cognitive ability on information processing by conducting cognitive response time (CRT) using a computer program. Methods : This study was conducted in 30 normal elderly (NE) and 30 elderly with amnestic MCI (aMCI), aged 65-79 years old living in Daegu and Gyeongbuk. The results were analyzed using the statistical analysis program R 4.0.2 (University of Auckland, New Zealand). Results : In the three sub-areas of CRT, the total response time showed a significant difference depending on group or age, and the error rate showed a significant difference depending on age or group in some sub-areas. In the aMCI group, the performance of CRT significantly correlated with that of the overall cognition and memory test. Conclusion : Information processing depending on aging or cognitive ability and the differential performance of processing speed could be observed through CRT. The performance of this test was found to be significantly correlated with that of the overall cognition and memory test. Therefore, CRT could be used meaningfully as a simplified tool to predict the initial cognitive disorder of the elderly in the community.

Performance Evaluation of Channel Estimation Algorithm for Pilot Symbol-Assisted IMT-2000 System over Multipath Rayleigh Fading Channel (다중경로 레일레이 페이딩 채널에서 파일럿 심볼 구조의 IMT-2000 시스템의 채널추정 알고리즘 성능평가)

  • 구제길;최형진
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.11 no.7
    • /
    • pp.1128-1138
    • /
    • 2000
  • This paper presents two different approaches for channel estimation of IMT-2000 pilot symbol-assisted W-CDMA reverse link over Rayleigh fading channels of one and two paths. By obtaining BER performance through computer simulations, the proposed algorithms of 2-point second-order interpolation and IDD BWMA are compared with the performance of existing interpolation and adaptive algorithms. The BER performance of the proposed algorithms is superior to WMSA, linear and second-order Gaussian interpolation, LMS, and RLS algorithm in fast fading channels. In particular, the BER performance of the IDD BWMA algorithm is nearly insensitive for Doppler frequency within simulation range $E_b/N_0$ = 28 dB. The two proposed algorithms also have relatively simple structure and similar processing delay in comparison to the existing algorithms. Therefore, these algorithms are more suitable for high-speed mobile communication environments.

  • PDF

Comparison of an Automated Technique TEMPO with Direct Plate Count Method for the Enumeration of Staphylococcus aureus (황색포도상구균의 TEMPO STA와 표준 평판 배지를 이용한 정량분석법 비교)

  • Cho, Yong Sun;Lee, Da-Yeon;Lee, Joo-Young;Wang, Hae-Jin;Shin, Dong-Bin
    • Journal of Food Hygiene and Safety
    • /
    • v.28 no.3
    • /
    • pp.252-257
    • /
    • 2013
  • In this study the automated technique TEMPO STA method, a new automated enumeration based on MPN method, was compared to the direct plate count method by testing various ready-to-eat compound food products. Artificially inoculated food samples with Staphylococcus aureus - Bibimbap, Bibimnaengmyeon, Mulnaengmyeon, Kimmaki, Salad, Japchae, and Sushi- were tested. Statistical analysis of the results showed above 99% in agreement between the two enumeration methods. Also, we monitored 466 various ready-to-eat compound food products samples. The measure uncertainties of the two methods is also familiar, while TEMPO STA automated method is simpler, less time-consuming, more effective and more stable.

High-Speed Reed-Solomon Decoder Using New Degree Computationless Modified Euclid´s Algorithm (새로운 DCME 알고리즘을 사용한 고속 Reed-Solomon 복호기)

  • 백재현;선우명훈
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.6
    • /
    • pp.459-468
    • /
    • 2003
  • This paper proposes a novel low-cost and high-speed Reed-Solomon (RS) decoder based on a new degree computationless modified Euclid´s (DCME) algorithm. This architecture has quite low hardware complexity compared with conventional modified Euclid´s (ME) architectures, since it can remove completely the degree computation and comparison circuits. The architecture employing a systolic away requires only the latency of 2t clock cycles to solve the key equation without initial latency. In addition, the DCME architecture using 3t+2 basic cells has regularity and scalability since it uses only one processing element. The RS decoder has been synthesized using the 0.25${\mu}{\textrm}{m}$. Faraday CMOS standard cell library and operates at 200MHz and its data rate suppots up to 1.6Gbps. For tile (255, 239, 8) RS code, the gate counts of the DCME architecture and the whole RS decoder excluding FIFO memory are only 21,760 and 42,213, respectively. The proposed RS decoder can reduce the total fate count at least 23% and the total latency at least 10% compared with conventional ME architectures.