#### Filter Results:

- Full text PDF available (85)

#### Publication Year

1993

2017

- This year (1)
- Last 5 years (21)
- Last 10 years (45)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Stas Goferman, Lihi Zelnik-Manor, Ayellet Tal
- IEEE Transactions on Pattern Analysis and Machine…
- 2010

We propose a new type of saliency&#x2014;context-aware saliency&#x2014;which aims at detecting the image regions that represent the scene. This definition differs from previous definitions whose goal is to either identify fixation points or detect the dominant object. In accordance with our saliency definition, we present a detection algorithm which… (More)

- Ran Margolin, Ayellet Tal, Lihi Zelnik-Manor
- 2013 IEEE Conference on Computer Vision and…
- 2013

What makes an object salient? Most previous work assert that distinctness is the dominating factor. The difference between the various algorithms is in the way they compute distinctness. Some focus on the patterns, others on the colors, and several add high-level cues and priors. We propose a simple, yet powerful, algorithm that integrates these three… (More)

- Sagi Katz, Ayellet Tal
- ACM Trans. Graph.
- 2003

Cutting up a complex object into simpler sub-objects is a fundamental problem in various disciplines. In image processing, images are segmented while in computational geometry, solid polyhedra are decomposed. In recent years, in computer graphics, polygonal meshes are decomposed into sub-meshes. In this paper we propose a novel hierarchical mesh… (More)

- Thomas A. Funkhouser, Michael M. Kazhdan, +5 authors David P. Dobkin
- ACM Trans. Graph.
- 2004

In this paper, we investigate a data-driven synthesis approach to constructing 3D geometric surface models. We provide methods with which a user can search a large database of 3D meshes to find parts of interest, cut the desired parts out of the meshes with intelligent scissoring, and composite them together in different ways to form new objects. The main… (More)

- Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal
- SODA
- 2004

We introduce the <i>Bloomier filter</i>, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction generalizes the classical Bloom filter, an ingenious hashing scheme heavily used in networks and databases, whose main attribute---space efficiency---is achieved at the expense… (More)

- Sagi Katz, George Leifman, Ayellet Tal
- The Visual Computer
- 2005

Mesh segmentation has become a necessary ingredient in many applications in computer graphics. This paper proposes a novel hierarchical mesh segmentation algorithm, which is based on new methods for prominent feature point and core extraction. The algorithm has several benefits. First, it is invariant both to the pose of the model and to different… (More)

- Ran Margolin, Lihi Zelnik-Manor, Ayellet Tal
- 2014 IEEE Conference on Computer Vision and…
- 2014

The output of many algorithms in computer-vision is either non-binary maps or binary maps (e.g., salient object detection and object segmentation). Several measures have been suggested to evaluate the accuracy of these foreground maps. In this paper, we show that the most commonly-used measures for evaluating both non-binary maps and binary maps do not… (More)

- Shymon Shlafman, Ayellet Tal, Sagi Katz
- Comput. Graph. Forum
- 2002

This paper describes an algorithm for morphing polyhedral surfaces based on their decompositions into patches. The given surfaces need neither be genus-zero nor two-manifolds. We present a new algorithm for decomposing surfaces into patches. We also present a new projection scheme that handles topologically cylinder-like polyhedral surfaces. We show how… (More)

- Sagi Katz, Ayellet Tal, Ronen Basri
- ACM Trans. Graph.
- 2007

This paper proposes a simple and fast operator, the <i>"Hidden" Point Removal</i> operator, which determines the visible points in a point cloud, as viewed from a given viewpoint. Visibility is determined without reconstructing a surface or estimating normals. It is shown that extracting the points that reside on the convex hull of a transformed point… (More)

- Michael Elad, Ayellet Tal, Sigal Ar
- Eurographics Multimedia Workshop
- 2001

We examine the problem of searching a database of three dimensional objects given in VRML for objects similar to a given ob ject We introduce an algorithm which is both iterative and interactive Rather than base the search solely on geometric feature similarity we propose letting the user in uence future search results by marking some of the results of the… (More)