• Title/Summary/Keyword: Bidirectional Algorithm

Search Result 148, Processing Time 0.022 seconds

Controller Optimization for Bidirectional Power Flow in Medium-Voltage DC Power Systems

  • Chung, Il-Yop;Liu, Wenxin;Cartes, David A.;Cho, Soo-Hwan;Kang, Hyun-Koo
    • Journal of Electrical Engineering and Technology
    • /
    • v.6 no.6
    • /
    • pp.750-759
    • /
    • 2011
  • This paper focuses on the control of bidirectional power flow in the electric shipboard power systems, especially in the Medium-Voltage Direct Current (MVDC) shipboard power system. Bidirectional power control between the main MVDC bus and the local zones can improve the energy efficiency and control flexibility of electric ship systems. However, since the MVDC system contains various nonlinear loads such as pulsed power load and radar in various subsystems, the voltage of the MVDC and the local zones varies significantly. This voltage variation affects the control performance of the bidirectional DC-DC converters as exogenous disturbances. To improve the control performance regardless of uncertainties and disturbances, this paper proposes a novel controller design method of the bidirectional DC-DC converters using $L_1$ control theory and intelligent optimization algorithm. The performance of the proposed method is verified via large-scale real-time digital simulation of a notional shipboard MVDC power system.

A New Image Enhancement Algorithm Based on Bidirectional Diffusion

  • Wang, Zhonghua;Huang, Xiaoming;Huang, Faliang
    • Journal of Information Processing Systems
    • /
    • v.16 no.1
    • /
    • pp.49-60
    • /
    • 2020
  • To solve the edge ringing or block effect caused by the partial differential diffusion in image enhancement domain, a new image enhancement algorithm based on bidirectional diffusion, which smooths the flat region or isolated noise region and sharpens the edge region in different types of defect images on aviation composites, is presented. Taking the image pixel's neighborhood intensity and spatial characteristics as the attribute descriptor, the presented bidirectional diffusion model adaptively chooses different diffusion criteria in different defect image regions, which are elaborated are as follows. The forward diffusion is adopted to denoise along the pixel's gradient direction and edge direction in the pixel's smoothing area while the backward diffusion is used to sharpen along the pixel's gradient direction and the forward diffusion is used to smooth along the pixel's edge direction in the pixel's edge region. The comparison experiments were implemented in the delamination, inclusion, channel, shrinkage, blowhole and crack defect images, and the comparison results indicate that our algorithm not only preserves the image feature better but also improves the image contrast more obviously.

A Single-Phase Current-Source Bidirectional Converter for V2G Applications

  • Han, Hua;Liu, Yonglu;Sun, Yao;Wang, Hui;Su, Mei
    • Journal of Power Electronics
    • /
    • v.14 no.3
    • /
    • pp.458-467
    • /
    • 2014
  • In this paper, a single-phase current-source bidirectional converter topology for V2G applications is proposed. The proposed converter consists of a single-phase current-source rectifier (SCSR) and an auxiliary switching network (ASN). It offers bidirectional power flow between the battery and the grid in the buck or boost mode and expands the output voltage range, so that it can be compatible with different voltage levels. The topology structure and operating principles of the proposed converter are analyzed in detail. An indirect control algorithm is used to realize the charging and discharging of the battery. Finally, the semiconductor losses and system efficiency are analyzed. Simulation and experimental results demonstrate the validity and effectiveness of the proposed topology.

An Integration of Searching Area Extraction Scheme and Bi-directional Link Searching Algorithm for the Urban ATIS Application (도시부 ATIS 효율적 적용을 위한 탐색영역기법 및 양방향 링크탐색 알고리즘의 구현)

  • 이승환;최기주;김원길
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.3
    • /
    • pp.45-59
    • /
    • 1996
  • The shortest path algorithm for route guidance is implicitly required not only to support geometrical variations of transportation network such as U-TURN or P-TURN but to efficiency search reasonable routes in searching mechanism. The purpose of this paper is to integrate such two requirements ; that is, to allow U-TURN and P-TURN possibilities and to cut down searching time in locating routes between two points (origin and destination) in networks. We also propose a new type of link searching algorithm which can solve the limitation of vine building algorithm at consecutively left-turn prohibited intersections. The test site is a block of Gangnam road network that has some left-turn prohibited and allowed U-TURN intersections. Four models have been identified to be comparatively analyzed in terms of searching efficiency. The Models are as follows : (i) Model 1 - Link Searching Dijkstra Algorithm without Searching Area Extraction (SAE) ; (ii) Model 2 - Link Searching Dijkstra Algorithm with SAE ; (iii) Model 3 - Link Searching Bidirectional Dijkstra Algorithm without SAE ; and (iv) Model 4 - Link Searching Bidirectional Dijkstra Algorithm with SAE. The results of comparative evaluation show that Model 4 can effectively find optimum path faster than any other models as expected. Some discussions and future research agenda have been presented in the light of dynamic route guidance application of the urban ATIS.

  • PDF

Self-adaptive and Bidirectional Dynamic Subset Selection Algorithm for Digital Image Correlation

  • Zhang, Wenzhuo;Zhou, Rong;Zou, Yuanwen
    • Journal of Information Processing Systems
    • /
    • v.13 no.2
    • /
    • pp.305-320
    • /
    • 2017
  • The selection of subset size is of great importance to the accuracy of digital image correlation (DIC). In the traditional DIC, a constant subset size is used for computing the entire image, which overlooks the differences among local speckle patterns of the image. Besides, it is very laborious to find the optimal global subset size of a speckle image. In this paper, a self-adaptive and bidirectional dynamic subset selection (SBDSS) algorithm is proposed to make the subset sizes vary according to their local speckle patterns, which ensures that every subset size is suitable and optimal. The sum of subset intensity variation (${\eta}$) is defined as the assessment criterion to quantify the subset information. Both the threshold and initial guess of subset size in the SBDSS algorithm are self-adaptive to different images. To analyze the performance of the proposed algorithm, both numerical and laboratory experiments were performed. In the numerical experiments, images with different speckle distribution, different deformation and noise were calculated by both the traditional DIC and the proposed algorithm. The results demonstrate that the proposed algorithm achieves higher accuracy than the traditional DIC. Laboratory experiments performed on a substrate also demonstrate that the proposed algorithm is effective in selecting appropriate subset size for each point.

Generation of full panoramic mosaics using bidirectional alignment with multi-anchor algorithm (BAMA 알고리즘을 이용한 전방위 파노라믹 모자이크 생성)

  • Leu, Ho-June;Kim, Seong-Dae
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.395-398
    • /
    • 2005
  • The acquisition of a panoramic image has been popular in recent years due to its large number of applications. In this paper, we deal with generation of a full panoramic mosaic. When it mosaicing consecutive frames, a simple alignment method may lead to local and global alignment errors. These errors can make a full-view panoramic mosaic to be cracked. In order to solve this problem, we propose the bidirectional alignment with multi-anchor (BAMA) algorithm with a basic local alignment formula. Experimental results show that we can create full panoramic mosaics stably through the proposed algorithm.

  • PDF

Intermediate Scene Generation using Fast Bidirectional Disparity Morphing and Three Occluding Patterns

  • Kim, Dae-Hyun;Park, Jong-Soo
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.904-907
    • /
    • 2002
  • In this paper, we describe an algorithm to automatically generate an intermediate scene using the bidirectional disparity morphing from the parallel stereopair. To compute the disparity between two reference images, we use the 2-step fast block matching algorithm that restricts the searching range and accelerates the speed of the computation of the disparity. We also define three occluding patterns so as to smooth the computed disparities, especially for occluded regions. They are derived from the peculiar properties of the disparity map. The smoothed disparity maps present that the false disparities are well corrected and the boundary between foreground and background becomes sharper. We discuss the advantages of this algorithm compared to the commonly used schemes and we show some experimental results with real data.

  • PDF

Efficient 1:N Fingerprint Matching Algorithm using Matching Score Distribution (매칭 점수 분포를 이용한 효율적인 1:N 지문 매칭 알고리듬)

  • Kim, Kyoung-Min;Park, Joong-Jo;Lee, Buhm;Go, Young-Jin;Jung, Soon-Won
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.3
    • /
    • pp.208-217
    • /
    • 2012
  • This paper presents two adaptive fingerprint matching methods. First, we experiment an adaptive threshold selection of 1:N matching system in order to raise the reliability of the matching score. Second, we propose a adaptive threshold selection using fitting algorithm for high speed matching. The experiment was conducted on the NITZEN database, which has 5247 samples. Consequently, this paper shows that our suggested method can perform 1.88 times faster matching speed than the bidirectional matching speed. And, we prove that FRR of our suggested method decreases 1.43 % than that of the unidirectional matching.

SINR based Maximum Link Scheduling with Uniform Power in Wireless Sensor Networks

  • Huang, Baogui;Yu, Jiguo;Yu, Dongxiao;Ma, Chunmei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.4050-4067
    • /
    • 2014
  • In wireless sensor networks, link scheduling is a fundamental problem related to throughput capacity and delay. For a given set of communication requests $L=\{l_1,l_2,{\cdots},l_n\}$, the MLS (maximum link scheduling) problem aims to find the largest possible subset S of Lsuch that the links in S can be scheduled simultaneously. Most of the existing results did not consider bidirectional transmission setting, which is more realistic in wireless sensor networks. In this paper, under physical interference model SINR (signal-to-noise-plus-interference-ratio) and bidirectional transmission model, we propose a constant factor approximation algorithm MLSA (Maximum Link Scheduling Algorithm) for MLS. It is proved that in the same topology setting the capacity under unidirectional transmission model is lager than that under bidirectional transmission model. However, compared with some work under unidirectional transmission model, the capacity of MLSA is improved about 28% to 45%.

A Fast Scene Change Detection Algorithm Using Feature Of B Frame in Compressed MPEG Video Sequence (압축된 MPEG 비디오 시퀀스에서 B 프레임의 특징을 이용한 빠른 장면전환 검출 알고리즘)

  • 김중헌;김신형;박두영;장종환
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.195-198
    • /
    • 2001
  • 비디오 데이터의 효율적인 저장, 관리를 위해서는 장면진환 검출을 통한 비디오 분할 기술에 대한 연구가 필요하다. 본 논문에서는 MPEG 압축 비디오 상의 B(Bidirectional) 프레임의 특성을 복호화 과정을 거치지 않고 직접 추출하여 I(Intra), P(Predictive), B(Bidirectional) 프레임에 제안받지 않고 장면전환을 검출해 내는 방법을 제안한다. 장면전환 검출을 위해 복호화 하지 않고 필요한 데이터만을 추출해 내어 B 프레임의 특징만을 이용해 검출하므로 빠르면서도 정화한 장면전환을 검출한다. 또한 카메라 움직임이나 빛의 변화 같은 잡음에 강건한 방법을 제안한다.

  • PDF