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

Vivek Kaul

dblp:07/8938 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2014
0000-0002-7978-7517ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › pattern detection
curve detection
0.112012
Detecting Curves with Unknown Endpoints and Arbitrary Topology Using Minimal Paths · IEEE Trans. Pattern Anal. Mach. Intell. 2012

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

minimal path algorithm · 0.1
YearPublicationVenuePosition
2014 Erratum to "Detecting Curves with Unknown Endpoints and Arbitary Topology Using Minimal Paths"
abstract
The authors of "Detecting Curves with Unknown Endpoints and Arbitrary Topology Using Minimal Paths" which appeared in the October 2012 issue of this journal point out and correct an error that occurred in equation (14) of the paper.
Vivek Kaul, Anthony J. Yezzi, Yichang James Tsai
IEEE Trans. Pattern Anal. Mach. Intell.1
2012 Detecting Curves with Unknown Endpoints and Arbitrary Topology Using Minimal Paths
abstract
Existing state-of-the-art minimal path techniques work well to extract simple open curves in images when both endpoints of the curve are given as user input or when one input is given and the total length of the curve is known in advance. Curves which branch require even further prior input from the user, namely, each branch endpoint. In this work, we present a novel minimal path-based algorithm which works on much more general curve topologies with far fewer demands on the user for initial input compared to prior minimal path-based algorithms. The two key novelties and benefits of this new approach are that 1) it may be used to detect both open and closed curves, including more complex topologies containing both multiple branch points and multiple closed cycles without requiring a priori knowledge about which of these types is to be extracted, and 2) it requires only a single input point which, in contrast to existing methods, is no longer constrained to be an endpoint of the desired curve but may in fact be ANY point along the desired curve (even an internal point). We perform quantitative evaluation of the algorithm on 48 images (44 pavement crack images, 1 catheter tube image, and 3 retinal images) against human supplied ground truth. The results demonstrate that the algorithm is indeed able to extract curve-like objects accurately from images with far less prior knowledge and less user interaction compared to existing state-of-the-art minimal path-based image processing algorithms. In the future, the algorithm can be applied to other 2D curve-like objects and it can be extended to detect 3D curves.
Vivek Kaul, Anthony J. Yezzi, Yichang James Tsai
IEEE Trans. Pattern Anal. Mach. Intell.1
2010 Detection of Curves with Unknown Endpoints using Minimal Path Techniques
abstract
©2010. The copyright of this document resides with its authors. It may be distributed unchanged freely in print or electronic forms.
Vivek Kaul, Yichang James Tsai, Anthony J. Yezzi
BMVC1