Search For:

Displaying 1-21 out of 21 total
A Probabilistic Approach to Pattern Matching in the Continuous Domain
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Daniel Keren,Michael Werman,Joshua Feinberg
Issue Date:October 2012
pp. 1873-1885
The goal of this paper is to solve the following basic problem: Given discrete noisy samples from a continuous signal, compute the probability distribution of its distance from a fixed template. As opposed to the typical restoration problem, which consider...
 
Shape Sensitive Geometric Monitoring
Found in: IEEE Transactions on Knowledge and Data Engineering
By Daniel Keren,Izchak Sharfman,Assaf Schuster,Avishay Livne
Issue Date:August 2012
pp. 1520-1535
An important problem in distributed, dynamic databases is to continuously monitor the value of a function defined on the nodes, and check that it satisfies some threshold constraint. We introduce a monitoring method, based on a geometric interpretation of ...
 
Applying Property Testing to an Image Partitioning Problem
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Igor Kleiner, Daniel Keren, Ilan Newman, Oren Ben-Zwi
Issue Date:February 2011
pp. 256-265
Property testing is a rapidly growing field of research. Typically, a property testing algorithm proceeds by quickly determining whether an input can satisfy some condition, under the assumption that most inputs do not satisfy it. If the input is
 
Applying Two-Pixel Features to Face Detection
Found in: Signal-Image Technologies and Internet-Based System, International IEEE Conference on
By Ido Nissenboim, Daniel Keren, Michael Werman
Issue Date:December 2008
pp. 65-69
We propose a
 
Aggregate Threshold Queries in Sensor Networks
Found in: Parallel and Distributed Processing Symposium, International
By Izchak Sharfman, Assaf Schuster, Daniel Keren
Issue Date:March 2007
pp. 107
An important class of queries over sensor networks are network-wide aggregation queries. In this work we study a class of aggregation queries which we refer to as aggregate threshold queries. The goal of an aggregate threshold query is to continuously moni...
 
Incorporating the Boltzmann Prior in Object Detection Using SVM
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Margarita Osadchy, Daniel Keren
Issue Date:June 2006
pp. 2095-2101
In this paper we discuss object detection when only a small number of training examples are given. Specifically, we show how to incorporate a simple prior on the distribution of natural images into support vector machines. SVMs are known to be robust to ov...
 
Hierarchical Decision Tree Induction in Distributed Genomic Databases
Found in: IEEE Transactions on Knowledge and Data Engineering
By Amir Bar-Or, Daniel Keren, Assaf Schuster, Ran Wolff
Issue Date:August 2005
pp. 1138-1151
Classification based on decision trees is one of the important problems in data mining and has applications in many fields. In recent years, database systems have become highly distributed, and distributed system paradigms, such as federated and peer-to-pe...
 
Topologically Faithful Fitting of Simple Closed Curves
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Daniel Keren
Issue Date:January 2004
pp. 118-123
<p><b>Abstract</b>—Implicit representations of curves have certain advantages over explicit representation, one of them being the ability to determine with ease whether a point is inside or outside the curve (<it>inside-outside func...
 
Recovery of Epipolar Geometry as a Manifold Fitting Problem
Found in: Computer Vision, IEEE International Conference on
By Liran Goshen, Ilan Shimshoni, P. Anandan, Daniel Keren
Issue Date:October 2003
pp. 1321
The introduction of the joint image manifold allows to treat the problem of recovering camera motion and epipolar geometry as the problem of fitting a manifold to the data measured in a stereo pair. The manifold has a singularity and boundary, therefore ca...
 
Painter Identification Using Local Features and Naive Bayes
Found in: Pattern Recognition, International Conference on
By Daniel Keren
Issue Date:August 2002
pp. 20474
<p>The goal of this paper is to offer a framework for image classification
 
Anti-Sequences: Event Detection by Frame Stacking
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Margarita Osadchy, Daniel Keren, Yaniv Gal
Issue Date:December 2001
pp. 46
This paper presents a natural extension of the newly introduced
 
Antifaces: A Novel, Fast Method for Image Detection
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Daniel Keren, Margarita Osadchy, Craig Gotsman
Issue Date:July 2001
pp. 747-761
<p><b>Abstract</b>—This paper offers a novel detection method, which works well even in the case of a complicated image collection—for instance, a frontal face under a large class of linear transformations. It is also successfully applied...
 
A Bayesian Method for Fitting Parametric and Nonparametric Models to Noisy Data
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Michael Werman, Daniel Keren
Issue Date:May 2001
pp. 528-534
<p><b>Abstract</b>—We present a simple paradigm for fitting models, parametric and nonparametric, to noisy data, which resolves some of the problems associated with classical MSE algorithms. This is done by considering each point on the m...
 
A Novel Bayesian Method for Fitting Parametric and Non-Parametric Models to Noisy Data
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Michael Werman, Daniel Keren
Issue Date:June 1999
pp. 2552
We offer a simple paradigm for fitting models, parametric and non-parametric, to noisy data, which resolves some of the problems associated with classic MSE algorithms. This is done by considering each point on the model as a possible source for each data ...
 
Fitting Curves and Surfaces With Constrained Implicit Polynomials
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Daniel Keren, Craig Gotsman
Issue Date:January 1999
pp. 31-41
<p><b>Abstract</b>—A problem which often arises while fitting implicit polynomials to 2D and 3D data sets is the following: Although the data set is simple, the fit exhibits undesired phenomena, such as loops, holes, extraneous components...
 
Practical Reliable Bayesian Recognition of 2D and 3D Objects Using Implicit Polynomials and Algebraic Invariants
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Jayashree Subrahmonia, David B. Cooper, Daniel Keren
Issue Date:May 1996
pp. 505-519
<p><b>Abstract</b>—Patches of quadric curves and surfaces such as spheres, planes, and cylinders have found widespread use in modeling and recognition of objects of interest in computer vision. In this paper, we treat use of more complex ...
 
Image Detection Under Varying Illumination and Pose
Found in: Computer Vision, IEEE International Conference on
By Margarita Osadchy, Daniel Keren
Issue Date:July 2001
pp. 668
This paper focuses on the detection of objects with Lambertian surface under both varying illumination and pose. We offer to apply a novel detection method that proceeds by modeling the different illuminations from a small number of images in the training ...
 
Planar shape interpolation with bounded distortion
Found in: ACM Transactions on Graphics (TOG)
By Daniel Keren, Mirela Ben-Chen, Ofir Weber, Renjie Chen
Issue Date:July 2013
pp. 1-12
Planar shape interpolation is widely used in computer graphics applications. Despite a wealth of interpolation methods, there is currently no approach that produces shapes with a bounded amount of distortion with respect to the input. As a result, existing...
     
Shape sensitive geometric monitoring
Found in: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (PODS '08)
By Assaf Schuster, Daniel Keren, Izchak Sharfman
Issue Date:June 2008
pp. 1-1
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in a communication efficient manner. Specifically, we assume that each node hold...
     
A geometric approach to monitoring threshold functions over distributed data streams
Found in: ACM Transactions on Database Systems (TODS)
By Assaf Schuster, Daniel Keren, Izchak Sharfman
Issue Date:November 2007
pp. 23-es
Monitoring data streams in a distributed system is the focus of much research in recent years. Most of the proposed schemes, however, deal with monitoring simple aggregated values, such as the frequency of appearance of items in the streams. More involved ...
     
A geometric approach to monitoring threshold functions over distributed data streams
Found in: Proceedings of the 2006 ACM SIGMOD international conference on Management of data (SIGMOD '06)
By Assaf Schuster, Daniel Keren, Izchak Sharfman
Issue Date:June 2006
pp. 301-312
Monitoring data streams in a distributed system is the focus of much research in recent years. Most of the proposed schemes, however, deal with monitoring simple aggregated values, such as the frequency of appearance of items in the streams. More involved ...
     
 1