Motion estimation is demanding field among researchers to compute independent estimation of motion at each pixel in most of general. Motion estimation generally known as optical or optic flow. In this paper, overview of some basic concepts of motion estimation, optical flow and Lucas kanade method has been provided by us. Lucas kanade method is one of the methods for optical flow measurement. I...

* Corresponding Author i Authors are with the Control and Intelligent Processing Center of Excellence, School of Electrical and Computer Engineering, University of Tehran, P.O. Box 14395/515, Tehran 14395, Iran. tel: 0098-21-82084904, fax: 0098-21-88778690, (emails: [email protected], [email protected], lucas@ ut.ac.ir) Babak N. Araabi and Caro Lucas are also with the School of Cognitive Sciences,...

Résumé. Nous présentons plusieurs théorèmes sur l’écriture des nombres entiers dans deux bases indépendantes. Nous dressons la liste complète des nombres de Fibonacci et des nombres de Lucas qui s’écrivent en binaire avec au plus quatre chiffres 1. Abstract. We discuss various results on the representation of integers in two unrelated bases. We give the complete list of all the Fibonacci number...

Many histories of the civil war and biographies of Margaret Lucas Cavendish recount the story that, in 1648, parliamentary soldiers desecrated the Lucas family tomb, scattered the remains of Cavendish’s mother and sister, and tore out the corpses’ hair to wear in their hats. Tracking down the sources of this widely repeated story, this essay examines the role of textual accounts in producing th...

The diameter of a graph is the maximum distance between pairs vertices in graph. A pair whose equal to its called diametrically opposite vertices. collection shortest paths referred as diametral paths. In this work, we enumerate number for Fibonacci cubes, Lucas cubes and alternate cubes. We present bijective proofs that show these numbers are related alternating permutations enumerated by Eule...

Javier de Lucas. Apuntes sobre una biografía intelectual

In this paper, we define bi-periodic (p,q)-Fibonacci and (p,q)-Lucas sequences, which generalize Fibonacci type, Lucas type using recurrence relations of sequences. Generating functions Binet formulas that allow us to calculate the nth terms these sequences are given convergence properties their consecutive examined. Also, prove some fundamental identities conform well-known

In the present paper, for a positive integer $r$, we study bi-periodic $r$-Fibonacci sequence and its family of companion sequences, $r$-Lucas type $s$ with $1 \leq s r$, which extend classical Fibonacci Lucas sequences. Afterwards, establish link between Furthermore, give their properties as linear recurrence relations, generating functions, explicit formulas Binet forms.

Abstract: In this paper, we investigated relationships between the Fibonacci, Lucas, Padovan numbers and 1-factors of some bipartite graphs with upper Hessenberg adjacency matrix. We calculated permanent of these upper Hessenberg matrices by contraction method and show that their permanents are equal to elements of the Fibonacci, Lucas and Padovan numbers. At the end of the paper, we give some ...