scispace - formally typeset
Search or ask a question
Author

Yosi Keller

Bio: Yosi Keller is an academic researcher from Bar-Ilan University. The author has contributed to research in topics: Image registration & Motion estimation. The author has an hindex of 26, co-authored 79 publications receiving 2902 citations. Previous affiliations of Yosi Keller include Technion – Israel Institute of Technology & Tel Aviv University.


Papers
More filters
Proceedings ArticleDOI
01 Oct 2019
TL;DR: A novel recurrent neural network (RNN)-based approach for face reenactment which adjusts for both pose and expression variations and can be applied to a single image or a video sequence and uses a novel Poisson blending loss which combines Poisson optimization with perceptual loss.
Abstract: We present Face Swapping GAN (FSGAN) for face swapping and reenactment. Unlike previous work, FSGAN is subject agnostic and can be applied to pairs of faces without requiring training on those faces. To this end, we describe a number of technical contributions. We derive a novel recurrent neural network (RNN)-based approach for face reenactment which adjusts for both pose and expression variations and can be applied to a single image or a video sequence. For video sequences, we introduce continuous interpolation of the face views based on reenactment, Delaunay Triangulation, and barycentric coordinates. Occluded face regions are handled by a face completion network. Finally, we use a face blending network for seamless blending of the two faces while preserving target skin color and lighting conditions. This network uses a novel Poisson blending loss which combines Poisson optimization with perceptual loss. We compare our approach to existing state-of-the-art systems and show our results to be both qualitatively and quantitatively superior.

430 citations

Journal ArticleDOI
TL;DR: This paper presents the Laplace-Beltrami approach for computing density invariant embeddings which are essential for integrating different sources of data and describes a refinement of the Nystrom extension algorithm called "geometric harmonics."
Abstract: Data fusion and multicue data matching are fundamental tasks of high-dimensional data analysis. In this paper, we apply the recently introduced diffusion framework to address these tasks. Our contribution is three-fold: first, we present the Laplace-Beltrami approach for computing density invariant embeddings which are essential for integrating different sources of data. Second, we describe a refinement of the Nystrom extension algorithm called "geometric harmonics." We also explain how to use this tool for data assimilation. Finally, we introduce a multicue data matching scheme based on nonlinear spectral graphs alignment. The effectiveness of the presented schemes is validated by applying it to the problems of lipreading and image sequence alignment

351 citations

Patent
20 May 2010
TL;DR: In this paper, a method for inferring/estimating missing values in a data matrix d(q, r) having a plurality of rows and columns comprises the steps of: organizing the columns of the data matrix D(q and r) into affinity folders of columns with similar data profile.
Abstract: The present invention is directed to a method for inferring/estimating missing values in a data matrix d(q, r) having a plurality of rows and columns comprises the steps of: organizing the columns of the data matrix d(q, r) into affinity folders of columns with similar data profile, organizing the rows of the data matrix d(q, r) into affinity folders of rows with similar data profile, forming a graph Q of augmented rows and a graph R of augmented columns by similarity or correlation of common entries; and expanding the data matrix d(q, r) in terms of an orthogonal basis of a graph Q×R to infer/estimate the missing values in said data matrix d(q, r).on the diffusion geometry coordinates.

280 citations

Journal ArticleDOI
TL;DR: This paper proposes an intrinsic scale detection scheme per interest point and utilizes it to derive two scale-invariant local features for mesh models that were experimentally shown to be robust to scale changes and partial mesh matching, and they were compared favorably with other local mesh features on the SHREC'10 andSHREC'11 testbeds.
Abstract: In this paper, we present a framework for detecting interest points in 3-D meshes and computing their corresponding descriptors. For that, we propose an intrinsic scale detection scheme per interest point and utilize it to derive two scale-invariant local features for mesh models. First, we present the scale-invariant spin image local descriptor that is a scale-invariant formulation of the spin image descriptor. Second, we adapt the scale-invariant feature transform feature to mesh data by representing the vicinity of each interest point as a depth map and estimating its dominant angle using the principal component analysis to achieve rotation invariance. The proposed features were experimentally shown to be robust to scale changes and partial mesh matching, and they were compared favorably with other local mesh features on the SHREC'10 and SHREC'11 testbeds. We applied the proposed local features to mesh retrieval using the bag-of-features approach and achieved state-of-the-art retrieval accuracy. Last, we applied the proposed local features to register models to scanned depth scenes and achieved high registration accuracy.

172 citations

Proceedings ArticleDOI
10 Apr 2011
TL;DR: A benchmark that simulates the feature detection and description stages of feature-based shape retrieval algorithms under a wide variety of transformations is presented.
Abstract: Feature-based approaches have recently become very popular in computer vision and image analysis applications, and are becoming a promising direction in shape retrieval. SHREC'11 robust feature detection and description benchmark simulates the feature detection and description stages of feature-based shape retrieval algorithms. The benchmark tests the performance of shape feature detectors and descriptors under a wide variety of transformations. The benchmark allows evaluating how algorithms cope with certain classes of transformations and strength of the transformations that can be dealt with. The present paper is a report of the SHREC'11 robust feature detection and description benchmark results

169 citations


Cited by
More filters
01 Jan 2016
TL;DR: The table of integrals series and products is universally compatible with any devices to read and is available in the book collection an online access to it is set as public so you can get it instantly.
Abstract: Thank you very much for downloading table of integrals series and products. Maybe you have knowledge that, people have look hundreds times for their chosen books like this table of integrals series and products, but end up in harmful downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they cope with some harmful virus inside their laptop. table of integrals series and products is available in our book collection an online access to it is set as public so you can get it instantly. Our book servers saves in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Merely said, the table of integrals series and products is universally compatible with any devices to read.

4,085 citations

01 Jan 2006

3,012 citations

Patent
11 Jan 2011
TL;DR: In this article, an intelligent automated assistant system engages with the user in an integrated, conversational manner using natural language dialog, and invokes external services when appropriate to obtain information or perform various actions.
Abstract: An intelligent automated assistant system engages with the user in an integrated, conversational manner using natural language dialog, and invokes external services when appropriate to obtain information or perform various actions. The system can be implemented using any of a number of different platforms, such as the web, email, smartphone, and the like, or any combination thereof. In one embodiment, the system is based on sets of interrelated domains and tasks, and employs additional functionally powered by external services with which the system can interact.

1,462 citations

Journal ArticleDOI
TL;DR: This article uses multiscale diffusion heat kernels as “geometric words” to construct compact and informative shape descriptors by means of the “bag of features” approach, and shows that shapes can be efficiently represented as binary codes.
Abstract: The computer vision and pattern recognition communities have recently witnessed a surge of feature-based methods in object recognition and image retrieval applications. These methods allow representing images as collections of “visual words” and treat them using text search approaches following the “bag of features” paradigm. In this article, we explore analogous approaches in the 3D world applied to the problem of nonrigid shape retrieval in large databases. Using multiscale diffusion heat kernels as “geometric words,” we construct compact and informative shape descriptors by means of the “bag of features” approach. We also show that considering pairs of “geometric words” (“geometric expressions”) allows creating spatially sensitive bags of features with better discriminative power. Finally, adopting metric learning approaches, we show that shapes can be efficiently represented as binary codes. Our approach achieves state-of-the-art results on the SHREC 2010 large-scale shape retrieval benchmark.

894 citations