• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.034 seconds

Recognition and positioning of occuluded objects using polygon segments (다각형 세그먼트를 이용한 겹쳐진 물체의 인식 및 위치 추정)

  • 정종면;문영식
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.5
    • /
    • pp.73-82
    • /
    • 1996
  • In this paper, an efficient algorithm for recognizing and positioning occuluded objects in a two-dimensional plane is presented. Model objects and unknown input image are approximated by polygonal boundaries, which are compactly represented by shape functions of the polygons. The input image is partitioned into measningful segments whose end points are at the locations of possible occlusion - i.e. at concave vertices. Each segment is matched against known model objects by calculating a matching measure, which is defined as the minimum euclidean distance between the shape functions. An O(mm(n+m) algorithm for computing the measure is presentd, where n and m are the number of veritces for a model and an unknown object, respectively. Match results from aprtial segments are combined based on mutual compatibility, then are verified using distance transformation and translation vector to produce the final recognition. The proposed algorithm is invariant under translation and rotation of objects, which has been shown by experimental results.

  • PDF

Block matching algorithm using quantization (양자화를 이용한 블록 정합 알고리즘에 대한 연구)

  • Lee, Young;Park, Gwi-Tae
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.2
    • /
    • pp.43-51
    • /
    • 1997
  • In this paper, we quantize the image data to simplify the systolic array architecture for block matching algorithm. As the number of bits for pixel data to be processed is reduced by quantization, one can simplify the hardware of systolic array. Especially, if the bit serial input is used, one can even more simplify the structure of processing element. First, we analize the effect of quantization to a block matching. then we show the structure of quantizer and processing element when bit serial input is used. The simulation results applied to standard images have shown that the proposed block matching method has less prediction error than the conventional high speed algorithm.

  • PDF

Synthesis of 4 bar linkage using genetic algorithm and overlay method (유전알고리즘과 겹쳐 그리기 법을 이용한 4절 링크 합성)

  • Yoon, Sung-Joon;Kim, Jun-Hwan
    • Proceeding of EDISON Challenge
    • /
    • 2015.03a
    • /
    • pp.476-478
    • /
    • 2015
  • This paper deals with synthesis of 4 bar linkage by using optimum design. To design 4 bar linkage, overlay method is proposed and for optimization, genetic algorithm is applied with objective function. The accuracy of this method will be determined by errors between real value and test value. We will use Chebychev spacing to get 3 precision positions of input angles. The output angles will be determined by the function that the designer wants input and output relations to be. It will be applied to example to show the accuracy of this method. The advantages of using this method are that it is fast to get optimal solution and it is simple to use.

  • PDF

Optimal Bit Allocation Adaptive Modulation Algorithm for MIMO System

  • Fan, Lingyan;He, Chen;Feng, Guorui
    • Journal of Communications and Networks
    • /
    • v.9 no.2
    • /
    • pp.136-140
    • /
    • 2007
  • In this paper, an adaptive minimum transmit power modulation scheme under constant data rate and fixed bit error rate (BER) for the multiple-input multiple-output (MIMO) system is proposed. It adjusts the modulation order and allocates the transmit power to each spatial sub-channel when meeting the user's requirements at the cost of minimum transmission power. Compared to the other algorithm, it can obtain good performance with lower computational complexity and can be applied to the wireless communication system. Computer simulation results present the efficiency of the proposed scheme. And its performance under different channel condition has been compared with the other algorithm.

Fast Extraction of Pedestrian Candidate Windows Based on BING Algorithm

  • Zeng, Jiexian;Fang, Qi;Wu, Zhe;Fu, Xiang;Leng, Lu
    • Journal of Multimedia Information System
    • /
    • v.6 no.1
    • /
    • pp.1-6
    • /
    • 2019
  • In the field of industrial applications, the real-time performance of the target detection problem is very important. The most serious time consumption in the pedestrian detection process is the extraction phase of the candidate window. To accelerate the speed, in this paper, a fast extraction of pedestrian candidate window based on the BING (Binarized Normed Gradients) algorithm replaces the traditional sliding window scanning. The BING features are extracted with the positive and negative samples and input into the two-stage SVM (Support Vector Machine) classifier for training. The obtained BING template may include a pedestrian candidate window. The trained template is loaded during detection, and the extracted candidate windows are input into the classifier. The experimental results show that the proposed method can extract fewer candidate window and has a higher recall rate with more rapid speed than the traditional sliding window detection method, so the method improves the detection speed while maintaining the detection accuracy. In addition, the real-time requirement is satisfied.

Regularized Zero-Forcing Beam Design under Time-Varying Channels

  • Yu, Heejung;Kim, Taejoon
    • ETRI Journal
    • /
    • v.38 no.3
    • /
    • pp.435-443
    • /
    • 2016
  • In this paper, an efficient beam tracking algorithm for a regularized zero-forcing (RZF) approach in slowly fading multiple-input and single-output (MISO) broadcast channels is considered. By modifying an RZF equation, an RZF beam tracking algorithm is proposed using matrix perturbation theory. The proposed algorithm utilizes both beams from the previous time step and channel difference (between the previous and current time steps) to calculate the RZF beams. The tracking performance of the proposed algorithm is analyzed in terms of the mean square error (MSE) between a tracking approach and an exact recomputing approach, and in terms of the additional MSE caused by the beam tracking error at the receiver. Numerical results show that the proposed algorithm has almost the same performance as the exact recomputing approach in terms of the sum rate.

Filtered-x LMS Algorithm for noise and vibration control system (잡음 및 진동제어시스템을 위한 Filtered -x LMS 알고리즘)

  • kim, soo-yong;Jee, suk-kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.697-702
    • /
    • 2009
  • Filtered-x LMS algorithm maybe the most popular control algorithm used in DSP implementations of active noise and vibration control system. The algorithm converges on a timescale comparable to the response time of the system to be controlled, and is found to be very robust. If the pure tone reference signal is synchronously sampled, it is found that the behavior of the adaptive system can be completely described by a matrix of linear, time invariant, transfer functions. This is used to explain the behavior observed in simulations of a simplified single input, single output adaptive system, which retains many of the properties of the multichannel algorithm.

  • PDF

Application of Genetic Algorithm for Large-Scale Multiuser MIMO Detection with Non-Gaussian Noise

  • Ran, Rong
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.2
    • /
    • pp.73-78
    • /
    • 2022
  • Based on experimental measurements conducted on many different practical wireless communication systems, ambient noise has been shown to be decidedly non-Gaussian owing to impulsive phenomena. However, most multiuser detection techniques proposed thus far have considered Gaussian noise only. They may therefore suffer from a considerable performance loss in the presence of impulsive ambient noise. In this paper, we consider a large-scale multiuser multiple-input multiple-output system in the presence of non-Gaussian noise and propose a genetic algorithm (GA) based detector for large-dimensional multiuser signal detection. The proposed algorithm is more robust than linear multi-user detectors for non-Gaussian noise because it uses a multi-directional search to manipulate and maintain a population of potential solutions. Meanwhile, the proposed GA-based algorithm has a comparable complexity because it does not require any complicated computations (e.g., a matrix inverse or derivation). The simulation results show that the GA offers a performance gain over the linear minimum mean square error algorithm for both non-Gaussian and Gaussian noise.

퍼지신경망에 의한 퍼지 회귀분석: 품질 평가 문제에의 응용

  • 권기택
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 1996.11a
    • /
    • pp.211-216
    • /
    • 1996
  • This paper propose a fuzzy regression method using fuzzy neural networks when a membership value is attached to each input-output pair. First, an architecture o fuzzy neural networks with fuzzy weights and fuzzy biases is shown. Next, a cost function is defined using the fuzzy output from the fuzzy neural network and the corresponding target output with a membership value. A learning algorithm is derived from the cost function. The derived learning algorithm trains the fuzzy neural network so 솜 t the level set of the fuzzy output includes the target output. Last, the proposed method is applied to the quality evaluation problem of injection molding

  • PDF

Signal Detection with Sphere Decoding Algorithm at MIMO Channel (MIMO채널에서 Sphere Decoding 알고리즘을 이용한 신호검파)

  • An, Jin-Young;Kang, Yun-Jeong;Kim, Sang-Choon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.10
    • /
    • pp.2197-2204
    • /
    • 2009
  • In this paper, we analyze the performance of the sphere decoding algorithm at MIMO system. The BER performance of this algorithm is the same as that of ML receiver, but computational complexity of SD algorithm is much less than that of ML receiver. The independent signals from each transmit antennas are modulated by using the QPSK and 16QAM modulation in the richly scattered Rayleigh flat-fading channel. The received signals from each receivers is independently detected by the receiver using Fincke & Pohst SD algorithm, and the BER output of the algorithm is compared with those of ZF, MMSE, SIC, and ML receivers. We also investigate the Viterbo & Boutros SD algorithm which is the modified SD algorithm, and the BER performance and the floting point operations of the algorithms are comparatively studied.