extraction algorithm
Recently Published Documents





Shaha Al-Otaibi ◽  
Nourah Altwoijry ◽  
Alanoud Alqahtani ◽  
Latifah Aldheem ◽  
Mohrah Alqhatani ◽  

Social media have become a discussion platform for individuals and groups. Hence, users belonging to different groups can communicate together. Positive and negative messages as well as media are circulated between those users. Users can form special groups with people who they already know in real life or meet through social networking after being suggested by the system. In this article, we propose a framework for recommending communities to users based on their preferences; for example, a community for people who are interested in certain sports, art, hobbies, diseases, age, case, and so on. The framework is based on a feature extraction algorithm that utilizes user profiling and combines the cosine similarity measure with term frequency to recommend groups or communities. Once the data is received from the user, the system tracks their behavior, the relationships are identified, and then the system recommends one or more communities based on their preferences. Finally, experimental studies are conducted using a prototype developed to test the proposed framework, and results show the importance of our framework in recommending people to communities.

2022 ◽  
Vol 121 ◽  
pp. 104332
Wenxiao Sun ◽  
Jian Wang ◽  
Fengxiang Jin ◽  
Youyuan Li ◽  
Yikun Yang

2022 ◽  
Vol 2022 ◽  
pp. 1-8
Xifeng Mi

With the continuous development of social economy, the expansion of cities often leads to the disorderly utilization of land resources and even waste. In view of these limitations and requirements, this paper introduces the automatic extraction algorithm of closed area boundary, combs the requirements of urban boundary extraction involved in urban planning and design, and uses the technology of geospatial analysis to carry out spatial analysis practice from three angles, so as to realize the expansion of functional analysis of urban planning and design and improve the efficiency and rationality of urban planning. The simulation results show that the automatic extraction algorithm of closed area boundary is effective and can support the functional analysis of urban planning and design expansion.

2022 ◽  
Vol 12 (2) ◽  
pp. 602
Weihua Li ◽  
Zhuang Miao ◽  
Jing Mu ◽  
Fanming Li

Superpixel segmentation has become a crucial pre-processing tool to reduce computation in many computer vision applications. In this paper, a superpixel extraction algorithm based on a seed strategy of contour encoding (SSCE) for infrared images is presented, which can generate superpixels with high boundary adherence and compactness. Specifically, SSCE can solve the problem of superpixels being unable to self-adapt to the image content. First, a contour encoding map is obtained by ray scanning the binary edge map, which ensures that each connected domain belongs to the same homogeneous region. Second, according to the seed sampling strategy, each seed point can be extracted from the contour encoding map. The initial seed set, which is adaptively scattered based on the local structure, is capable of improving the capability of boundary adherence, especially for small regions. Finally, the initial superpixels limited by the image contour are generated by clustering and refined by merging similar adjacent superpixels in the region adjacency graph (RAG) to reduce redundant superpixels. Experimental results on a self-built infrared dataset and the public datasets BSD500 and 3Dircadb demonstrate the generalization ability in grayscale and medical images, and the superiority of the proposed method over several state-of-the-art methods in terms of accuracy and compactness.

Qian Zhao ◽  
Hong Zhang

The extraction of color features plays an important role in image recognition and image retrieval. In the past, feature extraction mainly depends on manual or supervised learning, which limits the automation of the whole recognition or retrieval process. In order to solve the above problems, an automatic color extraction algorithm based on artificial intelligence is proposed. According to the characteristics of BMP image, the paper makes use of the conversion between image color space and realizes it in the visual C++6.0 environment. The experimental results show that the algorithm realizes the basic operation of image preprocessing, and realizes the automatic extraction of image color features by proper data clustering algorithm.

2022 ◽  
Vol 2022 ◽  
pp. 1-10
Feng Chen ◽  
Botao Yang

Image super-resolution is getting popularity these days in diverse fields, such as medical applications and industrial applications. The accuracy is imperative on image super-resolution. The traditional approaches for local edge feature point extraction algorithms are merely based on edge points for super-resolution images. The traditional algorithms are used to calculate the geometric center of gravity of the edge line when it is near, resulting in a low feature recall rate and unreliable results. In order to overcome these problems of lower accuracy in the existing system, an attempt is made in this research work to propose a new fast extraction algorithm for local edge features of super-resolution images. This paper primarily focuses on the super-resolution image reconstruction model, which is utilized to extract the super-resolution image. The edge contour of the super-resolution image feature is extracted based on the Chamfer distance function. Then, the geometric center of gravity of the closed edge line and the nonclosed edge line are calculated. The algorithm emphasizes on polarizing the edge points with the center of gravity to determine the local extreme points of the upper edge of the amplitude-diameter curve and to determine the feature points of the edges of the super-resolution image. The experimental results show that the proposed algorithm consumes 0.02 seconds to extract the local edge features of super-resolution images with an accuracy of up to 96.3%. The experimental results show that our proposed algorithm is an efficient method for the extraction of local edge features from the super-resolution images.

2022 ◽  
pp. 283-305
Veronica K. Chan ◽  
Christine W. Chan

This chapter discusses development, application, and enhancement of a decomposition neural network rule extraction algorithm for nonlinear regression problems. The dual objectives of developing the algorithms are (1) to generate good predictive models comparable in performance to the original artificial neural network (ANN) models and (2) to “open up” the black box of a neural network model and provide explicit information in the form of rules that are expressed as linear equations. The enhanced PWL-ANN algorithm improves upon the PWL-ANN algorithm because it can locate more than two breakpoints and better approximate the hidden sigmoid activation functions of the ANN. Comparison of the results produced by the two versions of the PWL-ANN algorithm showed that the enhanced PWL-ANN models provide higher predictive accuracies and improved fidelities compared to the originally trained ANN models than the PWL-ANN models.

2021 ◽  
Vol 38 (6) ◽  
pp. 1599-1611
Hong Yang ◽  
Yanming Zhao ◽  
Guoan Su ◽  
Xiuyun Liu ◽  
Songwen Jin ◽  

The conventional slow feature analysis (SFA) algorithm has no support of computational theory of vision for primates, nor does it have the ability to learn the global features with visual selection consistency continuity. And what is more, the algorithm is highly complex. Based on this, Slow Feature Extraction Algorithm Based on Visual selection consistency continuity and Its Application was proposed. Inspired by the visual selection consistency continuity theory for primates, this paper replaced the principal component analysis (PCA) method of the conventional SFA algorithm with the myTICA method, extracted the Gabor basis functions of natural images, initialized the basis function family; it used the feature basis expansion algorithm based on visual selection consistency continuity (the VSCC_FBEA algorithm) to replace the polynomial expansion method in the original SFA algorithm to generates the Gabor basis functions of features with long and short-term visual selectivity in the family of basis functions, which solved the drawbacks of the polynomial prediction algorithm; it also designed the Lipschitz consistency constraint, and proposed the Lipschitz-Orthogonal-Pruning-Method (LOPM algorithm) to optimize the basis function family into an over-complete family of basis functions. In addition, this paper used the feature expression method based on visual invariance theory (visual invariance theory -FEM) to establish the set of features of natural images with visual selection consistency continuity. Subsequently, it adopted three error evaluation methods and mySFA classification method to evaluate the proposed algorithm. According to the experimental results, the proposed algorithm showed good prediction performance with respect to the LSVRC2012 data set; compared with the SFA, GSFA, TICA, myICA and mySFA algorithms, the proposed algorithm is correct and feasible; when the classification threshold of the algorithm was set at 8.0, the recognition rate of the proposed algorithm reached 99.66%, and neither of the false recognition rate and the false rejection rate was higher than 0.33%. The proposed algorithm has good performance in prediction and classification, and also shows good anti-noise capacity under limited noise conditions.

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Yajun Wang ◽  
Shengming Cheng ◽  
Xinchen Zhang ◽  
Junyu Leng ◽  
Jun Liu

The traditional distributed database storage architecture has the problems of low efficiency and storage capacity in managing data resources of seafood products. We reviewed various storage and retrieval technologies for the big data resources. A block storage layout optimization method based on the Hadoop platform and a parallel data processing and analysis method based on the MapReduce model are proposed. A multireplica consistent hashing algorithm based on data correlation and spatial and temporal properties is used in the parallel data processing and analysis method. The data distribution strategy and block size adjustment are studied based on the Hadoop platform. A multidata source parallel join query algorithm and a multi-channel data fusion feature extraction algorithm based on data-optimized storage are designed for the big data resources of seafood products according to the MapReduce parallel frame work. Practical verification shows that the storage optimization and data-retrieval methods provide supports for constructing a big data resource-management platform for seafood products and realize efficient organization and management of the big data resources of seafood products. The execution time of multidata source parallel retrieval is only 32% of the time of the standard Hadoop scheme, and the execution time of the multichannel data fusion feature extraction algorithm is only 35% of the time of the standard Hadoop scheme.

Sign in / Sign up

Export Citation Format

Share Document