Matan Rusanovsky

dblp:244/4790 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
3since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1Security and privacy · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.

Artificial intelligence
2 papers
3D vision · 50% Generative modeling · 25% Vision and language · 25%
Network and information security
1 paper
Security and privacy of machine learning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 50% Storage systems · 50%
Theoretical computer science
1 paper
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › object pose estimation
category-agnostic pose estimation
0.912025
CapeX: Category-Agnostic Pose Estimation from Textual Point Explanation · ICLR 2025
Machine learning › Generative modeling
diffusion model
0.912025
Memories of Forgotten Concepts · CVPR 2025
Computer vision › 3D vision
pose estimation
0.912025
CapeX: Category-Agnostic Pose Estimation from Textual Point Explanation · ICLR 2025
Storage systems
crash recovery
0.412020
Upper and Lower Bounds on the Space Complexity of Detectable Objects · PODC 2020
Memory systems
non-volatile memory
0.412020
Upper and Lower Bounds on the Space Complexity of Detectable Objects · PODC 2020
Distributed computing theory
concurrent objects
0.412020
Upper and Lower Bounds on the Space Complexity of Detectable Objects · PODC 2020

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

latent inversion · 1.7vision-language model · 0.9graph neural network · 0.9space complexity analysis · 0.9lower bounds · 0.4lower bound · 0.4
YearPublicationVenuePosition
2025 Memories of Forgotten Concepts
abstract
Diffusion models dominate the space of text-to-image generation, yet they may produce undesirable outputs, including explicit content or private data. To mitigate this, concept ablation techniques have been explored to limit the generation of certain concepts. In this paper, we reveal that the erased concept information persists in the model and that erased concept images can be generated using the right latent. Utilizing inversion methods, we show that there exist latent seeds capable of generating high quality images of erased concepts. Moreover, we show that these latents have likelihoods that overlap with those of images outside the erased concept. We extend this to demonstrate that for every image from the erased concept set, we can generate many seeds that generate the erased concept. Given the vast space of latents capable of generating ablated concept images, our results suggest that fully erasing concept information may be intractable, highlighting possible vulnerabilities in current concept ablation techniques.
Matan Rusanovsky, Shimon Malnick, Amir Jevnisek, Ohad Fried, Shai Avidan
CVPR1
2025 CapeX: Category-Agnostic Pose Estimation from Textual Point Explanation
abstract
Conventional 2D pose estimation models are constrained by their design to specific object categories. This limits their applicability to predefined objects. To overcome these limitations, category-agnostic pose estimation (CAPE) emerged as a solution. CAPE aims to facilitate keypoint localization for diverse object categories using a unified model, which can generalize from minimal annotated support images. Recent CAPE works have produced object poses based on arbitrary keypoint definitions annotated on a user-provided support image. Our work departs from conventional CAPE methods, which require a support image, by adopting a text-based approach instead of the support image. Specifically, we use a pose-graph, where nodes represent keypoints that are described with text. This representation takes advantage of the abstraction of text descriptions and the structure imposed by the graph. Our approach effectively breaks symmetry, preserves structure, and improves occlusion handling. We validate our novel approach using the MP-100 benchmark, a comprehensive dataset covering over 100 categories and 18,000 images. MP-100 is structured so that the evaluation categories are unseen during training, making it especially suited for CAPE. Under a 1-shot setting, our solution achieves a notable performance boost of 1.26\%, establishing a new state-of-the-art for CAPE. Additionally, we enhance the dataset by providing text description annotations for both training and testing. We also include alternative text annotations specifically for testing the model's ability to generalize across different textual descriptions, further increasing its value for future research. Our code and dataset are publicly available at https://github.com/matanr/capex.
Matan Rusanovsky, Or Hirschorn, Shai Avidan
ICLR1
2021 Flat-Combining-Based Persistent Data Structures for Non-volatile Memory
Matan Rusanovsky, Hagit Attiya, Ohad Ben-Baruch, Tom Gerby, Danny Hendler, Pedro Ramalhete
SSS1
2020 Upper and Lower Bounds on the Space Complexity of Detectable Objects
abstract
The emergence of systems with non-volatile main memory (NVM) increases the interest in the design of recoverable concurrent objects that are robust to crash-failures, since their operations are able to recover from such failures by using state retained in NVM. Of particular interest are recoverable algorithms that, in addition to ensuring object consistency, also provide detectability, a correctness condition requiring that the recovery code can infer if the failed operation was linearized or not and, in the former case, obtain its response.
Ohad Ben-Baruch, Danny Hendler, Matan Rusanovsky
PODC3