نتایج جستجو برای: minimum face

تعداد نتایج: 326439  

2013
Hidetoshi NONAKA

Vertex coloring of a graph is the assignment of labels to the vertices of the graph so that adjacent vertices have different labels. In the case of polyhedral graphs, the chromatic number is 2, 3, or 4. Edge coloring problem and face coloring problem can be converted to vertex coloring problem for appropriate polyhedral graphs. We have been developed an interactive learning system of polyhedra,...

2013
Syed Hasan Ian Sheldon

In this paper constraints on technology choice and credit access are introduced into the Melitz (2003) model in a dynamic setting in order to explain the factors that limit the benefits to a firm from trade liberalization. Theoretical analysis shows that firms face credit constraints depending on their initial productivity and the cost of the credit. As a result, credit constrained firms may ne...

1998
Arno Schödl Antonio Haro Irfan A. Essa

We describe the use of a three-dimensional textured model of the human head under perspective projection to track a person’s face. The system is hand-initialized by projecting an image of the face onto a polygonal head model. Tracking is achieved by finding the six translation and rotation parameters to register the rendered images of the textured model with the video images. We find the parame...

2014
Ayan Seal Suranjan Ganguly Debotosh Bhattacharjee Mita Nasipuri Consuelo Gonzalo-Martín

This paper presents an algorithm for feature selection based on particle swarm optimization (PSO) for thermal face recognition. The total algorithm goes through many steps. In the very first step, thermal human face image is preprocessed and cropping of the facial region from the entire image is done. In the next step, scale invariant feature transform (SIFT) is used to extract the features fro...

1999
Daniel Câmara Mario Fernando Montenegro Campos

The main goal of this paper is to describe a method of image description in VRML, using a device for tridimensional image acquisition. The information obtained from the capture of each object face is organized and a description of the scanned object is made in VRML format. This paper presents a study of the minimum number of captures necessary to get the complete description of the object, show...

2004
Jim Rehg

In this project you will explore the use of Principle Component Analysis (PCA) and Probabilistic PCA (PPCA). PPCA is closely-related to factor analysis, which is described in chapter 14 of your text. Our application is face recognition, following on the work of Moghadden and Pentland. A minimum version of this project would involve reading chapter 14 and conducting a face recognition experiment...

2008
Hung-Hsuan Huang Aleksandra Cerekovic Igor S. Pandzic Yukiko Nakano Toyoaki Nishida

Embodied Conversational Agents (ECAs) are computer generated humanlike characters that interact with human users in face-to-face conversations. ECA is a powerful tool in representing the differences in cultural aspects and suitable for interactive training or edutainment systems. This paper presents the preliminary results of the development of a culture adaptive virtual tour guide agent for se...

2004
Ali Arya Babak Hamidzadeh

This paper proposes a simple yet effective 2D image transformation method for face animation. Instead of using complicated 3D models or a large database of 2D images, a set of transformations are learned to create different visual effects in a given image, including talking, changing facial expressions, and head movement. This approach enables creation of realistic images with minimum input dat...

2002
Bo Cao Shiguang Shan Wen Gao Debin Zhao

In this paper, a novel approach to localize human iris centers in facial images is proposed. From the estimated nose center of the detected face, the proposed method searches for the possible iris edge by gradually growing a rectangle, and then localizes the iris center in an expected region by searching for the pixel, which has the minimum average intensity. Experimental results show that this...

Journal: :Discrete Mathematics & Theoretical Computer Science 2013
Aijun Dong Guizhen Liu Guojun Li

The terminology and notation used but undefined in this paper can be found in [1]. Let G be a graph and we use V (G), E(G), F (G), ∆(G) and δ(G) to denote the vertex set, edge set, face set, maximum degree, and minimum degree of G, respectively. Let dG(x) or simply d(x), denote the degree of a vertex (resp. face) x in G. A vertex (resp. face) x is called a k-vertex (resp. k-face), k-vertex (res...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید