Search results

The notion of a computation graph is introduced. A computation graph is a rooted, directed graph whose nodes are labelled by statements (instructions) to be executed. The motivation for developing computation graphs comes from a desire to represent programs by well‐defined, manipulable structures and to permit search (especially backtracking) to be a natural part of the execution of such programs. This initial work considers very simple computation graphs where the only statements that can be executed are assignment statements and tests. Procedure calls, parameter passing, etc. are not considered. The execution rule for computation graphs is based upon search procedures. The computation rule presented permits a computation graph to be executed depth first, breadth first or using a combination of both. This is done by defining functions, which are arguments to the computation rule, to control the traversal of the graph. The use of the rule is illustrated by describing functions to permit the rule to execute the same graph depth first and breadth first.

The purpose of this paper is to provide a way to analyze satellite images using various clustering algorithms and refined bitplane methods with other supporting techniques to prove the superiority of RIFCM.

A comparative study has been carried out using RIFCM with other related algorithms from their suitability in analysis of satellite images with other supporting techniques which segments the images for further process for the benefit of societal problems. Four images were selected dealing with hills, freshwater, freshwatervally and drought satellite images.

The superiority of the proposed algorithm, RIFCM with refined bitplane towards other clustering techniques with other supporting methods clustering, has been found and as such the comparison, has been made by applying four metrics (Otsu (Max-Min), PSNR and RMSE (40%-60%-Min-Max), histogram analysis (Max-Max), DB index and D index (Max-Min)) and proved that the RIFCM algorithm with refined bitplane yielded robust results with efficient performance, reduction in the metrics and time complexity of depth computation of satellite images for further process of an image.

For better clustering of satellite images like lands, hills, freshwater, freshwatervalley, drought, etc. of satellite images is an achievement.

The existing system extends the novel framework to provide a more explicit way to analyze an image by removing distortions with refined bitplane slicing using the proposed algorithm of rough intuitionistic fuzzy c-means to show the superiority of RIFCM.

This paper aims to propose a new solution for real-time 3D perception with monocular camera. Most of the industrial robots’ solutions use active sensors to acquire 3D structure information, which limit their applications to indoor scenarios. By only using monocular camera, some state of art method provides up-to-scale 3D structure information, but scale information of corresponding objects is uncertain.

First, high-accuracy and scale-informed camera pose and sparse 3D map are provided by leveraging ORB-SLAM and marker. Second, for each frame captured by a camera, a specially designed depth estimation pipeline is used to compute corresponding 3D structure called depth map in real-time. Finally, depth map is integrated into volumetric scene model. A feedback module has been designed for users to visualize intermediate scene surface in real-time.

The system provides more robust tracking performance and compelling results. The implementation runs near 25 Hz on mainstream laptop based on parallel computation technique.

A new solution for 3D perception is using monocular camera by leveraging ORB-SLAM systems. Results in our system are visually comparable to active sensor systems such as elastic fusion in small scenes. The system is also both efficient and easy to implement, and algorithms and specific configurations involved are introduced in detail.

Scattered parts are laid randomly during the manufacturing process and have difficulty to recognize and manipulate. This study aims to complete the grasp of the scattered parts by a manipulator with a camera and learning method.

In this paper, a cascaded convolutional neural network (CNN) method for robotic grasping based on monocular vision and small data set of scattered parts is proposed. This method can be divided into three steps: object detection, monocular depth estimation and keypoint estimation. In the first stage, an object detection network is improved to effectively locate the candidate parts. Then, it contains a neural network structure and corresponding training method to learn and reason high-resolution input images to obtain depth estimation. The keypoint estimation in the third step is expressed as a cumulative form of multi-scale prediction from a network to use an red green blue depth (RGBD) map that is acquired from the object detection and depth map estimation. Finally, a grasping strategy is studied to achieve successful and continuous grasping. In the experiments, different workpieces are used to validate the proposed method. The best grasping success rate is more than 80%.

By using the CNN-based method to extract the key points of the scattered parts and calculating the possibility of grasp, the successful rate is increased.

This method and robotic systems can be used in picking and placing of most industrial automatic manufacturing or assembly processes.

Unlike standard parts, scattered parts are randomly laid and have difficulty recognizing and grasping for the robot. This study uses a cascaded CNN network to extract the keypoints of the scattered parts, which are also labeled with the possibility of successful grasping. Experiments are conducted to demonstrate the grasping of those scattered parts.

A comparison of the Halstead and McCabe methods of measuring program complexity with a recently proposed metric, which is based on the analysis of dependency computations using a data flowgraph model, is presented. The sensitivity of the metric to changes in the data structure is discussed. Comments and criticisms of the measures are included.

To avoid the structural defect, early crack detection is oneof the important aspects in the recent area of research. The purpose of this paper is to detect the crack before its failure by means of its position and severity.

This paper uses two trees based regressors, namely, decision tree (DT) regressor and random forest (RF) regressor for their capabilities to adopt different types of parameter and generate simple rules by which the method can predict the crack parameters with better accuracy, making it possible to effectively predict the crack parameters such as its location and depth before failure of the beam.

The predicted parameters can be achieved, if the relationship between vibration and crack parameters can be attained. The relationship yields the results of beam natural frequencies, which is used as the input value for the regression techniques. It is observed that the RF regressor predicts the parameters with better accuracy as compared to DT regressor.

The idea is used the developed regression techniques to identify the crack parameters which are more effective as compared to other developed methods because the alternate name of prediction is called regression. The authors have used DT regressor and RF regressor to achieve the target. In this paper care has been given to the generalization of the model, so that the adaptability of the model can be ensured. The robustness of proposed methods has been verified in support of numerical and experimental analysis.

Using social networks to identify users with traits similar to those of the target user has proven highly effective in the development of personalized recommendation systems. Existing methods treat all dimensions of user data as a whole, despite the fact that most of the information related to different dimensions is discrete. This has prompted researchers to adopt the skyline query for such search functions. Unfortunately, researchers have run into problems of instability in the number of users identified using this approach.

We thus propose the m-representative skyline queries to provide control over the number of similar users that are returned. We also developed an R-tree-based algorithm to implement the m-representative skyline queries.

By using the R-tree based algorithm, the processing speed of the m-representative skyline queries can now be accelerated. Experiment results demonstrate the efficacy of the proposed approach.

Note that with this new way of finding similar users in the social network, the performance of the personalized recommendation systems is expected to be enhanced.

The 3D dynamic clothing simulation is widely used in computer-added garment design. Collision detection and response are the essential component and also the efficiency bottleneck in the simulation. The purpose of this paper is to propose a high efficient collision detection algorithm for 3D clothing-human dynamic simulation to achieve both real-time and virtually real simulation effects.

The authors approach utilizes the offline data learning results to simplify the online collision detection complexity. The approach includes two stages. In the off-line stage, model triangles with most similar deformations are first, partitioned into several near-rigid-clusters. Clusters from the clothing model and the human model are matched as pairs according to the fact that they hold the potential to intersect. For each cluster, a hierarchical bounding box tree is then constructed. In the on-line stage, collision detection is checked and treated parallelly inside each cluster pairs. A multiple task allocation strategy is proposed in parallel computation to ensure efficiency.

Reasonably partitioning the 3D clothing and human model surfaces into several clusters and implementing collision detection on these cluster pairs can efficiently reduce the model primitive amounts that need be detected, consequently both improving the detection efficiency and remaining the simulation virtual effect.

The current methods only utilize the dynamic clothing-human status; the authors algorithm furthermore combines the intrinsic correspondence relationship between clothing and human clusters to efficiently shrink the detection query scope to accelerate the detection speed. Moreover, partitioning the model into several independent clusters as detection units is much more profitable for parallel computation than current methods those treat the model entirety as the unit.

This paper addresses a significant research gap in the study of Rayleigh surface wave propagation within a piezoelectric medium characterized by piezoelectric properties, thermal effects and voids. Previous research has often overlooked the crucial aspects related to voids. This study aims to provide analytical solutions for Rayleigh waves propagating through a medium consisting of a nonlocal piezo-thermo-elastic material with voids under the Moore–Gibson–Thompson thermo-elasticity theory with memory dependencies.

The analytical solutions are derived using a wave-mode method, and roots are computed from the characteristic equation using the Durand–Kerner method. These roots are then filtered based on the decay condition of surface waves. The analysis pertains to a medium subjected to stress-free and isothermal boundary conditions.

Computational simulations are performed to determine the attenuation coefficient and phase velocity of Rayleigh waves. This investigation goes beyond mere calculations and examines particle motion to gain deeper insights into Rayleigh wave propagation. Furthermore, this investigates how kernel function and nonlocal parameters influence these wave phenomena.

The results of this study reveal several unique cases that significantly contribute to the understanding of Rayleigh wave propagation within this intricate material system, particularly in the presence of voids.

This investigation provides valuable insights into the synergistic dynamics among piezoelectric constituents, void structures and Rayleigh wave propagation, enabling advancements in sensor technology, augmented energy harvesting methodologies and pioneering seismic monitoring approaches.

This study formulates a novel governing equation for a nonlocal piezo-thermo-elastic medium with voids, highlighting the significance of Rayleigh waves and investigating the impact of memory.

Describes current research work into the design of a 3‐D vision sensor for use in the field of robot navigation and autonomous vehicles. Outlines the development of a stereo vision system which uses fast data processing to extract feature points in the stereo images and a new fast stereo matching algorithm. Gives results of experiments performed using this system and concludes that the applications require fast, self‐adaptive algorithms which can be processed by parallel processors. This was obtained by means of a special configuration and a highly parallelizable stereo vision process based on the declivity feature matched by dynamic programming.