Search results

Single-shot multi-category clothing recognition and retrieval play a crucial role in online searching and offline settlement scenarios. Existing clothing recognition methods based on RGBD clothing images often suffer from high-dimensional feature representations, leading to compromised performance and efficiency.

To address this issue, this paper proposes a novel method called Manifold Embedded Discriminative Feature Selection (MEDFS) to select global and local features, thereby reducing the dimensionality of the feature representation and improving performance. Specifically, by combining three global features and three local features, a low-dimensional embedding is constructed to capture the correlations between features and categories. The MEDFS method designs an optimization framework utilizing manifold mapping and sparse regularization to achieve feature selection. The optimization objective is solved using an alternating iterative strategy, ensuring convergence.

Empirical studies conducted on a publicly available RGBD clothing image dataset demonstrate that the proposed MEDFS method achieves highly competitive clothing classification performance while maintaining efficiency in clothing recognition and retrieval.

This paper introduces a novel approach for multi-category clothing recognition and retrieval, incorporating the selection of global and local features. The proposed method holds potential for practical applications in real-world clothing scenarios.

The non‐well‐founded properties of the empty set provide existence to abstract topological spaces, in which intersections of subspaces with non‐equal dimensions give topologically closed structures. This let space‐time emerge as an ordered sequence of sections upon a defined combination rule, in which interactivity between observable structures is allowed and conditions for conscious perception phenomena are fulfilled. Conditions for evolution and rules for optimal evolution of ecosystems also infer as corollaries. A physical universe and life constitute one single self‐organized and self managed system where life appears as the physical‐like realization of conditions of functionality of the embedding mathematical spaces. The system includes self‐ethical and moral guidelines which should inspire human behavior on Planet Earth.

The central idea of this research article is to examine the characteristics of Clairaut submersions from Lorentzian trans-Sasakian manifolds of type (α, β) and also, to enhance this geometrical analysis with some specific cases, namely Clairaut submersion from Lorentzian α-Sasakian manifold, Lorentzian β-Kenmotsu manifold and Lorentzian cosymplectic manifold. Furthermore, the authors discuss some results about Clairaut Lagrangian submersions whose total space is a Lorentzian trans-Sasakian manifolds of type (α, β). Finally, the authors furnished some examples based on this study.

This research discourse based on classifications of submersion, mainly Clairaut submersions, whose total manifolds is Lorentzian trans-Sasakian manifolds and its all classes like Lorentzian Sasakian, Lorenztian Kenmotsu and Lorentzian cosymplectic manifolds. In addition, the authors have explored some axioms of Clairaut Lorentzian submersions and illustrates our findings with some non-trivial examples.

The major finding of this study is to exhibit a necessary and sufficient condition for a submersions to be a Clairaut submersions and also find a condition for Clairaut Lagrangian submersions from Lorentzian trans-Sasakian manifolds.

The results and examples of the present manuscript are original. In addition, more general results with fair value and supportive examples are provided.

This paper aims to use the redundancy of a 7-DOF (degree of freedom) serial manipulator to solve motion planning problems along a given 6D Cartesian tool path, in the presence of geometric constraints, namely, obstacles and joint limits.

This paper describes an explicit expression of the task submanifolds for a 7-DOF redundant robot, and the submanifolds can be parameterized by two parameters with this explicit expression. Therefore, the global search method can find the feasible path on this parameterized graph.

The proposed planning algorithm is resolution complete and resolution optimal for 7-DOF manipulators, and the planned path can satisfy task constraint as well as avoiding singularity and collision. The experiments on Motoman SDA robot are reported to show the effectiveness.

This algorithm is still time-consuming, and it can be improved by applying parallel collision detection method or lazy collision detection, adopting new constraints and implementing more effective graph search algorithms.

Compared with other task constrained planning methods, the proposed algorithm archives better performance. This method finds the explicit expression of the two-dimensional task sub-manifolds, so it’s resolution complete and resolution optimal.

Content‐based image retrieval (CBIR) is an important research area for automatically retrieving images of user interest from a large database. Due to many potential applications, facial image retrieval has received much attention in recent years. Similar to face recognition, finding appropriate image representation is a vital step for a successful facial image retrieval system. Recently, many efficient image feature descriptors have been proposed and some of them have been applied to face recognition. It is valuable to have comparative studies of different feature descriptors in facial image retrieval. And more importantly, how to fuse multiple features is a significant task which can have a substantial impact on the overall performance of the CBIR system. The purpose of this paper is to propose an efficient face image retrieval strategy.

In this paper, three different feature description methods have been investigated for facial image retrieval, including local binary pattern, curvelet transform and pyramid histogram of oriented gradient. The problem of large dimensionalities of the extracted features is addressed by employing a manifold learning method called spectral regression. A decision level fusion scheme fuzzy aggregation is applied by combining the distance metrics from the respective dimension reduced feature spaces.

Empirical evaluations on several face databases illustrate that dimension reduced features are more efficient for facial retrieval and the fuzzy aggregation fusion scheme can offer much enhanced performance. A 98 per cent rank 1 retrieval accuracy was obtained for the AR faces and 91 per cent for the FERET faces, showing that the method is robust against different variations like pose and occlusion.

The proposed method for facial image retrieval has a promising potential of designing a real‐world system for many applications, particularly in forensics and biometrics.

Mesh Parameterization is central to reverse engineering, tool path planning, etc. This work synthesizes parameterizations with un-constrained borders, overall minimum angle plus area distortion. This study aims to present an assessment of the sensitivity of the minimized distortion with respect to weighed area and angle distortions.

A Mesh Parameterization which does not constrain borders is implemented by performing: isometry maps for each triangle to the plane Z = 0; an affine transform within the plane Z = 0 to glue the triangles back together; and a Levenberg–Marquardt minimization algorithm of a nonlinear F penalty function that modifies the parameters of the first two transformations to discourage triangle flips, angle or area distortions. F is a convex weighed combination of area distortion (weight: α with 0 ≤ α ≤ 1) and angle distortion (weight: 1 − α).

The present study parameterization algorithm has linear complexity [𝒪(n), n = number of mesh vertices]. The sensitivity analysis permits a fine-tuning of the weight parameter which achieves overall bijective parameterizations in the studied cases. No theoretical guarantee is given in this manuscript for the bijectivity. This algorithm has equal or superior performance compared with the ABF, LSCM and ARAP algorithms for the Ball, Cow and Gargoyle data sets. Additional correct results of this algorithm alone are presented for the Foot, Fandisk and Sliced-Glove data sets.

The devised free boundary nonlinear Mesh Parameterization method does not require a valid initial parameterization and produces locally bijective parameterizations in all of our tests. A formal sensitivity analysis shows that the resulting parameterization is more stable, i.e. the UV mapping changes very little when the algorithm tries to preserve angles than when it tries to preserve areas. The algorithm presented in this study belongs to the class that parameterizes meshes with holes. This study presents the results of a complexity analysis comparing the present study algorithm with 12 competing ones.

Isometric feature mapping (Isomap) is a very popular manifold learning method and is widely used in dimensionality reduction and data visualization. The most time-consuming step in Isomap is to compute the shortest paths between all pairs of data points based on a neighbourhood graph. The classical Isomap (C-Isomap) is very slow, due to the use of Floyd’s algorithm to compute the shortest paths. The purpose of this paper is to speed up Isomap.

Through theoretical analysis, it is found that the neighbourhood graph in Isomap is sparse. In this case, the Dijkstra’s algorithm with Fibonacci heap (Fib-Dij) is faster than Floyd’s algorithm. In this paper, an improved Isomap method based on Fib-Dij is proposed. By using Fib-Dij to replace Floyd’s algorithm, an improved Isomap method is presented in this paper.

Using the S-curve, the Swiss-roll, the Frey face database, the mixed national institute of standards and technology database of handwritten digits and a face image database, the performance of the proposed method is compared with C-Isomap, showing the consistency with C-Isomap and marked improvements in terms of the high speed. Simulations also demonstrate that Fib-Dij reduces the computation time of the shortest paths from O(N³) to O(N²lgN).

Due to the limitations of the computer, the sizes of the data sets in this paper are all smaller than 3,000. Therefore, researchers are encouraged to test the proposed algorithm on larger data sets.

The new method based on Fib-Dij can greatly improve the speed of Isomap.

For robots to more actively interact with the surrounding environment in object manipulation tasks or walking, they must understand the physical attributes of objects and surface materials they encounter. Dynamic tactile sensing can effectively capture rich information about material properties. Hence, methods that convey and interpret this tactile information to the user can improve the quality of human–machine interaction. This paper aims to propose a visual-tactile cross-modal retrieval framework to convey tactile information of surface material for perceptual estimation.

The tactile information of a new unknown surface material can be used to retrieve perceptually similar surface from an available surface visual sample set by associating tactile information to visual information of material surfaces. For the proposed framework, the authors propose an online low-rank similarity learning method, which can effectively and efficiently capture the cross-modal relative similarity between visual and tactile modalities.

Experimental results conducted on the Technischen Universität München Haptic Texture Database demonstrate the effectiveness of the proposed framework and the method.

This paper provides a visual-tactile cross-modal perception method for recognizing material surface. By the method, a robot can communicate and interpret the conveyed information about the surface material properties to the user; it will further improve the quality of robot interaction.

Consequence prediction is an emerging topic in safety management concerning the severity outcome of accidents. In practical applications, it is usually implemented through supervised learning methods; however, the evaluation of classification results remains a challenge. The previous studies mostly adopted simplex evaluation based on empirical and quantitative assessment strategies. This paper aims to shed new light on the comprehensive evaluation and comparison of diverse classification methods through visualization, clustering and ranking techniques.

An empirical study is conducted using 9 state-of-the-art classification methods on a real-world data set of 653 construction accidents in China for predicting the consequence with respect to 39 carefully featured factors and accident type. The proposed comprehensive evaluation enriches the interpretation of classification results from different perspectives. Furthermore, the critical factors leading to severe construction accidents are identified by analyzing the coefficients of a logistic regression model.

This paper identifies the critical factors that significantly influence the consequence of construction accidents, which include accident type (particularly collapse), improper accident reporting and handling (E21), inadequate supervision engineers (O41), no special safety department (O11), delayed or low-quality drawings (T11), unqualified contractor (C21), schedule pressure (C11), multi-level subcontracting (C22), lacking safety examination (S22), improper operation of mechanical equipment (R11) and improper construction procedure arrangement (T21). The prediction models and findings of critical factors help make safety intervention measures in a targeted way and enhance the experience of safety professionals in the construction industry.

The empirical study using some well-known classification methods for forecasting the consequences of construction accidents provides some evidence for the comprehensive evaluation of multiple classifiers. These techniques can be used jointly with other evaluation approaches for a comprehensive understanding of the classification algorithms. Despite the limitation of specific methods used in the study, the presented methodology can be configured with other classification methods and performance metrics and even applied to other decision-making problems such as clustering.

This study sheds new light on the comprehensive comparison and evaluation of classification results through visualization, clustering and ranking techniques using an empirical study of consequence prediction of construction accidents. The relevance of construction accident type is discussed with the severity of accidents. The critical factors influencing the accident consequence are identified for the sake of taking prevention measures for risk reduction. The proposed method can be applied to other decision-making tasks where the evaluation is involved as an important component.

The paper aims to present the innovative design of a planar multilayered high temperature solid oxide fuel cell (SOFC), which is easy to manufacture, and features high resistance to rapid temperature changes. Temperature resistance was accomplished thanks to easy to heat, thin flat ceramic structure of the cell and elimination of metallic interconnections.

The ceramic fuel cell consists of the anode core made of six to eight layers of nickel/yttria-stabilized zirconia tapes (Ni/YSZ) isostatically pressed into a laminate. Two networks of fuel distribution microchannels are engraved on both sides of the anode laminate. The microchannels are subsequently covered with a thin layer of the functional anode tape made of Ni/YSZ and a solid electrolyte tape made of YSZ.

The single planar double-sided ceramic SOFC of dimensions 19 × 60 × 1.2 mm3 provides 3.2 Watts of electric power. The prototype of the battery which consists of four SOFCs provides an output power of > 12 W. Tests show that the stack is resistant to the rapid temperature change. If inserted into a chamber preheated to 800°C, the stack provides the full power within 5 minutes. Multiple cycling does not destroy the stack.

This anode-supported fuel cell structure is provided with thin anode functional layers suspended on a large number of fine beams. The whole anode structure is made with the same ceramic material, so the mechanical stress is minimized during the cell operation.