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

Dror Sholomon

dblp:135/4955 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2019
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 4 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.

Theoretical computer science
2 papers
Mathematical optimization · 100%
Artificial intelligence
1 paper
3D vision · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
combinatorial optimization
0.422014
A Generalized Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles of Complex Types · AAAI 2014
A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles · CVPR 2013
Computer vision › 3D vision
jigsaw puzzle solving
0.212014
A Generalized Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles of Complex Types · AAAI 2014
Mathematical optimization › combinatorial optimization
jigsaw puzzle solving
0.212013
A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles · CVPR 2013

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

genetic algorithm · 0.5
YearPublicationVenuePosition
2019 A novel hybrid scheme using genetic algorithms and deep learning for the reconstruction of portuguese tile panels
abstract
This paper presents a novel scheme, based on a unique combination of genetic algorithms (GAs) and deep learning (DL), for the automatic reconstruction of Portuguese tile panels, a challenging real-world variant of the jigsaw puzzle problem (JPP) with important national heritage implications. Specifically, we introduce an enhanced GA-based puzzle solver, whose integration with a novel DL-based compatibility measure (DLCM) yields state-of-the-art performance, regarding the above application. Current compatibility measures consider typically (the chromatic information of) edge pixels (between adjacent tiles), and help achieve high accuracy for the synthetic JPP variant. However, such measures exhibit rather poor performance when applied to the Portuguese tile panels, which are susceptible to various real-world effects, e.g., monochromatic panels, non-squared tiles, edge degradation, etc. To overcome such difficulties, we have developed a novel DLCM to extract high-level texture/color statistics from the entire tile information.
Daniel Rika, Dror Sholomon, Eli David, Nathan S. Netanyahu
GECCO2
2016 DNN-Buddies: A Deep Neural Network-Based Estimation Metric for the Jigsaw Puzzle Problem
Dror Sholomon, Eli David, Nathan S. Netanyahu
ICANN (2)1
2014 A Generalized Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles of Complex Types
abstract
In this paper we introduce new types of square-piece jigsaw puzzles, where in addition to the unknown location and orientation of each piece, a piece might also need to be flipped. These puzzles, which are associated with a number of real world problems, are considerably harder, from a computational standpoint. Specifically, we present a novel generalized genetic algorithm (GA)-based solver that can handle puzzle pieces of unknown location and orientation (Type 2 puzzles) and (two-sided) puzzle pieces of unknown location, orientation, and face (Type 4 puzzles). To the best of our knowledge, our solver provides a new state-of-the-art, solving previously attempted puzzles faster and far more accurately, handling puzzle sizes that have never been attempted before, and assembling the newly introduced two-sided puzzles automatically and effectively. This paper also presents, among other results, the most extensive set of experimental results, compiled as of yet, on Type 2 puzzles.
Dror Sholomon, Eli David, Nathan S. Netanyahu
AAAI1
2014 Genetic algorithm-based solver for very large multiple jigsaw puzzles of unknown dimensions and piece orientation
abstract
In this paper we propose the first genetic algorithm (GA)-based solver for jigsaw puzzles of unknown puzzle dimensions and unknown piece location and orientation. Our solver uses a novel crossover technique, and sets a new state-of-the-art in terms of the puzzle sizes solved and the accuracy obtained. The results are significantly improved, even when compared to previous solvers assuming known puzzle dimensions. Moreover, the solver successfully contends with a mixed bag of multiple puzzle pieces, assembling simultaneously all puzzles.
Dror Sholomon, Eli David, Nathan S. Netanyahu
GECCO1
2013 A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles
abstract
In this paper we propose the first effective automated, genetic algorithm (GA)-based jigsaw puzzle solver. We introduce a novel procedure of merging two "parent" solutions to an improved "child" solution by detecting, extracting, and combining correctly assembled puzzle segments. The solver proposed exhibits state-of-the-art performance solving previously attempted puzzles faster and far more accurately, and also puzzles of size never before attempted. Other contributions include the creation of a benchmark of large images, previously unavailable. We share the data sets and all of our results for future testing and comparative evaluation of jigsaw puzzle solvers.
Dror Sholomon, Eli David, Nathan S. Netanyahu
CVPR1