• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.4
• /
• pp.294-300
• /
• 2004

According to the development of digital media technologies various algorithms for video clip matching have been proposed to match the video sequences efficiently. A large number of video search methods have focused on frame-wise query, whereas a relatively few algorithms have been presented for video clip matching or video shot matching. In this paper, we propose an efficient algorithm to index the video sequences and to retrieve the sequences for video clip query. To improve the accuracy and performance of video sequence matching, we employ the Cauchy function as a similarity measure between histograms of consecutive frames, which yields a high performance compared with conventional measures. The key frames extracted from segmented video shots can be used not only for video shot clustering but also for video sequence matching or browsing, where the key frame is defined by the frame that is significantly different from the previous frames. Experimental results with color video sequences show that the proposed method yields the high matching performance and accuracy with a low computational load compared with conventional algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.45-52
• /
• 2004

According tothe development of digital media technologies various algorithms for video sequence matching have been proposed to match the video sequences efficiently. A large number of video sequence matching methods have focused on frame-wise query, whereas a relatively few algorithms have been presented for video sequence matching or video shot matching. In this paper, we propose an efficientalgorithm to index the video sequences and to retrieve the sequences for video sequence query. To improve the accuracy and performance of video sequence matching, we employ the Cauchy function as a similarity measure between histograms of consecutive frames, which yields a high performance compared with conventional measures. The key frames extracted from segmented video shots can be used not only for video shot clustering but also for video sequence matching or browsing, where the key frame is defined by the frame that is significantly different from the previous fames. Several key frame extraction algorithms have been proposed, in which similar methods used for shot boundary detection were employed with proper similarity measures. In this paper, we propose the efficient algorithm to extract key frames using the cumulative Cauchy function measure and. compare its performance with that of conventional algorithms. Video sequence matching can be performed by evaluating the similarity between data sets of key frames. To improve the matching efficiency with the set of extracted key frames we employ the Cauchy function and the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed method yields the high matching performance and accuracy with a low computational load compared with conventional algorithms.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.641-644
• /
• 2015

In this paper, we propose a precise frame-level near-duplicate video matching algorithm. First, a binary frame descriptor for near-duplicate video matching is proposed. The binary frame descriptor divides a frame into patches and represent the relations between patches in bits. Seconds, we formulate a cost function for the matching, composed of matching costs and compensatory costs. Then, we roughly determine initial matchings and refine the matchings iteratively to minimize the cost function. Experimental results demonstrate that the proposed algorithm provides efficient performance for frame-level near duplicate video matching.

• Geophysics and Geophysical Exploration
• /
• v.17 no.2
• /
• pp.88-94
• /
• 2014

Due to mechanical failure or geographical accessibility, the seismic data can be partially missed. In addition, it can be coarsely sampled such as crossline of the marine streamer data. This seismic data that irregular sampled and spatial aliased may cause problems during seismic data processing. Accurate and efficient interpolation method can solve this problem. Futhermore, interpolation can save the acquisition cost and time by reducing the number of shots and receivers. Among various interpolation methods, the Matching Pursuit method can be applied to any sampling type which is regular or irregular. However, in case of using sinusoidal basis function, this method has a limitation in spatial aliasing. Therefore, in this study, we have developed wavelet based Matching Pursuit method that uses wavelet instead of sinusoidal function for the improvement of dealiasing performance. In addition, we have improved interpolation speed by using inner product instead of L-2 norm.

• East Asian Economic Review
• /
• v.24 no.3
• /
• pp.275-301
• /
• 2020

We analyze state-level matching efficiencies in the Indian labor market using stochastic frontier analysis. The key contribution of this research is the estimation of matching efficiencies at the state level because these can be used for a state-level measure of labor market conditions. Next, we explore the relationship between the estimated matching efficiencies and population density, labor market flexibility, and the Ease of Doing Business index, respectively. The results show that matching efficiency is heterogeneous across states with considerable variation in accordance with the regional diversity in India. However, we find that there is little relationship between the estimated matching efficiencies and the labor market conditions of interest, suggesting that other regional diversity affects matching efficiencies across states in India.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.532-535
• /
• 2003

In this paper, we propose a new algorithm that can enhance the speed of template matching of hand vascular pattern person verification or recognition system. Various template matching algorithms have advantages in the matching accuracy, but most of the algorithms suffer from computational burden. To reduce the computational amount, with accuracy maintained, we propose following template matching scenario as follows. firstly, original hand vascular image is re-sampled in order to reduce spatial resolution. Secondly, reconstructed image is projected to vertical and horizontal direction, being converted to two one dimensional (1D) data. Thirdly, converted data is used to estimate spatial discrepancy between stored template image and target image. Finally, matching begins from where the estimated order is highest, and finishes when matching decision function is computed to be over certain threshold. We've applied the proposed algorithm to hand vascular pattern identification application for biometrics, and observed dramatic matching speed enhancement. This paper presents detailed explanation of the proposed algorithm and evaluation results.

• Communications for Statistical Applications and Methods
• /
• v.30 no.1
• /
• pp.1-19
• /
• 2023

Observational data with missing or incomplete data are common in biomedical research. Multiple imputation is an effective approach to handle missing data with the ability to decrease bias while increasing statistical power and efficiency. In recent years propensity score (PS) matching has been increasingly used in observational studies to estimate treatment effect as it can reduce confounding due to measured baseline covariates. In this paper, we describe in detail approaches to competing risk analysis in the setting of incomplete observational data when using PS matching. First, we used multiple imputation to impute several missing variables simultaneously, then conducted propensity-score matching to match statin-exposed patients with those unexposed. Afterwards, we assessed the effect of statin exposure on the risk of heart failure-related hospitalizations or emergency visits by estimating both relative and absolute effects. Collectively, we provided a general methodological framework to assess treatment effect in incomplete observational data. In addition, we presented a practical approach to produce overall cumulative incidence function (CIF) based on estimates from multiple imputed and PS-matched samples.

• Journal of Soil and Groundwater Environment
• /
• v.20 no.3
• /
• pp.51-64
• /
• 2015

In the present study, we develop two history matching techniques based on Markov chain Monte Carlo method where radial basis function and Gaussian distribution generated by unconditional geostatistical simulation are employed as the random walk transition kernels. The Bayesian inverse methods for aquifer characterization as the developed models can be effectively applied to the condition even when the targeted information such as hydraulic conductivity is absent and there are transient hydraulic head records due to imposed stress at observation wells. The model which uses unconditional simulation as random walk transition kernel has advantage in that spatial statistics can be directly associated with the predictions. The model using radial basis function network shares the same advantages as the model with unconditional simulation, yet the radial basis function network based the model does not require external geostatistical techniques. Also, by employing radial basis function as transition kernel, multi-scale nested structures can be rigorously addressed. In the validations of the developed models, the overall predictabilities of both models are sound by showing high correlation coefficient between the reference and the predicted. In terms of the model performance, the model with radial basis function network has higher error reduction rate and computational efficiency than with unconditional geostatistical simulation.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.6
• /
• pp.491-498
• /
• 2009

This paper presents the design method of an impedance matching network using an isolation transformer and the Chebyshev filter function for the high efficiency and the flat power driving of an underwater acoustic piezoelectric transducer. The proposed impedance matching network is designed for minimizing the reactance component of transducer and having the flat power response in the wide frequency range. We design a low pass filter with ladder-type circuit using the Chebyshev function as standard prototype filter function. In addition, we design the impedance matching network which is suitable for the equivalent circuit of transducer and the turn ratio of transformer through the bandpass frequency transformation. The proposed method is applied to the simulated dummy load of the tonpilz-type transducer operating in the middle frequency range. The simulation results are compared with the measured characteristics and the validity of the proposed method is verified.

• Journal of Broadcast Engineering
• /
• v.18 no.5
• /
• pp.669-679
• /
• 2013

This paper proposed a new VLSI (Very Large Scale Integrated Circuit) architecture for stereo matching in real time. We minimized the amount of calculation and the number of memory accesses through analyzing calculation of stereo matching. From this, we proposed a new stereo matching calculating cell and a new hardware architecture by expanding it in parallel, which concurrently calculates cost function for all pixels in a search range. After expanding it, we proposed a new hardware architecture to calculate cost function for 2-dimensional region. The implemented hardware can be operated with minimum 250Mhz clock frequence in FPGA (Field Programmable Gate Array) environment, and has the performance of 805fps in case of the search range of 64 pixels and the image size of $640{\times}480$.