• Title/Summary/Keyword: computational algorithm

Search Result 4,409, Processing Time 0.036 seconds

A study on integration of XML application schema for MGIS (해양GIS XML 응용스키마 결합방법 연구)

  • Oh, Se-Woong;Park, Gyei-Kark;Park, Jong-Min;Suh, Sang-Hyun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.2
    • /
    • pp.236-241
    • /
    • 2009
  • Information integration for distributed and heterogeneous data sources is still an open challenging, and schema matching is critical in this process. This paper presents and approach to automatic elements matching between XML application schemas using similarity measure and relaxation labeling. The semantic modeling of XML application schema has also been presented. The similarity measure method considers element categories and their properties. In an effort to achieve an optimal matching, contextual constraints are used in the relaxation labeling method. Based on the semantic modeling of XML application schemas, the compatible constraint coefficients are devised in terms of the structures and semantic relationships as defined in the semantic model. To examine the effectiveness of the proposed methods, an algorithm for XML schema matching has been developed, and corresponding computational experiments show changes of calculated values.

A Novel Control Strategy of Three-phase, Four-wire UPQC for Power Quality Improvement

  • Pal, Yash;Swarup, A.;Singh, Bhim
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.1
    • /
    • pp.1-8
    • /
    • 2012
  • The current paper presents a novel control strategy of a three-phase, four-wire Unified Power Quality (UPQC) to improve power quality. The UPQC is realized by the integration of series and shunt active power filters (APF) sharing a common dc bus capacitor. The realization of shunt APF is carried out using a three-phase, four-leg Voltage Source Inverter (VSI), and the series APF is realized using a three-phase, three-leg VSI. To extract the fundamental source voltages as reference signals for series APF, a zero-crossing detector and sample-and-hold circuits are used. For the control of shunt APF, a simple scheme based on the real component of fundamental load current (I $Cos{\Phi}$) with reduced numbers of current sensors is applied. The performance of the applied control algorithm is evaluated in terms of power-factor correction, source neutral current mitigation, load balancing, and mitigation of voltage and current harmonics in a three-phase, four-wire distribution system for different combinations of linear and non-linear loads. The reference signals and sensed signals are used in a hysteresis controller to generate switching signals for shunt and series APFs. In this proposed UPQC control scheme, the current/voltage control is applied to the fundamental supply currents/voltages instead of fast-changing APF currents/voltages, thus reducing the computational delay and the required sensors. MATLAB/Simulink-based simulations that support the functionality of the UPQC are obtained.

Reduction of Dynamic False Contours based on Gray Level Selection method in PDP (계조 수 감소를 이용한 PDP내에서 의사 윤곽 제거 기법)

  • Ahn Sang-Jun;Eo Yoon-Phil;Lee Sang-Uk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7C
    • /
    • pp.716-725
    • /
    • 2005
  • In this paper, we propose a new approach for the reduction of the dynamic false contours, which detects and compensates false contour artifacts adaptively. First, we develop a simple but effective method to select the pixels that are likely to cause the motion artifacts, based on the distribution of pixel values. Then, we merge the selected pixels into several regions using tree structure. Next, we reduce number of gray levels within the regions slightly to reduce the false contours. Note that reducing number of gray levels yield the distortion, thus it is applied only to the selected regions, instead of the whole picture. Intensive simulations on real moving image show that the proposed algorithm alleviates the dynamic false contours effectively with tolerable computational complexity.

Performance Improvement of Endpoint Detection of Double-Talking Period in the Acoustic Echo Canceller (음향반향제거기에서 동시통화시의 끝점검출 성능 개선)

  • Kim, Si-Ho;Kwon, Hong-Seok;Bae, Keun-Sung;Byun, Kyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1A
    • /
    • pp.58-65
    • /
    • 2002
  • This paper deals with a delay problem in the endpoint detection of double-talk detection algorithm using correlation coefficient in the acoustic echo canceller. In case that past power is much bigger than current power like at the end of double-talking period, the power, estimated using forgetting factor, decreases slowly to cause a delay problem in the endpoint detection. In this paper, two methods are proposed to solve this problem. One is that the current power is periodically replaced by a new average power and the other is that the past power in recursive equation is periodically removed or replaced by other values. The simulation results show that proposed methods outperform conventional method in the endpoint of double-talking periods without increasing the computational burden much more.

Performance Comparison and Analysis of SC-FDMA Systems employing IB-DFE (IB-DFE를 적용한 SC-FDMA 시스템의 성능 비교 분석)

  • Cho, Jae-Deok;Ahn, Sang-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9C
    • /
    • pp.906-914
    • /
    • 2009
  • SC-FDMA is employed in the 3GPP-LTE standard as the uplink transmission scheme. SC-FDMA has advantages that the signal has a low PAPR property and a simple equalizer such as FD-LE can be implemented. But FD-LE has inferior performance to Hybrid-DFE composed of frequency-domain feedforward filter and time-domain feedback filter. Recently, several IB-DFE algorithms have been proposed to overcome the disadvantages of implementation and processing complexity of Hybrid-DFE and to obtain superior performance to FD-LE. In this paper, we apply several IB-DFE algorithms to 3GPP-LTE uplink system and compare their performance by calculating BER. We investigate the effects of channel estimation errors and Doppler shift on performance. Finally, by analyzing computational complexity of IB-DFEs, we present some criteria to choose appropriate algorithm and to decide the number of iterative processes.

Texture Image Database Retrieval Using JPEG-2000 Partial Entropy Decoding (JPEG-2000 부분 엔트로피 복호화에 의향 질감 영상 데이터베이스 검색)

  • Park, Ha-Joong;Jung, Ho-Youl
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5C
    • /
    • pp.496-512
    • /
    • 2007
  • In this paper, we propose a novel JPEG-2000 compressed image retrieval system using feature vector extracted through partial entropy decoding. Main idea of the proposed method is to utilize the context information that is generated during entropy encoding/decoding. In the framework of JPEG-2000, the context of a current coefficient is determined depending on the pattern of the significance and/or the sign of its neighbors in three bit-plane coding passes and four coding modes. The contexts provide a model for estimating the probability of each symbol to be coded. And they can efficiently describe texture images which have different pattern because they represent the local property of images. In addition, our system can directly search the images in the JPEG-2000 compressed domain without full decompression. Therefore, our proposed scheme can accelerate the work of retrieving images. We create various distortion and similarity image databases using MIT VisTex texture images for simulation. we evaluate the proposed algorithm comparing with the previous ones. Through simulations, we demonstrate that our method achieves good performance in terms of the retrieval accuracy as well as the computational complexity.

Bit-Parallel Systolic Divider in Finite Field GF(2m) (유한 필드 GF(2m)상의 비트-패러럴 시스톨릭 나눗셈기)

  • 김창훈;김종진;안병규;홍춘표
    • The KIPS Transactions:PartA
    • /
    • v.11A no.2
    • /
    • pp.109-114
    • /
    • 2004
  • This paper presents a high-speed bit-parallel systolic divider for computing modular division A($\chi$)/B($\chi$) mod G($\chi$) in finite fields GF$(2^m)$. The presented divider is based on the binary GCD algorithm and verified through FPGA implementation. The proposed architecture produces division results at a rate of one every 1 clock cycles after an initial delay of 5m-2. Analysis shows that the proposed divider provides a significant reduction in both chip area and computational delay time compared to previously proposed systolic dividers with the same I/O format. In addition, since the proposed architecture does not restrict the choice of irreducible polynomials and has regularity and modularity, it provides a high flexibility and Scalability with respect to the field size m. Therefore, the proposed divider is well suited to VLSI implementation.

Artificial speech bandwidth extension technique based on opus codec using deep belief network (심층 신뢰 신경망을 이용한 오푸스 코덱 기반 인공 음성 대역 확장 기술)

  • Choi, Yoonsang;Li, Yaxing;Kang, Sangwon
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.1
    • /
    • pp.70-77
    • /
    • 2017
  • Bandwidth extension is a technique to improve speech quality, intelligibility and naturalness, extending from the 300 ~ 3,400 Hz narrowband speech to the 50 ~ 7,000 Hz wideband speech. In this paper, an Artificial Bandwidth Extension (ABE) module embedded in the Opus audio decoder is designed using the information of narrowband speech to reduce the computational complexity of LPC (Linear Prediction Coding) and LSF (Line Spectral Frequencies) analysis and the algorithm delay of the ABE module. We proposed a spectral envelope extension method using DBN (Deep Belief Network), one of deep learning techniques, and the proposed scheme produces better extended spectrum than the traditional codebook mapping method.

Performance Comparison of Implementation Technologies for Image Quality Enhancement Operations on Android Platforms (Android 플랫폼에서 구현 기술에 따른 화질 개선 연산 성능 비교)

  • Lee, Ju-Ho;Lee, Goo-Yeon;Jeong, Choong-Kyo
    • Journal of Digital Contents Society
    • /
    • v.14 no.1
    • /
    • pp.7-14
    • /
    • 2013
  • As mobiles devices with high-spec camera built in are used widely, the visual quality enhancement of the high-resolution images turns out to be one of the key capabilities of the mobile devices. Due to the limited computational resources of the mobile devices and the size of the high-resolution images, we should choose an image processing algorithm not too complex and use an efficient implementation technology. One of the simple and widely used image quality enhancement algorithms is contrast stretching. Java libraries running on a virtual machine, JNI (Java Native Interface) based native C/C++, and NEONTM SIMD (Single Instruction Multiple Data) are common implementation technologies in the case of Android smartphones. Using these three implementation technologies, we have implemented two image contrast stretching algorithms - linear and equalized, and compared the computation times. The native C/C++ and the NEONTM SIMD outperformed the native C/C++ implementation by 56-78 and 50-76 time faster respectively.

Subnet Selection Scheme based on probability to enhance process speed of Big Data (빅 데이터의 처리속도 향상을 위한 확률기반 서브넷 선택 기법)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Gil-Cheol
    • Journal of Digital Convergence
    • /
    • v.13 no.9
    • /
    • pp.201-208
    • /
    • 2015
  • With services such as SNS and facebook, Big Data popularize the use of small size such as micro blogs are increasing. However, the problem of accuracy and computational cost of the search result of big data of a small size is unresolved. In this paper, we propose a subnet selection techniques based probability to improve the browsing speed of the small size of the text information from big data environments, such as micro-blogs. The proposed method is to configure the subnets to give to the attribute information of the data increased the probability data search speed. In addition, the proposed method improves the accessibility of the data by processing a pair of the connection information between the probability of the data constituting the subnet to easily access the distributed data. Experimental results showed the proposed method is 6.8% higher detection rates than CELF algorithm, the average processing time was reduced by 8.2%.