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

Dmitriy Bespalov

dblp:35/2058 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
0since 2021 · last 2012
0000-0003-3119-8710ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 4 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1

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 · 50% Geometric modeling and processing · 50%

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

TopicWeightPapersLastEvidence papers
Image and video processing › feature extraction
local feature extraction
0.112006
Local feature extraction and matching partial objects · Comput. Aided Des. 2006
Geometric modeling and processing › shape matching
partial shape matching
0.112006
Local feature extraction and matching partial objects · Comput. Aided Des. 2006
YearPublicationVenuePosition
2012 Large-scale image classification using supervised spatial encoder
Dmitriy Bespalov, Yanjun Qi, Ali Shokoufandeh
ICPR1
2012 Sentiment Classification with Supervised Sequence Embedding
Dmitriy Bespalov, Yanjun Qi, Ali Shokoufandeh
ECML/PKDD (1)1
2011 Sentiment classification based on supervised latent n-gram analysis
abstract
In this paper, we propose an efficient embedding for modeling higher-order (n-gram) phrases that projects the n-grams to low-dimensional latent semantic space, where a classification function can be defined. We utilize a deep neural network to build a unified discriminative framework that allows for estimating the parameters of the latent space as well as the classification function with a bias for the target classification task at hand. We apply the framework to large-scale sentimental classification task. We present comparative evaluation of the proposed method on two (large) benchmark data sets for online product reviews. The proposed method achieves superior performance in comparison to the state of the art.
Dmitriy Bespalov, Yanjun Qi, Ali Shokoufandeh
CIKM1
2010 Geometric Total Variation for Texture Deformation
abstract
In this work we propose a novel variational method that we intend to use for estimating non-rigid texture deformation. The method is able to capture variation in gray scale images with respect to the geometry of its features. Accurate localization of features in the presence of unknown deformations is a crucial property for texture characterization. Our experimental evaluations demonstrate that accounting for geometry of features in texture images leads to significant improvements in localization of these features, when textures undergo geometrical transformations. In addition, feature descriptors using geometrical total variation energies discriminate between various regular textures with accuracy comparable to SIFT descriptors, while reduced dimensionality of TVG descriptor yields significant improvements over SIFT in terms of retrieval time.
Dmitriy Bespalov, Anders Bjorholm Dahl, Ali Shokoufandeh
ICPR1
2008 On evaluating the efficiency of software feature development using algebraic manifolds
abstract
Managers are often unable to explain objectively why or when effort was misplaced during the development process. In this paper, we present a formal technique to depict the expended effort during the life-cycle of a software feature using feature development manifolds (FDMs). Using the FDMs we can compute the preferred development path for a given feature. This development path includes the versions of a software feature that contributed to the final version of the feature in a positive way. The preferred development path excludes versions of the software feature that should have been skipped. Once the preferred development path is computed the amount of wasted effort can be quantified using the metric that we have developed. We demonstrate the effectiveness of our approach to compute wasted software feature development by applying our technique to two large open source software systems, Gaim and Firefox.
Jay Kothari, Dmitriy Bespalov, Spiros Mancoridis, Ali Shokoufandeh
ICSM2
2006 Local feature extraction and matching partial objects
Dmitriy Bespalov, William C. Regli, Ali Shokoufandeh
Comput. Aided Des.1
2005 Benchmarking CAD search techniques
abstract
While benchmark datasets have been proposed for testing computer vision and 3D shape retrieval algorithms, no such datasets have yet been put forward to assess the relevance of these techniques for engineering problems. This paper presents several distinctive benchmark datasets for evaluating techniques for automated classification and retrieval of CAD objects. These datasets include (1) a dataset of CAD primitives (such as those common in constructive solid geometry modeling); (2) two datasets consisting of classes generated by minor topological variation; (3) two datasets of industrial CAD models classified based on object function and manufacturing process, respectively; (4) and a dataset of LEGO© models from the Mindstorms© robotics kits. Each model in the datasets is available in three formats - ACIS SAT, ISO STEP, and as a VRML mesh (some models are available under several different fidelity settings). These are all available through the National Design Repository.Using these datasets, we present comprehensive empirical results for nińe (9) different shape and solid model matching and retrieval techniques. These experiments show, as expected, that the quality of precision-recall performance can significantly vary on different datasets. These experiments reveal that for certain object classes and classifications, such as those based on manufacturing processes, all existing techniques perform poorly. This study reveals the strengths and weaknesses of existing research in these areas, introduces open challenge problems, and provides meaningful datasets and metrics against which the success of current and future work can be measured.
Dmitriy Bespalov, Cheuk Yiu Ip, William C. Regli, Joshua Shaffer
Symposium on Solid and Physical Modeling1