Lidars and cameras play essential roles in autonomous driving, offering complementary information for 3D detection. The state-of-the-art fusion methods integrate them at the feature level, but they mostly rely on the ...
ISBN:
(纸本)9783031723346;9783031723353
Lidars and cameras play essential roles in autonomous driving, offering complementary information for 3D detection. The state-of-the-art fusion methods integrate them at the feature level, but they mostly rely on the learned soft association between point clouds and images, which lacks interpretability and neglects the hard association between them. In this paper, we combine feature-level fusion with point-level fusion, using hard association established by the calibration matrices to guide the generation of object queries. Specifically, in the early fusion stage, we use the 2D CNN features of images to decorate the point cloud data, and employ two independent sparse convolutions to extract the decorated point cloud features. In the mid-level fusion stage, we initialize the queries with a center heatmap and embed the predicted class labels as auxiliary information into the queries, making the initial positions closer to the actual centers of the targets. Extensive experiments conducted on two popular datasets, i.e. KITTI, Waymo, demonstrate the superiority of DecoratingFusion.
The detection of concavity and convexity of vertices and edges of three-dimensional (3D) geometric objects is a classic problem in the field of computer graphics. As the foundation of other related graphics algorithms...
详细信息
ISBN:
(纸本)9783031500787;9783031500770
The detection of concavity and convexity of vertices and edges of three-dimensional (3D) geometric objects is a classic problem in the field of computer graphics. As the foundation of other related graphics algorithms and operations, scholars have proposed many algorithms for determining the concavity and convexity of vertices and edges. However, existing concavity and convexity detection algorithms mainly focus on vertices and not on concavity and convexity detection methods for edges of 3D geometric objects. Furthermore, existing algorithms often require different detectionmethods when dealingwith two-dimensional (2D) planar geometric objects and 3D spatial geometric objects. This means that the algorithm structure of those algorithms becomes very complex when dealing with concavity and convexity judgments involving both planar polygon vertices and 3D geometric object edges. To solve the above problems, this paper proposes a multi-dimensional unified concave convex detection algorithm framework for geometric objects taking advantage of geometric algebra in multi-dimensional unified expression and calculation. The method proposed in this article can not only achieve concavity and convexity detection of planar polygon vertices and 3D geometric object vertices based on unified rules, but also further achieve concavity and convexity detection of 3D geometric object edges on this basis. By unifying the framework and detection rules of different dimensional geometric object concavity detection algorithms, the complexity of synchronous detection algorithms for planar polygon vertices and 3D geometric object vertices and edges concavity can be effectively simplified.
The reliable and repeatable evaluation of interactive, conversational, or generative IR systems is an ongoing research topic in the field of retrieval evaluation. One proposed solution is to fully automate evaluation ...
ISBN:
(纸本)9783031717352;9783031717369
The reliable and repeatable evaluation of interactive, conversational, or generative IR systems is an ongoing research topic in the field of retrieval evaluation. One proposed solution is to fully automate evaluation through simulated user behavior and automated relevance judgments. Still, simulation frameworks were technically quite complex and have not been widely adopted. Recently, however, easy access to large language models has drastically lowered the hurdles for both user behavior simulation and automated judgments. We therefore argue that it is high time to investigate how simulation-based evaluation setups should be evaluated themselves. In this position paper, we present GenIRSim, a flexible and easy-to-use simulation and evaluation framework for generative IR, and we explore GenIRSim's parameter space to identify open research questions on evaluating simulation-based evaluation setups.
When solving very large scale problems on parallel computer platforms, we consider the advantages of domain decomposition in strips or layers, compared to general domain decomposition splitting techniques. The layer s...
详细信息
ISBN:
(纸本)9783031562075;9783031562082
When solving very large scale problems on parallel computer platforms, we consider the advantages of domain decomposition in strips or layers, compared to general domain decomposition splitting techniques. The layer sub-domains are grouped in pairs, ordered as odd-even respectively even-odd and solved by a Schwarz alternating iteration method, where the solution at the middle interfaces of the odd-even groups is used as Dirichlet boundary conditions for the even-odd ordered groups and vice versa. To stabilize the method the commonly used coarse mesh method can be replaced by a coarse-fine mesh method. A component analysis of the arising eigenvectors demonstrates that this solution framework leads to very few Schwarz iterations. The resulting coarse-fine mesh method entails a coarse mesh of a somewhat large size. In this study it is solved by two methods, a modified Cholesky factorization of the whole coarse mesh matrix and a block-diagonal preconditioner, based on the coarse mesh points and the inner node points. Extensive numerical tests show that the latter method, being also computationally cheaper, needs very few iterations, in particular when the domain has been divided in many layers and the coarse to fine mesh size ratio is not too large.
The development of well-engineered quality ontologies is crucial to ensure capabilities of ontologies such as enhanced communication, knowledge reuse, and knowledge analytical capabilities. Ontology engineers conduct ...
ISBN:
(纸本)9783031646072;9783031646089
The development of well-engineered quality ontologies is crucial to ensure capabilities of ontologies such as enhanced communication, knowledge reuse, and knowledge analytical capabilities. Ontology engineers conduct comprehensive evaluations to ensure ontology quality by utilising multiple tools and approaches. However, the ontology evaluators encountered challenges in choosing appropriate evaluation tools and approaches, especially in the context of a decision support system where knowledge accuracy, completeness and relevancy are highly required. This study discusses the challenges encountered when assessing ontology quality, primarily considering the agriculture domain and highlights anomalies in the existing evaluation tools. Consequently, the study developed a tool which addresses the identified limitations in the existing tools. This tool includes measures for assessing crucial quality characteristics related to agriculture ontologies, such as complexity, completeness, consistency, modularity, and comprehensibility. Further, it supports developers in gaining valuable insights to mitigate the issues associated with these key quality characteristics of ontologies.
Flexible job shop scheduling problem with energy and makespan minimization objectives, and uncertain processing times that are modeled with intervals is addressed in this work. The problem is solved by a genetic algor...
ISBN:
(纸本)9783031611360;9783031611377
Flexible job shop scheduling problem with energy and makespan minimization objectives, and uncertain processing times that are modeled with intervals is addressed in this work. The problem is solved by a genetic algorithm using a lexicographic goal programming approach and the results evaluated with respect to the lower and upper bounds that come from various sources and methods.
Operator Precedence Languages (OPL) have been recently identified as a suitable formalism for model checking recursive procedural programs, thanks to their ability of modeling the program stack. OPL requirements can b...
ISBN:
(纸本)9783031656262;9783031656279
Operator Precedence Languages (OPL) have been recently identified as a suitable formalism for model checking recursive procedural programs, thanks to their ability of modeling the program stack. OPL requirements can be expressed in the Precedence Oriented Temporal Logic (POTL), which features modalities to reason on the natural matching between function calls and returns, exceptions, and other advanced programming constructs that previous approaches, such as Visibly Pushdown Languages, cannot model effectively. Existing approaches for model checking of POTL have been designed following the explicit-state, automata-based approach, a feature that severely limits their scalability. In this paper, we give the first symbolic, SMT-based approach for model checking POTL properties. While previous approaches construct the automaton for both the POTL formula and the model of the program, we encode them into a (sequence of) SMT formulas. The search of a trace of the model witnessing a violation of the formula is then carried out by an SMT-solver, in a Bounded Model Checking fashion. We carried out an experimental evaluation, which shows the effectiveness of the proposed solution.
HEAppE Middleware is IT4Innovations' in-house implementation of HPC-as-a-Service concept. It is being continuously developed for a more than a 10 years taking into account the user requirements and security polici...
ISBN:
(纸本)9783031488023;9783031488030
HEAppE Middleware is IT4Innovations' in-house implementation of HPC-as-a-Service concept. It is being continuously developed for a more than a 10 years taking into account the user requirements and security policies and constraints of different HPC or Data centres while supporting a number of widely used HPC workload managers. Via simple and easy-to-use REST API the end-users can manage the complete HPC job life cycle, file transfers, and HEAppE-specific functionality. HEAppE provides a user-friendly, secure, and cost-effective solution for the end-users or third-party applications on how to remotely access supercomputing resources without the HPC-specific know-how.
Fenghe and Zhenhua proposed a short and provable secure lattice-based signature scheme in the standard model in 2016. Their aim was to construct a short signature without using any lattice delegation technique. They c...
ISBN:
(数字)9783031515835
ISBN:
(纸本)9783031515828;9783031515835
Fenghe and Zhenhua proposed a short and provable secure lattice-based signature scheme in the standard model in 2016. Their aim was to construct a short signature without using any lattice delegation technique. They claimed that their scheme is strongly unforgeable under the hardness of the shortest integer solution (SIS) problem. In this article, we highlight a flaw in the signature scheme proposed by Fenghe and Zhenhua. We show that an adversary can generate a valid message-signature pair by solving a linear system of equations. We also show that the design of the scheme leaks some information about the secret key.
The representation of some elementary geometric concepts in the conformal geometric algebra of three dimensions are reviewed, and their connections to a recently discovered extension of Heron's formula for the are...
ISBN:
(数字)9783031340314
ISBN:
(纸本)9783031340307;9783031340314
The representation of some elementary geometric concepts in the conformal geometric algebra of three dimensions are reviewed, and their connections to a recently discovered extension of Heron's formula for the area of a triangle to the volume of a tetrahedron are discussed.
暂无评论