• Journal of Korea Multimedia Society
• /
• v.18 no.4
• /
• pp.443-451
• /
• 2015

In this paper we suggest a new two-wheelers detection algorithm using uniform local binary pattern weighting value for projection vectors. The first, we calculate feature vectors using projection method which has robustness for rotation invariant and reducing dimensionality for each cell from origin image. The second, we applied new weighting values which are calculated by the modified local binary pattern showing the fast compute and simple to implement. This paper applied the Adaboost algorithm to make a strong classification from weak classification. In this experiment, we can get the result that the detection rate of the proposed method is higher than that of the traditional method.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.6
• /
• pp.1549-1555
• /
• 2014

Consider a p-variate normal distribution ($p-q{\geq}3$, q = rank($P_V$) with a projection matrix $P_V$). Using a simple property of noncentral chi square distribution, the generalized Bayes estimators dominating the James-Stein estimator shrinking towards projection vectors under quadratic loss are given based on the methods of Brown, Brewster and Zidek for estimating a normal variance. This result can be extended the cases where covariance matrix is completely unknown or ${\sum}={\sigma}^2I$ for an unknown scalar ${\sigma}^2$.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.5 no.1
• /
• pp.154-161
• /
• 1997

This paper presents the method to eliminate the constraint reaction in the Lagrange multiplier form equation of motion by using a generalized coordinate driveder from the velocity constraint equation. This method introduces a matrix method by considering the m dimensional space spanned by the rows of the constraint jacobian matrix. The orthogonal vectors defining the constraint manifold are projected to null vectors by the tangential vectors defined on the constraint manifold. Therefore the orthogonal projection matrix is defined by the tangential vectors. For correcting the generalized position coordinate, the optimization problem is formulated. And this correction process is analyzed by the quasi Newton method. Finally this method is verified through 3 dimensional vehicle model.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.3
• /
• pp.20-29
• /
• 2008

In this paper, we propose a do-interlacing algorithm using integral projection-based motion estimation considering Region Of Interest(ROI). The proposed motion estimation method finds the motion of the given ROI accurately with low computational cost. In order to incorporate the motion estimation in do-interlacing, an entire image is first segmented into multiple ROIs according to the temporally predicted block-wise motion types and spatial positions. Then, motion vectors of respective ROIs are obtained by the integral projection method. In this paper, totally five ROIs, one for the global motion and four for the local motions, are made, and therefore, five motion vectors are produced for each field. By using the estimated motion vectors, motion compensation is performed for increasing the vortical resolution of the converted frames. Finally, do-interlaced frames are obtained by effectively combining the results of motion compensation and stable intra-field do-interlacing according to the reliability of motion compensation. Experimental results show that the proposed algorithm provides better image quality than existing algorithms in both subjective and objective measures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2341-2348
• /
• 1996

This paper proposes an image compression algorithm that adopts projection scheme on mean-residual metod. Sub-blocks of an image are encoded using mean-residual method where mean value is predicted according to that of neighboring blocks. Projection scheme with 8 directions is applied to the compression of residual signals of blocks. Projection vectors are finite-state vector quantized according to the projection angle of nighboring blocks in order to exploit the correlation among them. Side information to represent the repetition of projection is run-length coded while the information for projection direction is compressed using entropy encoding. The proposed scheme apears to be better in PSNR performance when compared with conventional projection scheme as well as in subjective quality preserving the edges of images better than most tranform methods which usually require heavy computation load.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1785-1794
• /
• 1999

The affine projection algorithm has known t require less computational complexity than RLS but have much faster convergence than NLMS for speech-like input signals. But the affine projection algorithm is still much more computationally demanding than the LMS algorithm because it requires the matrix inversion. In this paper, we show that the affine projection algorithm can be realized with the Gram-Schmidt orthogonalizaion of input vectors. Using the derived relation, we propose an approximate but much more efficient implementation of the affine projection algorithm. Simulation results show that the proposed algorithm has the convergence speed that is comparable to the affine projection algorithm with only a slight extra calculation complexity beyond that of NLMS.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.48-52
• /
• 2008

In this paper, we propose a new selective subspace projection method in order to recognize the occlusive face image effectively. The conventional subspace projection method is project to basis image using a full image of face. The face recognition rate has reduced because the face characteristic is easy to be distorted by occlusion. To overcome this problem, the proposed method first decide to occlusion. If it hasn't an occlusion, we get the feature vectors with total basis projection using the conventional subspace projection method. If it has an occlusion, we get one with partial basis projection. We get better recognition rate than conventional PCA and NMF using AR face database with occlusive face images.

• ETRI Journal
• /
• v.38 no.3
• /
• pp.502-509
• /
• 2016

Feature detection and description are key ingredients of common image processing and computer vision applications. Most existing algorithms focus on robust feature matching under challenging conditions, such as inplane rotations and scale changes. Consequently, they usually fail when the scene is blurred by camera shake or an object's motion. To solve this problem, we propose a new feature description algorithm that is robust to image blur and significantly improves the feature matching performance. The proposed algorithm builds a feature descriptor by considering the integral projection along four angular directions ($0^{\circ}$, $45^{\circ}$, $90^{\circ}$, and $135^{\circ}$) and by combining four projection vectors into a single highdimensional vector. Intensive experiment shows that the proposed descriptor outperforms existing descriptors for different types of blur caused by linear motion, nonlinear motion, and defocus. Furthermore, the proposed descriptor is robust to intensity changes and image rotation.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.2
• /
• pp.435-442
• /
• 2017

Consider the problem of estimating a $p{\times}1$ mean vector ${\theta}$ (p ${\geq}$ 3) under the quadratic loss from multi-variate normal population. We find a James-Stein type estimator which shrinks towards the projection vectors when the underlying distribution is that of a variance mixture of normals. In this case, the norm ${\parallel}{\theta}-K{\theta}{\parallel}$ is known where K is a projection vector with rank(K) = q. The class of this type estimator is quite general to include the class of the estimators proposed by Merchand and Giri (1993). We can derive the class and obtain the optimal type estimator. Also, this research can be applied to the simple and multiple regression model in the case of rank(K) ${\geq}2$.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2007.08a
• /
• pp.810-813
• /
• 2007

Recently, mobile video communication is getting more and more popular. Visual quality and computational complexity are primary factors affecting performance of video communication. Frame rate up-conversion (FRC) is necessary for achieving high visual quality in mobile projection displays. In this paper, a FRC method using motion compensation based on block matching algorithm (BMA) with adaptive block size is proposed. In order to improve the accuracy of the estimated motion vectors, the motion vector refinement technique is proposed. Experiment results indicate that the proposed technique exhibits better performance with lower hardware complexity compared to the conventional methods.