• International Journal of Automotive Technology
• /
• v.2 no.3
• /
• pp.117-122
• /
• 2001

For a dynamic analysis of a constrained multibody system, it is necessary to have a routine for satisfying kinematic constraints. LU decomposition scheme, which is used to divide coordinates into dependent and independent coordinates, is efficient but has great difficulty near the singular configuration. Other method such as the projection matrix, which is more stable near a singular configuration, takes longer simulation time due to the large amount of calculation for decomposition. In this paper, the row space and the null space of the Jacobian matrix are proposed by using the pseudo-inverse method and the projection matrix. The equations of the motion of a system are replaced with independent acceleration components using the null space of the Jacobian matrix. Also a new hybrid method is proposed, combining the LU decomposition and the projection matrix. The proposed hybrid method has following advantages. (1) The simulation efficiency is preserved by the LU method during the simulation. (2) The accuracy of the solution is also achieved by the projection method near the singular configuration.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.27-34
• /
• 2014

In this paper, we propose a pupil detection method using hybrid projection function and rank order filter. To reduce error to detect eyebrows as pupil, eyebrows are detected using hybrid projection function in face region and eye region is set to not include the eyebrows. In the eye region, potential pupil candidates are detected using rank order filter and then the positions of pupil candidates are corrected. The pupil candidates are grouped into pairs based on geometric constraints. A similarity measure is obtained for two eye of each pair using template matching, we select a pair with the smallest similarity measure as final two pupils. The experiments have been performed for 700 images of the BioID face database. The pupil detection rate is 92.4% and the proposed method improves about 21.5% over the existing method..

• Communications of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.447-456
• /
• 2017

The purpose of this paper is to introduce some strong convergence theorems for the problem of finding a common zero of a finite family of monotone operators and the problem of finding a common fixed point of a finite family of nonexpansive in Hilbert spaces by hybrid projection method.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.3
• /
• pp.553-568
• /
• 2022

In this paper, we introduce and study two different iterative hybrid projection algorithms for solving a fixed point problem of nonexpansive mappings. The first algorithm is generated by the combination of the inertial method and the hybrid projection method. On the other hand, the second algorithm is constructed by the convex combination of three updated vectors and the hybrid projection method. The strong convergence of the two proposed algorithms are proved under very mild assumptions on the scalar control. For illustrating the advantages of these two newly invented algorithms, we created some numerical results to compare various numerical performances of our algorithms with the algorithm proposed by Dong and Lu [11].

• Structural Engineering and Mechanics
• /
• v.65 no.6
• /
• pp.707-719
• /
• 2018

In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.

• East Asian mathematical journal
• /
• v.28 no.3
• /
• pp.305-320
• /
• 2012

The purpose of this paper is to introduce a hybrid projection method for finding a common element of the set of solutions of a generalized equilibrium problem, the set of solutions of a variational inclusion problem and the set of common fixed points of a finite family of strict pseudo-contractions in Hilbert spaces.

• Cartoon and Animation Studies
• /
• s.39
• /
• pp.133-156
• /
• 2015

With development of media and technology animation are seeking a variety of a genre fusion. I would like to propose a new animation screening method using a projection mapping and a popup book. I redesigned the existing method of watching the animation to a new experience by projecting the image on a three-dimensional structure instead a flat screen. This screening method was inspired by preceded works which were made by the fusion of a projection mapping and a popup book. Through analysis of them, I found the merits, shortcomings and clarified the difference of each works. I called this method "Hybrid Animation Theater" because it is fused the various areas - Theater, Projection mapping, Pop-up book, Animation, and Installations, etc. also studied for its architectural features and design. After I designed a prototype to demonstrate the possibilities, the limitations and shortcomings, I could suggest next research directions.

• Communications of the Korean Mathematical Society
• /
• v.26 no.3
• /
• pp.473-482
• /
• 2011

In this paper, mappings which are asymptotically pseudo-contractive in the intermediate sense are considered based on a hybrid projection method. Strong convergence theorems of fixed points are established in the framework of Hilbert spaces.

• Journal of the Korean Society of Industry Convergence
• /
• v.4 no.1
• /
• pp.87-94
• /
• 2001

In multibody dynamics, differential and algebraic equations which can satisfy both equation of motion and kinematic constraint equation should be solved. To solve this equation, coordinate partitioning method and constraint stabilization method are commonly used. The coordinate partitioning method divides the coordinate into independent and dependent coordinates. The most typical coordinate partitioning method arc LU decomposition, QR decomposition, projection method and SVD(sigular value decomposition).The objective of this research is to find a efficient coordinate partitioning method in flexible multibody systems and a hybrid decomposition algorithm which employs both LU and projection methods is proposed. The accuracy of the solution algorithm is checked with a slider-crank mechanism.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.801-812
• /
• 2010

In this paper, we consider the convergence of the shrinking projection method for quasi-$\phi$-nonexpansive mappings. Strong convergence theorems are established in a uniformly smooth and strictly convex Banach space which enjoys the Kadec-Klee property.