To guarantee the safety of railway operations,the swift detection of rail surface defects becomes imperative.Traditional methods of manual inspection and conventional nondestructive testing prove inefficient,especiall...To guarantee the safety of railway operations,the swift detection of rail surface defects becomes imperative.Traditional methods of manual inspection and conventional nondestructive testing prove inefficient,especially when scaling to extensive railway networks.Moreover,the unpredictable and intricate nature of defect edge shapes further complicates detection efforts.Addressing these challenges,this paper introduces an enhanced Unified Perceptual Parsing for Scene Understanding Network(UPerNet)tailored for rail surface defect detection.Notably,the Swin Transformer Tiny version(Swin-T)network,underpinned by the Transformer architecture,is employed for adept feature extraction.This approach capitalizes on the global information present in the image and sidesteps the issue of inductive preference.The model’s efficiency is further amplified by the windowbased self-attention,which minimizes the model’s parameter count.We implement the cross-GPU synchronized batch normalization(SyncBN)for gradient optimization and integrate the Lovász-hinge loss function to leverage pixel dependency relationships.Experimental evaluations underscore the efficacy of our improved UPerNet,with results demonstrating Pixel Accuracy(PA)scores of 91.39%and 93.35%,Intersection over Union(IoU)values of 83.69%and 87.58%,Dice Coefficients of 91.12%and 93.38%,and Precision metrics of 90.85%and 93.41%across two distinct datasets.An increment in detection accuracy was discernible.For further practical applicability,we deploy semantic segmentation of rail surface defects,leveraging connected component processing techniques to distinguish varied defects within the same frame.By computing the actual defect length and area,our deep learning methodology presents results that offer intuitive insights for railway maintenance professionals.展开更多
Extracting geometric data of landmarks from fluoroscopic images plays an important role in camera calibration process of a fluoroscopic-image-based surgical navigation system. Connected components labeling is the esse...Extracting geometric data of landmarks from fluoroscopic images plays an important role in camera calibration process of a fluoroscopic-image-based surgical navigation system. Connected components labeling is the essential technique for the extraction. A new fast connected components labeling algorithm was presented. The definition of upward concave set was introduced to explain the algorithm. Feasibility and efficiency of the algorithm were verified with experiments. This algorithm performs well in labeling non-upward concave set connected components and applies to landmarks labeling well. Moreover, the proposed algorithm possesses a desirable characteristic that will facilitate the subsequent processing of fluoroscopic images.展开更多
A fast label-equivalence-based connected components labeling algorithm is proposed in this paper.It is a combination of two existing efficient methods,which are pivotal operations in two-pass connected components labe...A fast label-equivalence-based connected components labeling algorithm is proposed in this paper.It is a combination of two existing efficient methods,which are pivotal operations in two-pass connected components labeling algorithms.One is a fast pixel scan method,and the other is an array-based Union-Find data structure.The scan procedure assigns each foreground pixel a provisional label according to the location of the pixel.That is to say,it labels the foreground pixels following background pixels and foreground pixels in different ways,which greatly reduces the number of neighbor pixel checks.The array-based Union-Find data structure resolves the label equivalences between provisional labels by using only a single array with path compression,and it improves the efficiency of the resolving procedure which is very time-consuming in general label-equivalence-based algorithms.The experiments on various types of images with different sizes show that the proposed algorithm is superior to other labeling approaches for huge images containing many big connected components.展开更多
An analysis and computation method of connectivity between components that based on logical subtyping is first presented, the concepts of virtual interface and real interface, and quantitative analysis and computation...An analysis and computation method of connectivity between components that based on logical subtyping is first presented, the concepts of virtual interface and real interface, and quantitative analysis and computation formula of connectivity between interfaces are also introduced, that based on a extendable software architecture specification language model. We provide a new idea for solving the problem of connection between reuse components.展开更多
Let g and h be two transcendental entire functions. Suppose that the Fatou set F（goh） contains multiply connected components. In this article, we will consider the growth of the functions g and h.
This paper introduces CBFEM （component-based finite element model） which is a new method to analyze and design connections of steel structures. Design focused CM （component model） is compared to FEM （finite eleme...This paper introduces CBFEM （component-based finite element model） which is a new method to analyze and design connections of steel structures. Design focused CM （component model） is compared to FEM （finite elements models）. Procedure for composition of a model based on usual production process is used in CBFEM. Its results are compared to those obtained by component method for portal frame eaves moment connection with good agreement. Design of moment resistant column base is demonstrated by a case loaded by two directional bending moments and normal force. Interaction of several connections in one complex joint is explained in the last example. This paper aims to provide structural engineers with a new tool to effectively analyze and design various joints of steel structures.展开更多
In 2012, Hsu et al. generalized the classical connectivity of graph G and introduced the concept of g-component connectivity CK<sub>g</sub> (G) to measure the fault tolerance of networks. In this pape...In 2012, Hsu et al. generalized the classical connectivity of graph G and introduced the concept of g-component connectivity CK<sub>g</sub> (G) to measure the fault tolerance of networks. In this paper, we determine the g-component connectivity of some graphs, such as fan graph, helm graph, crown graph, Gear graph and the Mycielskian graph of star graph and complete bipartite graph.展开更多
Although cerebral neuroplasticity following amputation has been observed, little is understood about how network-level functional reorganization occurs in the brain following upper-limb amputation. The objective of th...Although cerebral neuroplasticity following amputation has been observed, little is understood about how network-level functional reorganization occurs in the brain following upper-limb amputation. The objective of this study was to analyze alterations in brain network functional connectivity(FC) in upper-limb amputees(ULAs). This observational study included 40 ULAs and 40 healthy control subjects;all participants underwent resting-state functional magnetic resonance imaging. Changes in intra-and inter-network FC in ULAs were quantified using independent component analysis and brain network FC analysis. We also analyzed the correlation between FC and clinical manifestations, such as pain. We identified 11 independent components using independent component analysis from all subjects. In ULAs, intra-network FC was decreased in the left precuneus(precuneus gyrus) within the dorsal attention network and left precentral(precentral gyrus) within the auditory network;but increased in the left Parietal_Inf(inferior parietal, but supramarginal and angular gyri) within the ventral sensorimotor network, right Cerebelum_Crus2(crus Ⅱ of cerebellum) and left Temporal_Mid(middle temporal gyrus) within the ventral attention network, and left Rolandic_Oper(rolandic operculum) within the auditory network. ULAs also showed decreased inter-network FCs between the dorsal sensorimotor network and ventral sensorimotor network, the dorsal sensorimotor network and right frontoparietal network, and the dorsal sensorimotor network and dorsal attention network. Correlation analyses revealed negative correlations between inter-network FC changes and residual limb pain and phantom limb pain scores, but positive correlations between inter-network FC changes and daily activity hours of stump limb. These results show that post-amputation plasticity in ULAs is not restricted to local remapping;rather, it also occurs at a network level across several cortical regions. This observation provides additional insights into the plasticity of brain networks after upper-limb amputation, and could contribute to identification of the mechanisms underlying post-amputation pain.展开更多
Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuris...Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network. We distinguish the different components and embed VN requests onto them respectively. And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component. On the other hand, load balancing is also considered in this paper. It could avoid blocked or bottlenecked area of substrate network. Simulation experiments show that compared with other algorithms in large-scale network, acceptance ratio, average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced. It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.展开更多
Image segmentation denotes a process for partitioning an image into distinct regions, it plays an important role in interpretation and decision making. A large variety of segmentation methods has been developed;among ...Image segmentation denotes a process for partitioning an image into distinct regions, it plays an important role in interpretation and decision making. A large variety of segmentation methods has been developed;among them, multidimensional histogram methods have been investigated but their implementation stays difficult due to the big size of histograms. We present an original method for segmenting n-D (where n is the number of components in image) images or multidimensional images in an unsupervised way using a fuzzy neighbourhood model. It is based on the hierarchical analysis of full n-D compact histograms integrating a fuzzy connected components labelling algorithm that we have realized in this work. Each peak of the histo- gram constitutes a class kernel, as soon as it encloses a number of pixels greater than or equal to a secondary arbitrary threshold knowing that a first threshold was set to define the degree of binary fuzzy similarity be- tween pixels. The use of a lossless compact n-D histogram allows a drastic reduction of the memory space necessary for coding it. As a consequence, the segmentation can be achieved without reducing the colors population of images in the classification step. It is shown that using n-D compact histograms, instead of 1-D and 2-D ones, leads to better segmentation results. Various images were segmented;the evaluation of the quality of segmentation in supervised and unsupervised of segmentation method proposed compare to the classification method k-means gives better results. It thus highlights the relevance of our approach, which can be used for solving many problems of segmentation.展开更多
Based on detailed analysis of advantages and disadvantages of the existing connected-component labeling （CCL） algorithm,a new algorithm for binary connected components labeling based on run-length encoding （RLE） a...Based on detailed analysis of advantages and disadvantages of the existing connected-component labeling （CCL） algorithm,a new algorithm for binary connected components labeling based on run-length encoding （RLE） and union-find sets has been put forward.The new algorithm uses RLE as the basic processing unit,converts the label merging of connected RLE into sets grouping in accordance with equivalence relation,and uses the union-find sets which is the realization method of sets grouping to solve the label merging of connected RLE.And the label merging procedure has been optimized：the union operation has been modified by adding the ＂weighted rule＂ to avoid getting a degenerated-tree,and the ＂path compression＂ has been adopted when implementing the find operation,then the time complexity of label merging is O（nα（n））.The experiments show that the new algorithm can label the connected components of any shapes very quickly and exactly,save more memory,and facilitate the subsequent image analysis.展开更多
An Intelligent Transportation System (ITS) is a new system developed for the betterment of user in traffic and transport management domain area for smart and safe driving. ITS subsystems are Emergency vehicle notifica...An Intelligent Transportation System (ITS) is a new system developed for the betterment of user in traffic and transport management domain area for smart and safe driving. ITS subsystems are Emergency vehicle notification systems, Automatic road enforcement, Collision avoidance systems, Automatic parking, Map database management, etc. Advance Driver Assists System (ADAS) belongs to ITS which provides alert or warning or information to the user during driving. The proposed method uses Gaussian filtering and Median filtering to remove noise in the image. Subsequently image subtraction is achieved by subtracting Median filtered image from Gaussian filtered image. The resultant image is converted to binary image and the regions are analyzed using connected component approach. The prior work on speed bump detection is achieved using sensors which are failed to detect speed bumps that are constructed with small height and the detection rate is affected due to erroneous identification. And the smartphone and accelerometer methodologies are not perfectly suitable for real time scenario due to GPS error, network overload, real-time delay, accuracy and battery running out. The proposed system goes very well for the roads which are constructed with proper painting irrespective of their dimension.展开更多
Based on the in-depth analysis of the interaction patterns between the components of software system in architecture, this paper illustrates that the association among them is complex and usually changeable during the...Based on the in-depth analysis of the interaction patterns between the components of software system in architecture, this paper illustrates that the association among them is complex and usually changeable during the running period. So we assume the interactions between two adjacency components are grouped into a single connector, which can be used to analyze the influence of components assembly on the survivability for software architecture. The survivability of the components assembly is mapped into the connectivity of graph model. We also bring forward a simplicity method to calculate and quantify the survivability of architecture that could provide a more usable model for designers to evaluate the architecture.展开更多
基金supported in part by the National Natural Science Foundation of China(Grant No.62066024)Gansu Province Higher Education Industry Support Plan(2021CYZC34)Lanzhou Talent Innovation and Entrepreneurship Project(2021-RC-27,2021-RC-45).
文摘To guarantee the safety of railway operations,the swift detection of rail surface defects becomes imperative.Traditional methods of manual inspection and conventional nondestructive testing prove inefficient,especially when scaling to extensive railway networks.Moreover,the unpredictable and intricate nature of defect edge shapes further complicates detection efforts.Addressing these challenges,this paper introduces an enhanced Unified Perceptual Parsing for Scene Understanding Network(UPerNet)tailored for rail surface defect detection.Notably,the Swin Transformer Tiny version(Swin-T)network,underpinned by the Transformer architecture,is employed for adept feature extraction.This approach capitalizes on the global information present in the image and sidesteps the issue of inductive preference.The model’s efficiency is further amplified by the windowbased self-attention,which minimizes the model’s parameter count.We implement the cross-GPU synchronized batch normalization(SyncBN)for gradient optimization and integrate the Lovász-hinge loss function to leverage pixel dependency relationships.Experimental evaluations underscore the efficacy of our improved UPerNet,with results demonstrating Pixel Accuracy(PA)scores of 91.39%and 93.35%,Intersection over Union(IoU)values of 83.69%and 87.58%,Dice Coefficients of 91.12%and 93.38%,and Precision metrics of 90.85%and 93.41%across two distinct datasets.An increment in detection accuracy was discernible.For further practical applicability,we deploy semantic segmentation of rail surface defects,leveraging connected component processing techniques to distinguish varied defects within the same frame.By computing the actual defect length and area,our deep learning methodology presents results that offer intuitive insights for railway maintenance professionals.
基金Projectof Science and Technology Committee of Shanghai Municipality(No2528(3))
文摘Extracting geometric data of landmarks from fluoroscopic images plays an important role in camera calibration process of a fluoroscopic-image-based surgical navigation system. Connected components labeling is the essential technique for the extraction. A new fast connected components labeling algorithm was presented. The definition of upward concave set was introduced to explain the algorithm. Feasibility and efficiency of the algorithm were verified with experiments. This algorithm performs well in labeling non-upward concave set connected components and applies to landmarks labeling well. Moreover, the proposed algorithm possesses a desirable characteristic that will facilitate the subsequent processing of fluoroscopic images.
基金Sponsored by the National Natural Science Foundation of China (Grant No. 81071219)
文摘A fast label-equivalence-based connected components labeling algorithm is proposed in this paper.It is a combination of two existing efficient methods,which are pivotal operations in two-pass connected components labeling algorithms.One is a fast pixel scan method,and the other is an array-based Union-Find data structure.The scan procedure assigns each foreground pixel a provisional label according to the location of the pixel.That is to say,it labels the foreground pixels following background pixels and foreground pixels in different ways,which greatly reduces the number of neighbor pixel checks.The array-based Union-Find data structure resolves the label equivalences between provisional labels by using only a single array with path compression,and it improves the efficiency of the resolving procedure which is very time-consuming in general label-equivalence-based algorithms.The experiments on various types of images with different sizes show that the proposed algorithm is superior to other labeling approaches for huge images containing many big connected components.
基金Supported by the National Natural Science Foundation of China (6 98730 6 )
文摘An analysis and computation method of connectivity between components that based on logical subtyping is first presented, the concepts of virtual interface and real interface, and quantitative analysis and computation formula of connectivity between interfaces are also introduced, that based on a extendable software architecture specification language model. We provide a new idea for solving the problem of connection between reuse components.
文摘Let g and h be two transcendental entire functions. Suppose that the Fatou set F（goh） contains multiply connected components. In this article, we will consider the growth of the functions g and h.
文摘This paper introduces CBFEM （component-based finite element model） which is a new method to analyze and design connections of steel structures. Design focused CM （component model） is compared to FEM （finite elements models）. Procedure for composition of a model based on usual production process is used in CBFEM. Its results are compared to those obtained by component method for portal frame eaves moment connection with good agreement. Design of moment resistant column base is demonstrated by a case loaded by two directional bending moments and normal force. Interaction of several connections in one complex joint is explained in the last example. This paper aims to provide structural engineers with a new tool to effectively analyze and design various joints of steel structures.
文摘In 2012, Hsu et al. generalized the classical connectivity of graph G and introduced the concept of g-component connectivity CK<sub>g</sub> (G) to measure the fault tolerance of networks. In this paper, we determine the g-component connectivity of some graphs, such as fan graph, helm graph, crown graph, Gear graph and the Mycielskian graph of star graph and complete bipartite graph.
基金supported by the National Natural Science Foundation of China, No.81974331(to XYZ)Shanghai Municipal Education Commission-Gaofeng Clinical Medicine Grant, No.20161429(to XYZ)
文摘Although cerebral neuroplasticity following amputation has been observed, little is understood about how network-level functional reorganization occurs in the brain following upper-limb amputation. The objective of this study was to analyze alterations in brain network functional connectivity(FC) in upper-limb amputees(ULAs). This observational study included 40 ULAs and 40 healthy control subjects;all participants underwent resting-state functional magnetic resonance imaging. Changes in intra-and inter-network FC in ULAs were quantified using independent component analysis and brain network FC analysis. We also analyzed the correlation between FC and clinical manifestations, such as pain. We identified 11 independent components using independent component analysis from all subjects. In ULAs, intra-network FC was decreased in the left precuneus(precuneus gyrus) within the dorsal attention network and left precentral(precentral gyrus) within the auditory network;but increased in the left Parietal_Inf(inferior parietal, but supramarginal and angular gyri) within the ventral sensorimotor network, right Cerebelum_Crus2(crus Ⅱ of cerebellum) and left Temporal_Mid(middle temporal gyrus) within the ventral attention network, and left Rolandic_Oper(rolandic operculum) within the auditory network. ULAs also showed decreased inter-network FCs between the dorsal sensorimotor network and ventral sensorimotor network, the dorsal sensorimotor network and right frontoparietal network, and the dorsal sensorimotor network and dorsal attention network. Correlation analyses revealed negative correlations between inter-network FC changes and residual limb pain and phantom limb pain scores, but positive correlations between inter-network FC changes and daily activity hours of stump limb. These results show that post-amputation plasticity in ULAs is not restricted to local remapping;rather, it also occurs at a network level across several cortical regions. This observation provides additional insights into the plasticity of brain networks after upper-limb amputation, and could contribute to identification of the mechanisms underlying post-amputation pain.
基金supported in part by the National Natural Science Foundation of China under Grant No.61471055
文摘Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network. We distinguish the different components and embed VN requests onto them respectively. And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component. On the other hand, load balancing is also considered in this paper. It could avoid blocked or bottlenecked area of substrate network. Simulation experiments show that compared with other algorithms in large-scale network, acceptance ratio, average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced. It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.
文摘Image segmentation denotes a process for partitioning an image into distinct regions, it plays an important role in interpretation and decision making. A large variety of segmentation methods has been developed;among them, multidimensional histogram methods have been investigated but their implementation stays difficult due to the big size of histograms. We present an original method for segmenting n-D (where n is the number of components in image) images or multidimensional images in an unsupervised way using a fuzzy neighbourhood model. It is based on the hierarchical analysis of full n-D compact histograms integrating a fuzzy connected components labelling algorithm that we have realized in this work. Each peak of the histo- gram constitutes a class kernel, as soon as it encloses a number of pixels greater than or equal to a secondary arbitrary threshold knowing that a first threshold was set to define the degree of binary fuzzy similarity be- tween pixels. The use of a lossless compact n-D histogram allows a drastic reduction of the memory space necessary for coding it. As a consequence, the segmentation can be achieved without reducing the colors population of images in the classification step. It is shown that using n-D compact histograms, instead of 1-D and 2-D ones, leads to better segmentation results. Various images were segmented;the evaluation of the quality of segmentation in supervised and unsupervised of segmentation method proposed compare to the classification method k-means gives better results. It thus highlights the relevance of our approach, which can be used for solving many problems of segmentation.
文摘Based on detailed analysis of advantages and disadvantages of the existing connected-component labeling （CCL） algorithm,a new algorithm for binary connected components labeling based on run-length encoding （RLE） and union-find sets has been put forward.The new algorithm uses RLE as the basic processing unit,converts the label merging of connected RLE into sets grouping in accordance with equivalence relation,and uses the union-find sets which is the realization method of sets grouping to solve the label merging of connected RLE.And the label merging procedure has been optimized：the union operation has been modified by adding the ＂weighted rule＂ to avoid getting a degenerated-tree,and the ＂path compression＂ has been adopted when implementing the find operation,then the time complexity of label merging is O（nα（n））.The experiments show that the new algorithm can label the connected components of any shapes very quickly and exactly,save more memory,and facilitate the subsequent image analysis.
文摘An Intelligent Transportation System (ITS) is a new system developed for the betterment of user in traffic and transport management domain area for smart and safe driving. ITS subsystems are Emergency vehicle notification systems, Automatic road enforcement, Collision avoidance systems, Automatic parking, Map database management, etc. Advance Driver Assists System (ADAS) belongs to ITS which provides alert or warning or information to the user during driving. The proposed method uses Gaussian filtering and Median filtering to remove noise in the image. Subsequently image subtraction is achieved by subtracting Median filtered image from Gaussian filtered image. The resultant image is converted to binary image and the regions are analyzed using connected component approach. The prior work on speed bump detection is achieved using sensors which are failed to detect speed bumps that are constructed with small height and the detection rate is affected due to erroneous identification. And the smartphone and accelerometer methodologies are not perfectly suitable for real time scenario due to GPS error, network overload, real-time delay, accuracy and battery running out. The proposed system goes very well for the roads which are constructed with proper painting irrespective of their dimension.
基金the National High Technology Research and Development Program of China (2007AA012420)
文摘Based on the in-depth analysis of the interaction patterns between the components of software system in architecture, this paper illustrates that the association among them is complex and usually changeable during the running period. So we assume the interactions between two adjacency components are grouped into a single connector, which can be used to analyze the influence of components assembly on the survivability for software architecture. The survivability of the components assembly is mapped into the connectivity of graph model. We also bring forward a simplicity method to calculate and quantify the survivability of architecture that could provide a more usable model for designers to evaluate the architecture.
