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

Hanit Hakim

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

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

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
Visual content generation and editing · 50% Image and video processing · 50%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge graph
knowledge graph construction
0.912025
Finding your MUSE: Mining Unexpected Solutions Engine · EMNLP 2025
Visual content generation and editing › image animation
cinemagraph generation
0.512021
Endless loops: detecting and animating periodic patterns in still images · ACM Trans. Graph. 2021
Image and video processing
image warping
0.512021
Endless loops: detecting and animating periodic patterns in still images · ACM Trans. Graph. 2021

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

user study · 1.7temporal smoothing · 0.5displacement field estimation · 0.5
YearPublicationVenuePosition
2025 Finding your MUSE: Mining Unexpected Solutions Engine
abstract
Innovators often exhibit cognitive fixation on existing solutions or nascent ideas, hindering the exploration of novel alternatives.This paper introduces a methodology for constructing Functional Concept Graphs (FCGs), interconnected representations of functional elements that support abstraction, problem reframing, and analogical inspiration.Our approach yields large-scale, high-quality FCGs with explicit abstraction relations, overcoming limitations of prior work.We further present MUSE, an algorithm leveraging FCGs to generate creative inspirations for a given problem.We demonstrate our method by computing an FCG on 500K patents, which we release for further research.A user study indicates that participants exposed to MUSE's inspirations generated more creative ideas, both in terms of absolute number (up to 19% increase over participants not given inspirations) and ratio (75%, compared to 49% for no inspirations).
Nir Sweed, Hanit Hakim, Ben Wolfson, Hila Lifshitz, Dafna Shahaf
EMNLP2
2021 Endless loops: detecting and animating periodic patterns in still images
abstract
We present an algorithm for producing a seamless animated loop from a single image. The algorithm detects periodic structures, such as the windows of a building or the steps of a staircase, and generates a non-trivial displacement vector field that maps each segment of the structure onto a neighboring segment along a user- or auto-selected main direction of motion. This displacement field is used, together with suitable temporal and spatial smoothing, to warp the image and produce the frames of a continuous animation loop. Our cinemagraphs are created in under a second on a mobile device. Over 140,000 users downloaded our app and exported over 350,000 cinemagraphs. Moreover, we conducted two user studies that show that users prefer our method for creating surreal and structured cinemagraphs compared to more manual approaches and compared to previous methods.
Tavi Halperin, Hanit Hakim, Orestis Vantzos, Gershon Hochman, Netai Benaim, Lior Sassy, Michael Kupchik, Ofir Bibi, Ohad Fried
ACM Trans. Graph.2