celldetective 1.0.2__py3-none-any.whl → 1.1.0__py3-none-any.whl

celldetective/neighborhood.py

@@ -2,14 +2,16 @@ import numpy as np
 import pandas as pd
 from tqdm import tqdm
 from skimage.measure import regionprops_table
+from skimage.graph import pixel_graph
 from functools import reduce
 from mahotas.features import haralick
 from scipy.ndimage import zoom
 import os
 import subprocess
 from celldetective.utils import rename_intensity_column, create_patch_mask, remove_redundant_features
-from celldetective.io import get_position_table
 from scipy.spatial.distance import cdist
+from celldetective.measure import contour_of_instance_segmentation
+from celldetective.io import locate_labels, get_position_pickle, get_position_table
 import re
 
 abs_path = os.sep.join([os.path.split(os.path.dirname(os.path.realpath(__file__)))[0], 'celldetective'])
@@ -372,6 +374,23 @@ def compute_neighborhood_at_position(pos, distance, population=['targets','effec
 	df_A, path_A = get_position_table(pos, population=population[0], return_path=True)
 	df_B, path_B = get_position_table(pos, population=population[1], return_path=True)
 
+	df_A_pkl = get_position_pickle(pos, population=population[0], return_path=False)
+	df_B_pkl = get_position_pickle(pos, population=population[1], return_path=False)
+
+	if df_A_pkl is not None:
+		pkl_columns = np.array(df_A_pkl.columns)
+		neigh_columns = np.array([c.startswith('neighborhood') for c in pkl_columns])
+		cols = list(pkl_columns[neigh_columns]) + ['TRACK_ID','FRAME']
+		print(f'Recover {cols} from the pickle file...')
+		df_A = pd.merge(df_A, df_A_pkl.loc[:,cols], how="outer", on=['TRACK_ID','FRAME'])
+		print(df_A.columns)
+	if df_B_pkl is not None and df_B is not None:
+		pkl_columns = np.array(df_B_pkl.columns)
+		neigh_columns = np.array([c.startswith('neighborhood') for c in pkl_columns])
+		cols = list(pkl_columns[neigh_columns]) + ['TRACK_ID','FRAME']
+		print(f'Recover {cols} from the pickle file...')
+		df_B = pd.merge(df_B, df_B_pkl.loc[:,cols], how="outer", on=['TRACK_ID','FRAME'])
+
 	if clear_neigh:
 		unwanted = df_A.columns[df_A.columns.str.contains('neighborhood')]
 		df_A = df_A.drop(columns=unwanted)
@@ -558,7 +577,7 @@ def compute_neighborhood_metrics(neigh_table, neigh_col, metrics=['inclusive','e
 
 	return neigh_table
 
-def mean_neighborhood_before_event(neigh_table, neigh_col, event_time_col):
+def mean_neighborhood_before_event(neigh_table, neigh_col, event_time_col, metrics=['inclusive','exclusive','intermediate']):
 	
 	"""
 	Computes the mean neighborhood metrics for each cell track before a specified event time.
@@ -593,11 +612,13 @@ def mean_neighborhood_before_event(neigh_table, neigh_col, event_time_col):
 	else:
 		groupbycols = ['TRACK_ID']
 	neigh_table.sort_values(by=groupbycols+['FRAME'],inplace=True)
+	suffix = '_before_event'
 	
 	if event_time_col is None:
 		print('No event time was provided... Estimating the mean neighborhood over the whole observation time...')
 		neigh_table.loc[:,'event_time_temp'] = neigh_table['FRAME'].max()
 		event_time_col = 'event_time_temp'
+		suffix = ''
 	
 	for tid,group in neigh_table.groupby(groupbycols):
 
@@ -613,22 +634,24 @@ def mean_neighborhood_before_event(neigh_table, neigh_col, event_time_col):
 		if event_time<0.:
 			event_time = group['FRAME'].max()
 
-		valid_counts_intermediate = group.loc[group['FRAME']<=event_time,'intermediate_count_s1_'+neigh_col].to_numpy()
-		valid_counts_inclusive = group.loc[group['FRAME']<=event_time,'inclusive_count_s1_'+neigh_col].to_numpy()
-		valid_counts_exclusive = group.loc[group['FRAME']<=event_time,'exclusive_count_s1_'+neigh_col].to_numpy()
-
-		if len(valid_counts_intermediate[valid_counts_intermediate==valid_counts_intermediate])>0:
-			neigh_table.loc[indices, f'mean_count_intermediate_{neigh_col}_before_event'] = np.nanmean(valid_counts_intermediate)
-		if len(valid_counts_inclusive[valid_counts_inclusive==valid_counts_inclusive])>0:
-			neigh_table.loc[indices, f'mean_count_inclusive_{neigh_col}_before_event'] = np.nanmean(valid_counts_inclusive)
-		if len(valid_counts_exclusive[valid_counts_exclusive==valid_counts_exclusive])>0:
-			neigh_table.loc[indices, f'mean_count_exclusive_{neigh_col}_before_event'] = np.nanmean(valid_counts_exclusive)
+		if 'intermediate' in metrics:
+			valid_counts_intermediate = group.loc[group['FRAME']<=event_time,'intermediate_count_s1_'+neigh_col].to_numpy()
+			if len(valid_counts_intermediate[valid_counts_intermediate==valid_counts_intermediate])>0:
+				neigh_table.loc[indices, f'mean_count_intermediate_{neigh_col}{suffix}'] = np.nanmean(valid_counts_intermediate)			
+		if 'inclusive' in metrics:
+			valid_counts_inclusive = group.loc[group['FRAME']<=event_time,'inclusive_count_s1_'+neigh_col].to_numpy()
+			if len(valid_counts_inclusive[valid_counts_inclusive==valid_counts_inclusive])>0:
+				neigh_table.loc[indices, f'mean_count_inclusive_{neigh_col}{suffix}'] = np.nanmean(valid_counts_inclusive)			
+		if 'exclusive' in metrics:
+			valid_counts_exclusive = group.loc[group['FRAME']<=event_time,'exclusive_count_s1_'+neigh_col].to_numpy()
+			if len(valid_counts_exclusive[valid_counts_exclusive==valid_counts_exclusive])>0:
+				neigh_table.loc[indices, f'mean_count_exclusive_{neigh_col}{suffix}'] = np.nanmean(valid_counts_exclusive)
 
 	if event_time_col=='event_time_temp':
 		neigh_table = neigh_table.drop(columns='event_time_temp')
 	return neigh_table
 
-def mean_neighborhood_after_event(neigh_table, neigh_col, event_time_col):
+def mean_neighborhood_after_event(neigh_table, neigh_col, event_time_col, metrics=['inclusive','exclusive','intermediate']):
 	
 	"""
 	Computes the mean neighborhood metrics for each cell track after a specified event time.
@@ -663,10 +686,12 @@ def mean_neighborhood_after_event(neigh_table, neigh_col, event_time_col):
 	else:
 		groupbycols = ['TRACK_ID']
 	neigh_table.sort_values(by=groupbycols+['FRAME'],inplace=True)
+	suffix = '_after_event'
 	
 	if event_time_col is None:
 		neigh_table.loc[:,'event_time_temp'] = None #neigh_table['FRAME'].max()
 		event_time_col = 'event_time_temp'
+		suffix = ''
 	
 	for tid,group in neigh_table.groupby(groupbycols):
 
@@ -679,26 +704,469 @@ def mean_neighborhood_after_event(neigh_table, neigh_col, event_time_col):
 		else:
 			continue
 
-		if event_time is None or (event_time<0.):
-			neigh_table.loc[indices, f'mean_count_intermediate_{neigh_col}_after_event'] = np.nan
-			neigh_table.loc[indices, f'mean_count_inclusive_{neigh_col}_after_event'] = np.nan
-			neigh_table.loc[indices, f'mean_count_exclusive_{neigh_col}_after_event'] = np.nan
-		else:
-			valid_counts_intermediate = group.loc[group['FRAME']>event_time,'intermediate_count_s1_'+neigh_col].to_numpy()
-			valid_counts_inclusive = group.loc[group['FRAME']>event_time,'inclusive_count_s1_'+neigh_col].to_numpy()
-			valid_counts_exclusive = group.loc[group['FRAME']>event_time,'exclusive_count_s1_'+neigh_col].to_numpy()
+		if event_time is not None and (event_time>=0.):
 
-			if len(valid_counts_intermediate[valid_counts_intermediate==valid_counts_intermediate])>0:
-				neigh_table.loc[indices, f'mean_count_intermediate_{neigh_col}_after_event'] = np.nanmean(valid_counts_intermediate)
-			if len(valid_counts_inclusive[valid_counts_inclusive==valid_counts_inclusive])>0:
-				neigh_table.loc[indices, f'mean_count_inclusive_{neigh_col}_after_event'] = np.nanmean(valid_counts_inclusive)
-			if len(valid_counts_exclusive[valid_counts_exclusive==valid_counts_exclusive])>0:
-				neigh_table.loc[indices, f'mean_count_exclusive_{neigh_col}_after_event'] = np.nanmean(valid_counts_exclusive)
+			if 'intermediate' in metrics:
+				valid_counts_intermediate = group.loc[group['FRAME']>event_time,'intermediate_count_s1_'+neigh_col].to_numpy()
+				if len(valid_counts_intermediate[valid_counts_intermediate==valid_counts_intermediate])>0:
+					neigh_table.loc[indices, f'mean_count_intermediate_{neigh_col}{suffix}'] = np.nanmean(valid_counts_intermediate)
+			if 'inclusive' in metrics:
+				valid_counts_inclusive = group.loc[group['FRAME']>event_time,'inclusive_count_s1_'+neigh_col].to_numpy()
+				if len(valid_counts_inclusive[valid_counts_inclusive==valid_counts_inclusive])>0:
+					neigh_table.loc[indices, f'mean_count_inclusive_{neigh_col}{suffix}'] = np.nanmean(valid_counts_inclusive)
+			if 'exclusive' in metrics:
+				valid_counts_exclusive = group.loc[group['FRAME']>event_time,'exclusive_count_s1_'+neigh_col].to_numpy()
+				if len(valid_counts_exclusive[valid_counts_exclusive==valid_counts_exclusive])>0:
+					neigh_table.loc[indices, f'mean_count_exclusive_{neigh_col}{suffix}'] = np.nanmean(valid_counts_exclusive)
 
 	if event_time_col=='event_time_temp':
 		neigh_table = neigh_table.drop(columns='event_time_temp')
+
 	return neigh_table
 
+# New functions for direct cell-cell contact neighborhood
+
+def sign(num):
+	return -1 if num < 0 else 1
+
+def contact_neighborhood(labelsA, labelsB=None, border=3, connectivity=2):
+
+	labelsA = labelsA.astype(float)
+	if labelsB is not None:
+		labelsB = labelsB.astype(float)
+
+	print(f"Border = {border}")
+	
+	if border > 0:
+		print(labelsA.shape, border * (-1))
+		labelsA_edge = contour_of_instance_segmentation(label=labelsA, distance=border * (-1)).astype(float)
+		labelsA[np.where(labelsA_edge>0)] = labelsA_edge[np.where(labelsA_edge>0)]
+		if labelsB is not None:
+			labelsB_edge = contour_of_instance_segmentation(label=labelsB, distance=border * (-1)).astype(float)
+			labelsB[np.where(labelsB_edge>0)] = labelsB_edge[np.where(labelsB_edge>0)]
+	
+	if labelsB is not None:
+		labelsA[labelsA!=0] = -labelsA[labelsA!=0]
+		labelsAB = merge_labels(labelsA, labelsB)
+		labelsBA = merge_labels(labelsB, labelsA)
+		label_cases = [labelsAB, labelsBA]
+	else:
+		label_cases = [labelsA]
+	
+	coocurrences = []
+	for lbl in label_cases:
+		coocurrences.extend(find_contact_neighbors(lbl, connectivity=connectivity))
+	
+	unique_pairs = np.unique(coocurrences,axis=0)
+	
+	if labelsB is not None:
+		neighs = np.unique([tuple(sorted(p)) for p in unique_pairs if p[0]!=p[1] and sign(p[0])!=sign(p[1])],axis=0)
+	else:
+		neighs = np.unique([tuple(sorted(p)) for p in unique_pairs if p[0]!=p[1]],axis=0)
+	
+	return neighs
+
+def merge_labels(labelsA, labelsB):
+	
+	labelsA = labelsA.astype(float)
+	labelsB = labelsB.astype(float)
+	
+	labelsAB = labelsA.copy()
+	labelsAB[np.where(labelsB!=0)] = labelsB[np.where(labelsB!=0)]
+	
+	return labelsAB
+
+def find_contact_neighbors(labels, connectivity=2):
+	
+	assert labels.ndim==2,"Wrong dimension for labels..."
+	g, nodes = pixel_graph(labels, mask=labels.astype(bool),connectivity=connectivity)
+	g.eliminate_zeros()
+
+	coo = g.tocoo()
+	center_coords = nodes[coo.row]
+	neighbor_coords = nodes[coo.col]
+
+	center_values = labels.ravel()[center_coords]
+	neighbor_values = labels.ravel()[neighbor_coords]
+	touching_masks = np.column_stack((center_values, neighbor_values)) 
+	
+	return touching_masks
+
+
+def mask_contact_neighborhood(setA, setB, labelsA, labelsB, distance, mode='two-pop', status=None, not_status_option=None, compute_cum_sum=True, 
+							  attention_weight=True, symmetrize=True, include_dead_weight=True,
+							  column_labels={'track': "TRACK_ID", 'time': 'FRAME', 'x': 'POSITION_X', 'y': 'POSITION_Y', 'mask_id': 'class_id'}):
+	
+	"""
+
+	Match neighbors in set A and B within a circle of radius d. 
+
+	Parameters
+	----------
+	setA,setB : pandas DataFrame
+		Trajectory or position sets A and B.
+	distance : float
+		Cut-distance in pixels to match neighboring pairs.
+	mode: str
+		neighboring mode, between 'two-pop' (e.g. target-effector) and 'self' (target-target or effector-effector).
+	status: None or status 
+		name to look for cells to ignore (because they are dead). By default all cells are kept.
+	compute_cum_sum: bool,
+		compute cumulated time of presence of neighbours (only if trajectories available for both sets)
+	attention_weight: bool,
+		compute the attention weight (how much a cell of set B is shared across cells of set A)
+	symmetrize: bool,
+		write in set B the neighborhood of set A
+	include_dead_weight: bool
+		do not count dead cells when establishing attention weight
+	"""
+
+	# Check live_status option
+	if setA is not None and setB is not None:
+		setA, setB, status = set_live_status(setA, setB, status, not_status_option)
+	else:
+		return None,None
+
+	# Check distance option 
+	if not isinstance(distance, list):
+		distance = [distance]
+	
+	for d in distance:
+		# loop over each provided distance
+		
+		if mode=='two-pop':
+			neigh_col = f'neighborhood_2_contact_{d}_px'
+		elif mode=='self':
+			neigh_col = f'neighborhood_self_contact_{d}_px'
+			
+		cl = []
+		for s in [setA,setB]:
+
+			# Check whether data can be tracked
+			temp_column_labels = column_labels.copy()
+
+			if not 'TRACK_ID' in list(s.columns):
+				temp_column_labels.update({'track': 'ID'})
+				compute_cum_sum = False # if no tracking data then cum_sum is not relevant
+			cl.append(temp_column_labels)
+
+			# Remove nan tracks (cells that do not belong to a track)
+			s[neigh_col] = np.nan
+			s[neigh_col] = s[neigh_col].astype(object)
+			s.dropna(subset=[cl[-1]['track']],inplace=True)
+
+		# Loop over each available timestep
+		timeline = np.unique(np.concatenate([setA[cl[0]['time']].to_numpy(), setB[cl[1]['time']].to_numpy()])).astype(int)
+		for t in tqdm(timeline):
+
+			index_A = list(setA.loc[setA[cl[0]['time']]==t].index)
+			coordinates_A = setA.loc[setA[cl[0]['time']]==t,[cl[0]['x'], cl[0]['y']]].to_numpy()            
+			ids_A = setA.loc[setA[cl[0]['time']]==t,cl[0]['track']].to_numpy()
+			mask_ids_A = setA.loc[setA[cl[0]['time']]==t,cl[0]['mask_id']].to_numpy()
+			status_A = setA.loc[setA[cl[0]['time']]==t,status[0]].to_numpy()
+
+			index_B = list(setB.loc[setB[cl[1]['time']]==t].index)
+			coordinates_B = setB.loc[setB[cl[1]['time']]==t,[cl[1]['x'], cl[1]['y']]].to_numpy()
+			ids_B = setB.loc[setB[cl[1]['time']]==t,cl[1]['track']].to_numpy()
+			mask_ids_B = setB.loc[setB[cl[1]['time']]==t,cl[1]['mask_id']].to_numpy()
+			status_B = setB.loc[setB[cl[1]['time']]==t,status[1]].to_numpy()
+			
+			print(f"Frame {t}")
+			print(f"{mask_ids_A=}",f"{mask_ids_B}")
+
+			if len(ids_A) > 0 and len(ids_B) > 0:
+				
+				# compute distance matrix
+				dist_map = cdist(coordinates_A, coordinates_B, metric="euclidean")
+
+				# Do the mask contact computation
+				if labelsB is not None:
+					lblB = labelsB[t]
+				else:
+					lblB = labelsB
+
+				print(f"Distance {d} for contact as border")
+				contact_pairs = contact_neighborhood(labelsA[t], labelsB=lblB, border=d, connectivity=2)	
+
+				print(t, f"{np.unique(labelsA[t])=}")
+				print(f"Frame {t}: found the following contact pairs: {contact_pairs}...")
+				# Put infinite distance to all non-contact pairs (something like this)
+				plot_map=False
+
+				if len(contact_pairs)>0:
+					mask = np.ones_like(dist_map).astype(bool)
+					
+					indices_to_keep = []
+					for cp in contact_pairs:
+						
+						if np.any(cp<0):
+							if cp[0]<0:
+								mask_A = cp[1]
+								mask_B = np.abs(cp[0])
+							else:
+								mask_A = cp[0]
+								mask_B = np.abs(cp[1])
+						else:
+							mask_A = cp[0]
+							mask_B = cp[1]
+
+						try:
+
+							idx_A = np.where(mask_ids_A==int(mask_A))[0][0]
+							idx_B = np.where(mask_ids_B==int(mask_B))[0][0]
+							print(idx_A, idx_B)
+							indices_to_keep.append([idx_A,idx_B])
+						except:
+							pass
+
+					print(f'Indices to keep: {indices_to_keep}...')
+					if len(indices_to_keep)>0:
+						indices_to_keep = np.array(indices_to_keep)
+						mask[indices_to_keep[:,0],indices_to_keep[:,1]] = False
+						if mode=='self':
+							mask[indices_to_keep[:,1],indices_to_keep[:,0]] = False
+						dist_map[mask] = 1.0E06
+						plot_map=True
+				else:
+					dist_map[:,:] = 1.0E06
+
+				# PROCEED all the same?? --> I guess so
+				# if plot_map:
+				# 	import matplotlib.pyplot as plt
+				# 	print(indices_to_keep)
+				# 	plt.imshow(dist_map)
+				# 	plt.pause(5)
+				# 	plt.close()
+
+				d_filter = 1.0E05
+				if attention_weight:
+					weights, closest_A = compute_attention_weight(dist_map, d_filter, status_A, ids_A, axis=1, include_dead_weight=include_dead_weight)
+				
+				# Target centric
+				for k in range(dist_map.shape[0]):
+					
+					col = dist_map[k,:]
+					col[col==0.] = 1.0E06
+
+					neighs_B = np.array([ids_B[i] for i in np.where((col<=d_filter))[0]])
+					status_neigh_B = np.array([status_B[i] for i in np.where((col<=d_filter))[0]])
+					dist_B = [round(col[i],2) for i in np.where((col<=d_filter))[0]]
+					if len(dist_B)>0:
+						closest_B_cell = neighs_B[np.argmin(dist_B)]    
+					
+					if symmetrize and attention_weight:
+						n_neighs = float(len(neighs_B))
+						if not include_dead_weight:
+							n_neighs_alive = len(np.where(status_neigh_B==1)[0])
+							neigh_count = n_neighs_alive
+						else:
+							neigh_count = n_neighs
+						if neigh_count>0:
+							weight_A = 1./neigh_count
+						else:
+							weight_A = np.nan
+
+						if not include_dead_weight and status_A[k]==0:
+							weight_A = 0
+					
+					neighs = []
+					setA.at[index_A[k], neigh_col] = []
+					for n in range(len(neighs_B)):
+						
+						# index in setB
+						n_index = np.where(ids_B==neighs_B[n])[0][0]
+						# Assess if neigh B is closest to A
+						if attention_weight:
+							if closest_A[n_index]==ids_A[k]:
+								closest = True
+							else:
+								closest = False
+						
+						if symmetrize:
+							# Load neighborhood previous data
+							sym_neigh = setB.loc[index_B[n_index], neigh_col]
+							if neighs_B[n]==closest_B_cell:
+								closest_b=True
+							else:
+								closest_b=False
+							if isinstance(sym_neigh, list):
+								sym_neigh.append({'id': ids_A[k], 'distance': dist_B[n], 'status': status_A[k]})
+							else:
+								sym_neigh = [{'id': ids_A[k], 'distance': dist_B[n],'status': status_A[k]}]
+							if attention_weight:
+								sym_neigh[-1].update({'weight': weight_A, 'closest': closest_b})
+						
+						# Write the minimum info about neighborhing cell B
+						neigh_dico = {'id': neighs_B[n], 'distance': dist_B[n], 'status': status_neigh_B[n]}
+						if attention_weight:
+							neigh_dico.update({'weight': weights[n_index], 'closest': closest})
+
+						if compute_cum_sum:
+							# Compute the integrated presence of the neighboring cell B
+							assert cl[1]['track'] == 'TRACK_ID','The set B does not seem to contain tracked data. The cumulative time will be meaningless.'
+							past_neighs = [[ll['id'] for ll in l] if len(l)>0 else [None] for l in setA.loc[(setA[cl[0]['track']]==ids_A[k])&(setA[cl[0]['time']]<=t), neigh_col].to_numpy()]
+							past_neighs = [item for sublist in past_neighs for item in sublist]
+							
+							if attention_weight:
+								past_weights = [[ll['weight'] for ll in l] if len(l)>0 else [None] for l in setA.loc[(setA[cl[0]['track']]==ids_A[k])&(setA[cl[0]['time']]<=t), neigh_col].to_numpy()]
+								past_weights = [item for sublist in past_weights for item in sublist]
+
+							cum_sum = len(np.where(past_neighs==neighs_B[n])[0])
+							neigh_dico.update({'cumulated_presence': cum_sum+1})
+							
+							if attention_weight:
+								cum_sum_weighted = np.sum([w if l==neighs_B[n] else 0 for l,w in zip(past_neighs, past_weights)])
+								neigh_dico.update({'cumulated_presence_weighted': cum_sum_weighted + weights[n_index]})
+
+						if symmetrize:
+							setB.at[index_B[n_index], neigh_col] = sym_neigh
+						
+						neighs.append(neigh_dico)
+											
+					setA.at[index_A[k], neigh_col] = neighs
+		
+	return setA, setB
+
+def compute_contact_neighborhood_at_position(pos, distance, population=['targets','effectors'], theta_dist=None, img_shape=(2048,2048), return_tables=False, clear_neigh=False, event_time_col=None,
+	neighborhood_kwargs={'mode': 'two-pop','status': None, 'not_status_option': None,'include_dead_weight': True,"compute_cum_sum": False,"attention_weight": True, 'symmetrize': True}):
+	
+	"""
+	Computes neighborhood metrics for specified cell populations within a given position, based on distance criteria and additional parameters.
+
+	This function assesses the neighborhood interactions between two specified cell populations (or within a single population) at a given position.
+	It computes various neighborhood metrics based on specified distances, considering the entire image or excluding edge regions.
+	The results are optionally cleared of previous neighborhood calculations and can be returned as updated tables.
+
+	Parameters
+	----------
+	pos : str
+		The path to the position directory where the analysis is to be performed.
+	distance : float or list of float
+		The distance(s) in pixels to define neighborhoods.
+	population : list of str, optional
+		Names of the cell populations to analyze. If a single population is provided, it is used for both populations in the analysis (default is ['targets', 'effectors']).
+	theta_dist : float or list of float, optional
+		Edge threshold(s) in pixels to exclude cells close to the image boundaries from the analysis. If not provided, defaults to 90% of each specified distance.
+	img_shape : tuple of int, optional
+		The dimensions (height, width) of the images in pixels (default is (2048, 2048)).
+	return_tables : bool, optional
+		If True, returns the updated data tables for both populations (default is False).
+	clear_neigh : bool, optional
+		If True, clears existing neighborhood columns from the data tables before computing new metrics (default is False).
+	event_time_col : str, optional
+		The column name indicating the event time for each cell, required if mean neighborhood metrics are to be computed before events.
+	neighborhood_kwargs : dict, optional
+		Additional keyword arguments for neighborhood computation, including mode, status options, and metrics (default includes mode 'two-pop', and symmetrization).
+
+	Returns
+	-------
+	pandas.DataFrame or (pandas.DataFrame, pandas.DataFrame)
+		If `return_tables` is True, returns the updated data tables for the specified populations. If only one population is analyzed, both returned data frames will be identical.
+
+	Raises
+	------
+	AssertionError
+		If the specified position path does not exist or if the number of distances and edge thresholds do not match.
+	
+	"""
+
+	pos = pos.replace('\\','/')
+	pos = rf"{pos}"
+	assert os.path.exists(pos),f'Position {pos} is not a valid path.'
+
+	if isinstance(population, str):
+		population = [population, population]
+
+	if not isinstance(distance, list):
+		distance = [distance]
+	if not theta_dist is None and not isinstance(theta_dist, list):
+		theta_dist = [theta_dist]
+
+	if theta_dist is None:
+		theta_dist = [0 for d in distance] #0.9*d
+	assert len(theta_dist)==len(distance),'Incompatible number of distances and number of edge thresholds.'
+
+	if population[0]==population[1]:
+		neighborhood_kwargs.update({'mode': 'self'})
+	if population[1]!=population[0]:
+		neighborhood_kwargs.update({'mode': 'two-pop'})
+
+	df_A, path_A = get_position_table(pos, population=population[0], return_path=True)
+	df_B, path_B = get_position_table(pos, population=population[1], return_path=True)
+
+	df_A_pkl = get_position_pickle(pos, population=population[0], return_path=False)
+	df_B_pkl = get_position_pickle(pos, population=population[1], return_path=False)
+
+	if df_A_pkl is not None:
+		pkl_columns = np.array(df_A_pkl.columns)
+		neigh_columns = np.array([c.startswith('neighborhood') for c in pkl_columns])
+		cols = list(pkl_columns[neigh_columns]) + ['TRACK_ID','FRAME']
+		print(f'Recover {cols} from the pickle file...')
+		df_A = pd.merge(df_A, df_A_pkl.loc[:,cols], how="outer", on=['TRACK_ID','FRAME'])
+		print(df_A.columns)
+	if df_B_pkl is not None and df_B is not None:
+		pkl_columns = np.array(df_B_pkl.columns)
+		neigh_columns = np.array([c.startswith('neighborhood') for c in pkl_columns])
+		cols = list(pkl_columns[neigh_columns]) + ['TRACK_ID','FRAME']
+		print(f'Recover {cols} from the pickle file...')
+		df_B = pd.merge(df_B, df_B_pkl.loc[:,cols], how="outer", on=['TRACK_ID','FRAME'])
+
+	labelsA = locate_labels(pos, population=population[0])
+	if population[1]==population[0]:
+		labelsB = None
+	else:
+		labelsB = locate_labels(pos, population=population[1])
+
+	if clear_neigh:
+		unwanted = df_A.columns[df_A.columns.str.contains('neighborhood')]
+		df_A = df_A.drop(columns=unwanted)
+		unwanted = df_B.columns[df_B.columns.str.contains('neighborhood')]
+		df_B = df_B.drop(columns=unwanted)		
+
+	print(f"Distance: {distance} for mask contact")
+	df_A, df_B = mask_contact_neighborhood(df_A, df_B, labelsA, labelsB, distance,**neighborhood_kwargs)
+	if df_A is None or df_B is None:
+		return None
+
+	for td,d in zip(theta_dist, distance):
+
+		if neighborhood_kwargs['mode']=='two-pop':
+			neigh_col = f'neighborhood_2_contact_{d}_px'
+		elif neighborhood_kwargs['mode']=='self':
+			neigh_col = f'neighborhood_self_contact_{d}_px'
+
+		df_A.loc[df_A['class_id'].isnull(),neigh_col] = np.nan
+
+		# edge_filter_A = (df_A['POSITION_X'] > td)&(df_A['POSITION_Y'] > td)&(df_A['POSITION_Y'] < (img_shape[0] - td))&(df_A['POSITION_X'] < (img_shape[1] - td))
+		# edge_filter_B = (df_B['POSITION_X'] > td)&(df_B['POSITION_Y'] > td)&(df_B['POSITION_Y'] < (img_shape[0] - td))&(df_B['POSITION_X'] < (img_shape[1] - td))
+		# df_A.loc[~edge_filter_A, neigh_col] = np.nan
+		# df_B.loc[~edge_filter_B, neigh_col] = np.nan
+
+		df_A = compute_neighborhood_metrics(df_A, neigh_col, metrics=['inclusive','intermediate'], decompose_by_status=True)
+		if neighborhood_kwargs['symmetrize']:
+			df_B = compute_neighborhood_metrics(df_B, neigh_col, metrics=['inclusive','intermediate'], decompose_by_status=True)
+		
+		df_A = mean_neighborhood_before_event(df_A, neigh_col, event_time_col, metrics=['inclusive','intermediate'])
+		if event_time_col is not None:
+			df_A = mean_neighborhood_after_event(df_A, neigh_col, event_time_col, metrics=['inclusive','intermediate'])
+
+	df_A.to_pickle(path_A.replace('.csv','.pkl'))
+	if not population[0]==population[1]:
+		df_B.to_pickle(path_B.replace('.csv','.pkl'))
+
+	unwanted = df_A.columns[df_A.columns.str.startswith('neighborhood_')]
+	df_A2 = df_A.drop(columns=unwanted)
+	df_A2.to_csv(path_A, index=False)
+
+	if not population[0]==population[1]:
+		unwanted = df_B.columns[df_B.columns.str.startswith('neighborhood_')]
+		df_B_csv = df_B.drop(unwanted, axis=1, inplace=False)
+		df_B_csv.to_csv(path_B,index=False)
+
+	if return_tables:
+		return df_A, df_B
+
+
 
 # def mask_intersection_neighborhood(setA, labelsA, setB, labelsB, threshold_iou=0.5, viewpoint='B'):
 # 	# do whatever to match objects in A and B