Wei Ke received the Ph.D. degree from the School of Computer Science and Engineering, Beihang University, China. He is currently a Professor with the Ph.D. in Computer Applied Technology Program, Macao Polytechnic University. His research interests include computer vision, image processing, computer graphics, programming languages and tool support for object-oriented and component-based engineering and systems. His research interests also include the design and implementation of open platforms for applications of computer graphics and pattern recognition, including programming tools, environments, and frameworks.

  • Current Employer/Organization
    Macao Polytechnic University - Faculty of Applied Sciences
  • Current Position
    Professor

    Macao Polytechnic University

  • Subjects Taught
    • Data Structures and Algorithms
    • Computer Security
    • Functional Analysis
    • Functional Programming
    • Category Theory

  • Education

    • PhD in Computer Applied Technology, School of Computer Science and Engineering, Beihang University, Beijing, China

    • MSc in Computer Software and Theory, Institute of Software, Chinese Academy of Sciences, Beijing, China

    • BSc in Computer Software, Department of Computer Science, Sun Yat-sen University, Guangzhou, Guangdong, China

  • Research Interests

    • programming languages
    • component-based software engineering and systems
    • computer vision and pattern recognition
    • image processing

  • Journal papers

    1. C. Wang, Z. Wu, Y. Chen, W. Zhang, W. Ke and Z. Xiong, "Improving 3-D Zebrafish Tracking With Multiview Data Fusion and Global Association," in IEEE Sensors Journal, vol. 23, no. 15, pp. 17245-17259, 1 Aug.1, 2023, doi: 10.1109/JSEN.2023.3288729.
      Abstract. Zebrafish behavioral patterns reveal valuable insights for biomedical research. To accurately identify these patterns, visual tracking systems need to reconstruct 3-D trajectories from multiview video sequences. However, 3-D zebrafish tracking faces challenges such as the dynamics in movements, the similarity in appearances, and the distortion caused by different viewpoints. In this article, we propose a new method for robust 3-D zebrafish trajectory reconstruction based on multiview data fusion and global association. Our method generates reliable segments of 2-D/3-D trajectories, called tracklets, where we consider short-term cues of appearance similarity and motion consistency and propose corresponding scoring metrics. Moreover, we use a lazy-reconstruction strategy to enhance the overall accuracy of 3-D trajectories by taking into account the global context. Extensive experiments on the public 3D-ZeF20 dataset demonstrate the effectiveness of the proposed method, achieving 67.9% multiple object tracking accuracy (MOTA), 64.3% ID F1 Score (IDF1), and 55.0 MTBFm.
    2. Z. Cui, H. Sheng, D. Yang, S. Wang, R. Chen and W. Ke, "Light Field Depth Estimation For Non-Lambertian Objects via Adaptive Cross Operator," in IEEE Transactions on Circuits and Systems for Video Technology, doi: 10.1109/TCSVT.2023.3292884.
      Abstract. Light field (LF) depth estimation is a crucial basis for LF-related applications. Most existing methods are based on the Lambertian assumption and cannot deal with non-Lambertian surfaces represented by transparent objects and mirrors. In this paper, we propose a novel Adaptive-Cross-Operator-based(ACO) depth estimation algorithm for non-Lambertian LF. By analyzing the imaging characteristics of non-Lambertian regions, it is found that the difficulty of depth estimation lies in the photo inconsistency of the center view. Combining with the two-branch structure, we propose ACO with an inter-branch cooperation strategy to adaptively separate depth information with different reflectance coefficients. We discover that the bimodal distribution feature of the operator filtering results can assist in the separation of multi-layer scene information. The first detection branch filters the EPI and implicitly records the severity of multi-layer scene aliasing. According to the identification of bimodal distribution features, the non-Lambertian regions are marked out and the depth of the foreground is estimated. The second branch receives guidance from the first to dynamically adjust the inner weight and infer the background’s depth after weakening the interference from the foreground. Finally, the depth information separation of multi-layer scenes is achieved by extracting the unique X-shaped linear structure. Without the reflection coefficients of the non-Lambertian object, the proposed method can produce high-quality depth estimation under the transparency of 90% to 20%. Experimental results show that the proposed ACO outperforms state-of-the-art LF depth estimation methods in terms of accuracy and robustness.
    3. Y. Wu, H. Sheng, Y. Zhang, S. Wang, Z. Xiong and W. Ke, "Hybrid Motion Model for Multiple Object Tracking in Mobile Devices," in IEEE Internet of Things Journal, vol. 10, no. 6, pp. 4735-4748, 15 March15, 2023, doi: 10.1109/JIOT.2022.3219627.
      Abstract. For an intelligent transportation system, multiple object tracking (MOT) is more challenging from the traditional static surveillance camera to mobile devices of the Internet of Things (IoT). To cope with this problem, previous works always rely on additional information from multivision, various sensors, or precalibration. Only based on a monocular camera, we propose a hybrid motion model to improve the tracking accuracy in mobile devices. First, the model evaluates camera motion hypotheses by measuring optical flow similarity and transition smoothness to perform robust camera trajectory estimation. Second, along the camera trajectory, smooth dynamic projection is used to map objects from image to world coordinate. Third, to deal with trajectory motion inconsistency, which is caused by occlusion and interaction of long time interval, tracklet motion is described by the multimode motion filter for adaptive modeling. Fourth, in tracklets association, we propose a spatiotemporal evaluation mechanism, which achieves higher discriminability in motion measurement. Experiments on MOT15, MOT17, and KITTI benchmarks show that our proposed method improves the trajectory accuracy, especially in mobile devices and our method achieves competitive results over other state-of-the-art methods.
    4. X. Jiang, Y. Xu, W. Ke, Y. Zhang, Q. -X. Zhu and Y. -L. He, "An Imbalanced Multifault Diagnosis Method Based on Bias Weights AdaBoost," in IEEE Transactions on Instrumentation and Measurement, vol. 71, pp. 1-8, 2022, Art no. 3505908, doi: 10.1109/TIM.2022.3149097.
      Abstract. Fault diagnosis plays an important role in ensuring process safety. It is noted that imbalance between fault data and normal data always exists, and multifault obviously outranges a single fault in common, which leads to more challenges to fault diagnosis. In this article, an imbalanced multifault diagnosis method based on bias weights AdaBoost (BW-AdaBoost) is proposed. First, majority normal samples are under-sampled by K-nearest neighbor (KNN) to collect the boundary samples between majority normal samples and minority fault samples, and then the bias datasets are formed by under-sampled majority samples and minority samples. Second, different weak classifiers with adaptive weights are constructed based on the bias datasets and are integrated into a strong classifier, which is taken as the base classifier. While constructing the weak classifier, higher weights are given to the items corresponding to the minority class in the loss function to enhance the influence of minority class samples. Third, to solve the multifault problem, the base classifiers are integrated into a multiclassification model by the hierarchical structure which needs fewer classifiers and less computational expense. Finally, through simulation experiment, the comparison results show that the proposed imbalanced multifault diagnosis method based on BW-AdaBoost can effectively improve the diagnosis accuracy and F1 score.
    5. K. -H. Chan, W. Ke and S. -K. Im, "A General Method for Generating Discrete Orthogonal Matrices," in IEEE Access, vol. 9, pp. 120380-120391, 2021, doi: 10.1109/ACCESS.2021.3107579.
      Abstract. Discrete orthogonal matrices have applications in information coding and cryptography. It is often challenging to generate discrete orthogonal matrices. A common approach widely in use is to discretize continuous orthogonal functions that have been discovered. The need of such continuous functions is restrictive. Polynomials, as the simplest class of continuous functions, are widely studied for their orthogonality, to serve the purpose of generating orthogonal matrices. However, beginning with continuous orthogonal polynomials still takes much work. To overcome this complexity while improving the efficiency and flexibility, we present a general method for generating orthogonal matrices directly through the construction of certain even and odd polynomials from a set of distinct positive values, bypassing the need of continuous orthogonal functions. We present a constructive proof by induction that not only asserts the existence of such polynomials, but also tells how to iteratively construct them. Besides the derivation of the method as simple as a few nested loops, we discuss two well-known discrete transforms, the Discrete Cosine Transform and the Discrete Tchebichef Transform, about how they can be achieved using our method with the specific values, and how to embed them into the transform module of video coding. By the same token, we also give the examples for generating new orthogonal matrices from arbitrarily chosen values. The demonstrative experiments indicate that our method is not only simpler to implement, but also more efficient and flexible. It can generate orthogonal matrices of larger sizes, compared with those existing methods.
    6. W. Ke and K. -H. Chan, "Pattern Matching Based on Object Graphs," in IEEE Access, vol. 9, pp. 159313-159325, 2021, doi: 10.1109/ACCESS.2021.3128575.
      Abstract. Pattern matching has been widely adopted in functional programming languages, and is gradually getting popular in OO languages, from Scala to Python. The structural pattern matching currently in use has its foundation on algebraic data types from functional languages. To better reflect the pointer structures of OO programs, we propose a pattern matching extension to general statically typed OO languages based on object graphs. By this extension, we support patterns having aliasing and circular referencing, that are typically found in pointer structures. With the requirement of only an abstract subtyping preorder on types, our extension is not restricted to a particular hierarchical class model. We give the formal base of the graph model, that is able to handle aliases and cycles in patterns, together with the abstract syntax to construct the object graphs. More complex cases of conjunction and disjunction of multiple patterns are explored with resolution. We present the type checking rules and operational semantics to reason about the soundness by proving the type safety. We also discuss the design decisions, applicability and limitation of our pattern matching extension.
    7. H. Sheng et al., "Combining Pose Invariant and Discriminative Features for Vehicle Reidentification," in IEEE Internet of Things Journal, vol. 8, no. 5, pp. 3189-3200, 1 March1, 2021, doi: 10.1109/JIOT.2020.3015239.
      Abstract. Vehicle reidentification, aiming at identifying vehicles across images, has drawn a lot of attention and has made significant achievements in recent years. However, vehicle reidentification remains a challenging task caused by severe appearance changes due to different orientations. In practice, the result of reidentification is greatly influenced by the pose of vehicles, and we call this influence as a pose barrier problem. One way to address the pose barrier problem is to train a feature representation that is invariant for various vehicle poses. To this end, we present pose robust features (PRFs) that contains two components: 1) pose-invariant features (PIFs) and 2) pose discriminative features (PDFs). On the one hand, PIF is the expert in exploring the overall characteristic of vehicles. When training PIF, we adopt an identity classifier as well as an orientation classifier. In addition, an adversarial loss is deployed in the PIF network. On the other hand, we design a PDF network, which has a similar architecture to the PIF network but can distinguish the difference between local details. The difference between PDF and PIF is that the network of training PDF does not apply the adversarial loss. Finally, by combining PIF and PDF, PRF has the advantages of the two features and can alleviate the influence of the pose barrier problem. Experiments are conducted on the VeRi-776 and VehicleID data sets. We show that PIF and PDF are complementary and that PRF produces competitive performance compared with state-of-the-art approaches.
    8. Y. Zhang, H. Sheng, Y. Wu, S. Wang, W. Ke and Z. Xiong, "Multiplex Labeling Graph for Near-Online Tracking in Crowded Scenes," in IEEE Internet of Things Journal, vol. 7, no. 9, pp. 7892-7902, Sept. 2020, doi: 10.1109/JIOT.2020.2996609.
      Abstract. In recent years, the demand for intelligent devices related to the Internet of Things (IoT) is rapidly increasing. In the field of computer vision, many algorithms have been preinstalled in IoT devices to achieve higher efficiency, such as face recognition, area detection, target tracking, etc. Tracking is an important but complex task that needs high efficiency solutions in real applications. There is a common assumption that detection can only represent one pedestrian to describe nonoverlapping in physical space. In fact, the pixels of the image do not exactly correspond to the positions in the real world. In order to overcome the limitation of this assumption, we remove this unreasonable assumption and present a novel idea that each detector response can have multiple labels to describe different targets at the same time. Therefore, we propose a graph-based method for near-online tracking in this article. We introduce a detection multiplexing method for tracking in the monocular image and propose a multiplex labeling graph (MLG) model. Each node in MLG has the ability to represent multiple targets. In addition, we improve the shortage of graph-based trackers in using temporal features. We construct long short-term memory networks to model motion and appearance features for MLG optimization. On the public multiobject tracking challenge benchmark, our near-online method gains satisfactory efficiency and achieves state-of-the-art results without additional private detection as well.
    9. Y. Zhang, H. Sheng, Y. Wu, S. Wang, W. Lyu; W. Ke; Z. Xiong, "Long-Term Tracking With Deep Tracklet Association," in IEEE Transactions on Image Processing, vol. 29, pp. 6694-6706, 2020, doi: 10.1109/TIP.2020.2993073.
      Abstract. Recently, most multiple object tracking (MOT) algorithms adopt the idea of tracking-by-detection. Relevant research shows that the performance of the detector obviously affects the tracker, while the improvement of detector is gradually slowing down in recent years. Therefore, trackers using tracklet (short trajectory) are proposed to generate more complete trajectories. Although there are various tracklet generation algorithms, the fragmentation problem still often occurs in crowded scenes. In this paper, we introduce an iterative clustering method that generates more tracklets while maintaining high confidence. Our method shows robust performance on avoiding internal identity switch. Then we propose a deep association method for tracklet association. In terms of motion and appearance, we construct motion evaluation network (MEN) and appearance evaluation network (AEN) to learn long-term features of tracklets for association. In order to explore more robust features of tracklets, a tracklet-based training mechanism is also introduced. Tracklet groups are used as the input of the networks instead of discrete detections. Experimental results show that our training method enhances the performance of the networks. In addition, our tracking framework generates more complete trajectories while maintaining the unique identity of each target as the same time. On the latest MOT 2017 benchmark, we achieve state-of-the-art results.
    10. Y. Yang, X. Li, W. Ke and Z. Liu, "Automated Prototype Generation From Formal Requirements Model," in IEEE Transactions on Reliability, vol. 69, no. 2, pp. 632-656, June 2020, doi: 10.1109/TR.2019.2934348.
      Abstract. Prototyping is an effective and efficient way of requirements validation to avoid introducing errors in the early stage of software development. However, manually developing a prototype of a software system requires additional efforts, which would increase the overall cost of software development. In this article, we present an approach with a developed tool RM2PT to automated prototype generation from formal requirements models for requirements validation. A requirements model consists of a use case diagram, a conceptual class diagram, use case definitions specified by system sequence diagrams, and the contracts of their system operations. A system operation contract is formally specified by a pair of pre and postconditions in object constraint language. We propose a method with a set of transformation rules to decompose a contract into executable parts and nonexecutable parts. An executable part can be automatically transformed into a sequence of primitive operations by applying their corresponding rules, and a nonexecutable part is not transformable with the rules. The tool RM2PT provides a mechanism for developers to develop a piece of program for each nonexecutable part manually, which can be plugged into the generated prototype source code automatically. We have conducted four case studies with over 50 use cases. The experimental result shows that the 93.65% system operations are executable, and only 6.35% are nonexecutable, which can be implemented by developers manually or invoking the third-party application programming interface (APIs). Overall, the result is satisfactory. Each 1 s generated prototype of four case studies requires approximate one day's manual implementation by a skilled programmer. The proposed approach with the developed computer-aided software engineering tool can be applied to the software industry for requirements engineering.