Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nava Rubin

dblp:68/4954 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3Artificial intelligence and machine learning · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Segmentation and scene understanding · 38% Probabilistic and Bayesian machine learning · 33% 3D vision · 29%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
markov random field
0.011999
Measuring Convexity for Figure/Ground Separation · ICCV 1999
Image and video processing › image segmentation › object segmentation
figure-ground separation
0.011999
Measuring Convexity for Figure/Ground Separation · ICCV 1999
Computer vision › 3D vision › 3d scene understanding › amodal perception
amodal completion
0.011998
Salient and Multiple Illusory Surfaces · CVPR 1998
Computer vision › Segmentation and scene understanding › image segmentation › binary segmentation
foreground-background segmentation
0.011998
Salient and Multiple Illusory Surfaces · CVPR 1998

Methods — techniques the papers use, named apart from their topics

random walk · 0.0diffusion process · 0.0surface ordering · 0.0edge and junction detection · 0.0
YearPublicationVenuePosition
1999 Measuring Convexity for Figure/Ground Separation
abstract
In human perception, convex surfaces have a strong tendency to be perceived as the "figure". Convexity has a stronger influence on figural organization than other global shape properties, such as symmetry (G. Kanizsa, 1979), and yet there has been very little work on convexity properties in computer vision. We present a model for figure/ground segregation which exhibits a preference for convex regions as the figure (i.e., the foreground). The model also shows a preference for smaller regions to be selected as figures, which is also known to hold for human visual perception (K. Koffka, 1935). The model is based on the machinery of Markov random fields/random walks/diffusion processes, so that the global shape properties are obtained via local and stochastic computations. Experimental results demonstrate that our model performs well on ambiguous figure/ground displays which were not captured before. In particular in ambiguous displays where neither region is strictly convex, the model shows preference to the "more convex" region, thus offering a continuous measure of convexity in agreement with human perception.
Hsing-Kuo Kenneth Pao, Davi Geiger, Nava Rubin
ICCV3
1999 The Shape of Illusory Figures
abstract
We have been developing a stochastic model for figure-ground separation. The model selects/constructs the foreground with preference for figures with “more convex” shapes. When these models are applied to illusory figures they yield perceptually accurate selection of figure and background. The approach is based on an “entropy” measure of a region diffusion Markov model from a set of local figure/ground hypothesis. The contour boundaries are implicitly represented, via the thresholding of the diffusion result. What optimal properties do the illusory contours satisfies? We show that the entropy criteria selects contours such as to minimize a Taylor series of the even derivatives with respect to the length of the contour. The coefficients are positive and they get exponentially smaller as the derivatives increase. The zeroth order term suggest that small length contours are preferred, the second order terms suggests that curvature-like term is minimized (with less strength compared to the zero order one), and higher order derivatives give additional contour smoothness constraints.
Davi Geiger, Krishnan Kumaran, Hsing-Kuo Kenneth Pao, Nava Rubin
ICIP (2)4
1998 Salient and Multiple Illusory Surfaces
abstract
All illusory surface figures yield a perception of a surface occluding another one or the background. Occluded surfaces yield completion, a phenomena known as amodal completions. It is intriguing that for some images illusory surfaces are perceived, but not for other images. Also, illusory surfaces may have portions occlude. We aim to understand these phenomena. Our approach detects intensity edges and junctions. From the junctions we seek to find an optimal image organization, i.e., multiple ordered surfaces with the ordering accounting for salience. The most salient being the figure, while the other surfaces are classified as background. A decision of which surface is the visible one (on rep) is made locally, at each pixel, allowing the salient surface (figure) to have portions occluded, i.e., with amodal completions. We account for a variety of imagery not explained before.
Davi Geiger, Hsing-Kuo Kenneth Pao, Nava Rubin
CVPR3