bluuebunny/crossref_metadata_2025_split huggingface dataset:
Crime contra mulheres e culpabilização das vítimas: a interseccionalidade com a raça e classe social
Authors: Moura Costa Prates Angela Maria , Da Silva Abreu Ana Claudia 
Published: January 2022

O objetivo é analisar como as mulheres são representadas dentro do sistema de justiça criminal, quando são vítimas de crimes como o feminicídio e o estupro. A opção metodológica é o enfoque dado pela perspectiva da criminologia crítica e feminista, interseccionando gênero, raça e classe social. Optou-se pela investigação de dois crimes: o feminicídio, em razão de sua aplicação estar, na maioria dos casos, relacionada aos conflitos domésticos e aos papeis esperados das mulheres (mãe/esposa); e o estupro, por representar o controle do corpo das mulheres e da sexualidade feminina. As relações desiguais entre os gêneros não ocorrem apenas no
ambiente doméstico e nas relações afetivas, mas também em lugares que devem garantir proteção e segurança às mulheres, como o sistema de justiça criminal. Ainda, devido à raça e à classe, as mulheres podem ser culpabilizadas por um crime cometido contra elas, como ocorre no estupro ou no feminicídio.
¿Existe el enfoque nexo agua-energía-alimento en el mandato constitucional del Ecuador?
Authors: Mora Bernal Adriana 
Published: January 2022

La gestión integrada de los recursos naturales debe ser una constante para
un uso más eficiente de los recursos, y esta sinergia se evidencia en los tres elementos
del enfoque nexo agua-energía-alimento. Estas interconexiones no pueden alejarse de los
derechos humanos, ya que son el hilo conductor del cumplimiento de los Objetivos de
Desarrollo Sostenible (ODS) y de las interacciones que se puedan suscitar entre agua,
energía y alimento. El presente trabajo aborda el anclaje constitucional para determinar
si existen elementos del enfoque nexo. Concluye que, si bien los asambleístas constituyentes de 2008 no formularon la creación de la Constitución a partir del enfoque nexo,
la norma constitucional sí desarrolla elementos como la soberanía económica, de la
que forma parte la soberanía alimentaria y energética. Además, se establece el derecho
humano al agua como un derecho autónomo e identifica los diferentes usos del agua
evitando una posible conflictividad por el uso, esclareciendo cuáles son las interacciones
del recurso hídrico con sectores como la alimentación y energía. Esto exige la aplicación
obligatoria del mandato constitucional, lo que permite proyectar sus exigencias sobre
todo el ordenamiento jurídico ecuatoriano, en aras de hacer realidad la Constitución
en su vertiente de garantía de los derechos fundamentales anudados al medio ambiente,
así como a un desarrollo económico sustentable alineado al cumplimiento de los ODS.
La naturaleza jurídica del alta mar en materia de responsabilidad por daños ambientales
Authors: Castro Enríquez Israel 
Published: January 2022

A la luz del derecho internacional ambiental se estudiaron los regímenes
jurídicos, jurisprudenciales y doctrinarios que engloban a la institución de alta mar, ya
que tanto la Convención de las Naciones Unidas sobre Derecho de Mar de 1982 como la
Declaración de Río sobre Medio Ambiente y Desarrollo de 1992 congregan una desnaturalización a los derechos y obligaciones de protección establecidos en beneficio de alta
mar; porque dentro de estos instrumentos internacionales sus efectos y aplicación radican dentro de la teoría soft law, debido al carácter soberano de los Estados y por la escasa
técnica legislativa contemplada en su desarrollo normativo; cuestiones que inducen a la
formación de vacíos legales que provocan que los casos en materia de contaminación
y sobreexplotación de recursos naturales no renovables que yacen en alta mar queden
en la impunidad. Por ende, este trabajo invita a la comunidad internacional a modificar
la estructura jurídica de la Convención de las Naciones Unidas sobre Derecho de Mar
de 1982, en la medida que incorpore una protección efectiva en la Parte VII sobre alta
mar; y, además incluya en cierto modo al medio ambiente con el objeto de prevenir y
reducir potenciales actividades antrópicas que provocan el deterioro del ambiente por
los nuevos usos y costumbres instigados en el siglo XXI.
Naming and Renaming Texts: Rubrics in Middle High German Miscellany Manuscripts
Authors: Fernández Riva Gustavo 
Published: January 2022

This article analyses rubrics in Middle High German miscellany manuscripts of short texts in rhyming couplets (Reimpaargedichte). A corpus consisting of 1433 rubrics from 68 manuscripts was created to be able to perform this study. As rubrics in medieval manuscripts were not authorial, but composed by scribes, they offer insights into the reception of the texts. This paper analyses their features and functions as a proxy to interrogate the standing and status of Reimpaargedichte between the thirteenth and fifteenth centuries. The main methodology is distant reading, i.e. the application and interpretation of statistical methods on a textual corpus. The features analyzed include the length of the rubrics, their level of variation, the presence of author names, and vocabulary. Although no general patterns regarding length nor level of variation were detected, some important conclusions can be drawn: 1. there were no clear markers of literary genre in rubrics; 2. authorship was mostly absent, except for some specific cases of famous authors; 3. relatively stable keywords were used to identify particular texts, but they were more common in manuscripts with narrative texts (Erzählungen) and less common in later manuscripts dominated by the genre known as Minnereden. Furthermore, the analysis revealed that rubrics used a series of linguistic procedures to show that they participated in a different speech act than the main text – they embodied an interaction between scribes and readers, in which the former framed the reception of the work.
Spherical Wavelet ITK Filter
Authors: Gao Yi , Nain Delphine , LeFaucheur Xavier , Tannenbaum Allen 
Published: January 2022

This paper describes the Insight Toolkit (ITK) Spherical Wavelet object: itkSWaveletSource. This ITK object is an implementation of a paper by Schr¨oder and W. Sweldens, “Spherical Wavelets: Effi- ciently Representing Functions on the Sphere” [8], with pseudo-code given in their paper entitled “Spherical wavelets: Texture processing” [7]. In these papers, Swelden et. al. show how to do decompose a scalar signal defined on a spherical mesh into spherical wavelet coefficients (analysis step, also called forward transform), and vice-versa (synthesis step, also called inverse transform). We have implemented the spherical wavelet transform in ITK entitled itkSWaveletSource object, which will take the scalar function defined on a spherical mesh as input and apply spherical wavelet analysis and synthesis on it. In this paper, we describe our code and provide the user with enough details to reproduce the results which we present in this paper. This filter has a variety of applications including shape representation and shape analysis of brain surfaces, which was the initial motivation for this work. This paper is accompanied with the source code, input data, parameters and output data that the authors used for validating the spherical wavelet transform described in this paper.
Automatic Branch Decomposition for Tubular Structures
Authors: Xiong Guanglei , Xing Lei , Taylor Charles 
Published: January 2022

Branches of tubular structures (vasculature, trachea, neuron, etc.) in medical images are critical for the topology of these structures. In many applications, It is very helpful to be able to decompose tubular structures and identify every individual branch. For example, quantification of geometric vascular features, registration of trachea movement due to respiration, tracing of neuron path. However, manual decomposition can be tedious, time-consuming, and subject to operator bias. In this paper, we propose a novel method to decompose tubular structures automatically and describe how to implement it in ITK framework. The input is a 2D/3D binary image that can be obtained from any segmentation techniques, as well as the junctions, which can be generated automatically from our previously contributed ITK class: itk::JunctionDetectionFilter. The output will be branches with their labels and their connection. There are only two parameters which need to be set by the user. We provide here the implementation as a ITK class: itk::BranchDecompositionFilter. Please cite the following paper if you are interested in our work. G. Xiong, C. Chen, J. Chen, Y. Xie, and L. Xing, Tracking the Motion Trajectories of Junction Structures in 4D CT Images of the Lung, Vol. 57, No. 15, pp. 4905-4930, Physics in Medicine and Biology, 2012.
Large Image Streaming using ITKv4
Authors: Zuluaga Maria A. , Ibáñez Luis , Peyrin Françoise 
Published: January 2022

This document illustrates how to process large images (5 and 23 Gigabytes in size) by taking advantage of the streaming capabilities of the Insight Toolkit ITK. Here we illustrate two scenarios: (a) the case when the image itself is larger than the computer’s RAM, (b) the case when the image is large but still can fit in the computer’s RAM. This report is intended to serve as a tutorial on how to take advantage of this memory management capabilities of ITK version 4.This paper is accompanied with the source code, input data, parameters and output data that we used for validating the algorithm described in this paper. This adheres to the fundamental principle that scientific publications must facilitate reproducibility of the reported results.
ImageNetworkReader: an ITK Class for Loading Images Across a Network
Authors: Blezek Daniel 
Published: January 2022

This document describes a new class for the Insight Toolkit~(ITK www.itk.org) for reading images across a network. Network access is handled by CURL (http://curl.haxx.se/libcurl/), an Open Source library for client-side URL transfer. CURL supports the FTP, FTPS, HTTP, HTTPS, SCP, SFTP, TFTP, TELNET, DICT, LDAP, LDAPS and FILE protocols.This paper is accompanied with source code and a test to load a NRRD file across the network and verify that is is read properly.
Expectation Maximization of Gausian Mixture Models in VTK
Authors: Doria David 
Published: January 2022

Expectation maximization (EM) is a common technique for estimating the parameters of a model after having collected observations of data generated by the model. We first explain the algorithm, then present our impelementation. We focus on estimation of the parameters of a Gaussian Mixture Model (GMM). The implementation is written in the VTK framework and is provided as a new class, vtkExpectationMaximization.The code is hosted here: http://github.com/daviddoria/ExpectationMaximization for the time being.
Microscopy Image Analysis: Blob Segmentation using Geodesic Active Contours
Authors: Mosaliganti Kishore , Gelas Arnaud , Gouaillard Alexandre , Megason Sean 
Published: January 2022

An Insight Toolkit (ITK) processing framework for blob segmentation with applications to microscopy images is presented in this paper. Our algorithm is a reﬁnement of the work of Mosaliganti et al. [3] for splitting cell clusters. The basic idea is to incorporate as many cues as possible into developing a suitable level-set speed function so that an evolving contour exactly segments a cell/nuclei blob. We use image gradients, distance maps, multiple channel information and a shape model to drive the evolution. The framework consists of a linear pipeline of 6 new ITK ﬁlters which are applied in succession to generate the segmentation. The ﬁlters extract the cell foreground, construct the speed image, ﬁnd seed points for evolution and collect cell statistics from the segmentation. We include 2D/3D example code, parameter settings and show the results generated on confocal images of the zebraﬁsh embryo.
Fuzzy Clustering Algorithms for Image Segmentation
Authors: Rey Alberto , Castro Alfonso , Arcay Bernardino 
Published: January 2022

In this document we present the implementation of three fuzzy clustering algorithms using the Insight Toolkit ITK. Firstly, we developed the conventional Fuzzy C-Means that will serve as the basis for the rest of the proposed algorithms. The next algorithms are the FCM with spatial constraints based on kernel-induced distance and the Modified Spatial Kernelized Fuzzy C-Means. Both of these introduce a Kernel function, replacing the Euclidean distance of the FCM, and spatial information into the membership function.These algorithms have been implemented in a threaded version to take advantage of the multicore processors. Moreover, providing an useful implementation make it possible that classes work with 2D/3D images, different kernels and spatial shapes.We included the source code as well as different 2D/3D examples, using several input parameters for the algorithms and obtaining the results generated on 2D/3D CT lung studies.
DICOM Spatial Transform IO in the Insight Toolkit
Authors: Mccormick Matthew , Wang Kevin , Wang Kevin , Lasso Andras , Sharp Greg , Pieper Steve 
Published: January 2022

This document describes a module that extends the Insight Toolkit, ITK, which reads DICOM Spatial Rogistration Object files in itk::Transform’s. Currently, DICOM files are read by applying the DCMTK library as a backend. An itk::DCMTKTransformIO class can be registration with the IO factory mechanism so itk::TransformFileReadertemplate will recognize and read these files.This paper is accompanied with the source code, input data, parameters and output data that the authors used for validating the algorithm described in this paper. This adhere to the fundamental principle that scientific publications must facilitate reproducibility of the reported results.
An open, clinically-validated database of 3D+t cine-MR images of the left ventricle with associated manual and automated segmentation
Authors: Najman Laurent , Cousty Jean , Couprie Michel , Talbot Hugues , Clément-Guinaudeau Stéphanie , Goissen Thomas , Garot Jérome 
Published: January 2022

In this paper, we describe a database of cine-MR (3D+t) images of the left ventricle. This database contains the voxel data, one automated and two manual segmentations for each sequence of images. The segmentations are validated from a clinical point of view. We detail how the images were obtained, as well as how the associated segmentations were performed. We also provide the data clinical validation process.This database, including tools to compute quantitative measures and the software package used to obtain the automated segmentation, is freely available for research purposes.
A Generalized Squared Euclidean Distance Transform with Voronoi Maps
Authors: King Benjamin , Döker Rolf , Meier Simone , Shin Hoen-oh , Galanski Michael 
Published: January 2022

This document describes the implementation of an algorithm that computes a generalization of the distance transform with the squared euclidean metric.The generalization allows for interesting image operators, e.g. a morphologic dilation with euclidean ball structure elements that can vary in size across the image. Voronoi maps and the standard distance transform can be computed as well.The algorithm is provided as an image processing filter for ITK. Several example programs demonstrate its applications.
Non-rigid Groupwise Registration using B-Spline Deformation Model
Authors: Balci Serdar , Golland Polina , Wells William 
Published: January 2022

In this work, we extend a previously demonstrated entropy based groupwise registration method to include a non-rigid deformation model based on B-splines. We describe an open source implementation of the groupwise registration algorithm using the Insight Toolkit ITK. We provide the source code, parameters, input and output data that we used for validation.We describe an efficient implementation of the algorithm by using a stochastic optimization scheme embedded in a multi-resolution setting. The objective function is optimized using gradient descent algorithm combined with line search for the step size. The derivative of the objective function is evaluated efficiently by computing Jacobian of B-spline deformation field locally.We demonstrate the algorithm in application to different imaging modalities including proton density, FA, T1 and T2 MR images. We validate the algorithm on synthetic datasets varying from 2 to 30 images by recovering randomly applied affine and B-spline transforms.
Experimenting with Segmentation in ITK
Authors: Bilgin Cemal Cagatay 
Published: January 2022

This document describes some experiments for segmentation using the Insight Toolkit ITK . The code of the experiment is written following the ITK CodingStyle as described in the directory .Segmentation is still an open problem and there are quite a lot of algorithms specific to application domains and data being used. In this experiment I’ve used a 3-D MRA scan of Brain retrieved from MIDAS website. This paper is accompanied with the source code, input data, parameters and output data that the author used for experimenting with the algorithm.
Shaped Neighborhood based Flood Filled Conditional Iterators
Authors: Heibel Hauke , Groher Martin 
Published: January 2022

ITK’s flood filling iterator represents a way to visit pixels/voxels within an image having a specific connectivity. The iterator is initialized at known seed points and starting from these, neighbors that are within the desired connectivity are marked as to be visited and processed by the iterator in the future.The FloodFilledFunctionConditionalConstIterator builds the foundation for the implementation of the NeighborhoodConnectedImageFilter and is currently fixed to investigating 4-neighborhoods in 2D and 6-neighborhoods in 3D. Since many existing applications use region growing algorithms that perform on full neighborhoods (i.e. 8-connected in 2D and 26-connected in 3D) it is desirable to be able to choose at least between these two standard connectivities.In this document we describe the extension of the existing iterator to be using ShapedNeighborhoodIterators which has already been proposed in the implementation of the FloodFilledFunctionConditionalConstIterator.
Spherical Demons Registration of Spherical Surfaces
Authors: Ibanez Luis , Audette Michel , Yeo B.t. thomas , Goland Polina 
Published: January 2022

As demonstrated by the example videos accompanying this submission of the multiresolution implementation of Spherical Demons, the registration appears reasonable. However, we are still unable to replicate the warps from the stable and well verified implementation of this algorithm url{http://sites.google.com/site/yeoyeo02/software/sphericaldemonsrelease}.We find the average warp discrepancies between the original implementation and ITK implementation to be about 5.3 mm on a sphere of radius 100.0 mm (note that we do not expect a 100% agreement because of implementation differences, but 5.3 mm is relatively large). The submission also includes cortical surface meshes of 39 subjects and the corresponding segmentation labels of the cortical surfaces. Ultimately, the best validation would be to compare the overlap of these segmentation labels after registration. We welcome fellow ITK developers to work on this.Please note that this ITK implementation of the algorithm is currently being reviewed and tested in the NAMIC Sandbox at: url{http://svn.na-mic.org/NAMICSandBox/trunk/QuadEdgeMeshSphericalDiffeomorphicDemonsRegistration/}.If you want access to the stable and well verified implementation of this algorithm, please use the MATLAB code available at: url{http://sites.google.com/site/yeoyeo02/software/sphericaldemonsrelease}.This document describes a contribution to the Insight Toolkit intended to support the process of performing deformable registration on two Meshes. The method implemented here is restricted to Meshes with a Spherical geometry and topology, and with scalar values associated to their nodes. The code described here is an implementation of the paper “Spherical Demons: Fast Diffeomorphic Landmark-Free Surface Registration” by Yeo, Sabuncu, Vercauteren, Ayache, Fischl and Golland [3, 4].This paper is accompanied with the source code, input data, parameters and output data that we used for validating the algorithm described in this paper. This adheres to the fundamental principle that scientific publications must facilitate reproducibility of the reported results.
A Fast Approximation to the Bilateral Filter for ITK
Authors: Woehr Jordan 
Published: January 2022

This document describes an implementation of an alternative bilateral filtering algorithm in ITK. This class implements the fast bilateral filter algorithm in ITK by taking the input image and organizing it into the required data structure as an ITK Image with dimension one greater than the original image. The DiscreteGaussianImageFilter is then used to blur the higher dimensional image. The discrete Gaussian image filter was chosen because the kernel width used should usually be small due to the down-sampling involved when using this technique. As described in the ITK documentation, this class should outperform the recursive Gaussian algorithm due to the small kernel size DiscreteGaussianImageFilter.After the Gaussian blur has been completed the data will be interpolated and written to the output image.By incorporating this class into the ITK framework, this more efficient algorithm will be made available to all ITK users.
A Conditional Mesh Front Iterator for VTK
Authors: Doria David 
Published: January 2022

Region growing is a technique that can be used to propagate information over a mesh. In a previous submission, “A Mesh Front Iterator for VTK”, we introduced an iterator that can be used with vtkPointSet subclasses to traverse a mesh. It is sometimes useful to visit only vertices that are “similar” to their neighbors by some definition. This concept can be used to select many types of common regions, including planar regions or regions with similar color, to name a few. In this paper, we propose an iterator which propagates on a mesh using a condition test which can be easily modified.The latest code is available here: https://github.com/daviddoria/MeshConditionalFrontIterator
An image sampling framework for the ITK
Authors: Staring Marius , Klein Stefan 
Published: January 2022

This document describes the implementation of image samplers using the Insight Toolkit ITK url{www.itk.org}. Image samplers take a set of `picks’ from an image and store them in an array. A sample consists of the location of the pick (a point) and the corresponding image intensity (a value). Image samplers are useful for image registration, where samples are drawn from the fixed image in order to compute the similarity measure. Together with an image sampler base class, we introduce the following image samplers: 1) a full sampler that draws all voxel coordinates from the input image, 2) a grid sampler that draws samples from a user-specified regular voxel grid, 3 and 4) two random samplers that uniformly draw a user-specified number of samples from the input image.This paper is accompanied with the source code, input data, parameters and output data that the authors used for validating the algorithm described in this paper.
Polar Transforms for ITK
Authors: Bican Jakub 
Published: January 2022

Polar transform is a geometric transform, that transforms points form cartesian coordinates to so-called polar coordinates. In case of 2D space, a point in polar coordinate system is addressed by radius and angle. In image processing, polar transform is usually used to convert rotations around the origin of polar coordinate system to translations.This submission contains the implementation of forward and inverse polar transforms in two very simple classes for the Insight Toolkit.