• Title/Summary/Keyword: data complexity

Search Result 2,414, Processing Time 0.027 seconds

Moving Object Detection Using Sparse Approximation and Sparse Coding Migration

  • Li, Shufang;Hu, Zhengping;Zhao, Mengyao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.2141-2155
    • /
    • 2020
  • In order to meet the requirements of background change, illumination variation, moving shadow interference and high accuracy in object detection of moving camera, and strive for real-time and high efficiency, this paper presents an object detection algorithm based on sparse approximation recursion and sparse coding migration in subspace. First, low-rank sparse decomposition is used to reduce the dimension of the data. Combining with dictionary sparse representation, the computational model is established by the recursive formula of sparse approximation with the video sequences taken as subspace sets. And the moving object is calculated by the background difference method, which effectively reduces the computational complexity and running time. According to the idea of sparse coding migration, the above operations are carried out in the down-sampling space to further reduce the requirements of computational complexity and memory storage, and this will be adapt to multi-scale target objects and overcome the impact of large anomaly areas. Finally, experiments are carried out on VDAO datasets containing 59 sets of videos. The experimental results show that the algorithm can detect moving object effectively in the moving camera with uniform speed, not only in terms of low computational complexity but also in terms of low storage requirements, so that our proposed algorithm is suitable for detection systems with high real-time requirements.

Low-Complexity Multi-Size Circular Shifter for QC-LDPC Decoder Based on Two Serial Barrel-Rotators (두 개의 직렬 Barrel-Rotator를 이용한 QC-LDPC 복호기용 저면적 Multi-Size Circular Shifter)

  • Kang, Hyeong-Ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.8
    • /
    • pp.1839-1844
    • /
    • 2015
  • The low-density parity-check(LDPC) code has been adopted in many communication standards due to its error correcting performance, and the quasi-cyclic LDPC(QC-LDPC) is widely used because of implementation easiness. In the QC-LDPC decoder, a cyclic-shifter is required to rotate data in various sizes. This kind of cyclic-shifters are called multi-size circular shifter(MSCS), and this paper proposes a low-complexity structure for MSCS. In the conventional serially-placed two barrel-rotators, the unnecessary multiplexers are revealed and removed, leading to low-complexity. The experimental results show that the area is reduced by about 12%.

Multi-antenna Subcarrier Allocation Using Zero-Forcing Beamforming in MIMO-OFDM Systems (다중입출력 직교 주파수 분할 다중접속 시스템에서 제로포싱 빔형성을 이용한 다중안테나 부반송파 할당 방법)

  • Shin, Young-Il;Kang, Tae-Sung;Kim, Hyung-Myung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.974-983
    • /
    • 2007
  • In this paper, a low complexity subcarrier allocation scheme is proposed for multiuser MIMO-OFDM systems with zero-forcing beamformer (ZFBF) so that the total transmit power can be minimized satisfying given target data rate. Since the optimal method requires very high computational complexity, we propose a low complextiy suboptimal method. Using the fact that the effective channel gain is proportional to the orthogonallity of channels of multiplexed users, a user set with the highest orthogonality of channel among users is assigned to each subcarrier in order to minimize required transmit power. The numerical results show that the proposed suboptimal method can reduce computational complexity with little performance loss.

Combination of Array Processing and Space-Time Coding In MC-CDMA System

  • Hung Nguyen Viet;Fernando W. A. C
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.302-309
    • /
    • 2004
  • The transmission capacity of wireless communication systems may become dramatically high by employ multiple transmit and receive antennas with space-time coding techniques appropriate to multiple transmit antennas. For large number of transmit antennas and at high bandwidth efficiencies, the receiver may become too complex whenever correlation across transmit antennas is introduced. Reducing decoding complexity at receiver by combining array processing and space-time codes (STC) helps a communication system using STC to overcome the big obstacle that prevents it from achieving a desired high transmission rate. Multi-carrier CDMA (MC-CDMA) allows providing good performance in a channel with high inter-symbol interference. Antenna array, STC and MC-CDMA system have a similar characteristic that transmit-receive data streams are divided into sub-streams. Thus, there may be a noticeable reduction of receiver complexity when we combine them together. In this paper, the combination of array processing and STC in MC-CDMA system over slow selective-fading channel is investigated and compared with corresponding existing MC-CDMA system using STC. A refinement of this basic structure leads to a system design principle in which we have to make a trade off between transmission rate, decoding complexity, and length of spreading code to reach a given desired design goal.

  • PDF

Implementation of Variable Threshold Dual Rate ADPCM Speech CODEC Considering the Background Noise (배경잡음을 고려한 가변임계값 Dual Rate ADPCM 음성 CODEC 구현)

  • Yang, Jae-Seok;Han, Kyong-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.3166-3168
    • /
    • 2000
  • This paper proposed variable threshold dual rate ADPCM coding method which is modified from the standard ADPCM of ITU G.726 for speech quality improvement. The speech quality of variable threshold dual rate ADPCM is better than single rate ADPCM at noisy environment without increasing the complexity by using ZCR(Zero Crossing Rate). In this case, ZCR is used to divide input signal samples into two categories(noisy & speech). The samples with higher ZCR is categorized as the noisy region and the samples with lower ZCR is categorized as the speech region. Noisy region uses higher threshold value to be compressed by 16Kbps for reduced bit rates and the speech region uses lower threshold value to be compressed by 40Kbps for improved speech quality. Comparing with the conventional ADPCM, which adapts the fixed coding rate. the proposed variable threshold dual rate ADPCM coding method improves noise character without increasing the bit rate. For real time applications, ZCR calculation was considered as a simple method to obtain the background noise information for preprocess of speech analysis such as FFT and the experiment showed that the simple calculation of ZCR can be used without complexity increase. Dual rate ADPCM can decrease the amount of transferred data efficiently without increasing complexity nor reducing speech quality. Therefore result of this paper can be applied for real-time speech application such as the internet phone or VoIP.

  • PDF

Fast Codevector Search on Vector Quantization (백터양자화기의 신속코더백터 찾기)

  • 우홍체
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.5 no.2
    • /
    • pp.16-21
    • /
    • 2000
  • Vector quantization(VQ) is widely used in many high-quality and high-rate data compression applications such as speech coding, audio coding, image coding and video coding. When the size of a VQ codebook is large, the computational complexity for the full codeword search method is a significant problem for many applications. A number of complexity reduction algorithms have been proposed and investigated using such properties of the codebook as the triangle inequality. This paper proposes a new fast VQ search algorithm that is based on a multi-stage structure for searching for the best codeword. Even using only two stages, a significant complexity reduction can be obtained without any loss of quality.

  • PDF

Derivation of State Transition Diagram from Class Using Tree Structure (트리 형태를 이용한 클래스의 단계별 상태 다이어그램 도출 기법에 대한 연구)

  • Choi, Soo Kyung;Park, Young Bom
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.1
    • /
    • pp.19-26
    • /
    • 2013
  • To improve the reliability and quality of software system, many studies of the testing based on state-transition diagram have been in progress. Existing studies tried to solve the complexity problem of state-transition diagram. But the development of test case demands the better way to derive and manage the state diagram with low complexity. In this paper, the STMT(State-Transition Mapping Tree) is proposed to decrease the complexity of state diagram without changing or loosing the original state or transition information. Comparing with other methods, the proposed method turns out to be less complex.

Customer Adoption of Islamic Banking Services: Empirical Evidence from Indonesia

  • SUDARSONO, Heri;TUMEWANG, Yunice Karina;KHOLID, Muamar Nur
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.8 no.3
    • /
    • pp.1193-1204
    • /
    • 2021
  • This paper aims to examine the main factors that influence the adoption of Islamic banking services in Indonesia. This research collects primary data by distributing questionnaires to 550 respondents in 29 provinces in Indonesia. A total of 550 questionnaires were returned comprising 34.2 percent male respondents and 65.8 percent female respondents. Most of the respondents were in the age group of 21-30 years with the highest level of education being high school. Most of the respondents were working in private firms, with a monthly expenditure of IDR 2,500,000. The independent variables in this study are bank reputation, perceived complexity, perceived compatibility, perceived risk, relative advantage, religiosity, and social influence. Meanwhile, the dependent variable is customer interest in adopting Islamic banking services. The result of this study indicates that awareness and perceived compatibility have a positive effect on customer intention to adopt Islamic banking services. Likewise, religiosity and social influence also have a significant and positive effect on customer intention to adopt Islamic banking services. Meanwhile, bank reputation and perceived complexity have no effect on customer intention to adopt Islamic banking services. Lastly, perceived risk has a negative and significant effect on customer intention of adopting Islamic banking services in Indonesia.

Changes in the Recognition Rate of Kodály Learning Devices using Machine Learning (머신러닝을 활용한 코다이 학습장치의 인식률 변화)

  • YunJeong LEE;Min-Soo KANG;Dong Kun CHUNG
    • Journal of Korea Artificial Intelligence Association
    • /
    • v.2 no.1
    • /
    • pp.25-30
    • /
    • 2024
  • Kodály hand signs are symbols that intuitively represent pitch and note names based on the shape and height of the hand. They are an excellent tool that can be easily expressed using the human body, making them highly engaging for children who are new to music. Traditional hand signs help beginners easily understand pitch and significantly aid in music learning and performance. However, Kodály hand signs have distinctive features, such as the ability to indicate key changes or chords using both hands and to clearly represent accidentals. These features enable the effective use of Kodály hand signs. In this paper, we aim to investigate the changes in recognition rates according to the complexity of scales by creating a device for learning Kodály hand signs, teaching simple Do-Re-Mi scales, and then gradually increasing the complexity of the scales and teaching complex scales and children's songs (such as "May Had A Little Lamb"). The learning device utilizes accelerometer and bending sensors. The accelerometer detects the tilt of the hand, while the bending sensor detects the degree of bending in the fingers. The utilized accelerometer is a 6-axis accelerometer that can also measure angular velocity, ensuring accurate data collection. The learning and performance evaluation of the Kodály learning device were conducted using Python.

A New Semi-Random Imterleaver Algorithm for the Noise Removal in Image Communication (영상통신에서 잡음 제거를 위한 새로운 세미 랜덤 인터리버 알고리즘)

  • Hong, Sung-Won;Park, Jin-Soo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2473-2483
    • /
    • 2000
  • In this paper, The turbo code is used to effectively remove noise which is generated on the image communication channel. Turbo code had excellent decoding performance. However, it had limitations for real time communication because of the system complexity and time delay in decoding procedure. To overcome this problem, this paper proposed a new SRI(Semi Random Interleaved algorithm, which decrease the time delay, when the image data, which reduced the interleaver size of turbo code encoder and decoder, transmitted. The SRI algorithm was composed of 0.5 interleaver size from input frame sequence. When the data inputs in interleaver, the data recorded by row such as block interleaver. But, When the data read in interleaver, the data was read by randomly and the next data located by the just address simultaneously. Therefore, the SRI reduced half-complexity when it was compared with pre-existing method such as block, helical, random interleaver. The image data could be the real time processing when the SRI applied to turbo code.

  • PDF