Point Representation Research Articles

Identifikasi Lokasi Pemusatan Fasilitas Rumah Sakit Kota di Surakarta

Health is the optimal general state of one's body, mind, and spirit. Someone can do an activity because there is a healthy body so in general everyone always tries to stay healthy. The availability and convenience of health facilities is one of the efforts made by the government to improve the quality of public health. The purpose of this study with the Mean center method and Density estimation analysis with Heatmap, is to gain a better understanding of data distribution patterns. The Mean center method is used to determine the central point of distribution of data which can then be used as a reference to analyze and understand further distribution patterns. From this analysis it can be concluded that the Mean center method can help in identifying the center point or midpoint in the Surakarta area, describing the ideal location in Surakarta City, this method allows geographical representation of the center point using geographical coordinates such as latitude and longtitude which can then provide an easy understanding of the relative location of the center point of the hospital to other hospitals in the region. The results of the Mean center show that the center point of the hospital is located in Kelurahan Kestalan, Kecamatan, Banjarsari Surakarta City. Density estimation results in 3 (three) concentration clusters in Surakarta City. This helps local governments in plans to add health facilities, because of the gap in the northern, central and southern regions.

Information hiding using approximate POSIT representation

AbstractPOSIT is a numerical system consists of sign, regime, exponential, and fraction bits to overcome some limitations of the IEEE‐754 floating point (FP) representation. This work proposes a technique to hide critical information in the least significant bits (LSBs) of the POSIT FP representation by exploiting approximate computing (AC). The proposed technique, called information hiding using POSIT and LSB (IHUPL), explores the opportunities offered by both the POSIT representation and the AC to hide information with a minimum loss in accuracy and other performance metrics. IHUPL offers two options for hiding information: either by embedding one digit of each character into each pixel or by embedding all the digits of the character at the same time into each pixel of the alpha‐red, green, blue, or black/white image. Experimental results are evaluated for benchmark images and showed that IHUPL enhanced the accuracy of embedding data into LSB of POSIT FP by an average of 5%, the image quality improvement rates of IHUPL are 19% and 16% for options 1 and 2, respectively. Besides the encoding method using IHUPL, the paper outlines an extraction decoding technique that saves the original replacement bits in a key‐image to recover the hidden security message.

An Approach for Cipher Communication Utilizing the Concepts of Elliptic Curve Cryptography

Message encryption is a process of protection of the original data in transmission. Several cryptosystems were designed in the history for different environments. Public key or Asymmetric cryptosystem has become more popular in recent era where the key space consists both public and private keys. Elliptic curve cryptography dominates public key cryptosystems like Diffie Hellman key exchange and RSA. ECC is more powerful and alternative technique of RSA, with a simple replacement of exponent calculations of large prime numbers to mathematical representation of Elliptic curve points. Besides the computation ECC works with shorter key length than RSA. The present paper describes an encryption algorithm using elliptic curves over finite fields. Here a group of authentic users transmit.

PointUR-RL: Unified Self-Supervised Learning Method Based on Variable Masked Autoencoder for Point Cloud Reconstruction and Representation Learning

Self-supervised learning has made significant progress in point cloud processing. Currently, the primary tasks of self-supervised learning, which include point cloud reconstruction and representation learning, are trained separately due to their structural differences. This separation inevitably leads to increased training costs and neglects the potential for mutual assistance between tasks. In this paper, a self-supervised method named PointUR-RL is introduced, which integrates point cloud reconstruction and representation learning. The method features two key components: a variable masked autoencoder (VMAE) and contrastive learning (CL). The VMAE is capable of processing input point cloud blocks with varying masking ratios, ensuring seamless adaptation to both tasks. Furthermore, CL is utilized to enhance the representation learning capabilities and improve the separability of the learned representations. Experimental results confirm the effectiveness of the method in training and its strong generalization ability for downstream tasks. Notably, high-accuracy classification and high-quality reconstruction have been achieved with the public datasets ModelNet and ShapeNet, with competitive results also obtained with the ScanObjectNN real-world dataset.

ANALYSIS OF RESOLVING EFFICIENT DOMINATING SET AND ITS APPLICATION SCHEME IN SOLVING ETLE PROBLEMS

This research focuses on the analysis of Resolving Efficient Dominating Set (REDS) and its application in solving Electronic Traffic Law Enforcement (ETLE) problems using the Spatial Temporal Graph Neural Network (STGNN). Resolving Efficient Dominating Set (REDS) is a concept in graph theory that studies a set of points in a graph that efficiently monitors other points. It involves ensuring that each point v ∈ V (G) - D is dominated by exactly one point in D, with no adjacent points in D, and the representation of point v ∈ V (G) concerning D is not the same, which is termed as a resolving efficient dominating set. In the context of Electronic Traffic Law Enforcement (ETLE), the analysis of REDS has a significant impact. The theorem resulting from the analysis of REDS enables the determination of the number of traffic violation sensors required. Furthermore, by taking simulation data from road points, violation forecasting can be performed. The accurate predictions from this forecasting can assist authorities in anticipating and addressing traffic violation issues more effectively.

PCDNF: Revisiting Learning-Based Point Cloud Denoising via Joint Normal Filtering.

Point cloud denoising is a fundamental and challenging problem in geometry processing. Existing methods typically involve direct denoising of noisy input or filtering raw normals followed by point position updates. Recognizing the crucial relationship between point cloud denoising and normal filtering, we re-examine this problem from a multitask perspective and propose an end-to-end network called PCDNF for joint normal filtering-based point cloud denoising. We introduce an auxiliary normal filtering task to enhance the network's ability to remove noise while preserving geometric features more accurately. Our network incorporates two novel modules. First, we design a shape-aware selector to improve noise removal performance by constructing latent tangent space representations for specific points, taking into account learned point and normal features as well as geometric priors. Second, we develop a feature refinement module to fuse point and normal features, capitalizing on the strengths of point features in describing geometric details and normal features in representing geometric structures, such as sharp edges and corners. This combination overcomes the limitations of each feature type and better recovers geometric information. Extensive evaluations, comparisons, and ablation studies demonstrate that the proposed method outperforms state-of-the-art approaches in both point cloud denoising and normal filtering.

Beyond Grids: Scaling Up Continuous Kernels via Adaptive Point Representations for Sensor-Based Human Activity Recognition

Beyond Grids: Scaling Up Continuous Kernels via Adaptive Point Representations for Sensor-Based Human Activity Recognition

Linguistic-Driven Partial Semantic Relevance Learning for Skeleton-Based Action Recognition.

Skeleton-based action recognition, renowned for its computational efficiency and indifference to lighting variations, has become a focal point in the realm of motion analysis. However, most current methods typically only extract global skeleton features, overlooking the potential semantic relationships among various partial limb motions. For instance, the subtle differences between actions such as "brush teeth" and "brush hair" are mainly distinguished by specific elements. Although combining limb movements provides a more holistic representation of an action, relying solely on skeleton points proves inadequate for capturing these nuances. Therefore, integrating detailed linguistic descriptions into the learning process of skeleton features is essential. This motivates us to explore integrating fine-grained language descriptions into the learning process of skeleton features to capture more discriminative skeleton behavior representations. To this end, we introduce a new Linguistic-Driven Partial Semantic Relevance Learning framework (LPSR) in this work. While using state-of-the-art large language models to generate linguistic descriptions of local limb motions and further constrain the learning of local motions, we also aggregate global skeleton point representations and textual representations (which generated from an LLM) to obtain a more generalized cross-modal behavioral representation. On this basis, we propose a cyclic attentional interaction module to model the implicit correlations between partial limb motions. Numerous ablation experiments demonstrate the effectiveness of the method proposed in this paper, and our method also obtains state-of-the-art results.

Vision‐Based Online Key Point Estimation of Deformable Robots

The precise control of soft and continuum robots requires knowledge of their shape, which has, in contrast to classical rigid robots, infinite degrees of freedom. To partially reconstruct the shape, proprioceptive techniques use built‐in sensors, resulting in inaccurate results and increased fabrication complexity. Exteroceptive methods so far rely on expensive tracking systems with reflective markers placed on all components, which are infeasible for deformable robots interacting with the environment due to marker occlusion and damage. Here, a regression approach is presented for three‐dimensional key point estimation using a convolutional neural network. The proposed approach uses data‐driven supervised learning and is capable of online markerless estimation during inference. Two images of a robotic system are captured simultaneously at 25 Hz from different perspectives and fed to the network, which returns for each pair the parameterized key point or piecewise constant curvature shape representations. The proposed approach outperforms markerless state‐of‐the‐art methods by a maximum of 4.5% in estimation accuracy while being more robust and requiring no prior knowledge of the shape. Online evaluations on two types of soft robotic arms and a soft robotic fish demonstrate the method's accuracy and versatility on highly deformable systems.

Dynamically Enhanced lane detection with multi-scale semantic feature fusion

Lane detection plays a crucial role in autonomous driving technology, and there have been many recent advancements in 3D lane detection methods. One common approach is simplifying the problem by transforming images into Bird's Eye View (BEV) space. However, existing methods still have limitations, particularly in accurately identifying lanes in many complex autonomous driving scenarios, such as slopes and extreme weather conditions. Therefore, this paper proposes a dynamically updated lane detection method called DynamicallyLane. This method utilizes ConvNeXt V2-N deformations as the backbone for feature extraction, employs dynamic learnable encoding and deformable attention mechanisms, achieves precise conversion from the frontal view to BEV through a novel representation of 3D reference points, and utilizes the Enhanced BEV Features module for feature fusion, obtaining richer and more semantically informative feature representations to facilitate the model learning process better. Experimental results demonstrate that DynamicallyLane achieves an F-score of 56.2 % on the OpenLane dataset and performs excellently on the Apollo 3D Synthetic dataset. Our code is available at https://github.com/Tafble/lane_detection.

A Closest Point Method for PDEs on Manifolds with Interior Boundary Conditions for Geometry Processing

Many geometry processing techniques require the solution of partial differential equations (PDEs) on manifolds embedded in \(\mathbb {R}^2 \) or \(\mathbb {R}^3 \) , such as curves or surfaces. Such manifold PDEs often involve boundary conditions (e.g., Dirichlet or Neumann) prescribed at points or curves on the manifold’s interior or along the geometric (exterior) boundary of an open manifold. However, input manifolds can take many forms (e.g., triangle meshes, parametrizations, point clouds, implicit functions, etc.). Typically, one must generate a mesh to apply finite element-type techniques or derive specialized discretization procedures for each distinct manifold representation. We propose instead to address such problems in a unified manner through a novel extension of the closest point method (CPM) to handle interior boundary conditions. CPM solves the manifold PDE by solving a volumetric PDE defined over the Cartesian embedding space containing the manifold, and requires only a closest point representation of the manifold. Hence, CPM supports objects that are open or closed, orientable or not, and of any codimension. To enable support for interior boundary conditions we derive a method that implicitly partitions the embedding space across interior boundaries. CPM’s finite difference and interpolation stencils are adapted to respect this partition while preserving second-order accuracy. Additionally, we develop an efficient sparse-grid implementation and numerical solver that can scale to tens of millions of degrees of freedom, allowing PDEs to be solved on more complex manifolds. We demonstrate our method’s convergence behaviour on selected model PDEs and explore several geometry processing problems: diffusion curves on surfaces, geodesic distance, tangent vector field design, harmonic map construction, and reaction-diffusion textures. Our proposed approach thus offers a powerful and flexible new tool for a range of geometry processing tasks on general manifold representations.

A novel geometric method based on conformal geometric algebra applied to the resection problem in two and three dimensions

This paper introduces a novel method for solving the resection problem in two and three dimensions based on conformal geometric algebra (CGA). Advantage is taken because of the characteristics of CGA, which enables the representation of points, lines, planes, and volumes in a unified mathematical framework and offers a more intuitive and geometric understanding of the problem, in contrast to existing purely algebraic methods. Several numerical examples are presented to demonstrate the efficacy of the proposed method and to compare its validity with established techniques in the field. Numerical simulations indicate that our vector geometric algebra implementation is faster than the best-known algorithms to date, suggesting that the proposed GA-based methods can provide a more efficient and comprehensible solution to the two- and three-dimensional resection problem, paving the way for further applications and advances in geodesy research. Furthermore, the method’s emphasis on graphical and geometric representation makes it particularly suitable for educational purposes, allowing the reader to grasp the concepts and principles of resection more effectively. The proposed method has potential applications in a wide range of other fields, including surveying, robotics, computer vision, or navigation.

DATFNets-dynamic adaptive assigned transformer network for fire detection

Fires cause severe damage to the ecological environment and threaten human life and property. Although the traditional convolutional neural network method effectively detects large-area fires, it cannot capture small fires in complex areas through a limited receptive field. At the same time, fires can change at any time due to the influence of wind direction, which challenges fire prevention and control personnel. To solve these problems, a novel dynamic adaptive distribution transformer detection framework is proposed to help firefighters and researchers develop optimal fire management strategies. On the one hand, this framework embeds a context aggregation layer with a masking strategy in the feature extractor to improve the representation of low-level and salient features. The masking strategy can reduce irrelevant information and improve network generalization. On the other hand, designed a dynamic adaptive direction conversion function and sample allocation strategy to fully use adaptive point representation while achieving accurate positioning and classification of fires and screening out representative fire samples in complex backgrounds. In addition, to prevent the network from being limited to the local optimum and discrete points in the sample from causing severe interference to the overall performance, designed a weighted loss function with spatial constraints to optimize the network and penalize the discrete points in the sample. The mAP in the three baseline data sets of FireDets, WildFurgFires, and FireAndSmokes are 0.871, 0.909, and 0.955, respectively. The experimental results are significantly better than other detection methods, which proves that the proposed method has good robustness and detection performance.

Weakly Supervised Learning Method for Semantic Segmentation of Large-Scale 3D Point Cloud Based on Transformers

Abstract. Nowadays, semantic segmentation results of 3D point cloud have been widely applied in the fields of robotics, autonomous driving, and augmented reality etc. Thanks to the development of relevant deep learning models (such as PointNet), supervised training methods have become hotspot, in which two common limitations exists: inferior feature representation of 3D points and massive annotations. To improve 3D point feature, inspired by the idea of transformer, we employ a so-call LCP network that extracts better feature by investigating attentions between target 3D points and its corresponding local neighbors via local context propagation. Training transformer-based network needs amount of training samples, which itself is a labor-intensive, costly and error-prone work, therefore, this work proposes a weakly supervised framework, in particular, pseudo-labels are estimated based on the feature distances between unlabeled points and prototypes, which are calculated based on labeled data. The extensive experimental results show that, the proposed PL-LCP can yield considerable results (67.6% mIOU for indoor and 67.3% for outdoor) even if only using 1% real labels, and comparing to several state-of-the-art method using all labels, we achieve superior results in mIOU, OA for indoor (65.9%, 89.2%).

Reduced-order modeling on a near-term quantum computer

Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems of equations as well as systems of linear ordinary differential equations (ODEs) and partial differential equations (PDEs). Reduced-order modeling (ROM) algorithms for studying fluid dynamics have shown success in identifying linear operators that can describe flowfields, where dynamic mode decomposition (DMD) is a particularly useful method in which a linear operator is identified from data. In this work, DMD is reformulated as an optimization problem to propagate the state of the linearized dynamical system on a quantum computer. This reformulation was chosen as a means of facilitating implementation on a near-term quantum computer. Quadratic unconstrained binary optimization (QUBO), a technique for optimizing quadratic polynomials in binary variables, allows for quantum annealing algorithms to be applied. A quantum circuit model (quantum approximation optimization algorithm, QAOA) is utilized to obtain predictions of the state trajectories. Results are shown for the quantum-ROM predictions for flow over a 2D cylinder at Re = 220 and flow over a NACA0009 airfoil at Re = 500 and α=15∘. The quantum-ROM predictions are found to depend on the number of bits utilized for a fixed point representation and the truncation level of the DMD model. Comparisons with DMD predictions from a classical computer algorithm are made, as well as an analysis of the computational complexity and prospects for future, more fault-tolerant quantum computers.

DBGCN

Given the extensive use of online learning in educational settings, Knowledge Tracing (KT) is becoming increasingly essential. KT primarily aims to predict a student's future knowledge acquisition based on their past learning activities, thus enhancing the efficiency of student learning. However, the effective acquisition of dynamic and evolving student representations from their historical records presents a formidable challenge. This paper introduces a Knowledge Tracing methodology predicated on Dynamic Broadth Graph Convolutional Networks (DBGCN). DBGCN leverages the mechanisms of breadth graph convolutional networks to proficiently acquire representations of questions and knowledge points from dynamically constructed topological graphs. It employs student state information as an attention query vector to augment student representations, thereby partially mitigating the challenge of capturing the dynamic shifts in user states. The effectiveness of our proposed DBGCN method has been demonstrated through extensive experimentation.

Automatic tooth arrangement with joint features of point and mesh representations via diffusion probabilistic models

Tooth arrangement is a crucial step in orthodontics treatment, in which aligning teeth could improve overall well-being, enhance facial aesthetics, and boost self-confidence. To improve the efficiency of tooth arrangement and minimize errors associated with unreasonable designs by inexperienced practitioners, some deep learning-based tooth arrangement methods have been proposed. Currently, most existing approaches employ MLPs to model the nonlinear relationship between tooth features and transformation matrices to achieve tooth arrangement automatically. However, the limited datasets (which to our knowledge, have not been made public) collected from clinical practice constrain the applicability of existing methods, making them inadequate for addressing diverse malocclusion issues. To address this challenge, we propose a general tooth arrangement neural network based on the diffusion probabilistic model. Conditioned on the features extracted from the dental model, the diffusion probabilistic model can learn the distribution of teeth transformation matrices from malocclusion to normal occlusion by gradually denoising from a random variable, thus more adeptly managing real orthodontic data. To take full advantage of effective features, we exploit both mesh and point cloud representations by designing different encoding networks to extract the tooth (local) and jaw (global) features, respectively. In addition to traditional metrics ADD, PA-ADD, CSA, and MErot, we propose a new evaluation metric based on dental arch curves to judge whether the generated teeth meet the individual normal occlusion. Experimental results demonstrate that our proposed method achieves state-of-the-art tooth alignment results and satisfactory occlusal relationships between dental arches. We will publish the code and dataset.

Compact HD Map Construction via Douglas-Peucker Point Transformer

High-definition (HD) map construction requires a comprehensive understanding of traffic environments, encompassing centimeter-level localization and rich semantic information. Previous works face challenges in redundant point representation or high-complexity curve modeling. In this paper, we present a flexible yet effective map element detector that synthesizes hierarchical information with a compact Douglas-Peucker (DP) point representation in a transformer architecture for robust and reliable predictions. Specifically, our proposed representation approximates class-agnostic map elements with DP points, which are sparsely located in crucial positions of structures and can get rid of redundancy and complexity. Besides, we design a position constraint with uncertainty to avoid potential ambiguities. Moreover, pairwise-point shape matching constraints are proposed to balance local structural information of different scales. Experiments on the public nuScenes dataset demonstrate that our method overwhelms current SOTAs. Extensive ablation studies validate each component of our methods. Codes will be released at https://github.com/sweety121/DPFormer.

Learning Multimodal Volumetric Features for Large-Scale Neuron Tracing

The current neuron reconstruction pipeline for electron microscopy (EM) data usually includes automatic image segmentation followed by extensive human expert proofreading. In this work, we aim to reduce human workload by predicting connectivity between over-segmented neuron pieces, taking both microscopy image and 3D morphology features into account, similar to human proofreading workflow. To this end, we first construct a dataset, named FlyTracing, that contains millions of pairwise connections of segments expanding the whole fly brain, which is three orders of magnitude larger than existing datasets for neuron segment connection. To learn sophisticated biological imaging features from the connectivity annotations, we propose a novel connectivity-aware contrastive learning method to generate dense volumetric EM image embedding. The learned embeddings can be easily incorporated with any point or voxel-based morphological representations for automatic neuron tracing. Extensive comparisons of different combination schemes of image and morphological representation in identifying split errors across the whole fly brain demonstrate the superiority of the proposed approach, especially for the locations that contain severe imaging artifacts, such as section missing and misalignment. The dataset and code are available at https://github.com/Levishery/Flywire-Neuron-Tracing.

Sampling of healthcare professionals' perspective on point-of-care technologies from 2019-2021: A survey of benefits, concerns, and development.

Point-of-care technology (POCT) plays a vital role in modern healthcare by providing a fast diagnosis, improving patient management, and extending healthcare access to remote and resource-limited areas. The objective of this study was to understand how healthcare professionals in the United States perceived POCTs during 2019-2021 to assess the decision-making process of implementing these newer technologies into everyday practice. A 5-point Likert scale survey was sent to respondents to evaluate their perceptions of benefits, concerns, characteristics, and development of point-of-care technologies. The 2021 survey was distributed November 1st, 2021- February 15th, 2022, with a total of 168 independent survey responses received. Of the respondents, 59% identified as male, 73% were white, and 48% have been in practice for over 20 years. The results showed that most agreed that POCTs improve patient management (94%) and improve clinician confidence in decision making (92%). Healthcare professionals were most concerned with potentially not being reimbursed for the cost of the POCT (37%). When asked to rank the top 3 important characteristics of POCT, respondents chose accuracy, ease of use, and availability. It is important to note this survey was conducted during the COVID-19 pandemic. To achieve an even greater representation of healthcare professionals' point of view on POCTs, further work to obtain responses from a larger, more diverse population of providers is needed.