Searcharxiv⌕ Search

arXiv subjects

Wei-Chang Yeh

Publications and source records attributed to Wei-Chang Yeh.

At least 37 records · Page 2Linked to original sources

PAM: Pose Attention Module for Pose-Invariant Face Recognition

Pose variation is one of the key challenges in face recognition. Conventional techniques mainly focus on face frontalization or face augmentation in image space. However, transforming face images in image space is not guaranteed to preserve the lossless identity features of the original image. Moreover, these methods suffer from more computational costs and memory requirements due to the additional models. We argue that it is more desirable to perform feature transformation in hierarchical feature space rather than image space, which can take advantage of different feature levels and benefit from joint learning with representation learning. To this end, we propose a lightweight and easy-to-implement attention block, named Pose Attention Module (PAM), for pose-invariant face recognition. Specifically, PAM performs frontal-profile feature transformation in hierarchical feature space by learning residuals between pose variations with a soft gate mechanism. We validated the effectiveness of PAM block design through extensive ablation studies and verified the performance on several popular benchmarks, including LFW, CFP-FP, AgeDB-30, CPLFW, and CALFW. Experimental results show that our method not only outperforms state-of-the-art methods but also effectively reduces memory requirements by more than 75 times. It is noteworthy that our method is not limited to face recognition with large pose variations. By adjusting the soft gate mechanism of PAM to a specific coefficient, such semantic attention block can easily extend to address other intra-class imbalance problems in face recognition, including large variations in age, illumination, expression, etc.

cs.CV↗

New Binary-Addition Tree Algorithm for the All-Multiterminal Binary-State Network Reliability Problem

Various real-life applications, for example, Internet of Things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems, are always modeled as network structures. The binary-state network composed of binary-state (e.g., functioning or failed) components (arcs and/or nodes) is one of the most popular network structures. The two-terminal network reliability is a success probability that the network is still functioning and can be calculated by verifying the connectivity between two specific nodes, and is an effective and popular technique for evaluating the performance of all types of networks. To obtain complete information for a making better decisions, a multi-terminal network reliability extends the two specific nodes to a specific node subset in which all nodes are connected. In this study, a new algorithm called the all-multiterminal BAT is proposed by revising the binary-addition-tree algorithm (BAT) and the layered-search algorithm (LSA) to calculate all multi-terminal reliabilities. The efficiency and effectiveness of the proposed all-multiterminal BAT are analyzed from the perspective of time complexity and explained via numerical experiments to solve the all-multiterminal network reliability problems.

cs.NI↗

Novel Binary Addition Tree Algorithm (BAT) for Calculating the Direct Lower-Bound of the Highly Reliable Binary-State Network Reliability

Real-world applications such as the internet of things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems are typically modeled as network structures. Network reliability represents the success probability of a network and it is an effective and popular metric for evaluating the performance of all types of networks. Binary-state networks composed of binary-state (e.g., working or failed) components (arcs and/or nodes) are some of the most popular network structures. The scale of networks has grown dramatically in recent years. For example, social networks have more than a billion users. Additionally, the reliability of components has increased as a result of both mature and emergent technology. For highly reliable networks, it is more practical to calculate approximated reliability, rather than exact reliability, which is an NP-hard problem. Therefore, we propose a novel direct reliability lower bound based on the binary addition tree algorithm to calculate approximate reliability. The efficiency and effectiveness of the proposed reliability bound are analyzed based on time complexity and validated through numerical experiments.

cs.DM↗

A Novel Simplified Swarm Optimization for Generalized Reliability Redundancy Allocation Problem

Network systems are commonly used in various fields, such as power grid, Internet of Things (IoT), and gas networks. Reliability redundancy allocation problem (RRAP) is a well-known reliability design tool, which needs to be developed when the system is extended from the series-parallel structure to a more general network structure. Therefore, this study proposes a novel RRAP called General RRAP (GRRAP) to be applied to network systems. The Binary Addition Tree Algorithm (BAT) is used to solve the network reliability. Since GRRAP is an NP-hard problem, a new algorithm called Binary-addition simplified swarm optimization (BSSO) is also proposed in this study. BSSO combines the accuracy of the BAT with the efficiency of SSO, which can effectively reduce the solution space and speed up the time to find high-quality solutions. The experimental results show that BSSO outperforms three well-known algorithms, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Swarm Optimization (SSO), on six network benchmarks.

cs.NI↗

Implementation of Parallel Simplified Swarm Optimization in CUDA

As the acquisition cost of the graphics processing unit (GPU) has decreased, personal computers (PC) can handle optimization problems nowadays. In optimization computing, intelligent swarm algorithms (SIAs) method is suitable for parallelization. However, a GPU-based Simplified Swarm Optimization Algorithm has never been proposed. Accordingly, this paper proposed Parallel Simplified Swarm Optimization (PSSO) based on the CUDA platform considering computational ability and versatility. In PSSO, the theoretical value of time complexity of fitness function is O (tNm). There are t iterations and N fitness functions, each of which required pair comparisons m times. pBests and gBest have the resource preemption when updating in previous studies. As the experiment results showed, the time complexity has successfully reduced by an order of magnitude of N, and the problem of resource preemption was avoided entirely.

cs.NE↗

Novel General Active Reliability Redundancy Allocation Problems and Algorithm

The traditional (active) reliability redundancy allocation problem (RRAP) is used to maximize system reliability by determining the redundancy and reliability variables in each subsystem to satisfy the volume, cost, and weight constraints. The RRAP structure is very simple, that is, redundant components are parallel in each subsystem, and all subsystems are either connected in series or in a bridge network. Owing to its important and practical applications, a novel RRAP, called the general RRAP (GRRAP), is proposed to extend the series-parallel structure or bridge network to a more general network structure. To solve the proposed novel GRRAP, a new algorithm, called the BAT-SSOA3, used the simplified swarm optimization (SSO) to update solutions, the small-sampling tri-objective orthogonal array (SS3OA) to tune the parameters in the proposed algorithm, the binary-addition-tree algorithm (BAT) to calculate the fitness (i.e., reliability) of each solution, and the penalty function to force infeasible back to the feasible region. To validate the proposed algorithm, the BAT-SSOA3 is compared with state-of-the-art algorithms, such as, particle swarm optimization (PSO) and SSO, via designed experiments and computational studies.

math.OC↗

Convolution Neural Network Hyperparameter Optimization Using Simplified Swarm Optimization

Convolutional neural networks (CNNs) are widely used in image recognition. Numerous CNN models, such as LeNet, AlexNet, VGG, ResNet, and GoogLeNet, have been proposed by increasing the number of layers, to improve the performance of CNNs. However, performance deteriorates beyond a certain number of layers. Hence, hyperparameter optimisation is a more efficient way to improve CNNs. To validate this concept, a new algorithm based on simplified swarm optimisation is proposed to optimise the hyperparameters of the simplest CNN model, which is LeNet. The results of experiments conducted on the MNIST, Fashion MNIST, and Cifar10 datasets showed that the accuracy of the proposed algorithm is higher than the original LeNet model and PSO-LeNet and that it has a high potential to be extended to more complicated models, such as AlexNet.

cs.NE↗

Computation of the Activity-on-Node Binary-State Reliability with Uncertainty Components

Various networks such as cloud computing, water/gas/electricity networks, wireless sensor networks, transportation networks, and 4G/5G networks, have become an integral part of our daily lives. A binary-state network (BN) is often used to model network structures and applications. The BN reliability is the probability that a BN functions continuously; that is, that there is always a simple path connected between a specific pair of nodes. This metric is a popular index for designing, managing, controlling, and evaluating networks. The traditional BN reliability assumes that the reliability of each arc is known in advance. However, this is not always the case. Functioning components operate under different environments; moreover, a network might have newly installed components. Hence, the reliability of these components is not always known. To resolve the aforementioned problems, in which the reliability of some components of a network are uncertain, we introduce the fuzzy concept for the analysis of these components, and propose a new algorithm to solve this uncertainty-component BN reliability problem. The time complexity of the proposed algorithm is analyzed, and the superior performance of the algorithm is demonstrated through examples.

cs.DM↗

Novel Direct Algorithm for Computing Simultaneous All-Levels Reliability of Multi-state Flow Networks

All kind of networks, e.g., Internet of Things, social networks, wireless sensor networks, transportation networks, 4g/5G, etc., are around us to benefit and help our daily life. The multistate flow network (MFN) is always used to model network structures and applications. The level d reliability, Rd, of the MFN is the success probability of sending at least d units of integer flow from the source node to the sink node. The reliability Rd is a popular index for designing, managing, controlling, and evaluating MFNs. The traditional indirect algorithms must have all d-MPs (special connected vectors) or d-MCs (special disconnected vectors) first, then use Inclusion-Exclusion Technique (IET) or Sum-of-disjoint Product (SDP) in terms of found d-MPs or d-MCs to calculate Rd. The above four procedures are all NP-Hard and #P-Hard and cannot calculate Rd for all d at the same time A novel algorithm based on the binary-addition-tree algorithm (BAT) is proposed to calculate the Rd directly for all d at the same time without using any of the above four procedures. The time complexity and demonstration of the proposed algorithm are analyzed, and examples are provided. An experiment is also conducted to compare the proposed algorithm and existing algorithms based on d-MPs, d-MCs, IET, and/or SDP to validate the proposed algorithm.

cs.DM↗

Novel Algorithm for Computing All-Pairs Homogeneity-Arc Binary-State Undirected Network Reliability

Among various real-life emerging applications, wireless sensor networks, Internet of Things, smart grids, social networks, communication networks, transportation networks, and computer grid systems, etc., the binary-state network is the fundamental network structure and model with either working or failed binary components. The network reliability is an effective index for assessing the network function and performance. Hence, the network reliability between two specific nodes has been widely adopted and more efficient network reliability algorithm is always needed. To have complete information for a better decision, all-pairs network reliability thus arises correspondingly. In this study, a new algorithm called the all-pairs BAT is proposed by revising the binary-addition-tree algorithm (BAT) and the layered-search algorithm (LSA). From both the theoretical analysis and the practical experiments conducted on 20 benchmark problems, the proposed all-pairs BAT is more efficient than these algorithms by trying all combinations of any pairs of nodes.

cs.DM↗

One-batch Preempt Deterioration-effect Multi-state Multi-rework Network Reliability Problem and Algorithms

A rework network is a distinct multi-state network that exists in many real-life industrial manufacturing systems for fixing defective products using rework processes to improve the utility and productivity of the systems. To provide a more general model of rework networks, a novel one-batch preempt multi-state multi-rework network is proposed to achieve real-life applications without numerous impractical and unreasonable limitations. Accordingly, a new algorithm based on two different multi-state types of binary addition tree algorithms (BATs) is proposed to calculate the reliability of the proposed rework. Furthermore, the proposed BAT-based algorithm is applied to four rework problems to validate its effectiveness and performance for the rework reliability problem.

eess.SY↗

Novel Bounded Binary-Addition Tree Algorithm for Binary-State Network Reliability Problems

Many network applications are based on binary-state networks, where each component has one of two states: success or failure. Efficient algorithms to evaluate binary-state network reliability are continually being developed. Reliability estimates the probability of the success state and is an effective and popular evaluation technique for binary-state networks. Binary-addition tree (BAT) algorithms are frequently used to calculate the efficiency and reliability of binary-state networks. In this study, we propose a novel, bounded BAT algorithm that employs three novel concepts: the first connected vector, the last disconnected vector, and super vectors. These vectors and the calculations of their occurrent probabilities narrow the search space and simplify the probability calculations to reduce the run time of the algorithm. Moreover, we show that replacing each undirected arc with two directed arcs, which is required in traditional direct methods, is unnecessary in the proposed algorithm. We call this novel concept the undirected vectors. The performance of the proposed bounded BAT algorithm was verified experimentally by solving a benchmark set of problems.

cs.NI↗

A new BAT for Acyclic Multistate Information Network Reliability Evaluation

The acyclic multistate information network (AMIN), which is a kind of MIN that does not require the conservation law of flow, plays an important role nowadays because many modern network structures present AMIN as the construction such as social networks, local area networks (LANs), 4G/5G networks, etc. To effectively evaluate the network reliability of AMIN, which indicates the reliable operation of the network, showing a major and primary metrics for determining the performance and quality of the overall network. The network reliability, which has been shown a NP-hard, has been successfully resolved and approached by the universal generation function method (UGFM). However, the UGFM can only solve small-scale problems due to the overflow in computer memory. To overcome the memory obstacle, an improved and enhanced binary-addition vectors tree algorithm (BAT) is proposed to effectively evaluate and analyze the reliability of AMIN. The performance of the proposed BAT is validated on examples.

cs.NI↗

Simplified Swarm Optimization for Bi-Objection Active Reliability Redundancy Allocation Problems

The reliability redundancy allocation problem (RRAP) is a well-known tool in system design, development, and management. The RRAP is always modeled as a nonlinear mixed-integer non-deterministic polynomial-time hardness (NP-hard) problem. To maximize the system reliability, the integer (component active redundancy level) and real variables (component reliability) must be determined to ensure that the cost limit and some nonlinear constraints are satisfied. In this study, a bi-objective RRAP is formulated by changing the cost constraint as a new goal, because it is necessary to balance the reliability and cost impact for the entire system in practical applications. To solve the proposed problem, a new simplified swarm optimization (SSO) with a penalty function, a real one-type solution structure, a number-based self-adaptive new update mechanism, a constrained nondominated-solution selection, and a new pBest replacement policy is developed in terms of these structures selected from full-factorial design to find the Pareto solutions efficiently and effectively. The proposed SSO outperforms several metaheuristic state-of-the-art algorithms, e.g., nondominated sorting genetic algorithm II (NSGA-II) and multi-objective particle swarm optimization (MOPSO), according to experimental results for four benchmark problems involving the bi-objective active RRAP.

cs.NE↗

A New Method for Verifying d-MC Candidates

Network reliability modeling and calculation is a very important study domain in reliability engineering. It is also a popular index for validating and measuring the performance of real-world multi-state flow networks (MFNs), e.g., the applications in internet of things, social networks, clouding computing, and 5G. The d-MC is a vector, the maximum flow of whose related network is d, and any vector less than the d-MC is not a d-MC in MFNs. The MFN reliability can be calculated in terms of d-MCs. Hence, the d-MC is one of the most popular tools for evaluating the MFN reliability. The method to find all d-MCs is through the mathematical programming whose solutions are called d-MC candidates, and all d-MCs are selected from these candidates. In this study, a novel and simple algorithm is proposed to filter out d-MCs from these d-MC candidates after removing duplicates. The time complexity of the proposed algorithm is analyzed along with the demonstration using an example. An experiment with 200 random networks is outlined to compare the proposed, traditional, and best-known algorithms used for verifying d-MC candidates.

cs.DM↗

Novel Binary-Addition Tree Algorithm (BAT) for Binary-State Network Reliability Problem

Network structures and models have been widely adopted, e.g., for Internet of Things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems. Network reliability is an effective and popular technique to estimate the probability that the network is still functioning. Networks composed of binary-state (e.g., working or failed) components (arcs and/or nodes) are called binary-state networks. The binary-state network is the fundamental type of network; thus, there is always a need for a more efficient algorithm to calculate the network reliability. Thus, a novel binary-addition tree (BAT) algorithm that employs binary addition for finding all the possible state vectors and the path-based layered-search algorithm for filtering out all the connected vectors is proposed for calculating the binary-state network reliability. According to the time complexity and numerical examples, the efficiency of the proposed BAT is higher than those of traditional algorithms for solving the binary-state network reliability problem.

cs.DS↗

Convolutional Support Vector Machine

The support vector machine (SVM) and deep learning (e.g., convolutional neural networks (CNNs)) are the two most famous algorithms in small and big data, respectively. Nonetheless, smaller datasets may be very important, costly, and not easy to obtain in a short time. This paper proposes a novel convolutional SVM (CSVM) that has both advantages of CNN and SVM to improve the accuracy and effectiveness of mining smaller datasets. The proposed CSVM adapts the convolution product from CNN to learn new information hidden deeply in the datasets. In addition, it uses a modified simplified swarm optimization (SSO) to help train the CSVM to update classifiers, and then the traditional SVM is implemented as the fitness for the SSO to estimate the accuracy. To evaluate the performance of the proposed CSVM, experiments were conducted to test five well-known benchmark databases for the classification problem. Numerical experiments compared favorably with those obtained using SVM, 3-layer artificial NN (ANN), and 4-layer ANN. The results of these experiments verify that the proposed CSVM with the proposed SSO can effectively increase classification accuracy.

cs.LG↗

General Multi-State Rework Network and Reliability Algorithm

A rework network is a common manufacturing system, in which flows (products) are processed in a sequence of workstations (nodes), which often results in defective products. To improve the productivity and utility of the system, the rework network allows some of the defective products to go back to the "as normal" condition after the rework process. In a recent study, Song proposed an algorithm to correct more than 21 archive publications regarding the rework network reliability problem, which is an important real-life problem. However, we prove that Song's proposed algorithm is still incorrect. Additionally, we provide an accurate general model based on the novel state distribution with a smaller number of limitations. Furthermore, we propose an algorithm to calculate the reliability of the multi-state rework networks using the proposed novel state distributions.

cs.DS↗