• Title/Summary/Keyword: New Four Step Search Algorithm

Search Result 10, Processing Time 0.021 seconds

A Study on a Compensation of Decoded Video Quality and an Enhancement of Encoding Speed

  • Sir, Jaechul;Yoon, Sungkyu;Lim, Younghwan
    • Journal of the Korea Computer Graphics Society
    • /
    • v.6 no.3
    • /
    • pp.35-40
    • /
    • 2000
  • There are two problems in H.26X compression technique. One is compressing time in encoding process and the other is degradation of the decoded video quality due to high compression rate. For transferring moving pictures in real-time, it is required to adopt massively high compression. In this case, there are a lot of losses of an original video data and that results in degradation of quality. Especially degradation called by blocking artifact may be produced. The blocking artifact effect is produced by DCT-based coding techniques because they operate without considering correlation between pixels in block boundaries. So it represents discontinuity between adjacent blocks. This paper describes methods of quality compensation for H.26x decoded data and enhancing encoding speed for real-time operation. Our goal of the quality compensation is not to make the decoded video identical to a original video but to make it perceived better through human eyes. We suggest an algorithm that reduces block artifact and clears decoded video in decoder. To enhance encoding speed, we adopt new four-step search algorithm. As shown in the experimental result, the quality compensation provides better video quality because of reducing blocking artifact. And then new four-step search algorithm with $MMX^{TM}$ implementation improves encoding speed from 2.5 fps to 17 fps.

  • PDF

VLSI Architecture Designs of the Block-Matching Motion Estimation/Compensation using a Modified 4-Step Search Algorithm (변형된 4스텝 써치를 이용한 블럭정합 움직임 추정 및 보상 알고리즘의 VLSI 구조 설계)

  • Lee, Dong-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.9
    • /
    • pp.86-94
    • /
    • 1998
  • This paper proposes a new fast block-matching algorithm, named MFSS(Modified Four-Step Search) algorithm, which has better performance and is more adequate for hardware realization than the existing fast algorithms. The proposed algorithm is suitable for hardware realization since it has a unique regularity during the search procedure. It is shown from simulation results that its performance is close to that of FS(Full Search) algorithm. This paper also proposes a VLSI architecture and presents some design results of a motion estimator and compensator which adopted the MFSS algorithm. The important aspects considered in designing a motion estimator and compensator are hardware complexity of design results, and total delay needed to generate the motion compensated data after finding the motion vectors. Hardware complexity is minimized by using just nine PE(Process Element)'s, and total delay is minimized by sharing search memory of the motion estimator and compensator.

  • PDF

Fast Motion Estimation Based on Motion Speed and Multiple Initial Center Point Prediction (모션 속도와 다양한 초기의 중앙점 예측에 기반한 빠른 비디오 모션 추정)

  • Peng, Shao-Hu;Saipullah, Khairul Muzzammil;Yun, Byung-Choon;Kim, Deok-Hwan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06a
    • /
    • pp.246-247
    • /
    • 2010
  • This paper proposes a fast motion estimation algorithm based on motion speed and multiple initial center points. The proposed method predicts initial search points by means of the spatio-temporal neighboring motion vectors. A dynamic search pattern based on motion speed and the predicted initial center points is proposed to quickly obtain the motion vector. Due to the usage of the spatio-temporal information and the dynamic search pattern, the proposed method greatly accelerates the search speed while maintaining a good predicted image quality. Experimental results show that the proposed method has a good predicted image quality in terms of PSNR with less search time as compared to the Full Search, New Three-Step Search, and Four-Step Search.

  • PDF

Fast Block-Matching Motion Estimation Using Constrained Diamond Search Algorithm (구속조건을 적용한 다이아몬드 탐색 알고리즘에 의한 고속블록정합움직임추정)

  • 홍성용
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.4
    • /
    • pp.13-20
    • /
    • 2003
  • Based on the studies on the motion vector distributions estimated on the image sequences, we proposed constrained diamond search (DS) algorithm for fast block-matching motion estimation. By considering the fact that motion vectors are searched within the 2 pixels distance in vertically and horizontally on average, we confirmed that DS algorithm achieves close performance on error ratio and requires less computation compared with new three-step search (NTSS) algorithm. Also, by applying displaced frame difference (DFD) to DS algorithm, we reduced the computational loads needed to estimate the motion vectors within the stable block that do not have motions. And we reduced the possibilities falling into the local minima in the course of estimation of motion vectors by applying DFD to DS algorithm. So, we knew that proposed constrained DS algorithm achieved enhanced results as aspects of error ratio and the number of search points to be necessary compared with conventional DS algorithm, four step search (FSS) algorithm, and block-based gradient-descent search algorithm

  • PDF

Fast Video Motion Estimation Algorithm Based on Motion Speed and Multiple Initial Center Points Prediction (모션 속도와 다중 초기 중심점 예측에 기반한 빠른 비디오 모션 추정 알고리즘)

  • Peng, Sha-Hu;Saipullah, Khairul Muzzammil;Yun, Byung-Choon;Kim, Deok-Hwan
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.12
    • /
    • pp.1219-1223
    • /
    • 2010
  • This paper proposes a fast motion estimation algorithm based on motion speed and multiple initial center points. The proposed method predicts initial search points by means of the spatio-temporal neighboring motion vectors. A dynamic search pattern based on the motion speed and the predicted initial center points is proposed to quickly obtain the motion vector. Due to the usage of the spatio-temporal information and the dynamic search pattern, the proposed method greatly accelerates the search speed while keeping a good predicted image quality. Experimental results show that the proposed method has a good predicted image quality in terms of PSNR with less searching time comparing with the Full Search, New Three-Step Search, and Four-Step Search.

Development of a Design System for Multi-Stage Gear Drives (2nd Report : Development of a Generalized New Design Algortitm

  • Chong, Tae-Hyong;Inho Bae
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.2 no.2
    • /
    • pp.65-72
    • /
    • 2001
  • The design of multi-stage gear drives is a time-consuming process, since on includes more complicated problems, which are not considered in the design of single-stage gear drives. The designer has th determine the number of reduction stages and the gear ratios of each reduction state. In addition, the design problems include not only the dimensional design but also the configuration design of gear drive elements. There is no definite rule and principle for these types of design problems. Thus the design practices largely depend on the sense and the experiences of the designer , and consequently result in undesirable design solution. We propose a new generalized design algorithm to support the designer at the preliminary design phase of multi-stage gear drives. The proposed design algorithm automates the design process by integrating the dimensional design and the configuration design process. The algorithm consists of four steps. In the first step, a designer determines the number of reduction stage. In the second step. gear ratios se chosen by using the random search method. In the third step, the values of basic design parameter are chosen by using the generate and test method. Then, the values of other dimension, such ad pitch diameter, outer diameter, and face width, are calculated for the configuration design in the final step. The strength and durability of a gear is guaranteed by the bending strength and the pitting resistance rating practices by using the AGMA rating formulas. In the final step, the configuration design is carried out b using the simulated annealing algorithm. The positions of gears and shafts are determined to minimize the geometrical volume(size) of a gearbox, while satisfying spatial constraints between them. These steps are carried out iteratively until a desirable solution is acquired. The propose design algorithm has been applied to the preliminary design of four-stage gear drives in order to validate the availability. The design solution have shown considerably good results in both aspects of the dimensional and the configuration design.

  • PDF

Parallel Connected Component Labeling Based on the Selective Four Directional Label Search Using CUDA

  • Soh, Young-Sung;Hong, Jung-Woo
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.16 no.3
    • /
    • pp.83-89
    • /
    • 2015
  • Connected component labeling (CCL) is a mandatory step in image segmentation where objects are extracted and uniquely labeled. CCL is a computationally expensive operation and thus is often done in parallel processing framework to reduce execution time. Various parallel CCL methods have been proposed in the literature. Among them are NSZ label equivalence (NSZ-LE) method, modified 8 directional label selection (M8DLS) method, HYBRID1 method, and HYBRID2 method. Soh et al. showed that HYBRID2 outperforms the others and is the best so far. In this paper we propose a new hybrid parallel CCL algorithm termed as HYBRID3 that combines selective four directional label search (S4DLS) with label backtracking (LB). We show that the average percentage speedup of the proposed over M8DLS is around 60% more than that of HYBRID2 over M8DLS for various kinds of images.

Development of a Design System for Multi-Stage Gear Drives (2nd Report: Development of a Generalized New Design Algorithm) (다단 치차장치 설계 시스템 개발에 관한 연구(제 2보: 일반화된 신설계 알고리즘의 개발))

  • Chong, Tae-Hyong;Bae, In-Ho;Park, Gyung-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.10
    • /
    • pp.192-199
    • /
    • 2000
  • The design of multi-stage gear drives is a time-consuming process because it includes more complicated problems, which are not considered in the design of single-stage gear drives. The designer has no determine the number of reduction stages and the gear ratios of each reduction stage. In addition, the design problems include not only dimensional design but also configuration design of gear drive elements. There is no definite rule or principle for these types of design problems. Thus the design practices largely depend on the sense and the experiences of the designer, and consequently result in undesirable design solution. A new and generalized design algorithm has been proposed to support the designer at the preliminary phase of the design of multi-stage gear drives. The proposed design algorithm automates the design process by integrating the dimensional design and the configuration design process. The algorithm consists of four steps. In the first step, the user determines the number of reduction stages. In the second step, gear ratios of every stage are chosen using the random search method. The values of the basic design parameters of a gear are chose in the third step by using the generate and test method. Then the values of the dimensions, such as pitch diameter, outer diameter and face width, are calculated for the configuration design in the next step. The strength and durability of each gear is guaranteed by the bending strength and the pitting resistance rating practices by using AGMA rating formulas. In the final step, the configuration design is carried out using simulated annealing algorithm. The positions of gears and shafts are determined to minimize the geometrical volume (size) of a gearbox while avoiding interferences between them. These steps are carried out iteratively until a desirable solution is acquired. The proposed design algorithm is applied to the preliminary design of four-stage gear drives in order to validate the availability. The design solution has considerably good results in both aspects of the dimensional and the configuration design.

  • PDF

Identification of Fractional-derivative-model Parameters of Viscoelastic Materials Using an Optimization Technique (최적화 기법을 이용한 점탄성물질의 분수차 미분모델 물성계수 추정)

  • Kim, Sun-Yong;Lee, Doo-Ho
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.16 no.12 s.117
    • /
    • pp.1192-1200
    • /
    • 2006
  • Viscoelastic damping materials are widely used to reduce noise and vibration because of its low cost and easy implementation, for examples, on the body structure of passenger cars, air planes, electric appliances and ships. To design the damped structures, the material property such as elastic modulus and loss factor is essential information. The four-parameter fractional derivative model well describes the dynamic characteristics of the viscoelastic damping materials with respect to both frequency and temperature. However, the identification procedure of the four-parameter is very time-consuming one. In this study a new identification procedure of the four-parameters is proposed by using an FE model and a gradient-based numerical search algorithm. The identification procedure goes two sequential steps to make measured frequency response functions(FRF) coincident with simulated FRFs: the first one is a peak alignment step and the second one is an amplitude adjustment step. A numerical example shows that the proposed method is useful in identifying the viscoelastic material parameters of fractional derivative model.

The Effect of Data Size on the k-NN Predictability: Application to Samsung Electronics Stock Market Prediction (데이터 크기에 따른 k-NN의 예측력 연구: 삼성전자주가를 사례로)

  • Chun, Se-Hak
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.3
    • /
    • pp.239-251
    • /
    • 2019
  • Statistical methods such as moving averages, Kalman filtering, exponential smoothing, regression analysis, and ARIMA (autoregressive integrated moving average) have been used for stock market predictions. However, these statistical methods have not produced superior performances. In recent years, machine learning techniques have been widely used in stock market predictions, including artificial neural network, SVM, and genetic algorithm. In particular, a case-based reasoning method, known as k-nearest neighbor is also widely used for stock price prediction. Case based reasoning retrieves several similar cases from previous cases when a new problem occurs, and combines the class labels of similar cases to create a classification for the new problem. However, case based reasoning has some problems. First, case based reasoning has a tendency to search for a fixed number of neighbors in the observation space and always selects the same number of neighbors rather than the best similar neighbors for the target case. So, case based reasoning may have to take into account more cases even when there are fewer cases applicable depending on the subject. Second, case based reasoning may select neighbors that are far away from the target case. Thus, case based reasoning does not guarantee an optimal pseudo-neighborhood for various target cases, and the predictability can be degraded due to a deviation from the desired similar neighbor. This paper examines how the size of learning data affects stock price predictability through k-nearest neighbor and compares the predictability of k-nearest neighbor with the random walk model according to the size of the learning data and the number of neighbors. In this study, Samsung electronics stock prices were predicted by dividing the learning dataset into two types. For the prediction of next day's closing price, we used four variables: opening value, daily high, daily low, and daily close. In the first experiment, data from January 1, 2000 to December 31, 2017 were used for the learning process. In the second experiment, data from January 1, 2015 to December 31, 2017 were used for the learning process. The test data is from January 1, 2018 to August 31, 2018 for both experiments. We compared the performance of k-NN with the random walk model using the two learning dataset. The mean absolute percentage error (MAPE) was 1.3497 for the random walk model and 1.3570 for the k-NN for the first experiment when the learning data was small. However, the mean absolute percentage error (MAPE) for the random walk model was 1.3497 and the k-NN was 1.2928 for the second experiment when the learning data was large. These results show that the prediction power when more learning data are used is higher than when less learning data are used. Also, this paper shows that k-NN generally produces a better predictive power than random walk model for larger learning datasets and does not when the learning dataset is relatively small. Future studies need to consider macroeconomic variables related to stock price forecasting including opening price, low price, high price, and closing price. Also, to produce better results, it is recommended that the k-nearest neighbor needs to find nearest neighbors using the second step filtering method considering fundamental economic variables as well as a sufficient amount of learning data.