• The Journal of Korea Robotics Society
• /
• v.5 no.2
• /
• pp.85-92
• /
• 2010

In this paper, we propose a digital image stabilization technique using edge detection and Lucas-Kanade optical flow in order to minimize the motion of the shaken image. The accuracy of motion estimation based on block matching technique depends on the size of search window, which results in long calculation time. Therefore it is not applicable to real-time system. In addition, since the size of vector depends on that of block, it is difficult to estimate the motion which is bigger than the block size. The proposed method extracts the trust region using edge detection, to estimate the motion of some critical points in trust region based on Lucas-Kanade optical flow algorithm. The experimental results show that the proposed method stabilizes the shaking of motion image effectively in real time.

• Kyungpook Mathematical Journal
• /
• v.63 no.4
• /
• pp.539-550
• /
• 2023

In this paper, we define the generalized k-balancing numbers {B^(k)_n} and k-Lucas balancing numbers {C^(k)_n} and associated polynomials, where n is of the form sk+r, 0 ≤ r < k. We give several formulas for these new sequences in terms of classic balancing and Lucas balancing numbers and study their properties. Moreover, we give a Binet style formula, Cassini's identity, and binomial sums of these sequences.

• Journal of the Korean Mathematical Society
• /
• v.42 no.1
• /
• pp.135-151
• /
• 2005

In this paper, we obtain some properties of the sequences $U^{q}_n\;and\;V^{q}_n$ introduced in [6]. We find polynomial representations and formulas of them. For q = 5, $U^{5}_n$ is the Fibonacci sequence $F_n\;and\;V^{5}_n$ is the Lucas sequence $L_n$.

• Communications of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.511-522
• /
• 2017

We explicitly solve the diophantine equations of the form $$A_{n_1}A_{n_2}{\cdots}A_{n_k}{\pm}1=B^2_m$$, where $(A_n)_{n{\geq}0}$ and $(B_m)_{m{\geq}0}$ are either the Fibonacci sequence or Lucas sequence. This extends the result of D. Marques [9] and L. Szalay [13] concerning a variant of Brocard-Ramanujan equation.

• Communications of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.447-450
• /
• 2016

Let $F_n$ and $L_n$ be the nth Fibonacci number and Lucas number, respectively. The order of appearance of m in the Fibonacci sequence, denoted by z(m), is the smallest positive integer k such that m divides $F_k$. Marques obtained the formula of $z(L^k_n)$ in some cases. In this article, we obtain the formula of $z(L^k_n)$ for all $n,k{\geq}1$.

• Kyungpook Mathematical Journal
• /
• v.59 no.1
• /
• pp.23-34
• /
• 2019

In this paper, we first define generalizations of Pell and Pell-Lucas sequences by the recurrence relations $$p_n=2ap_{n-1}+(b-a^2)p_{n-2}\;and\;q_n=2aq_{n-1}+(b-a^2)q_{n-2}$$ with initial conditions $p_0=0$, $p_1=1$, and $p_0=2$, $p_1=2a$, respectively. We give generating functions and Binet's formulas for these sequences. Also, we obtain some identities of these sequences.

• Communications of the Korean Mathematical Society
• /
• v.38 no.3
• /
• pp.695-704
• /
• 2023

Area problems for triangles and polygons whose vertices have Fibonacci numbers on a plane were presented by A. Shriki, O. Liba, and S. Edwards et al. In 2017, V. P. Johnson and C. K. Cook addressed problems of the areas of triangles and polygons whose vertices have various sequences. This paper examines the conditions of triangles and polygons whose vertices have Lucas sequences and presents a formula for their areas.

• Honam Mathematical Journal
• /
• v.45 no.4
• /
• pp.572-584
• /
• 2023

In this study, we search for Pell and Pell-Lucas numbers, which are concatenations of two repdigits and find these numbers to be only 12, 29, 70 and 14, 34, 82, respectively. We use Baker's Theory and Baker-Davenport basis reduction method while finding the solutions.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.835-838
• /
• 2008

In this paper, we present automatic face detection and tracking which is robustness in rotation and translation. Detecting a face image, we used Haar-like feature, which is fast detect facial image. Also tracking, we applied Lucas-Kanade feature tracker and KLT algorithm, which has robustness for rotated facial image. In experiment result, we confirmed that face detection and tracking which is robustness in rotation and translation.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1439-1443
• /
• 2010

For a positive integer k $\geq$ 2, the k-bonacci sequence {$g^{(k)}_n$} is defined as: $g^{(k)}_1=\cdots=g^{(k)}_{k-2}=0$, $g^{(k)}_{k-1}=g^{(k)}_k=1$ and for n > k $\geq$ 2, $g^{(k)}_n=g^{(k)}_{n-1}+g^{(k)}_{n-2}+{\cdots}+g^{(k)}_{n-k}$. And the k-Lucas sequence {$l^{(k)}_n$} is defined as $l^{(k)}_n=g^{(k)}_{n-1}+g^{(k)}_{n+k-1}$ for $n{\geq}1$. In this paper, we give a representation of nth k-Lucas $l^{(k)}_n$ by using determinant.