Adversarial attacks pose a significant threat to the reliability of biometric systems, particularly in security-critical applications such as identity verification and access control. Ensuring robustness against such attacks is essential for the safe deployment of face recognition technologies in real-world scenarios. To advance this goal, the 2025 Adversarial Attack Challenge for Secure Face Recognition was organized as part of the International Joint Conference on Biometrics (IJCB) 2025.The competition focused on two main tracks: Detection, where the objective was to determine whether a given face image is clean or adversarial, and Resilience, which aimed to evaluate recognition systems under adversarial perturbations. Participants were provided with a standardized dataset derived from CelebA and LFW, encompassing both clean samples and adversarial images crafted using ten diverse attack methods targeting evasion and impersonation scenarios. To ensure fairness and reproducibility, all models were trained solely on the data provided, with support from a custom open source adversarial attack package tailored for face recognition.In addition to benchmarking adversarial robustness, the challenge contributes to the research community by releasing the data set and the extensible attack package, allowing further investigation of secure and reliable face recognition systems.

In this paper, we tackle the task of automatically analyzing 3D volumetric scans obtained from computed tomography (CT) devices. In particular, we address a particular task for which data is very limited: the segmentation of ancient Egyptian mummies CT scans. We aim at digitally unwrapping the mummy and identify different segments such as body, bandages and jewelry. The problem is complex because of the lack of annotated data for the different semantic regions to segment, thus discouraging the use of strongly supervised approaches. We, therefore, propose a weakly supervised and efficient interactive segmentation method to solve this challenging problem. After segmenting the wrapped mummy from its exterior region using histogram analysis and template matching, we first design a voxel distance measure to find an approximate solution for the body and bandage segments. Here, we use geodesic distances since voxel features as well as spatial relationship among voxels is incorporated in this measure. Next, we refine the solution using a GrabCut based segmentation together with a tracking method on the slices of the scan that assigns labels to different regions in the volume, using limited supervision in the form of scribbles drawn by the user. The efficiency of the proposed method is demonstrated using visualizations and validated through quantitative measures and qualitative unwrapping of the mummy.

The objective in image co-segmentation is to jointly segment unknown common objects from a given set of images. In this paper, we propose a novel deep convolution neural network based end-to-end co-segmentation model. It is composed of a metric learning and decision network leading to a novel conditional siamese encoder-decoder network for estimating a co-segmentation mask. The role of the metric learning network is to find an optimum latent feature space where objects of the same class are closer and that of different classes are separated by a certain margin. Depending on the extracted features, the decision network decides whether input images have common objects or not and the encoder-decoder network produces a cosegmentation mask accordingly. Key aspects of the architecture are as follows. First, it is completely class agnostic and does not require any semantic information. Second, in addition to producing masks, the decoder network also learns similarity across image pairs that improves co-segmentation significantly. Experimental results reflect an excellent performance of our method compared to state of-the-art methods on challenging co-segmentation datasets.

In this paper, we formulate image co-segmentation as a classification problem in an unsupervised framework with the classes being the common foreground and the remaining regions in the image set. We first find a set of superpixels across all images with high feature similarity such that the constituent superpixels in individual images are spatially compact and label them as seed for the common foreground. Those superpixels with high background probability are labeled as respective seeds for multiple background classes. Seed computation here is unsupervised and automated unlike some semi-supervised methods. Then, we compute discriminative features that separate the initially labeled classes using linear discriminant analysis. We use these features to perform spatially constrained label propagation and obtain labels for the unlabeled regions, and iterate this process till the seed regions grow to the common object. Experimental results demonstrate excellent robustness properties even while processing non-homogeneous image sets where the common object is present only in majority of the images.

In this paper, we propose an unsupervised two-stage algorithm to extract salient objects from images. In the first stage, the image is segmented into superpixels that are grouped together through k-means clustering, based on histogram features of superpixels. The saliency of each cluster is calculated using inter-cluster and intra-cluster feature dissimilarities. In the second stage, we use seam carving to obtain an object level segmentation of the image in the form of a bounding box around the salient object. We propose an automated approach for seam carving based on a novel energy function obtained by combining the saliency output with a texture removed input image. We compute the optimal number of seams to be removed to extract the salient object instead of manually providing it. The performance of the proposed method is demonstrated by processing different types of images.