• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.1
• /
• pp.37-55
• /
• 2023

In this paper we propose a new algorithm for detecting and counting flowers in a complex background based on digital images. The algorithm mainly includes the following parts: edge contour extraction of flowers, edge contour determination of overlapped flowers and flower counting. We use a contour detection technique in Computer Vision (CV) to extract the edge contours of flowers and propose an improved algorithm with a concave point detection technique to find accurate segmentation for overlapped flowers. In this process, we first use the polygon approximation to smooth edge contours and then adopt the second-order central moments to fit ellipse contours to determine whether edge contours overlap. To obtain accurate segmentation points, we calculate the curvature of each pixel point on the edge contours with an improved Curvature Scale Space (CSS) corner detector. Finally, we successively give three adaptive judgment criteria to detect and count flowers accurately and automatically. Both experimental results and the proposed evaluation indicators reveal that the proposed algorithm is more efficient for flower counting.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.84-90
• /
• 2023

In this article the problem of computing floating-point reciprocal cube root functions is considered. Our new algorithms for this task decrease the number of arithmetic operations used for computing $1/{\sqrt[3]{x}}$. A new approach for selection of magic constants is presented in order to minimize the computation time for reciprocal cube roots of arguments with movable decimal point. The underlying theory enables partitioning of the base argument range x∈[1,8) into 3 segments, what in turn increases accuracy of initial function approximation and decreases the number of iterations to one. Three best algorithms were implemented and carefully tested on 32-bit microcontroller with ARM core. Their custom C implementations were favourable compared with the algorithm based on cbrtf(x) function taken from C ＜math.h＞ library on three different hardware platforms. As a result, the new fast approximation algorithm for the function $1/{\sqrt[3]{x}}$ was determined that outperforms all other algorithms in terms of computation time and cycle count.

• Journal of Power Electronics
• /
• v.15 no.1
• /
• pp.106-115
• /
• 2015

This paper proposes a novel direct power control (DPC) strategy for neutral-point-clamped (NPC) three-level rectifiers, to directly control the active power, the reactive power and the neutral point potential of the rectifiers by referring to three pre-calculated vector influence tables and minimizing an objective function. In the three vector influence tables, the influences of different voltage vectors on the active power, the reactive power and the neutral-point potential are shown explicitly. A conceptual description and control algorithm of the proposed controller are presented in this paper. Then, numerical simulations and experiments are carried out to validate the proposed method. Both the simulation and experimental results show that good performances during both the steady-state and transient operating conditions are achieved. As a result, the proposed strategy has been proven to be effective for NPC three-level rectifiers.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1017-1020
• /
• 1998

We propose an algorithm which processes the floating-point $n_{addition}$traction and rounding in parallel. It also processes multiplication and rounding in the same way. The hardware model is presented that minimizes the delay time to get results for all the rounding modes defined in the IEEE Standards. An unified method to get the three bits(L, G, S)for the rounding is described. We also propose an unified guide line to determine the 1-bit shift for the post-normalization in the Floating-point $n_{addition}$traction and multiplication.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.8 no.1
• /
• pp.71-87
• /
• 1990

This paper presents a simple algorithm to obtain three dimensional information of an object. In the preprocessing of the stereo matching,feature point informations of stero image must be less sensitive to noise and well liked the correspondance problem. This paper described a simple technique of struture feature extraction of 3-D object and used edge-end point expanding method for unconnected line instade of Hough transform. The feature such as corner point and their angles are used for matching problem. The experimental results show that the described algorithm is a useful method for stereo correspondence problem.

• Computers and Concrete
• /
• v.22 no.1
• /
• pp.39-51
• /
• 2018

This study introduces a new algorithm to determine size independent values of fracture energy, fracture toughness, and fracture process zone length in three-point bending specimens with shallow to deep notches. By using the exact beam theory, a concept of equivalent notch length is introduced for specimens with no notches in order to predict the peak loads with acceptable precisions. Moreover, the method considers the variations of fracture process zone length and effects of higher order terms of stress field in each specimen size. In this paper, it was demonstrated that the use of some recently developed size effect laws raises some concerns due to the use of nonlinear regression analysis. By using a comprehensive fracture test data, provided by Hoover and Bazant, the algorithm has been assessed. It could be concluded that the proposed algorithm can facilitate a powerful tool for size effect study of three-point bending specimens with different notch lengths.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.245-250
• /
• 1992

In this paper, we present a nev algorithm for the fast computation of the discrete cosine transform(DCT). This algorithm consists of the three dimensional prime factor-decomposed algorithm(PFA) and three dimensional common factor-decomposed algorithm(CFA). We can compute N-point DCT for the number N decomposable Into three relative prime numbers using PFA and into three common numbers using CFA. We also show input and output index mapping for the three decomposition. it results in requiring fever multiplicaions than the previous algorithms. Particularly, for the large number N, it is more powerful in reducing the number of multiplication.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.52-56
• /
• 1990

An algorithm is proposed to determine the optimal contact forces of robotic hands, where the soft finger contact as well as the frictional point contact are considered. Especially, the algorithm can be efficiently applied to the case of multi-point contact by inner-link as well as fingertip. To show the validities of the algorithm, several numerical exampies are presented by employing a robotics hand with three fingers each of which has four joints.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.1
• /
• pp.1-11
• /
• 2021

In this paper we study the weak and strong convergence to minimizers of convex function of proximal point algorithm SP-iteration of three multivalued nonexpansive mappings in a Hilbert space.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.783-796
• /
• 2010

We introduce a new iterative algorithm for equilibrium and fixed point problems of three hemi-relatively nonexpansive mappings by the CQ hybrid method in Banach spaces, Our results improve and extend the corresponding results announced by Xiaolong Qin, Yeol Je Cho, Shin Min Kang [Xiaolong Qin, Yeol Je Cho, Shin Min Kang, Convergence theorems of common elements for equilibrium problems and fixed point problems in Banach spaces, Journal of Computational and Applied Mathematics 225 (2009) 20-30], P. Kumam, K. Wattanawitoon [P. Kumam, K. Wattanawitoon, Convergence theorems of a hybrid algorithm for equilibrium problems, Nonlinear Analysis: Hybrid Systems (2009), doi:10.1016/j.nahs.2009.02.006], W. Takahashi, K. Zembayashi [W. Takahashi, K. Zembayashi, Strong convergence theorem by a new hybrid method for equilibrium problems and relatively nonexpansive mappings, Fixed Point Theory Appl. (2008) doi:10.1155/2008/528476] and others therein.