SearcharxivSearch

arXiv subjects

Cesar H. Comin

Publications and source records attributed to Cesar H. Comin.

At least 19 recordsLinked to original sources

VessShape: Few-shot 2D blood vessel segmentation by leveraging shape priors from synthetic images

Semantic segmentation of blood vessels is an important task in medical image analysis, but its progress is often hindered by the scarcity of large annotated datasets and the poor generalization of models across different imaging modalities. A key aspect is the tendency of Convolutional Neural Networks (CNNs) to learn texture-based features, which limits their performance when applied to new domains with different visual characteristics. We hypothesize that leveraging geometric priors of vessel shapes, such as their tubular and branching nature, can lead to more robust and data-efficient models. To investigate this, we introduce VessShape, a methodology for generating large-scale 2D synthetic datasets designed to instill a shape bias in segmentation models. VessShape images contain procedurally generated tubular geometries combined with a wide variety of foreground and background textures, encouraging models to learn shape cues rather than textures. We demonstrate that a model pre-trained on VessShape images achieves strong few-shot segmentation performance on two real-world datasets from different domains, requiring only four to ten samples for fine-tuning. Furthermore, the model exhibits notable zero-shot capabilities, effectively segmenting vessels in unseen domains without any target-specific training. Our results indicate that pre-training with a strong shape bias can be an effective strategy to overcome data scarcity and improve model generalization in blood vessel segmentation.

cs.CV

An Analysis of the Influence of Transfer Learning When Measuring the Tortuosity of Blood Vessels

Characterizing blood vessels in digital images is important for the diagnosis of many types of diseases as well as for assisting current researches regarding vascular systems. The automated analysis of blood vessels typically requires the identification, or segmentation, of the blood vessels in an image or a set of images, which is usually a challenging task. Convolutional Neural Networks (CNNs) have been shown to provide excellent results regarding the segmentation of blood vessels. One important aspect of CNNs is that they can be trained on large amounts of data and then be made available, for instance, in image processing software for wide use. The pre-trained CNNs can then be easily applied in downstream blood vessel characterization tasks such as the calculation of the length, tortuosity, or caliber of the blood vessels. Yet, it is still unclear if pre-trained CNNs can provide robust, unbiased, results on downstream tasks when applied to datasets that they were not trained on. Here, we focus on measuring the tortuosity of blood vessels and investigate to which extent CNNs may provide biased tortuosity values even after fine-tuning the network to the new dataset under study. We show that the tortuosity values obtained by a CNN trained from scratch on a dataset may not agree with those obtained by a fine-tuned network that was pre-trained on a dataset having different tortuosity statistics. In addition, we show that the improvement in segmentation performance when fine-tuning the network does not necessarily lead to a respective improvement on the estimation of the tortuosity. To mitigate the aforementioned issues, we propose the application of specific data augmentation techniques even in situations where they do not improve segmentation performance.

eess.IV

How does the Topology of City Streets Impact on their Respective Optimization?

Several natural and artificial structures and systems are somehow optimized for performing specific functionalities. The structure and topology of cities is no exception, as it is critically important to ensure effective access to the several resources as well as overall mobility. The present work addresses the important subject of improving the plan of a given city through the incorporation of avenues and other express ways such as bridges and tunnels. More specifically, we start with the topology of a real city and consider the incorporation of a express way between any two locations in the city, keeping one location fixed and varying the angle of the other. The whole city area is covered in this manner, which allows us to derive a respective energy surface indicating the gain obtained regarding the average shortest path length for each of the possible situations. These surfaces therefore provide a complete picture of how much each city can be improved regarding minimal distances. Quite distinct surfaces have been obtained for 18 considered European cities. These surfaces are then characterized in terms of the number of local extrema and respective spatial complexity, expressed in terms of a raggedness measurement. Measurements are also obtained respectively to the geometry and topology of the considered cities. It is shown that the shortest path gain depends strongly on some of the considered measurements, especially lacunarity and transitivity. Interestingly, the intricacy of the energy surfaces resulted in relatively little correlation with the topological and geometrical measurements.

physics.soc-ph

Estimating the Effects of Urban Green Regions in terms of Diffusion

The interaction between cities and their respective green regions corresponds to an interesting issue that has received growing attention over the last decades. These relationships have multiple natures, ranging from providing habitat for animal life to temperature and humidity dynamics. Several methods based on area, size, shape, and distance have been considered in the literature. Given that several important contributions of green regions to urban areas involve temperature, humidity and gases (e.g.~oxygen) exchanges, which are intrinsically related to physical diffusion, it becomes particularly interesting to simulate the diffusion of green effects over urban areas as a means of better understanding the respective influences. The present work reports a related approach. Once the green regions of a given city are automatically identified by semantic segmentation and have eventual artifacts eliminated, successive convolutions are applied as a means to obtain the unfolding of the diffusion of the green effects along time. As illustrated, the diffusion dynamics is intrinsically interesting because it can be strongly affected by the spatial distribution of the green mass. In particular, we observed that smaller green regions could substantially contribute to the diffusion. The reported approach has been illustrated with respect to the Brazilian city of Ribeirao Preto, whose small and medium-sized green regions were found to complement in an effective manner the diffusion of the green effects as inferred from the performed simulations under specific parameter settings.

physics.soc-ph

Modeling the Perspectives for Scientific Advancement

The development of science constitutes itself an important subject of scientific investigation.Indeed, better knowledge about this intricate dynamical system can provide subsidies for enhancing the manners in which science progresses. Recently, a network science-based approach was reported aimed at characterizing and studying the prospects for scientific advancement assuming that new pieces of knowledge are incorporated in a uniformly random manner. A surprising result was reported in the sense that quite similar advancements were observe for both Erdős-Rényi (ER) and Barabási-Albert (BA) knowledge networks. In the present work, we develop a systematic complementation of that preliminary investigation, considering an additional network model, the random geometric graph (GR) as well as several other manners to incorporating knowledge, namely preferential to node degree, preferential to closer or adjacent nodes, as well as taking into account the betweenness centrality of the unknown nodes. Several interesting results were obtained and discussed, including: the uniform strategy led to the best expansion in the GR model, the results of the degree and betweenness expansion for the ER and GR models were similar to those obtained using uniformity method in those same models. Surprisingly, the BA model led to just a slightly faster expansion than in the uniform case. Though qualitatively similar, strategies based on the degree and betweenness yielded distinct results as a consequence of them not being linearly related.

physics.soc-ph

Spatial distribution of graffiti: A complex network approach

Despite the great differences among cities, they face similar challenges regarding social inequality, politics and criminality. Urban art express these feelings from the citizen point-of-view. In particular, the drawing and painting of public surfaces may carry rich information about the time and region it was made. Existing studies have explored the spatial distribution of graffiti, but most of them considered graffiti as a whole, with no separation among the types. Also, the analyses rarely take into account the city topology. In this work, we propose to categorize the graffiti into three types: simple scribbles, complex scribbles, canvases. We analyze the spatial distribution and identify the spatial bias of each type. To further analyze the spatial distribution of the types, we apply concepts from complex networks. First, regions (communities) defined by the connectivity profiles of the city network are obtained and the prevalence of each type of graffiti over these regions are analyzed. Next, a measure based on the dynamics of the network (accessibility) is calculated and compared to the distribution of the graffiti types. A case study is performed in the analysis of three different categories of graffiti in the city of Sao Paulo, Brazil. The results showed that the categories present characteristic spatial distributions. The ratio of each type per community of the network, though, does not pose significant deviations. Finally, a small positive correlation was observed between the locations of each graffiti type and the accessibility.

physics.soc-ph

Classification of abrupt changes along viewing profiles of scientific articles

With the expansion of electronic publishing, a new dynamics of scientific articles dissemination was initiated. Nowadays, many works are widely disseminated even before publication, in the form of preprints. Another important new element concerns the views of published articles. Thanks to the availability of respective data by some journals, such as PLoS ONE, it became possible to develop investigations on how scientific works are viewed along time, often before the first citations appear. This provides the main theme of the present work. More specifically, our research was motivated by preliminary observations that the view profiles along time tend to present a piecewise linear nature. A methodology was then delineated in order to identify the main segments in the view profiles, which allowed several related measurements to be derived. In particular, we focused on the inclination and length of each subsequent segment. Basic statistics indicated that the inclination can vary substantially along subsequent segments, while the segment lengths resulted more stable. Complementary joint statistics analysis, considering pairwise correlations, provided further information about the properties of the views. In order to better understand the view profiles, we performed respective multivariate statistical analysis, including principal component analysis and hierarchical clustering. The results suggest that a portion of the polygonal views are organized into clusters or groups. These groups were characterized in terms of prototypes indicating the relative increase or decrease along subsequent segments. Four respective distinct models were then developed for representing the observed segments. It was found that models incorporating joint dependencies between the properties of the segments provided the most accurate results among the considered alternatives.

cs.DL

Revisiting Agglomerative Clustering

An important issue in clustering concerns the avoidance of false positives while searching for clusters. This work addressed this problem considering agglomerative methods, namely single, average, median, complete, centroid and Ward's approaches applied to unimodal and bimodal datasets obeying uniform, gaussian, exponential and power-law distributions. A model of clusters was also adopted, involving a higher density nucleus surrounded by a transition, followed by outliers. This paved the way to defining an objective means for identifying the clusters from dendrograms. The adopted model also allowed the relevance of the clusters to be quantified in terms of the height of their subtrees. The obtained results include the verification that many methods detect two clusters in unimodal data. The single-linkage method was found to be more resilient to false positives. Also, several methods detected clusters not corresponding directly to the nucleus. The possibility of identifying the type of distribution was also investigated.

cs.LG

Shortest Paths in Complex Networks: Structure and Optimization

Among the several topological properties of complex networks, the shortest path represents a particularly important characteristic because of its potential impact not only on other topological properties, but mainly for its influence on several dynamical processes taking place on the network. In addition, several practical situations, such as transit in cities, can benefit by modifying a network so as to reduce the respective shortest paths. In the present work, we addressed the problem of trying to reduce the average shortest path of several theoretical and real-world complex networks by adding a given number of links according to different strategies. More specifically, we considered: placing new links between nodes with relatively low and high degrees; to enhance the degree regularity of the network; preferential attachment according to the degree; linking nodes with relatively low and high betweenness centrality; and linking nodes with relatively low/low, low/high, and high/high accessibilities. Several interesting results have been obtained, including the identification of the accessibility-based strategies as providing the largest reduction of the average shortest path length. Another interesting finding is that, for several types of networks, the degree-based methods tend to provide improvements comparable to those obtained by using the much more computationally expensive betweenness centrality measurement.

cs.SI

Distance-Based Network Partitioning

A new method for identifying communities in networks is proposed. Reference nodes, either selected using a priory information about the network or according to relevant node measurements, are obtained so as to indicate putative communities. Distance vectors between each network node and the reference nodes are then used for defining a coordinate system representing the community structure of the network at many different scales. For modular networks, the distribution of nodes in this space often results in a well-separated clustered structure, with each cluster corresponding to a community. One interesting feature of the reported methodology for community finding is that the coordinate system defined by the seeds allows an intuitive and direct interpretation of the situation of each node with respect to the considered communities. The potential of the method is illustrated with respect to a community detection benchmark, a spatial network model and to city streets networks.

cs.SI

Intelligent Complex Networks

The present work addresses the issue of using complex networks as artificial intelligence mechanisms. More specifically, we consider the situation in which puzzles, represented as complex networks of varied types, are to be assembled by complex network processing engines of diverse structures. The puzzle pieces are initially distributed on a set of nodes chosen according to different criteria, including degree and eigenvector centrality. The pieces are then repeatedly copied to the neighboring nodes. The provision of buffering of different sizes are also investigated. Several interesting results are identified, including the fact that BA-based assembling engines tend to provide the fastest solutions. It is also found that the distribution of pieces according to the eigenvector centrality almost invariably leads to the best performance. Another result is that using the buffer sizes proportional to the degree of the respective nodes tend to improve the performance.

physics.soc-ph

Malleability of complex networks

Most complex networks are not static, but evolve along time. Given a specific configuration of one such changing network, it becomes a particularly interesting issue to quantify the diversity of possible unfoldings of its topology. In this work, we suggest the concept of malleability of a network, which is defined as the exponential of the entropy of the probabilities of each possible unfolding with respect to a given configuration. We calculate the malleability with respect to specific measurements of the involved topologies. More specifically, we identify the possible topologies derivable from a given configuration and calculate some topological measurement of them (e.g. clustering coefficient, shortest path length, assortativity, etc.), leading to respective probabilities being associated to each possible measurement value. Though this approach implies some level of degeneracy in the mapping from topology to measurement space, it still paves the way to inferring the malleability of specific network types with respect to given topological measurements. We report that the malleability, in general, depends on each specific measurement, with the average shortest path length and degree assortativity typically leading to large malleability values. The maximum malleability was observed for the Wikipedia network and the minimum for the Watts-Strogatz model.

physics.soc-ph

Can Spatiality Promote Diversity?

Real-world dynamics running on networks can be characterized in terms of their respective diversity, or heterogeneity of state values. Spatial networks can be understood as networks exhibiting limited small world characteristics. In the present work we argue that network spatiality can enhance the diversity of respectively unfolding dynamics. This also means that the small world property tends to reduce diversity. We illustrate this conjecture by simulating one type of Sznajd dynamics at the transient regime on Watts-Strogatz networks with varying rewiring levels. The obtained results show a marked reduction of state diversity as spatiality is replaced by the small world property.

physics.soc-ph

Principal Component Analysis: A Natural Approach to Data Exploration

Principal component analysis (PCA) is often used for analyzing data in the most diverse areas. In this work, we report an integrated approach to several theoretical and practical aspects of PCA. We start by providing, in an intuitive and accessible manner, the basic principles underlying PCA and its applications. Next, we present a systematic, though no exclusive, survey of some representative works illustrating the potential of PCA applications to a wide range of areas. An experimental investigation of the ability of PCA for variance explanation and dimensionality reduction is also developed, which confirms the efficacy of PCA and also shows that standardizing or not the original data can have important effects on the obtained results. Overall, we believe the several covered issues can assist researchers from the most diverse areas in using and interpreting PCA.

cs.CE

The Dynamics of Knowledge Acquisition via Self-Learning in Complex Networks

Studies regarding knowledge organization and acquisition are of great importance to understand areas related to science and technology. A common way to model the relationship between different concepts is through complex networks. In such representations, network's nodes store knowledge and edges represent their relationships. Several studies that considered this type of structure and knowledge acquisition dynamics employed one or more agents to discover node concepts by walking on the network. In this study, we investigate a different type of dynamics considering a single node as the "network brain". Such brain represents a range of real systems such as the information about the environment that is acquired by a person and is stored in the brain. To store the discovered information in a specific node, the agents walk on the network and return to the brain. We propose three different dynamics and test them on several network models and on a real system, which is formed by journal articles and their respective citations. Surprisingly, the results revealed that, according to the adopted walking models, the efficiency of self-knowledge acquisition has only a weak dependency on the topology, search strategy and localization of the network brain.

cs.SI

Note: Distance-Based Network Partitioning

A new method for identifying soft communities in networks is proposed. Reference nodes, either selected using a priori information about the network or according to relevant node measurements, are obtained. Distance vectors between each network node and the reference nodes are then used for defining a multidimensional coordinate system representing the community structure of the network at many different scales. For modular networks, the distribution of nodes in this space often results in a well-separated clustered structure, with each cluster corresponding to a community. The potential of the method is illustrated with respect to a spatial network model and the Zachary's karate club network.

physics.soc-ph

How Integrated are Theoretical and Applied Physics?

How well integrated are more theoretically and application oriented works in Physics currently? This interesting question, which has several relevant implications, has been approached mostly in a more subjective way. Recent concepts and methods from network science are used in the current work in order to develop a more principled, quantitative and objective approach to gauging the integration and centrality of more theoretical/applied journals within the APS journals database, represented as a directed and undirected citation network. The results suggest a surprising level of integration between more theoretically and application oriented journals, which are also characterized by remarkably similar centralities in the network.

physics.soc-ph

Topology and Dynamics in Complex Networks: The Role of Edge Reciprocity

A key issue in complex systems regards the relationship between topology and dynamics. In this work, we use a recently introduced network property known as steering coefficient as a means to approach this issue with respect to different directed complex network systems under varying dynamics. Theoretical and real-world networks are considered, and the influences of reciprocity and average degree on the steering coefficient are quantified. A number of interesting results are reported that can assist the design of complex systems exhibiting larger or smaller relationships between topology and dynamics.

physics.soc-ph