Search results

Accurate and automatic clothing pattern making is very important in personalized clothing customization and virtual fitting room applications. Clothing pattern generating as well as virtual clothing simulation is an attractive research issue both in clothing industry and computer graphics.

Physics-based method is an effective way to model dynamic process and generate realistic clothing animation. Due to conceptual simplicity and computational speed, mass-spring model is frequently used to simulate deformable and soft objects follow the natural physical rules. We present a physics-based clothing pattern generating framework by using scanned human body model. After giving a scanned human body model, first, we extract feature points, planes and curves on the 3D model by geometric analysis, and then, we construct a remeshed surface which has been formatted to connected quad meshes. Second, for each clothing piece in 3D, we construct a mass-spring model with same topological structures, and conduct a typical time integration algorithm to the mass-spring model. Finally, we get the convergent clothing pieces in 2D of all clothing parts, and we reconnected parts which are adjacent on 3D model to generate the basic clothing pattern.

The results show that the presented method is a feasible way for clothing pattern generating by use of scanned human body model.

The main contribution of this work is twofold: one is the geometric algorithm to scanned human body model, which is specially conducted for clothing pattern design to extract feature points, planes and curves. This is the crucial base for suit clothing pattern generating. Another is the physics-based pattern generating algorithm which flattens the 3D shape to 2D shape of cloth pattern pieces.

Existing Simultaneous Localization and Mapping (SLAM) algorithms have been relatively well developed. However, when in complex dynamic environments, the movement of the dynamic points on the dynamic objects in the image in the mapping can have an impact on the observation of the system, and thus there will be biases and errors in the position estimation and the creation of map points. The aim of this paper is to achieve more accurate accuracy in SLAM algorithms compared to traditional methods through semantic approaches.

In this paper, the semantic segmentation of dynamic objects is realized based on U-Net semantic segmentation network, followed by motion consistency detection through motion detection method to determine whether the segmented objects are moving in the current scene or not, and combined with the motion compensation method to eliminate dynamic points and compensate for the current local image, so as to make the system robust.

Experiments comparing the effect of detecting dynamic points and removing outliers are conducted on a dynamic data set of Technische Universität München, and the results show that the absolute trajectory accuracy of this paper's method is significantly improved compared with ORB-SLAM3 and DS-SLAM.

In this paper, in the semantic segmentation network part, the segmentation mask is combined with the method of dynamic point detection, elimination and compensation, which reduces the influence of dynamic objects, thus effectively improving the accuracy of localization in dynamic environments.

The purpose of this review is to comprehensively consider the material properties and processing of additive titanium alloy and provide a new perspective for the robotic grinding and polishing of additive titanium alloy blades to ensure the surface integrity and machining accuracy of the blades.

At present, robot grinding and polishing are mainstream processing methods in blade automatic processing. This review systematically summarizes the processing characteristics and processing methods of additive manufacturing (AM) titanium alloy blades. On the one hand, the unique manufacturing process and thermal effect of AM have created the unique processing characteristics of additive titanium alloy blades. On the other hand, the robot grinding and polishing process needs to incorporate the material removal model into the traditional processing flow according to the processing characteristics of the additive titanium alloy.

Robot belt grinding can solve the processing problem of additive titanium alloy blades. The complex surface of the blade generates a robot grinding trajectory through trajectory planning. The trajectory planning of the robot profoundly affects the machining accuracy and surface quality of the blade. Subsequent research is needed to solve the problems of high machining accuracy of blade profiles, complex surface material removal models and uneven distribution of blade machining allowance. In the process parameters of the robot, the grinding parameters, trajectory planning and error compensation affect the surface quality of the blade through the material removal method, grinding force and grinding temperature. The machining accuracy of the blade surface is affected by robot vibration and stiffness.

This review systematically summarizes the processing characteristics and processing methods of aviation titanium alloy blades manufactured by AM. Combined with the material properties of additive titanium alloy, it provides a new idea for robot grinding and polishing of aviation titanium alloy blades manufactured by AM.

In the era of artificial intelligence (AI), algorithms have gained unprecedented importance. Scientific studies have shown that algorithms are frequently mentioned in papers, making mention frequency a classical indicator of their popularity and influence. However, contemporary methods for evaluating influence tend to focus solely on individual algorithms, disregarding the collective impact resulting from the interconnectedness of these algorithms, which can provide a new way to reveal their roles and importance within algorithm clusters. This paper aims to build the co-occurrence network of algorithms in the natural language processing field based on the full-text content of academic papers and analyze the academic influence of algorithms in the group based on the features of the network.

We use deep learning models to extract algorithm entities from articles and construct the whole, cumulative and annual co-occurrence networks. We first analyze the characteristics of algorithm networks and then use various centrality metrics to obtain the score and ranking of group influence for each algorithm in the whole domain and each year. Finally, we analyze the influence evolution of different representative algorithms.

The results indicate that algorithm networks also have the characteristics of complex networks, with tight connections between nodes developing over approximately four decades. For different algorithms, algorithms that are classic, high-performing and appear at the junctions of different eras can possess high popularity, control, central position and balanced influence in the network. As an algorithm gradually diminishes its sway within the group, it typically loses its core position first, followed by a dwindling association with other algorithms.

To the best of the authors’ knowledge, this paper is the first large-scale analysis of algorithm networks. The extensive temporal coverage, spanning over four decades of academic publications, ensures the depth and integrity of the network. Our results serve as a cornerstone for constructing multifaceted networks interlinking algorithms, scholars and tasks, facilitating future exploration of their scientific roles and semantic relations.

Data-driven marketing is replacing conventional marketing strategies. The modern marketing strategy is based on insights derived from customer behavior information gathered from their facial expressions and neuro-signals. This study explores the potential for face recognition and neuro-marketing in modern-day marketing.

The study conducts an in-depth examination of the extant literature on neuro-marketing and facial recognition marketing. The articles for review are downloaded from the Scopus database, and PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analyses) is then used to screen and choose the relevant papers. The systematic literature review method is applied to conduct the study.

An extensive review of the literature reveals that the domains of neuro-marketing and face recognition marketing remain understudied. The authors’ review of selected papers delivers five neuro-marketing and facial recognition marketing themes that are essential to modern marketing concepts.

Neuro-marketing and facial recognition marketing are artificial intelligence (AI)-enabled marketing techniques that assist in gaining cognitive insights into human behavior. The findings would be of use to managers in designing marketing strategies to enhance their marketing approach and boost conversion rates.

The uniqueness of this study lies in that it provides an updated review on neuro-marketing and face recognition marketing.

The purpose of this paper is to provide a new procedure for in-plane compensation of geometric errors that often appear in the layers deposited by an additive manufacturing (AM) process when building a part, regardless of the complexity of the layer geometry.

The procedure is based on comparing the real layer contours to the nominal ones extracted from the STL model of the part. Considering alignment and form deviations, the compensation algorithm generates new compensated contours that match the nominal ones as closely as possible. To assess the compensation effectiveness, two case studies were analysed. In the first case, the parts were not manufactured, but the distortions were simulated using a predictive model. In the second example, the test part was actually manufactured, and the distortions were measured on a coordinate measuring machine.

The geometric deviations detected in both case studies, as evaluated by various quality indicators, reduced significantly after applying the compensation procedure, meaning that the compensated and nominal contours were better matched both in shape and size.

Although large contours showed deviations close to zero, dimensional overcompensation was observed when applied to small contours. The compensation procedure could be enhanced if the applied compensation factor took into account the contour size of the analysed layer and other geometric parameters that could have an influence.

The presented method of compensation is applicable to layers of any shape obtained in any AM process.

This paper aims to propose a generative design method combined with meta-heuristic algorithm for automating and optimizing the floor layout of modular buildings using typical standardized module units, which are the room module, the corridor module and the stair module.

The integrated framework involves the generative design method and optimization for modular construction. The generative rules are provided by geometric relationships and functionalities of the module units. An evaluation function of the generated floor plans is also presented by the combination of project cost and cost penalties for the geometric features. The multi-population genetic algorithm (MPGA) method is provided for the optimization of the combination of costs.

The proposed MPGA method is demonstrated fast and efficient at discovering the globally optimal solution. The results indicate that when the unit price of modules is high, the transportation distance is long, or the land cost is high, the layout cost, which related to the symmetry, the compactness and the energy is tend to be lower, making the optimal layout economical.

This paper presented an integrated framework of generative floor layout and optimization for modular construction by using typical module units. It fulfills the need for automated layout generation with repetitive units and corresponding assessment during the early design stage.

This paper aims to propose a robust method for non-rigid point set registration, using the Gaussian mixture model and accommodating non-rigid transformations. The posterior probabilities of the mixture model are determined through the proposed integrated feature divergence.

The method involves an alternating two-step framework, comprising correspondence estimation and subsequent transformation updating. For correspondence estimation, integrated feature divergences including both global and local features, are coupled with deterministic annealing to address the non-convexity problem of registration. For transformation updating, the expectation-maximization iteration scheme is introduced to iteratively refine correspondence and transformation estimation until convergence.

The experiments confirm that the proposed registration approach exhibits remarkable robustness on deformation, noise, outliers and occlusion for both 2D and 3D point clouds. Furthermore, the proposed method outperforms existing analogous algorithms in terms of time complexity. Application of stabilizing and securing intermodal containers loaded on ships is performed. The results demonstrate that the proposed registration framework exhibits excellent adaptability for real-scan point clouds, and achieves comparatively superior alignments in a shorter time.

The integrated feature divergence, involving both global and local information of points, is proven to be an effective indicator for measuring the reliability of point correspondences. This inclusion prevents premature convergence, resulting in more robust registration results for our proposed method. Simultaneously, the total operating time is reduced due to a lower number of iterations.

Prefabricated building has been widely applied in the construction industry all over the world, which can significantly reduce labor consumption and improve construction efficiency compared with conventional approaches. During the construction of prefabricated buildings, the overall efficiency largely depends on the lifting sequence and path of each prefabricated component. To improve the efficiency and safety of the lifting process, this study proposes a framework for automatically optimizing the lifting path of prefabricated building components using building information modeling (BIM), improved 3D-A* and a physic-informed genetic algorithm (GA).

Firstly, the industry foundation class (IFC) schema for prefabricated buildings is established to enrich the semantic information of BIM. After extracting corresponding component attributes from BIM, the models of typical prefabricated components and their slings are simplified. Further, the slings and elements’ rotations are considered to build a safety bounding box. Secondly, an efficient 3D-A* is proposed for element path planning by integrating both safety factors and variable step size. Finally, an efficient GA is designed to obtain the optimal lifting sequence that satisfies physical constraints.

The proposed optimization framework is validated in a physics engine with a pilot project, which enables better understanding. The results show that the framework can intuitively and automatically generate the optimal lifting path for each type of prefabricated building component. Compared with traditional algorithms, the improved path planning algorithm significantly reduces the number of nodes computed by 91.48%, resulting in a notable decrease in search time by 75.68%.

In this study, a prefabricated component path planning framework based on the improved A* algorithm and GA is proposed for the first time. In addition, this study proposes a safety-bounding box that considers the effects of torsion and slinging of components during lifting. The semantic information of IFC for component lifting is enriched by taking into account lifting data such as binding positions, lifting methods, lifting angles and lifting offsets.

The electromechanical brake system is leading the latest development trend in railway braking technology. The tolerance stack-up generated during the assembly and production process catalyzes the slight geometric dimensioning and tolerancing between the motor stator and rotor inside the electromechanical cylinder. The tolerance leads to imprecise brake control, so it is necessary to diagnose the fault of the motor in the fully assembled electromechanical brake system. This paper aims to present improved variational mode decomposition (VMD) algorithm, which endeavors to elucidate and push the boundaries of mechanical synchronicity problems within the realm of the electromechanical brake system.

The VMD algorithm plays a pivotal role in the preliminary phase, employing mode decomposition techniques to decompose the motor speed signals. Afterward, the error energy algorithm precision is utilized to extract abnormal features, leveraging the practical intrinsic mode functions, eliminating extraneous noise and enhancing the signal’s fidelity. This refined signal then becomes the basis for fault analysis. In the analytical step, the cepstrum is employed to calculate the formant and envelope of the reconstructed signal. By scrutinizing the formant and envelope, the fault point within the electromechanical brake system is precisely identified, contributing to a sophisticated and accurate fault diagnosis.

This paper innovatively uses the VMD algorithm for the modal decomposition of electromechanical brake (EMB) motor speed signals and combines it with the error energy algorithm to achieve abnormal feature extraction. The signal is reconstructed according to the effective intrinsic mode functions (IMFS) component of removing noise, and the formant and envelope are calculated by cepstrum to locate the fault point. Experiments show that the empirical mode decomposition (EMD) algorithm can effectively decompose the original speed signal. After feature extraction, signal enhancement and fault identification, the motor mechanical fault point can be accurately located. This fault diagnosis method is an effective fault diagnosis algorithm suitable for EMB systems.

By using this improved VMD algorithm, the electromechanical brake system can precisely identify the rotational anomaly of the motor. This method can offer an online diagnosis analysis function during operation and contribute to an automated factory inspection strategy while parts are assembled. Compared with the conventional motor diagnosis method, this improved VMD algorithm can eliminate the need for additional acceleration sensors and save hardware costs. Moreover, the accumulation of online detection functions helps improve the reliability of train electromechanical braking systems.