• Title/Summary/Keyword: Vector Smoothing method

Search Result 32, Processing Time 0.024 seconds

Frame Rate Up Conversion Method using Partition Block OBMC and Improved Adaptively Weighted Vector Median (분할 블록 OBMC와 개선된 적응 가중 중간값 필터를 이용한 프레임률 증가 기법)

  • Kim, Geun-Tae;Ko, Yun-Ho
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.24 no.1
    • /
    • pp.1-12
    • /
    • 2019
  • This paper proposes a new motion vector smoothing and motion compensation method to increase the frame rate of videos. The proposed method reduces false motion vector smoothing by improving the weight with reflecting accuracy to overcome the limitation of the conventional motion vector smoothing using the adaptively weighted vector median. Also, to improve the interpolated image quality of the conventional OBMC(Overlapped Block Motion Compensation), a scheme that divides an original block into 4 sub-blocks and then generates the interpolated frame using the reestimated motion vector for each sub-block is proposed. The simulation results prove that the proposed method can provide much better objective and subjective image quality than the conventional method.

A New Smoothing Method of Unstructured Viscous Grid for ALM Method (ALM 방법에 의한 비정렬 점성 격자의 유화 기법)

  • Lee, Bong-Ju;Kim, Byoung-Soo
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2008.03b
    • /
    • pp.618-621
    • /
    • 2008
  • In this paper a new smoothing method of unstructured viscous grid which can be useful when the ALM(Advacning Layer Method) method is used to generate volume grids of prism cells starting with unstructured triangular surface grids. According to the new method two layers of prism cells in the advancing direction which are found by the vector smoothing method are first generated, and then the position of nodes along the middle layer are adjusted by using spring analogy. It is found that the proposed method improves grid quality of the unstructured viscous volume grids for body shape with convex and concave corners.

  • PDF

Hybrid Deinterlacing Algorithm with Motion Vector Smoothing

  • Khvan, Dmitriy;Jeon, Gwanggil;Jeong, Jechang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.07a
    • /
    • pp.262-265
    • /
    • 2012
  • In this paper we propose a new deinterlacing method with block classification and motion vector smoothing. The proposed method classifies a block, then depending on the region it belongs to, the motion estimation or line averaging is applied. To classify a block its variance is calculated. Then, for those blocks that belong to simple non-texture region the line averaging is done while motion estimation is applied to complex region. The motion vector field is smoothed using median filter what yields more accurate interpolation. In the experiments for the subjective evaluation, the proposed method bas shown satisfying results in terms of computation time consumption and peak signal-to-noise ratio. Due to the simplicity of the algorithm computation time was drastically decreased.

  • PDF

A Study on a Statistical Modeling of 3-Dimensional MPEG Data and Smoothing Method by a Periodic Mean Value (3차원 동영상 데이터의 통계적 모델링과 주기적 평균값에 의한 Smoothing 방법에 관한 연구)

  • Kim, Duck-Sung;Kim, Tae-Hyung;Rhee, Byung-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.6
    • /
    • pp.87-95
    • /
    • 1999
  • We propose a simulation model of 3-dimensional MPEG data over Asynchronous transfer Mode(ATM) networks. The model is based on a slice level and is named to Projected Vector Autoregressive(PVAR) model. The PVAR model is modeled using the Autoregressive(AR) model in order to meet the autocorrelation condition and fit the histogram, and maps real data by a projection function. For the projection function, we use the Cumulative Distribution Probability Function (CDPF), and the procedure is performed at each slice level. Our proposed model shows good performance in meeting the autocorrelation condition and fitting the histogram, and is found important in analyzing the performance of networks. In addiotion, we apply a smoothing method by which a periodic mean value. In general. the Quality of Service(QoS) depends on the Cell Loss Rate(CLR), which is related to the cell loss and a maximum delay in a buffer. Hence the proposed smoothing method can be used to improve the QoS.

  • PDF

MULTIGRID METHODS FOR 3D H(curl) PROBLEMS WITH NONOVERLAPPING DOMAIN DECOMPOSITION SMOOTHERS

  • Duk-Soon Oh
    • Journal of the Korean Mathematical Society
    • /
    • v.61 no.4
    • /
    • pp.659-681
    • /
    • 2024
  • We propose V-cycle multigrid methods for vector field problems arising from the lowest order hexahedral Nédélec finite element. Since the conventional scalar smoothing techniques do not work well for the problems, a new type of smoothing method is necessary. We introduce new smoothers based on substructuring with nonoverlapping domain decomposition methods. We provide the convergence analysis and numerical experiments that support our theory.

Codeword-Dependent Distance Normalization and Smoothing of Output Probalities Based on the Instar-formed Fuzzy Contribution in the FVQ-DHMM (퍼지양자화 은닉 마르코프 모델에서 코드워드 종속거리 정규화와 Instar 형태의 퍼지 기여도에 기반한 출력확률의 평활화)

  • Choi, Hwan-Jin;Kim, Yeon-Jun;Oh, Yung-Hwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.2
    • /
    • pp.71-79
    • /
    • 1997
  • In this paper, a codeword-dependent distance normalization(CDDN) and an instar-formed fuzzy smoothing of output distribution are proposed for robust estimation of output probabilities in the FVQ(fuzzy vector quantization)-DHMM(discrete hidden Markov model). The FVQ-DHMM is a variant of DHMM in which the state output probability is estimated by the sum oft he product of the output probability and its weighting factor for each codeword on an input vector. As the performance of the FVQ-DHMM is influenced by weighting factor and output distribution from a state, it is required to get a method to get robust estimation of weighting factors and output distribution for each state. From experimental results, the proposed CDDN method has reduced 24% of error rate over the conventional FVQ-DHMM, and also reduced 79% of error rate when the smoothing of output distribution is also applied to the computation of an output probability. These results indicate that the use of CDDN and the fuzzy smoothing of output distribution to the FVQ-DHMM lead to improved recognition, and therefore it may be used as an alternative to the robust estimation of output probabilities for HMMs.

  • PDF

A Study on the Generation of Initial Shape for the Initiation of Optimal Blank Design Sequence (최적블랭크 설계를 위한 초기형상 생성에 관한 연구)

  • 심현보;장상득;박종규
    • Transactions of Materials Processing
    • /
    • v.13 no.1
    • /
    • pp.90-101
    • /
    • 2004
  • An inverse mosaic method has been proposed to generate an initial blank shape from the final product shape. Differently from the geometric mapping method, the method can handle triangular patches. However, the generated blank shape is strongly dependent on the order of determination of nodes. In order to compensate the dependency error smoothing technique has been also developed. Although the accuracy has been improved greatly compared with the geometrical mapping method, the method has limitation, due to the no incorporation of plasticity theory. Even though the accuracy of the radius vector method is already proved. the method requires initial guess to start the method. In order to compromise the limitation of the present method and the radius vector method, the method has been connected to the radius vector method. The efficiency of the present optimal blank design method has been verified with some chosen examples.

An Efficient Illumination Preprocessing Algorithm based on Anisotropic Smoothing for Face Recognition (얼굴 인식을 위한 Anisotropic Smoothing 기반 효율적 조명 전처리)

  • Kim, Sang-Hoon;Jung, Sou-Hwan;Cho, Seong-Won;Chung, Sun-Tae
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.236-245
    • /
    • 2008
  • Robust face recognition under various illumination environments is very difficult and needs to be accomplished for successful commercialization. In this paper, we propose an efficient illumination preprocessing method for face recognition. illumination preprocessing algorithm based on anisotropic smoothing is well known to be effective among illumination normalization methods but deteriorates the intensity contrast of the original image, and incurs less sharp edges. The proposed method in this paper improves the previous anisotropic smoothing based illumination normalization method so that it increases the intensity contrast and enhances the edges while diminishing effects of illumination. Due to the result of these improvements, face images preprocessed by the proposed illumination preprocessing method becomes to have more distinctive feature vectors(Gabor feature vectors). Through experiments of face recognition using Gabor jet similarity, the effectiveness of the proposed illumination preprocessing method is verified.

Hybrid CSA optimization with seasonal RVR in traffic flow forecasting

  • Shen, Zhangguo;Wang, Wanliang;Shen, Qing;Li, Zechao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4887-4907
    • /
    • 2017
  • Accurate traffic flow forecasting is critical to the development and implementation of city intelligent transportation systems. Therefore, it is one of the most important components in the research of urban traffic scheduling. However, traffic flow forecasting involves a rather complex nonlinear data pattern, particularly during workday peak periods, and a lot of research has shown that traffic flow data reveals a seasonal trend. This paper proposes a new traffic flow forecasting model that combines seasonal relevance vector regression with the hybrid chaotic simulated annealing method (SRVRCSA). Additionally, a numerical example of traffic flow data from The Transportation Data Research Laboratory is used to elucidate the forecasting performance of the proposed SRVRCSA model. The forecasting results indicate that the proposed model yields more accurate forecasting results than the seasonal auto regressive integrated moving average (SARIMA), the double seasonal Holt-Winters exponential smoothing (DSHWES), and the relevance vector regression with hybrid Chaotic Simulated Annealing method (RVRCSA) models. The forecasting performance of RVRCSA with different kernel functions is also studied.

Smoothing Kaplan-Meier estimate using monotone support vector regression (단조 서포트벡터기계를 이용한 카플란-마이어 생존함수의 평활)

  • Hwang, Changha;Shim, Jooyong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.6
    • /
    • pp.1045-1054
    • /
    • 2012
  • Support vector machine is known to be the very useful statistical method in classification and nonlinear function estimation. In this paper we propose a monotone support vector regression (SVR) for the estimation of monotonically decreasing function. The proposed monotone SVR is applied to smooth the Kaplan-Meier estimate of survival function. Experimental results are then presented which indicate the performance of the proposed monotone SVR using survival functions obtained by exponential distribution.