• Title/Summary/Keyword: Recursive Technique

Search Result 186, Processing Time 0.022 seconds

A Fault Tolerant Control Technique for Hybrid Modular Multi-Level Converters with Fault Detection Capability

  • Abdelsalam, Mahmoud;Marei, Mostafa Ibrahim;Diab, Hatem Yassin;Tennakoon, Sarath B.
    • Journal of Power Electronics
    • /
    • v.18 no.2
    • /
    • pp.558-572
    • /
    • 2018
  • In addition to its modular nature, a Hybrid Modular Multilevel Converter (HMMC) assembled from half-bridge and full-bridge sub-modules, is able to block DC faults with a minimum number of switching devices, which makes it attractive for high power applications. This paper introduces a control strategy based on the Root-Least Square (RLS) algorithm to estimate the capacitor voltages instead of using direct measurements. This action eliminates the need for voltage transducers in the HMMC sub-modules and the associated communication link with the central controller. In addition to capacitor voltage balancing and suppression of circulating currents, a fault tolerant control unit (FTCU) is integrated into the proposed strategy to modify the parameters of the HMMC controller. On advantage of the proposed FTCU is that it does not need extra components. Furthermore, a fault detection unit is adapted by utilizing a hybrid estimation scheme to detect sub-module faults. The behavior of the suggested technique is assessed using PSCAD offline simulations. In addition, it is validated using a real-time digital simulator connected to a real time controller under various normal and fault conditions. The proposed strategy shows robust performance in terms of accuracy and time response since it succeeds in stabilizing the HMMC under faults.

Efficient Processing of Transitive Closure Queries in Ontology using Graph Labeling (온톨로지에서의 그래프 레이블링을 이용한 효율적인 트랜지티브 클로저 질의 처리)

  • Kim Jongnam;Jung Junwon;Min Kyeung-Sub;Kim Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.32 no.5
    • /
    • pp.526-535
    • /
    • 2005
  • Ontology is a methodology on describing specific concepts and their relationships, and it is being considered important more and more as semantic web and variety of knowledge management systems are being highlighted. Ontology uses the relationships among concerts to represent some concrete semantics of specific concept. When we want to get some useful information from ontology, we severely have to process the transitive relationships because most of relationships among concepts represent transitivity. Technically, it causes recursive calls to process such transitive closure queries with heavy costs. This paper describes the efficient technique for processing transitive closure queries in ontology. To the purpose of it, we examine some approaches of current systems for transitive closure queries, and propose a technique by graph labeling scheme. Basically, we assume large size of ontology, and then we show that our approach gives relative efficiency in processing of transitive closure, queries.

Doppler Frequency Estimation for Time-Varying Underwater Acoustic Communication Channel (시변 수중음향통신 채널을 위한 도플러 주파수 추정)

  • Hwang, Chan-Ho;Kim, Ki-Man
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.1
    • /
    • pp.187-192
    • /
    • 2015
  • Underwater acoustic communication channels have very complex channel characteristics caused by time-varying sea surface, submarine topography, sound speed, and geometry between transmitter and receiver. Especially, the channel has time-variance and doppler effect due to wind and sea current. We have to recognize the channel state and apply it to communication technique for increasing transmission efficiency in the underwater acoustic channel. In this paper, we present the frame recursive modulation and demodulation method using ambiguity function and autocorrelation function to estimate the doppler frequency. Furthermore, we conducted the simulation and sea experiment to evaluate the performance of the proposed method. When the channel coding technique was not used, the bit error rate performance of the proposed method was improved about 32 % compared with conventional method.

Development of Tracking Equipment for Real­Time Multiple Face Detection (실시간 복합 얼굴 검출을 위한 추적 장치 개발)

  • 나상동;송선희;나하선;김천석;배철수
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.8
    • /
    • pp.1823-1830
    • /
    • 2003
  • This paper presents a multiple face detector based on a robust pupil detection technique. The pupil detector uses active illumination that exploits the retro­reflectivity property of eyes to facilitate detection. The detection range of this method is appropriate for interactive desktop and kiosk applications. Once the location of the pupil candidates are computed, the candidates are filtered and grouped into pairs that correspond to faces using heuristic rules. To demonstrate the robustness of the face detection technique, a dual mode face tracker was developed, which is initialized with the most salient detected face. Recursive estimators are used to guarantee the stability of the process and combine the measurements from the multi­face detector and a feature correlation tracker. The estimated position of the face is used to control a pan­tilt servo mechanism in real­time, that moves the camera to keep the tracked face always centered in the image.

Semi-automatic Extraction of 3D Building Boundary Using DSM from Stereo Images Matching (영상 매칭으로 생성된 DSM을 이용한 반자동 3차원 건물 외곽선 추출 기법 개발)

  • Kim, Soohyeon;Rhee, Sooahm
    • Korean Journal of Remote Sensing
    • /
    • v.34 no.6_1
    • /
    • pp.1067-1087
    • /
    • 2018
  • In a study for LiDAR data based building boundary extraction, usually dense point cloud was used to cluster building rooftop area and extract building outline. However, when we used DSM generated from stereo image matching to extract building boundary, it is not trivial to cluster building roof top area automatically due to outliers and large holes of point cloud. Thus, we propose a technique to extract building boundary semi-automatically from the DSM created from stereo images. The technique consists of watershed segmentation for using user input as markers and recursive MBR algorithm. Since the proposed method only inputs simple marker information that represents building areas within the DSM, it can create building boundary efficiently by minimizing user input.

Intelligent System for the Prediction of Heart Diseases Using Machine Learning Algorithms with Anew Mixed Feature Creation (MFC) technique

  • Rawia Elarabi;Abdelrahman Elsharif Karrar;Murtada El-mukashfi El-taher
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.5
    • /
    • pp.148-162
    • /
    • 2023
  • Classification systems can significantly assist the medical sector by allowing for the precise and quick diagnosis of diseases. As a result, both doctors and patients will save time. A possible way for identifying risk variables is to use machine learning algorithms. Non-surgical technologies, such as machine learning, are trustworthy and effective in categorizing healthy and heart-disease patients, and they save time and effort. The goal of this study is to create a medical intelligent decision support system based on machine learning for the diagnosis of heart disease. We have used a mixed feature creation (MFC) technique to generate new features from the UCI Cleveland Cardiology dataset. We select the most suitable features by using Least Absolute Shrinkage and Selection Operator (LASSO), Recursive Feature Elimination with Random Forest feature selection (RFE-RF) and the best features of both LASSO RFE-RF (BLR) techniques. Cross-validated and grid-search methods are used to optimize the parameters of the estimator used in applying these algorithms. and classifier performance assessment metrics including classification accuracy, specificity, sensitivity, precision, and F1-Score, of each classification model, along with execution time and RMSE the results are presented independently for comparison. Our proposed work finds the best potential outcome across all available prediction models and improves the system's performance, allowing physicians to diagnose heart patients more accurately.

Error Resilient Video Coding Techniques Using Multiple Description Scheme (다중 표현을 이용한 에러에 강인한 동영상 부호화 방법)

  • 김일구;조남익
    • Journal of Broadcast Engineering
    • /
    • v.9 no.1
    • /
    • pp.17-31
    • /
    • 2004
  • This paper proposes an algorithm for the robust transmission of video in error Prone environment using multiple description codingby optimal split of DCT coefficients and rate-distortionoptimization framework. In MDC, a source signal is split Into several coded streams, which is called descriptions, and each description is transmitted to the decoder through different channel. Between descriptions, structured correlations are introduced at the encoder, and the decoder exploits this correlation to reconstruct the original signal even if some descriptions are missing. It has been shown that the MDC is more resilient than the singe description coding(SDC) against severe packet loss ratecondition. But the excessive redundancy in MDC, i.e., the correlation between the descriptions, degrades the RD performance under low PLR condition. To overcome this Problem of MDC, we propose a hybrid MDC method that controls the SDC/MDC switching according to channel condition. For example, the SDC is used for coding efficiency at low PLR condition and the MDC is used for the error resilience at high PLR condition. To control the SDC/MDC switching in the optimal way, RD optimization framework are used. Lagrange optimization technique minimizes the RD-based cost function, D+M, where R is the actually coded bit rate and D is the estimated distortion. The recursive optimal pet-pixel estimatetechnique is adopted to estimate accurate the decoder distortion. Experimental results show that the proposed optimal split of DCT coefficients and SD/MD switching algorithm is more effective than the conventional MU algorithms in low PLR conditions as well as In high PLR condition.

Finding a Minimum Fare Route in the Distance-Based System (거리비례제 요금부과에 따른 최소요금경로탐색)

  • Lee, Mee-Young;Baik, Nam-Cheol;Nam, Doo-Hee;Shin, Seon-Gil
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.6
    • /
    • pp.101-108
    • /
    • 2004
  • The new transit fare in the Seoul Metropolitan is basically determined based on the distance-based fare system (DBFS). The total fare in DBFS consists of three parts- (1) basic fare, (2) transfer fare, and (3) extra fare. The fixed amount of basic fare for each mode is charged when a passenger gets on a mode, and it proceeds until traveling within basic travel distance. The transfer fare may be added when a passenger switches from the present mode to another. The extra fare is imposed if the total travel distance exceeds the basic travel distance, and after that, the longer distance the more extra fare based on the extra-fare-charging rule. This study proposes an algorithm for finding minimum fare route in DBFS. This study first exploits the link-label-based searching method to enable shortest path algorithms to implement without network expansion at junction nodes in inter-modal transit networks. Moreover, the link-expansion technique is adopted in order for each mode's travel to be treated like duplicated links, which have the same start and end nodes, but different link features. In this study, therefore, some notations associated with modes can be saved, thus the existing link-based shortest path algorithm is applicable without any loss of generality. For fare calculation as next steps, a mathematical formula is proposed to embrace fare-charging process using search process of two adjacent links illustrated from the origin. A shortest path algorithm for finding a minimum fare route is derived by converting the formula as a recursive form. The implementation process of the algorithm is evaluated through a simple network test.

Design of IIR Structure Active Mufflers using Stabilized Filter Algorithms (안정화 필터 알고리즘을 적용한 IIR 구조 능동 머플러의 설계)

  • Ahn, Dong-Jun;Nam, Hyun-Do
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.3
    • /
    • pp.570-575
    • /
    • 2019
  • Active muffler is implemented by applying active noise control technique to reduce exhaust noise of automobile muffler. Conventional Filtered_x LMS algorithm has a problem that the degree of control filter becomes very large and convergence deteriorates when acoustic feedback is present. The recursive LMS algorithm can compensate for this problem because it can be easily diverted in the adaptive filter adaptation process. In this paper, the structure of the primary path and the secondary path transfer function is designed as the IIR filter to improve the convergence performance and the computational burden, and the stabilization filter algorithm is applied to secure stability which is a disadvantage of the IIR filter structure. The stabilization filter algorithm plays a role of pulling the pole into the unit circle to prevent the pole of the transfer function corresponding to the acoustic feedback from diverging during the adaptation process. In this way, the computational burden of the active muffler system and the convergence performance can be improved. In order to show the usefulness of the proposed system, we compared the performance of the proposed Filtered_x LMS algorithm with the performance of the proposed system for the exhaust sound of a diesel engine, which is a variable environment. Compared to conventional algorithm, proposed algorithm's computational burden is less than half, and convergence performances are more than 4 times.

A Study on Spectators Reception of Visual Error in Manually Produced Animation (아날로그 제작 방식 애니메이션에 나타나는 시각적 오차성의 관객 수용에 대한 연구)

  • Kim, Jean-Young
    • Cartoon and Animation Studies
    • /
    • s.13
    • /
    • pp.83-96
    • /
    • 2008
  • Digital production method in animation has enabled us to reconstruction the real world in the way we had sought in visual all. However, spectator's visual desire is not satisfied with mere photographic visual reconstruction. It demands traditional picturesque qualify with involves a great deal of contingencies and errors. Naturally, Digital film technology has also sometimes tried to simulate analogue technique such as hand drawing so on. This is not caused by nostalgia, but by recursive instinct. The spectator's visual desire for media doesn't remain only precision of real world but require mental demand on successive visual and perceptive errors while repealing ripeness of new media and going through perception and recognition. This spectator's desire and visual art technology pursuits variously its visual perfection in history.

  • PDF