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.

Sameer Shirdhonkar

dblp:17/6876 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Computer graphics and multimedia
2 papers
Computational photography and imaging · 41% Rendering · 41% Image and video coding · 18%
Theoretical computer science
1 paper
Approximation and online algorithms · 100%
Artificial intelligence
1 paper
Image recognition and object detection · 77% 3D vision · 23%

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

TopicWeightPapersLastEvidence papers
Information retrieval › similarity measure
histogram dissimilarity
0.112008
Approximate earth mover's distance in linear time · CVPR 2008
Information retrieval
retrieval models
0.112008
Approximate earth mover's distance in linear time · CVPR 2008
Approximation and online algorithms
approximation algorithms
0.112008
Approximate earth mover's distance in linear time · CVPR 2008
Computer vision › Image recognition and object detection
object recognition
0.112005
Non-Negative Lighting and Specular Object Recognition · ICCV 2005
Computational photography and imaging
illumination estimation
0.112005
Non-Negative Lighting and Specular Object Recognition · ICCV 2005
Rendering › lighting
spherical harmonic lighting
0.112005
Non-Negative Lighting and Specular Object Recognition · ICCV 2005
Image and video coding › image quality assessment
perceptual similarity
0.012008
Approximate earth mover's distance in linear time · CVPR 2008
Computer vision › 3D vision › shape matching
3d model alignment
0.012005
Non-Negative Lighting and Specular Object Recognition · ICCV 2005

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

wavelet transform · 0.2kantorovich-rubinstein duality · 0.2szego eigenvalue distribution theorem · 0.1semidefinite programming · 0.1
YearPublicationVenuePosition
2008 Approximate earth mover's distance in linear time
abstract
The earth moverpsilas distance (EMD) is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3logN)) computational complexity. We present a novel linear time algorithm for approximating the EMD for low dimensional histograms using the sum of absolute values of the weighted wavelet coefficients of the difference histogram. EMD computation is a special case of the Kantorovich-Rubinstein transshipment problem, and we exploit the Holder continuity constraint in its dual form to convert it into a simple optimization problem with an explicit solution in the wavelet domain. We prove that the resulting wavelet EMD metric is equivalent to EMD, i.e. the ratio of the two is bounded. We also provide estimates for the bounds. The weighted wavelet transform can be computed in time linear in the number of histogram bins, while the comparison is about as fast as for normal Euclidean distance or chi2statistic. We experimentally show that wavelet EMD is a good approximation to EMD, has similar performance, but requires much less computation.
Sameer Shirdhonkar, David Jacobs 0001
CVPR1
2005 Non-Negative Lighting and Specular Object Recognition
abstract
Recognition of specular objects is particularly difficult because their appearance is much more sensitive to lighting changes than that of Lambertian objects. We consider an approach in which we use a 3D model to deduce the lighting that best matches the model to the image. In this case, an important constraint is that incident lighting should be non-negative everywhere. In this paper, we propose a new method to enforce this constraint and explore its usefulness in specular object recognition, using the spherical harmonic representation of lighting. The method follows from a novel extension of Szego's eigenvalue distribution theorem to spherical harmonics, and uses semidefinite programming to perform a constrained optimization. The new method is faster as well as more accurate than previous methods. Experiments on both synthetic and real data indicate that the constraint can improve recognition of specular objects by better separating the correct and incorrect models
Sameer Shirdhonkar, David Jacobs 0001
ICCV1