# Implementaci\'on de un nuevo algoritmo de identificaci\'on de fuentes estelares en el c\'odigo SACAMAN

## TL;DR

This paper presents an improved, faster algorithm for identifying stellar sources in the SACAMAN code, enabling efficient magnitude extraction for predefined objects, and is applied to study variable carbon stars in the Galactic Bulge.

## Contribution

An enhanced proximity algorithm reduces processing time by approximately 70%, improving stellar source identification in the SACAMAN code.

## Key findings

- Significant reduction in processing time.
- Successful application to variable carbon stars.
- Enhanced accuracy in stellar magnitude determination.

## Abstract

An improved version of the identification stellar sources module in the quasi-automatic SACAMAN code is presented, which allows to obtain YZJHKs-VVV magnitudes for a set of predefined objects. The procedure uses a proximity algorithm $\simeq$ 70 less time-consuming than the previous method of successive and counting approximation. This code is being applied to the study of variability of carbon stars belonging to the Galactic Bulge.