An underwater acoustic sensor network (UASN) is suitable for gathering data from aquatic environments, including lakes, rivers, seas, and oceans. This network faces several issues due to the distinct features of under...
详细信息
An underwater acoustic sensor network (UASN) is suitable for gathering data from aquatic environments, including lakes, rivers, seas, and oceans. This network faces several issues due to the distinct features of underwater environments and the limitations of acoustic channels. These challenges include energy limitations, unreliable communication links, and dynamic network topologies. Additionally, the difficulty of recharging or replacing batteries in underwater conditions makes energy optimization essential for prolonging the network lifespan. Currently, many energy-efficient approaches in UASNs emphasize node clustering and multi-hop communication, but most of these methods rely on distributed algorithms. This paper introduces a novel energy-efficient clustering framework called FHOEEC (Fire Hawk Optimization-based Energy-Efficient Clustering), which integrates both distributed and centralized strategies. The clustering process is divided into three stages: (1) cluster formation, (2) selection of cluster heads, and (3) cluster maintenance. During the periodic neighbor discovery phase, FHOEEC examines two key aspects: the format of the hello packet and its propagation process. FHOEEC aims to create an energy-efficient, cluster-based network structure. To achieve this, the sink node utilizes the fire hawk optimization (FHO) algorithm to decide on the optimal range and number of clusters. To establish these clusters, a fitness function considers a weighted combination of three sub-functions: intra-cluster and inter-cluster distances, the proportion of isolated clusters compared to others, and cluster density. In the final stage, intra-cluster and inter-cluster communication paths are established by focusing on energy balance. This ensures that nodes with energy levels below a specified threshold are excluded from serving as intermediate nodes. Simulation results and performance evaluations show that FHOEEC outperforms three existing clustering methods–CCCS, GTC, and
We consider the problem of classifying documents containing multiple unordered pages. For this purpose, we propose a novel bag-of-pages document representation. To represent a document, one assigns every page to a pro...
详细信息
An anti-compression watermarking scheme is proposed. The scheme uses improved Dougleas-Peucker algorithm to compress redundant vertex data, which is important character of vector map, and embeds the watermark into com...
详细信息
In large-scale query-by-example retrieval, embedding image signatures in a binary space offers two benefits: data compression and search efficiency. While most embedding algorithms binarize both query and database sig...
详细信息
Car plate detection is a key component in automatic license plate recognition system. This paper adopts an enhanced cascaded tree style learner framework for car plate detection using the hybrid object features includ...
详细信息
This report introduces our work at the instance search task of TRECVID 2016. This year INS task asks systems to retrieve specific persons in specific locations. For the new task, the key points include: (1) We exploit...
详细信息
The problem of egomotion recovery has been treated by using as input local image motion, with the published algorithms utilizing the geometric constraint relating 2-D local image motion (optical flow, correspondence, ...
详细信息
Three-dimensional rotational angiography (3DRA) is a promising imaging technique which yields high-resolution isotropic 3D images of vascular structures. Raw 3DRA images, however, usually suffer from a high noise leve...
详细信息
The definition of accurate similarity measures is a key issue of every Case-Based Reasoning application. Although some approaches to optimize similarity measures automatically have already been applied, these approach...
详细信息
Laplacianfaces is a recent addition to appearance based face recognition algorithms with promising future potential. Unlike Eigenfaces algorithm, Laplacianfaces algorithm finds an embedding that preserves the locality...
详细信息
Laplacianfaces is a recent addition to appearance based face recognition algorithms with promising future potential. Unlike Eigenfaces algorithm, Laplacianfaces algorithm finds an embedding that preserves the locality information of the subjects in feature space. In this study we have comprehensively evaluated the performance of Laplacianfaces against PCA on FERET face-image database using csuFaceIdEval as the testing platform. The effect of internal parameters, including size of locality to be preserved, the choice of distance measure to determine locality and the number of leading eigenvalues to be used for matching has been thoroughly studied for the first time. The impact of illumination, face expression and age variations on the relative performance of Laplacianfaces and Eigenfaces has been shown to be very significant and best parameter settings for enhanced performance have been proposed.
暂无评论