Nallig Leal

Prof. Nallig Leal


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 June 2021 in Sensors
Verified
Journal Article
Open access
PDF file
ELEsmeide Leal
Esmeide Leal
GSGerman Sanchez
German Sanchez
JBJohn W Branch
John W Branch
FAFrancisco Abad
Francisco Abad
NLNallig Leal
Nallig Leal
High-resolution 3D scanning devices produce high-density point clouds, which require a large capacity of storage and time-consuming processing algorithms. In order to reduce both needs, it is common to apply surface simplification algorithms as a preprocessing stage. The goal of point cloud simplification algorithms is to reduce the volume of data while preserving the most relevant features of the original point cloud. In this paper, we present a new point cloud feature-preserving simplification algorithm. We use a global approach to detect saliencies on a given point cloud. Our method estimates a feature vector for each point in the cloud. The components of the feature vector are the normal vector coordinates, the point coordinates, and the surface curvature at each point. Feature vectors are used as basis signals to carry out a dictionary learning process, producing a trained dictionary. We perform the corresponding sparse coding process to produce a sparse matrix. To detect the saliencies, the proposed method uses two measures, the first of which takes into account the quantity of nonzero elements in each column vector of the sparse matrix and the second the reconstruction error of each signal. These measures are then combined to produce the final saliency value for each point in the cloud. Next, we proceed with the simplification of the point cloud, guided by the detected saliency and using the saliency values of each point as a dynamic clusterization radius. We validate the proposed method by comparing it with a set of state-of-the-art methods, demonstrating the effectiveness of the simplification method.

10 March 2020 in Sensors
Verified
Journal Article
Open access
PDF file
NLNallig Leal
Nallig Leal
EZEduardo Zurek
Eduardo Zurek
ELEsmeide Leal
Esmeide Leal
Magnetic Resonance (MR) Imaging is a diagnostic technique that produces noisy images, which must be filtered before processing to prevent diagnostic errors. However, filtering the noise while keeping fine details is a difficult task. This paper presents a method, based on sparse representations and singular value decomposition (SVD), for non-locally denoising MR images. The proposed method prevents blurring, artifacts, and residual noise. Our method is composed of three stages. The first stage divides the image into sub-volumes, to obtain its sparse representation, by using the KSVD algorithm. Then, the global influence of the dictionary atoms is computed to upgrade the dictionary and obtain a better reconstruction of the sub-volumes. In the second stage, based on the sparse representation, the noise-free sub-volume is estimated using a non-local approach and SVD. The noise-free voxel is reconstructed by aggregating the overlapped voxels according to the rarity of the sub-volumes it belongs, which is computed from the global influence of the atoms. The third stage repeats the process using a different sub-volume size for producing a new filtered image, which is averaged with the previously filtered images. The results provided show that our method outperforms several state-of-the-art methods in both simulated and real data.


21 February 2019 in Ingenieria y Universidad
Verified
Journal Article
Open access
PDF file
MGMargarita Gamarra
Margarita Gamarra
IFInés Meriño Fuentes
Inés Meriño Fuentes
JSJuan Calabria Sarmiento
Juan Calabria Sarmiento
Omar Gutiérrez AcostaOmar Gutiérrez Acosta
Omar Gutiérrez Acosta
MBMAURICIO BARRIOS
MAURICIO BARRIOS
Pedro WightmanPedro Wightman
Pedro Wightman
Introduction: The use of mobile applications has increased in the last years. Most of them require the knowledge of the user location, either for their core service or for marketing purposes. Location-based services (LBS) offer context-based assistance to users based on their location. Although these applications ask the user for permission to use their location and even explain in detail how this information will be used in its terms and conditions, most users are not aware or even interested in the fact that their location information is stored in databases and monetized by selling it to third-party companies. Regarding this situation, we developed a study with the aim to assess perception, concerns and awareness from users about their location information. Methods: This work is based on an exploratory survey applied to the university community, mainly from the North Coast of Colombia, to measure the perception of location privacy of users with mobile devices. The questionnaire was applied using Google Forms. The survey has nineteen questions organized in three sections: personal information, identification of privacy and privacy management. These questions were designed to know the users’ perceptions of privacy concerns in LBS and any actions they take to preserve it. Results: The results show that, in general, the respondents do not have a real concern regarding the privacy of their geolocation data, and the majority is not willing to pay to protect their privacy. Conclusions: This type of surveys can generate awareness among participants about the use of their private information. The results expose in this paper can be used to create government policies and regulations by technology companies about the privacy management.

1 January 2014 in Información tecnológica
Verified
Journal Article
Open access
PDF file
ELEsmeide Leal
Esmeide Leal
NLNallig Leal
Nallig Leal
GSGerman Sanchez
German Sanchez

1 January 2007 in International Journal of Computational Intelligence Research
Verified
Journal Article
Closed access
NLNallig Leal
Nallig Leal
OLOscar Ortega Lobo
Oscar Ortega Lobo
JBJohn William Branch
John William Branch