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

Arun Kumar 0009

dblp:30/4308-9 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
2since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 3 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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.

Computer graphics and multimedia
2 papers
Image and video processing · 82% Geometric modeling and processing · 18%

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

TopicWeightPapersLastEvidence papers
Image and video processing
motion estimation
0.011996
Optical flow: a curve evolution approach · IEEE Trans. Image Process. 1996
Image and video processing › motion estimation
optical flow
0.011996
Optical flow: a curve evolution approach · IEEE Trans. Image Process. 1996
Image and video processing › motion estimation › optical flow
variational optical flow
0.011996
Optical flow: a curve evolution approach · IEEE Trans. Image Process. 1996
Image and video processing › image segmentation
active contour
0.011995
Gradient Flows and Geometric Active Contour Models · ICCV 1995
Geometric modeling and processing › deformable models
curve evolution
0.011995
Gradient Flows and Geometric Active Contour Models · ICCV 1995

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

level set method · 0.0l1 minimization · 0.0curve evolution · 0.0riemannian metric · 0.0gradient flow · 0.0
YearPublicationVenuePosition
2026 Structured Relational Representations
Arun Kumar 0009, Paul Schrater
ICAART (3)1
2025 Curiosity as a Morphism of Interpretation
Arun Kumar 0009, Paul Schrater
CogSci1
2019 Belief dynamics extraction
Arun Kumar 0009, Zhengwei Wu, Xaq Pitkow, Paul Schrater
CogSci1
2017 Novelty Learning via Collaborative Proximity Filtering
abstract
The vast majority of recommender systems model preferences as static or slowly changing due to observable user experience. However, spontaneous changes in user preferences are ubiquitous in many domains like media consumption and key factors that drive changes in preferences are not directly observable. These latent sources of preference change pose new challenges. When systems do not track and adapt to users' tastes, users lose confidence and trust, increasing the risk of user churn. We meet these challenges by developing a model of novelty preferences that learns and tracks latent user tastes. We combine three innovations: a new measure of item similarity based on patterns of consumption co-occurrence; model for spontaneous changes in preferences; and a learning agent that tracks each user's dynamic preferences and learns individualized policies for variety. The resulting framework adaptively provides users with novelty tailored to their preferences for change per se.
Arun Kumar 0009, Paul Schrater
IUI1
1997 A Geometric Snake Model for Segmentation of Medical Imagery
abstract
In this note, we employ the new geometric active contour models formulated in [25] and [26] for edge detection and segmentation of magnetic resonance imaging (MRI), computed tomography (CT), and ultrasound medical imagery. Our method is based on defining feature-based metrics on a given image which in turn leads to a novel snake paradigm in which the feature of interest may be considered to lie at the bottom of a potential well. Thus, the snake is attracted very quickly and efficiently to the desired feature.
Anthony J. Yezzi, Satyanad Kichenassamy, Arun Kumar 0009, Peter J. Olver, Allen R. Tannenbaum
IEEE Trans. Medical Imaging3
1996 Optical flow: a curve evolution approach
abstract
A novel approach for the computation of optical flow based on an L (1) type minimization is presented. It is shown that the approach has inherent advantages since it does not smooth the flow-velocity across the edges and hence preserves edge information. A numerical approach based on computation of evolving curves is proposed for computing the optical flow field. Computations are carried out on a number of real image sequences in order to illustrate the theory as well as the numerical approach.
Arun Kumar 0009, Allen R. Tannenbaum, Gary J. Balas
IEEE Trans. Image Process.1
1995 Gradient Flows and Geometric Active Contour Models
abstract
In this paper, we analyze the geometric active contour models discussed previously from a curve evolution point of view and propose some modifications based on gradient flows relative to certain new feature-based Riemannian metrics. This leads to a novel snake paradigm in which the feature of interest may be considered to lie at the bottom of a potential well. Thus the snake is attracted very naturally and efficiently to the desired feature. Moreover, we consider some 3-D active surface models based on these ideas.>
Satyanad Kichenassamy, Arun Kumar 0009, Peter J. Olver, Allen R. Tannenbaum, Anthony J. Yezzi
ICCV2
1995 Optical flow: a curve evolution approach
abstract
A novel approach for the computation of optical flow based on an L/sup 1/ type minimization is presented. It is shown that the approach has inherent advantages since it does not smooth the flow-velocity across the edges and hence preserves edge information. A numerical approach based on computation of evolving curves is proposed for computing the optical flow field and results of experiments are presented.
Arun Kumar 0009, Allen R. Tannenbaum, Gary J. Balas
ICIP (3)1