• Title/Summary/Keyword: Partial block error

Search Result 27, Processing Time 0.024 seconds

A Study on Tracking Algorithm for Moving Object Using Partial Boundary Line Information (부분 외곽선 정보를 이용한 이동물체의 추척 알고리즘)

  • Jo, Yeong-Seok;Lee, Ju-Sin
    • The KIPS Transactions:PartB
    • /
    • v.8B no.5
    • /
    • pp.539-548
    • /
    • 2001
  • In this paper, we propose that fast tracking algorithm for moving object is separated from background, using partial boundary line information. After detecting boundary line from input image, we track moving object by using the algorithm which takes boundary line information as feature of moving object. we extract moving vector on the imput image which has environmental variation, using high-performance BMA, and we extract moving object on the basis of moving vector. Next, we extract boundary line on the moving object as an initial feature-vector generating step for the moving object. Among those boundary lines, we consider a part of the boundary line in every direction as feature vector. And then, as a step for the moving object, we extract moving vector from feature vector generated under the information of the boundary line of the moving object on the previous frame, and we perform tracking moving object from the current frame. As a result, we show that the proposed algorithm using feature vector generated by each directional boundary line is simple tracking operation cost compared with the previous active contour tracking algorithm that changes processing time by boundary line size of moving object. The simulation for proposed algorithm shows that BMA operation is reduced about 39% in real image and tracking error is less than 2 pixel when the size of feature vector is [$10{\times}5$] using the information of each direction boundary line. Also the proposed algorithm just needs 200 times of search operation bout processing cost is varies by the size of boundary line on the previous algorithm.

  • PDF

Quasi-Lossless Fast Motion Estimation Algorithm using Distribution of Motion Vector and Adaptive Search Pattern and Matching Criterion (움직임벡터의 분포와 적응적인 탐색 패턴 및 매칭기준을 이용한 유사 무손실 고속 움직임 예측 알고리즘)

  • Park, Seong-Mo;Ryu, Tae-Kyung;Jung, Yong-Jae;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.7
    • /
    • pp.991-999
    • /
    • 2010
  • In this paper, we propose a fast motion estimation algorithm for video encoding. Conventional fast motion estimation algorithms have a serious problem of low prediction quality in some frames. However, full search based fast algorithms have low computational reduction ratio. In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution probability of motion vectors and adaptive search patterns and block matching criteria. By taking different search patterns and error criteria of block matching according to distribution probability of motion vectors, we can reduces only unnecessary computations efficiently. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

A Fast Motion Estimation Algorithm using Probability Distribution of Motion Vector and Adaptive Search (움직임벡터의 확률분포와 적응적인 탐색을 이용한 고속 움직임 예측 알고리즘)

  • Park, Seong-Mo;Ryu, Tae-Kyung;Kim, Jong-Nam
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.2
    • /
    • pp.162-165
    • /
    • 2010
  • In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. In the proposed algorithm, we can reduces only unnecessary computations efficiently by taking different search patterns and error criteria of block matching according to distribution probability of motion vectors. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2/4 AVC standards.

Low complexity hybrid layered tabu-likelihood ascent search for large MIMO detection with perfect and estimated channel state information

  • Sourav Chakraborty;Nirmalendu Bikas Sinha;Monojit Mitra
    • ETRI Journal
    • /
    • v.45 no.3
    • /
    • pp.418-432
    • /
    • 2023
  • In this work, we proposed a low-complexity hybrid layered tabu-likelihood ascent search (LTLAS) algorithm for large multiple-input multiple-output (MIMO) system. The conventional layered tabu search (LTS) approach involves many partial reactive tabu searches (RTSs), and each RTS requires an initialization and searching phase. In the proposed algorithm, we restricted the upper limit of the number of RTS operations. Once RTS operations exceed the limit, RTS will be replaced by low-complexity likelihood ascent search (LAS) operations. The block-based detection approach is considered to maintain a higher signal-to-noise ratio (SNR) detection performance. An efficient precomputation technique is derived, which can suppress redundant computations. The simulation results show that the bit error rate (BER) performance of the proposed detection method is close to the conventional LTS method. The complexity analysis shows that the proposed method has significantly lower computational complexity than conventional methods. Also, the proposed method can reduce almost 50% of real operations to achieve a BER of 10-3.

Peak-to-Average Power Ratio Reduction Technique Superimposing the Rotation Phases over Pilot and Data Symbols (회전 위상을 파일롯과 데이터 심볼에 덧붙인 첨두대 평균 전력비 저감 기법)

  • Han, Tae-Young;Choi, Jung-Hun;Kim, Nam
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.18 no.1 s.116
    • /
    • pp.53-61
    • /
    • 2007
  • This paper researches on the scheme superimposing the rotation phases over the pilot and data symbols in order to reduce the peak-to-average power ratio(PAPR) of the orthogonal frequency division multiplexing(OFDM) communication. The bandwidth and power efficiency are the main consideration. The phases of rotation vector are added to those of both pilot symbols and data symbols interlaying between any two pilot symbols in an OFDM block. Owing to this scheme the transmitter reduces the PAPR using the partial transmit sequences(PTS) and the receiver restores the data symbol utilizing the channel estimation of pilot symbols. Therefore, the bandwidth efficiency is accomplished by not using the further subcarriers for the reduction of PAPR and the enormous increase of bit error rate according to the receiving error of the side information, i.e. the phases of rotation vector, is prevented. In other words, both bandwidth-and power-efficiency and quality of communication performance can be improved.

Improving the PTS Method for the PAPR Reduction in the OFDM System (OFDM 시스템에서 PAPR 감소를 위한 PTS 기법의 성능개선)

  • Kim, Dong-Seek;Kwak, Min-Gil;Cho, Hyung-Rae
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.34 no.8
    • /
    • pp.1165-1171
    • /
    • 2010
  • The OFDM system has better characteristics in transmission rate, power efficiency, bandwidth efficiency, impulse-noise immunity, and narrow band interference immunity etc. in comparison with other conventional systems. However, high PAPR of an OFDM signals causes some serious non-linear processing of RF amplifier. And performance of the communication system gets worse. Therefore, various methods reducing PAPR of an OFDM skills such as the clipping method, block coding method, and phase rotation method etc. have been researched. In this paper, we propose a high-speed adaptive PTS method which eliminates high PAPR. And we compare the proposed method with other conventional methods. The proposed method has decreased quantity of calculation compare with an adaptive PTS method. Of course, The more its calculation amount is decreased, the more its BER characteristic is not better than an adaptive PTS method. However, keeping up satisfactory BER performance, we highly improved calculation amount of a PTS method.

Simultaneous Spectrometric Determination of Caffeic Acid, Gallic Acid, and Quercetin in Some Aromatic Herbs, Using Chemometric Tools

  • Kachbi, Abdelmalek;Abdelfettah-Kara, Dalila;Benamor, Mohamed;Senhadji-Kebiche, Ounissa
    • Journal of the Korean Chemical Society
    • /
    • v.65 no.4
    • /
    • pp.254-259
    • /
    • 2021
  • The purpose of this work is the development of a method for an effective, less expensive, rapid, and simultaneous determination of three phenolic compounds (caffeic acid, gallic acid, and quercetin) widely present in food resources and known for their antioxidant powers. The method relies on partial least squares (PLS) calibration of UV-visible spectroscopic data. This model was applied to simultaneously determine, the concentrations of caffeic acid (CA), gallic acid (GA), and quercetin (Q) in six herb infusion extracts: basil, chive, laurel, mint, parsley, and thyme. A wavelength range (250-400) nm, and an experimental calibration matrix with 21 samples of ternary mixtures composed of CA (6.0-21.0 mg/L), GA (10.0-35.2 mg/L), and Q (6.4-17.5 mg/L) were chosen. Spectroscopic data were mean-centered before calibration. Two latent variables were determined using the contiguous block cross-validation procedure after calculating the root mean square error cross-validation RMSECV. Other statistic parameters: RMSEP, R2, and Recovery (%) were used to determine the predictive ability of the model. The results obtained demonstrated that UV-visible spectrometry and PLS regression were successfully applied to simultaneously quantify the three phenolic compounds in synthetic ternary mixtures. Moreover, the concentrations of CA, GA and Q in herb infusion extracts were easily predicted and found to be 3.918-18.055, 9.014-23.825, and 9.040-13.350 mg/g of dry sample, respectively.