Application of a Fast Connected Components Labeling Algorithm in Processing Landmark Images

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 connected components labeling algorithm for binary 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 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.

On the growth of transcendental entire functions with multiply connected 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.

Rail Surface Defect Detection Based on Improved UPerNet and Connected Component Analysis

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.

3D Kronecker Convolutional Feature Pyramid for Brain Tumor Semantic Segmentation in MR Imaging

Brain tumor significantly impacts the quality of life and changes everything for a patient and their loved ones.Diagnosing a brain tumor usually begins with magnetic resonance imaging(MRI).The manual brain tumor diagnosis from the MRO images always requires an expert radiologist.However,this process is time-consuming and costly.Therefore,a computerized technique is required for brain tumor detection in MRI images.Using the MRI,a novel mechanism of the three-dimensional(3D)Kronecker convolution feature pyramid(KCFP)is used to segment brain tumors,resolving the pixel loss and weak processing of multi-scale lesions.A single dilation rate was replaced with the 3D Kronecker convolution,while local feature learning was performed using the 3D Feature Selection(3DFSC).A 3D KCFP was added at the end of 3DFSC to resolve weak processing of multi-scale lesions,yielding efficient segmentation of brain tumors of different sizes.A 3D connected component analysis with a global threshold was used as a post-processing technique.The standard Multimodal Brain Tumor Segmentation 2020 dataset was used for model validation.Our 3D KCFP model performed exceptionally well compared to other benchmark schemes with a dice similarity coefficient of 0.90,0.80,and 0.84 for the whole tumor,enhancing tumor,and tumor core,respectively.Overall,the proposed model was efficient in brain tumor segmentation,which may facilitate medical practitioners for an appropriate diagnosis for future treatment planning.

Use of a submodel method to check the bolt strength of marine equipment

A submodel method was proposed that works from computational models of marine gear cases to verify that the proposed bolts will give it sufficient structural integrity. Calculations for marine equipment using this system accorded well with conventional results. As an example, an anti-shock computation was processed for a gear case, and the submodel was then employed to check the strength of individual components. The results showed that the gear case connecting structure can satisfy relative anti-shock requirements, and the dynamic response characteristics seen in the bolt structures had a close relationship with the method used for attaching the bolt. This provides a new means for checking the strength of connecting structures on large-scale equipment and thus has significant reference value.

A new approach for real time object detection and tracking on high resolution and multi-camera surveillance videos using GPU

High resolution cameras and multi camera systems are being used in areas of video surveillance like security of public places, traffic monitoring, and military and satellite imaging. This leads to a demand for computational algorithms for real time processing of high resolution videos. Motion detection and background separation play a vital role in capturing the object of interest in surveillance videos, but as we move towards high resolution cameras, the time-complexity of the algorithm increases and thus fails to be a part of real time systems. Parallel architecture provides a surpass platform to work efficiently with complex algorithmic solutions. In this work, a method was proposed for identifying the moving objects perfectly in the videos using adaptive background making, motion detection and object estimation. The pre-processing part includes an adaptive block background making model and a dynamically adaptive thresholding technique to estimate the moving objects. The post processing includes a competent parallel connected component labelling algorithm to estimate perfectly the objects of interest. New parallel processing strategies are developed on each stage of the algorithm to reduce the time-complexity of the system. This algorithm has achieved a average speedup of 12.26 times for lower resolution video frames(320×240, 720×480, 1024×768) and 7.30 times for higher resolution video frames(1360×768, 1920×1080, 2560×1440) on GPU, which is superior to CPU processing. Also, this algorithm was tested by changing the number of threads in a thread block and the minimum execution time has been achieved for 16×16 thread block. And this algorithm was tested on a night sequence where the amount of light in the scene is very less and still the algorithm has given a significant speedup and accuracy in determining the object.

On Commuting Graph of Group Ring Z_nS_3

The commuting graph of an arbitrary ring R, denoted by Г（R）, is a graph whose vertices are all non-central elements of R, and two distinct vertices a and b are adjacent if and only if ab = ba. In this paper, we investigate the connectivity and the diameter of Г（ZnS3）. We show that Г（ZnS3） is connected if and only if n is not a prime number. If Г（ZnS3） is connected then diam（Г（ZnS3）） = 3, while ifГ（ZnS3） is disconnected then every connected component of Г（ZnS3） must be a complete graph with same size, and we completely determine the vertice set of every connected component.

Robust Virtual Network Embedding Based on Component Connectivity in Large-Scale Network

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.

Real Time Speed Bump Detection Using Gaussian Filtering and Connected Component Approach

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.

An advanced segmentation using area and boundary tracing technique in extraction of lungs region

A new method is presented for the segmentation of pulmonary parenchyma. The proposed method is based on the area calculation of different objects in the image. The main purpose of the proposed algorithm is the segment of the lungs images from the computer tomography(CT) images. The original image is binarized using the bit-plane slicing technique and among the different images the best binarized image is chosen. After binarization, the labeling is done and the area of each label is calculated from which the next level of binarized image is obtained. Then, the boundary tracing algorithm is applied to get another level of binarized image. The proposed method is able to extract lung region from the original images. The experimental results show the significance of the proposed method.

A Practical Parallel Algorithm for Propositional Knowledge Base Revision

Different methods for revising propositional knowledge base have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a revision method in special case, and gives a corresponding polynomial algorithm as well as its parallel version on CREW PRAM.

The hamiltonicity on the competition graphs of round digraphs

Given a digraph D =（V, A）, the competition graph G of D, denoted by C（D）, has the same set of vertices as D and an edge between vertices x and y if and only if N;（x）∩N;（y）≠Ф. In this paper, we investigate the competition graphs of round digraphs and give a necessary and sufficient condition for these graphs to be hamiltonian.

TOPOLOGICAL AND GEOMETRIC PROPERTY OF MATRIX ALGEBRA

Let B（R^n） be the set of all n x n real matrices, Sr the set of all matrices with rank r, 0 ≤ r ≤ n, and Sr^# the number of arcwise connected components of Sr. It is well-known that Sn =GL（R^n） is a Lie group and also a smooth hypersurface in B（R^n） with the dimension n × n.

A Note on the Prime Spectrums of Character Rings of Finite Groups

Let G be a finite group with order g and S be a subring of the algebraic number field which contains the integral extension over Z generated by a g-th primitive root co of unity, and R（G） be the character ring of G. The prime spectrum of the commutative ring S×Z R（G） iv denoted by Spec（S×Z R（G）） and set π={p｜p is a rational prime number such that p^-1 S}. We prove that when G is a regroup, a π＇-group, or a finite Abelian group, the number of the connetted components of Spec（ S×Z R （G） ） coincides with the number of the π-regular classes in G,

Fast Object Extraction and Euler Number on Block Represented Images

The identification of objects in binary images is a fundamental task in image analysis and pattern recognition tasks. The Euler number of a binary image is an important topological measure which is used as a feature in image analysis. In this paper, a very fast algorithm for the detection and localization of the objects and the computation of the Euler number of a binary image is proposed. The proposed algorithm operates in one scan of the image and is based on the Image Block Representation (IBR) scheme. The proposed algorithm is more efficient than conventional pixel based algorithms in terms of execution speed and representation of the extracted information.

On Connected Components of Skew Group Algebras

Let A be a basic connected finite dimensional associative algebra over an algebraically closed field k and G be a cyclic group.There is a quiver QGwith relationsρG such that the skew group algebras A[G]is Morita equivalent to the quotient algebra of path algebra kQGmodulo ideal(ρG).Generally,the quiver QGis not connected.In this paper we develop a method to determine the number of connect components of QG.Meanwhile,we introduce the notion of weight for underlying quiver of A such that A is G-graded and determine the connect components of smash product A#kG*.

Design for structural flexibility using connected morphable components based topology optimization

In topology optimization of structures considering flexibility, degenerated optimal solutions, such as hinges, gray areas and disconnected structures may appear. In this paper, built upon the newly developed morphable component based topology optimization approach, a novel representation using connected morphable components(CMC) and a linkage scheme are proposed to prevent degenerating designs and to ensure structure integrity. A lower bound condition of the thickness of each component is also incorporated to completely remove the smallest components in an optimal configuration. Designs of flexible structures, such as compliant mechanism design, maximum compliance structure design, and design of low-frequency resonating micro devices are studied to validate the proposed methodology. Our work demonstrates that the new methodology can successfully prevent degeneration solutions and possesses other advantages, such as minimum member size control in topology optimization of flexible structures.

Structural properties and generative model of non-giant connected components in social networks

Most previous studies have mainly focused on the analyses of one entire network(graph) or the giant connected components of networks. In this paper, we investigate the disconnected components(non-giant connected component) of some real social networks, and report some interesting discoveries about structural properties of disconnected components. We study three diverse, real networks and compute the significance profile of each component. We discover some similarities in the local structure between the giant connected component and disconnected components in diverse social networks. Then we discuss how to detect network attacks based on the local structure properties of networks. Furthermore, we propose an empirical generative model called i Friends to generate networks that follow our observed patterns.

SEMI-ALGEBRAICALLY CONNECTED COMPONENTS OF MINIMUM POINTS OF A POLYNOMIAL FUNCTION

In a recent article, the authors provided an effective algorithm for both computing the global infimum of f and deciding whether or not the infimum of f is attained, where f is a multivariate polynomial over the field R of real numbers. As a complement, the authors investigate the semi- algebraically connected components of minimum points of a polynomial function in this paper. For a given multivariate polynomial f over R, it is shown that the above-mentioned algorithm can find at least one point in each semi-algebraically connected component of minimum points of f whenever f has its global minimum.