Face recognition has received significant attention because of its numerous applications in access control, law enforcement, security, surveillance, Internet communication and computer entertainment. Although significant progress has been made, the state-of-the-art face recognition systems yield satisfactory performance only under controlled scenarios and they degrade significantly when confronted with real-world scenarios. The real-world scenarios have unconstrained conditions such as illumination and pose variations, occlusion and expressions. Thus, there remain plenty of challenges and opportunities ahead. Latterly, some researchers have begun to examine face recognition under unconstrained conditions. Instead of providing a detailed experimental evaluation, which has been already presented in the referenced works, this study serves more as a guide for readers. Thus, the goal of this study is to discuss the significant challenges involved in the adaptation of existing face recognition algorithms to build successful systems that can be employed in the real world. Then, it discusses what has been achieved so far, focusing specifically on the most successful algorithms, and overviews the successes and failures of these algorithms to the subject. It also proposes several possible future directions for face recognition. Thus, it will be a good starting point for research projects on face recognition as useful techniques can be isolated and past errors can be avoided.
Large-scale wireless sensor network (LSWSN) is composed of a huge number of sensor nodes that are distributed in some region of interest (ROI), to sense and measure the environmental conditions like pressure, temperature, pollution levels, humidity, wind, and so on. The objective is to collect data for real-time monitoring so that appropriate actions can be taken promptly. One of the sensor nodes used in an LSWSN is called the sink node, which is responsible for processing and analyzing the collected information. It works as a station between the network sensor nodes and the administrator. Also, it is responsible for controlling the whole network. Determining the sink node location in an LSWSN is a challenging task, as it is crucial to the network lifetime, for keeping the network activity to the most possible extent. In this paper, the Harris' hawks optimization (HHO) algorithm is employed to solve this problem and subsequently the Prim's shortest path algorithm is used to reconstruct the network by making minimum transmission paths from the sink node to the rest of the sensor nodes. The performance of HHO is compared with other well-known algorithms such as particle swarm optimization (PSO), flower pollination algorithm (FPA), grey wolf optimizer (GWO), sine cosine algorithm (SCA), multi-verse optimizer (MVO), and whale optimization algorithm (WOA). The simulation results of different network sizes, with single and multiple sink nodes, show the superiority of the employed approach in terms of energy consumption and localization error, and ultimately prolonging the lifetime of the network in an efficacious way.INDEX TERMS Large-scale wireless sensor network, Harris' hawks optimization, topology control, sink node placement.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.