Matching Algorithm Research Articles

Multidimensional morphological analysis of live sperm based on multiple-target tracking

Manual semen evaluation methods are subjective and time-consuming. In this study, a deep learning algorithmic framework was designed to enable non-invasive multidimensional morphological analysis of live sperm in motion, improve current clinical sperm morphology testing methods, and significantly contribute to the advancement of assisted reproductive technologies. We improved the FairMOT tracking algorithm by incorporating the distance and angle of the same sperm head movement in adjacent frames, as well as the head target detection frame IOU value, into the cost function of the Hungarian matching algorithm. For sperm morphology, we used the BlendMask segmentation method to segment individual sperm. SegNet was used to separate the head, midpiece, and principal piece comments from each sperm. Experienced in vivo sperm physicians confirmed a morphological accuracy percentage of 90.82%. A total of 1272 samples were collected from multiple tertiary hospitals for validation of the system, which were also evaluated by physicians. The results of our system were highly consistent with those of manual microscopy. This study realized the automated detection of progressive motility and morphology of sperm simultaneously, which is crucial for selection of morphologically normal and motile sperm for intracytoplasmic sperm injection.

A Web Portal for Tracking and Finding Missing Person Using Aadhaar Enabled Biometrics

The Aadhaar-Enabled Biometric Web Portal for Finding Missing Persons research aims to address the critical issue of locating missing individuals by leveraging Aadhaar-enabled biometric data. With the widespread adoption of Aadhaar cards in India, this research uses the unique biometric information linked to Aadhaar cards to create a web portal. Through this portal, users can input relevant biometric data, such as fingerprints or iris scans, which are then compared with the Aadhaar database. The system utilizes advanced biometric matching algorithms to accurately identify potential matches, thereby aiding law enforcement agencies and concerned individuals in locating missing persons efficiently. By integrating Aadhaar-enabled biometrics into a user-friendly web interface, this research facilitates swift and accurate identification, offering a valuable tool in the effort to reunite missing individuals with their families and loved ones.

Sea ice drift vector extraction based on feature matching using CS-1 Images

The study emphasizes the crucial role of sea ice drift in Arctic climate research and the protection of human activities. Employing C-SAR/01 (CS-1) imagery as the primary data source, the study assesses the effectiveness of the ORB feature matching algorithm for extracting Arctic Sea ice drift vectors. Additionally, it investigates the spatial distribution variations in the drift vectors extracted from the HH and HV polarization channels. The accuracy of the extracted drift vectors is validated using manually extracted sea ice drift data. Experimental results reveal a significant disparity in the number of drift vectors extracted from CS-1 HV polarization images compared to HH polarization images. The sea ice drift vectors extracted using the Oriented fast and Roasted Bried (ORB) operator demonstrate an average velocity error of less than 0.27 cm/s (0.31 km/d) and an average direction error of less than 5.66° in HV polarization images.

Region-based convolutional neural networks for occluded person re-identification

In a variety of applications, including intelligent surveillance systems, targeted tracking, and assistive human-following robots, the ability to accurately identify individuals even when they are partially obscured is imperative. Such Continuous person tracking is complicated by the close similarity between the appearance of people and target occlusions. This study addresses this significant challenge by proposing a two-step, detection-first approach that uses a region-based convolutional neural network (R-CNN) as the re-identification (re-ID)solution. The model is specifically trained to detect occluded persons at different levels of occlusion before forwarding the image for the re-ID process. Three occluded-specific datasets are selected to evaluate the model's effectiveness in detecting occluded people. There are 379 distinct people in total, and each has five images obstructed from different angles. A sample of the data is taken to simulate various environment settings, and new data points are generated with different degrees of occlusion to assess how well the model performs under varying levels of obstruction. The findings demonstrate that the proposed person re-ID model is reliable in most circumstances, correctly re-identifying at 74% (Rank-1) and 90% (Rank-5). Although there is a decrease in accuracy as the number of distinctive people in the dataset increases, this does not significantly impact the tracking performance in various applications, which are expected to recognize a single person or a small group of individuals. Future works will explore refining similarity matching algorithms by delving into robust image comparison techniques, thereby addressing the challenges presented by occlusions. A critical aspect is to assess the model under diverse lighting conditions and investigate scenarios with multiple individuals in a frame. It is also beneficial to exploit high-resolution datasets, such as DukeMTMC-reID, and integrate finer contextual details, like clothing or carried objects. These collective efforts are essential for optimizing the model’s efficacy in practical applications and advancing person re-ID technologies.

Performance evaluation of individual tree detection and segmentation algorithms using ALS data in Chir Pine (Pinus roxburghii) forest

The application of individual tree detection algorithms for assessing forest inventories and aiding decision-making in forestry has been a subject of research for more than two decades. Nevertheless, there is a notable research gap in the development of robust algorithms capable of automatically detecting trees of different species, ages, and varied crown sizes in dense forest environments. In this study, we conducted a comprehensive evaluation of six different individual tree detection (ITD) algorithms using airborne LiDAR data in Chir Pine (Pinus roxburghii) forests. This research represents one of the pioneering efforts in applying ITD algorithms to Chir Pine forests using ALS data. We categorized ITD routines into two groups: those reliant on local maxima as treetops and initial seeds for crown delineation, and those that do not require explicit treetop identification. To assess accuracy, we developed a special Individual Tree Matching (ITM) algorithm, enabling the matching of LiDAR-detected trees with 284 reference trees measured in the field. Our analysis involved various combinations of filtering fixed window sizes and adaptive window sizes applied to the point cloud, unsmoothed, and smoothed canopy height model (CHM). Our results highlighted the effectiveness of the 3 × 3m fixed window size method on unsmoothed CHM, achieving an overall F-score of 0.65 and a tree detection rate of 86%. Additionally, the Dalponte 2016 method proved superior for crown segmentation using identified treetops, consistently measuring mean crown radii within 0.5 m of reference field trees. Among the methods not relying on treetops, the adaptive mean shift algorithm (AMS3D) delivered strong performance, boasting an overall F-score of 0.67 and mean crown radii within 0.1 m. Our study revealed a high correlation between LiDAR-detected tree heights and field-measured tree heights across all evaluated methods. Overall, our findings underscore the potential of ITD algorithms in enhancing forest attribute measurement accuracy and facilitating climate-responsive forest management strategies.

A single-stage anchor-free rotating target visual detection algorithm suitable for flexible body vibration displacement measurement

The phenomenon of angular inclination of flexible structures during vibration poses a significant challenge to the applicability of visual vibration measurement methods because the target locked in the captured image will produce unknown geometric deformations such as scale, displacement, and angle in the time domain space, and the horizontal rectangular frame used for matching during target detection will also increase the false detection rate of the target due to the introduction of more background information. Such subtle geometric deformations and false detections can lead to severe fit errors in the displacement curves regressed by the visual vibration measurement algorithm. To effectively improve the accuracy and robustness of vibration image target recognition, this article takes the flexible body captured by a high-speed camera as the target of vibration displacement measurement. It introduces the rotating target detection method based on deep learning into the field of visual vibration measurement, which verifies the feasibility of the deep learning method in flexible body vibration measurement, and based on the deep convolutional neural network framework, a high-precision displacement measurement algorithm based on single-stage anchor-free rotating target detection is proposed. The algorithm in this article first uses the CSPDarknet backbone network to extract multi-scale features of flexible structural image sequences. It then uses PANet to fuse the top-down and bottom-up bidirectional feature maps of the four bridge target feature maps obtained through the backbone network. The shallow and deep information is used for semantic feature fusion and combined with the Coordinate Attention mechanism to achieve target finding and fine positioning on the feature map. Finally, we use the coordinates of the bounding box obtained from the test to regress the position offset of the object’s center point. To verify the accuracy of the algorithm in this article, we conducted experimental validation on the cable-stayed bridge model and the actual bridge and compared the performance with the traditional template matching algorithm, differential optical flow method, and various deep learning algorithms with different localization principles, as well as the displacement signals collected and processed by accelerometers. The experimental results of time-frequency characteristics analysis show that the vibration displacement trajectories regressed by the algorithm in this paper have the best overlap with the displacement measurements collected by the accelerometer, which verifies that the algorithm in this article has good application potential and implementation space in the field of condition monitoring of flexible structural bodies.

Research on image deformation monitoring algorithm based on binocular vision

Monitoring the deformation of critical structures such as tunnel、buildings and bridges is critical to ensure the safety of infrastructures. Non-contact deformation monitoring technology based on digital imagery has emerged as a prevalent and effective monitoring method, which enables cost-effective and efficient tracking of structural deformations. This paper aims to develop an automated deformation monitoring methodology using the binocular vision. First, standard preprocessing of digital images is performed through the integration of filtering algorithms and image enhancement techniques. Furthermore, by combining the Scale Invariant Feature Transform (SIFT) feature matching algorithm, the inverse compositional gauss–newton iterative algorithm, and interpolation methodologies, the planar displacement of the monitored targets can be calculated precisely, with sub-pixel precision being achieved. Subsequently, by adopting an enhanced Semi-Global Matching (SGM) algorithm, stereo matching of binocular images were accomplished. This process yields a disparity map, from which the depth map is computed. Then, precise measurement of the vertical displacement of the monitoring target can be obtained. This enables accurate measurement of three-dimensional displacements of the monitored targets. Finally, the developed methodology undergoes a comparative assessment against traditional measurement methods and existing algorithms to validate its measurement accuracy. The results prove that the deformation measurement technique based on binocular vision proposed in this paper captures structural deformation effectively. The accuracy surpasses that of existing measurement algorithms, and its efficiency outperforms traditional measurement methods.

Application of Gale-Shapley algorithm in optimal matching for healthcare facilities to elderly population: the case of Hangzhou, China

ABSTRACT This paper serves as the first empirical research applying the Nobel Prize winning Gale-Shapley algorithm to study optimal stable matching of healthcare facilities to elderly population living in residential neighbourhoods in main urban districts of Hangzhou, China. Through bilateral considerations of supply side attributes of healthcare facilities and demand side preferences of elderly population, this research shows that the Gale-Shapley matching is superior to unilateral spatial or non-spatial utility matching and can optimize stable matching for elderly population in a way similar to the Pareto optimal. Further, this study provides a conceptual model classifying urban spaces for healthcare services at various levels.

Measurement Method of Bar Unmanned Warehouse Area Based on Binocular Vision

With the development of Industry 4.0 and the implementation of the 14th Five-Year Plan, intelligent manufacturing has become a significant trend in the steel industry, which can propel the steel industry toward a more intelligent, efficient, and sustainable direction. At present, the operation mode of unmanned warehouse area for slabs and coils has become relatively mature, while the positioning accuracy requirement of bars is getting more stringent because they are stacked in the warehouse area according to the stacking position and transferred by disk crane. Meanwhile, the traditional laser ranging and line scanning method cannot meet the demand for precise positioning of the whole bundle of bars. To deal with the problems above, this paper applies machine vision technology to the unmanned warehouse area of bars, proposing a binocular vision-based measurement method. On the one hand, a 3D reconstruction model with sub-pixel interpolation is established to improve the accuracy of 3D reconstruction in the warehouse area. On the other hand, a feature point matching algorithm based on motion trend constraint is established by means of multi-sensor data fusion, thus improving the accuracy of feature point matching. Finally, a high-precision unmanned 3D reconstruction of the bar stock area is completed.

Deep match: A zero-shot framework for improved fiducial-free respiratory motion tracking

Background and purposeMotion management is essential to reduce normal tissue exposure and maintain adequate tumor dose in lung stereotactic body radiation therapy (SBRT). Lung SBRT using an articulated robotic arm allows dynamic tracking during radiation dose delivery. Two stereoscopic X-ray tracking modes are available – fiducial-based and fiducial-free tracking. Although X-ray detection of implanted fiducials is robust, the implantation procedure is invasive and inapplicable to some patients and tumor locations. Fiducial-free tracking relies on tumor contrast, which challenges the existing tracking algorithms for small (e.g., <15 mm) and/or tumors obscured by overlapping anatomies. To markedly improve the performance of fiducial-free tracking, we proposed a deep learning-based template matching algorithm – Deep Match. MethodDeep Match consists of four self-definable stages – training-free feature extractor, similarity measurements for location proposal, local refinements, and uncertainty level prediction for constructing a more trustworthy and versatile pipeline. Deep Match was validated on a 10 (38 fractions; 2661 images) patient cohort whose lung tumor was trackable on one X-ray view, while the second view did not offer sufficient conspicuity for tumor tracking using existing methods. The patient cohort was stratified into subgroups based on tumor sizes (<10 mm, 10–15 mm, and >15 mm) and tumor locations (with/without thoracic anatomy overlapping). ResultsOn X-ray views that conventional methods failed to track the lung tumor, Deep Match achieved robust performance as evidenced by >80 % 3 mm-Hit (detection within 3 mm superior/inferior margin from ground truth) for 70 % of patients and <3 mm superior/inferior distance (SID) ∼1 mm standard deviation for all the patients. ConclusionDeep Match is a zero-shot learning network that explores the intrinsic neural network benefits without training on patient data. With Deep Match, fiducial-free tracking can be extended to more patients with small tumors and with tumors obscured by overlapping anatomy.

Real‐time displacement measurement for long‐span bridges using a compact vision‐based system with speed‐optimized template matching

AbstractThis paper introduces a new accelerating algorithm, efficient match slimmer (EMS), specifically designed to lighten computational loads of sophisticated template matching algorithms, enabling these algorithms to be effectively run on single‐board computers. Utilizing EMS in conjunction with a robust template matching algorithm, we have developed Raspberry Vision—a compact, cost‐effective, and real‐time vision‐based system. Its compactness and portability facilitate a practical measurement strategy that not only minimizes the camera‐to‐target distance but also simplifies the camera calibration process in bridge displacement monitoring, thereby enhancing measurement accuracy. The performance of the system is estimated on two operational suspension bridges. The results demonstrate that Raspberry Vision, equipped with the measurement strategy, can significantly improve the measurement accuracy in the long‐span bridge test and is also suitable for cross‐sea bridge measurements.

Hierarchical sort-based parallel algorithm for dynamic interest matching

Publish–subscribe communication is a fundamental service used for message-passing between decoupled applications in distributed simulation. When abundant unnecessary data transfer is introduced, interest-matching services are needed to filter irrelevant message traffic. Frequent demands during simulation execution makes interest matching a bottleneck with increased simulation scale. Contemporary algorithms built for serial processing inadequately leverage multicore processor-based parallel resources. Parallel algorithmic improvements are insufficient for large-scale simulations. Therefore, we propose a hierarchical sort-based parallel algorithm for dynamic interest matching that embeds all update and subscription regions into two full binary trees, thereby transferring the region-matching task to one of node-matching. It utilizes the association between adjacent nodes and the hierarchical relation between parent‒child nodes to eliminate redundant operations, and achieves incremental parallel matching that only compares changed regions. We analyze the time and space complexity of this process. The new algorithm performs better and is more scalable than state-of-the-art algorithms.

Clothing Style Similarity Matching and Classification Recognition Algorithm Based on Double-Layer Model in the Context of the Internet of Things

Abstract The identification of different clothing style attributes is helpful for designers to grasp the clothing style, and it is also helpful for consumers to find clothes with the same style attributes according to their own preferences. This is becoming more important in the clothing design, Internet, and e-commerce industries. It is of great significance to carry out clothing style similarity matching and classification recognition. For the problem of clothing style similarity matching and classification recognition, the traditional algorithm stays in the stage of qualitative analysis and subjective evaluation, unable to quantitatively and objectively determine clothing style, resulting in the decline of clothing style similarity matching effect and classification recognition accuracy. Therefore, a similarity matching, classification, and recognition algorithm of clothing style based on the double-layer model in the context of the Internet of Things is designed. The double-layer model is constructed through the target detection layer and target segmentation layer. The double-layer model is used to realize the segmentation of clothing image. The overall similarity evaluation index of image style is obtained according to the image gradient to complete the similarity matching of clothing style. On this basis, the clothing image features are extracted and input into the support vector machine classifier to complete the clothing classification and recognition. The experimental results show that the proposed garment style similarity matching and classification recognition algorithm based on the two-layer model has high image segmentation accuracy, good style similarity matching effect, high classification recognition accuracy, and high efficiency, which proves that the algorithm is feasible for garment style similarity matching and classification recognition using the two-layer model and can be further applied in the field of garment design.

Fairness-Aware Dynamic Ride-Hailing Matching Based on Reinforcement Learning

The core issue in ridesharing is designing reasonable algorithms to match drivers and passengers. The ridesharing matching problem, influenced by various constraints such as weather, traffic, and supply–demand dynamics in real-world scenarios, requires optimization of multiple objectives like total platform revenue and passenger waiting time. Due to its complexity in terms of constraints and optimization goals, the ridesharing matching problem becomes a central issue in the field of mobile transportation. However, the existing research lacks exploration into the fairness of driver income, and some algorithms are not practically applicable in the industrial context. To address these shortcomings, we have developed a fairness-oriented dynamic matching algorithm for ridesharing, effectively optimizing overall platform efficiency (expected total driver income) and income fairness among drivers (entropy of weighted amortization fairness information between drivers). Firstly, we introduced a temporal dependency of matching outcomes on subsequent matches in the scenario setup and used reinforcement learning to predict these temporal dependencies, overcoming the limitation of traditional matching algorithms that rely solely on historical data and current circumstances for order allocation. Then, we implemented a series of optimization solutions, including the introduction of a time window matching model, pruning operations, and metric representation adjustments, to enhance the algorithm’s adaptability and scalability for large datasets. These solutions also ensure the algorithm’s efficiency. Finally, experiments conducted on real datasets demonstrate that our fairness-oriented algorithm based on reinforcement learning achieves improvements of 81.4%, 28.5%, and 79.7% over traditional algorithms in terms of fairness, platform utility, and matching efficiency, respectively.

Improving Performance of Massive Text Real-Time Classification for Document Confidentiality Management

For classified and sensitive electronic documents within the scope of enterprises and organizations, in order to standardize and strengthen the confidentiality management of enterprises and meet the actual needs of secret text classification, a document automatic classification optimization method based on keyword retrieval and the kNN classification algorithm is proposed. The method supports keyword classification management, provides users with keywords of multiple risk levels, and then combines a matching scanning algorithm to label keywords of different levels. The text with labels is used as the training set of the kNN algorithm to classify the target text and realize the classification protection of text data. Aimed at solving the shortcomings of large feature vector dimension, low classification efficiency, and low accuracy in existing kNN text classification methods, an optimization method is proposed using a feature selection algorithm and a kNN algorithm based on an AVX instruction set to realize real-time classification of massive texts. By constructing a keyword dictionary and an optimized feature vector, parallel calculation of the feature vector weight and distance vector is realized, and the accuracy and efficiency of text classification are improved. The experimental results show that the multi-classification effect of the feature selection algorithm used in this paper, tf-DE, is better than that of the traditional tf-idf algorithm, and the classification effect of kNN is comparable to that of the support vector machine (SVM) algorithm. With the increase in feature vector dimensions, the classification effect of the text classification algorithm is improved and the classification time also increases linearly. The AVX-256 acceleration method takes about 55% of the time of the original version, thus verifying the effect of multi-classification of massive texts for document confidentiality management.

Voice-based Biometric Data through Machine Learning Algorithm using Feature-based Classification with the Wood Texture using Android Studio

Voice the authentication process uses artificial intelligence to analyze the distinct parameters which having vocal patterns to register to authenticate the dual effect of increasing security using the voice biometrics technology refers to the knowledge-based authentication methods like voice matching algorithms enable the organization the identity of a parameter that effect on the synthetic voice attacks this is text-independent speaker recognition system voice by comparing the recorded audio signal with the prerecorded reference database. Voice recognition is analyzing the input voice of a person and conversations with the search engine SERP-based conversational response generation. Unauthorized entries can be dangerous to control and checking them frequently changes of loss and problems occurring in it like phones and lockers.

Advanced Underwater Measurement System for ROVs: Integrating Sonar and Stereo Vision for Enhanced Subsea Infrastructure Maintenance

In the realm of ocean engineering and maintenance of subsea structures, accurate underwater distance quantification plays a crucial role. However, the precision of such measurements is often compromised in underwater environments due to backward scattering and feature degradation, adversely affecting the accuracy of visual techniques. Addressing this challenge, our study introduces a groundbreaking method for underwater object measurement, innovatively combining image sonar with stereo vision. This approach aims to supplement the gaps in underwater visual feature detection with sonar data while leveraging the distance information from sonar for enhanced visual matching. Our methodology seamlessly integrates sonar data into the Semi-Global Block Matching (SGBM) algorithm used in stereo vision. This integration involves introducing a novel sonar-based cost term and refining the cost aggregation process, thereby both elevating the precision in depth estimations and enriching the texture details within the depth maps. This represents a substantial enhancement over existing methodologies, particularly in the texture augmentation of depth maps tailored for subaquatic environments. Through extensive comparative analyses, our approach demonstrates a substantial reduction in measurement errors by 1.6%, showing significant promise in challenging underwater scenarios. The adaptability and accuracy of our algorithm in generating detailed depth maps make it particularly relevant for underwater infrastructure maintenance, exploration, and inspection.

Quasi-Dense Matching for Oblique Stereo Images through Semantic Segmentation and Local Feature Enhancement

This paper proposes a quasi-dense feature matching algorithm that combines image semantic segmentation and local feature enhancement networks to address the problem of the poor matching of image features because of complex distortions, considerable occlusions, and a lack of texture on large oblique stereo images. First, a small amount of typical complex scene data are used to train the VGG16-UNet, followed by completing the semantic segmentation of multiplanar scenes across large oblique images. Subsequently, the prediction results of the segmentation are subjected to local adaptive optimization to obtain high-precision semantic segmentation results for each planar scene. Afterward, the LoFTR (Local Feature Matching with Transformers) strategy is used for scene matching, enabling enhanced matching for regions with poor local texture in the corresponding planes. The proposed method was tested on low-altitude large baseline stereo images of complex scenes and compared with five classical matching methods. Results reveal that the proposed method exhibits considerable advantages in terms of the number of correct matches, correct rate of matches, matching accuracy, and spatial distribution of corresponding points. Moreover, it is well-suitable for quasi-dense matching tasks of large baseline stereo images in complex scenes with considerable viewpoint variations.

A Novel Framework for Image Matching and Stitching for Moving Car Inspection under Illumination Challenges.

Vehicle exterior inspection is a critical operation for identifying defects and ensuring the overall safety and integrity of vehicles. Visual-based inspection of moving objects, such as vehicles within dynamic environments abounding with reflections, presents significant challenges, especially when time and accuracy are of paramount importance. Conventional exterior inspections of vehicles require substantial labor, which is both costly and prone to errors. Recent advancements in deep learning have reduced labor work by enabling the use of segmentation algorithms for defect detection and description based on simple RGB camera acquisitions. Nonetheless, these processes struggle with issues of image orientation leading to difficulties in accurately differentiating between detected defects. This results in numerous false positives and additional labor effort. Estimating image poses enables precise localization of vehicle damages within a unified 3D reference system, following initial detections in the 2D imagery. A primary challenge in this field is the extraction of distinctive features and the establishment of accurate correspondences between them, a task that typical image matching techniques struggle to address for highly reflective moving objects. In this study, we introduce an innovative end-to-end pipeline tailored for efficient image matching and stitching, specifically addressing the challenges posed by moving objects in static uncalibrated camera setups. Extracting features from moving objects with strong reflections presents significant difficulties, beyond the capabilities of current image matching algorithms. To tackle this, we introduce a novel filtering scheme that can be applied to every image matching process, provided that the input features are sufficient. A critical aspect of this module involves the exclusion of points located in the background, effectively distinguishing them from points that pertain to the vehicle itself. This is essential for accurate feature extraction and subsequent analysis. Finally, we generate a high-quality image mosaic by employing a series of sequential stereo-rectified pairs.

Detection of normal and abnormal brain tumor MRI images using machine learning approaches

&lt;p&gt;Without image processing, the modern technological world we live in today would be completely different. Different applications can be found in many different areas, including as medicine, remote sensing, computer vision, and more. Brain tumours occur because of the abnormal growth of brain tissue. Therefore, it is crucial to surgically remove the tumor’s component that has spread throughout the brain. The creation of images of the human body’s internal organs and structures depends on numerous factors, one of which is the use of Magnetic Resonance Imaging (MRI), one of the many medical imaging techniques. Segmenting images is a challenging task in the modern medical field. The tumor’s location and sizes can be detected with more accuracy with the help of a segmentation performed on MRI slices. In this paper, we propose the Adaptive Convex Region Contour (ACRC) algorithm, a novel method for achieving such requirements. Here, we use the Support Vector Machine, often known as SVM, to identify slices and determine whether they are normal or abnormal. Once the SVM results are in, the off-kilter slices will be included into the analysis. Since the human body already has a complex anatomy in 3D. It’s disappointing because MRI slices can only provide images in a plain, 2D plane. Because of its 3D structure, the tumor’s actual shape cannot be detected from a surface image. This means that the transformation from 2D to 3D is important, as it provides necessary data to the surgeons doing the operation. The Rapid Mode Image Matching (RMIM) algorithm should be used when constructing a 3D reconstruction model. Immediately after the 3D model is completed being created, a rough estimate of the tumor’s original volume is generated. The methodological consideration was conducted in the simulated MATLAB software. It was determined from the data that the proposed method is better to the current establishment methodologies in terms of accuracy. &lt;strong&gt;Objective:&lt;/strong&gt; This paper aims to address the need for accurate segmentation of brain tumors in Magnetic Resonance Imaging (MRI) slices. The primary research question revolves around developing a novel segmentation method, the Adaptive Convex Region Contour (ACRC) algorithm, to improve the precision of tumor detection by incorporating a Support Vector Machine (SVM) for identifying abnormal slices.&lt;strong&gt; &lt;/strong&gt;&lt;strong&gt;Methods: &lt;/strong&gt;The proposed approach involves utilizing the SVM to classify MRI slices as either normal or abnormal. The abnormal slices, detected by SVM, are subjected to further analysis. To overcome the limitation of MRI producing 2D images for the inherently 3D human anatomy, a transformation from 2D to 3D is crucial. The Rapid Mode Image Matching (RMIM) algorithm is adopted to construct a 3D reconstruction model of the brain and its tumor. This model allows surgeons to obtain a more accurate understanding of the tumor’s actual 3D shape. &lt;strong&gt;Results: &lt;/strong&gt;The methodology was implemented and evaluated using simulated MATLAB software. The results demonstrate that the proposed ACRC algorithm, combined with SVM-based abnormal slice identification and subsequent 3D reconstruction using RMIM, outperforms existing methodologies in terms of accuracy. The 3D reconstruction provides valuable insights into the tumor’s shape, aiding surgical planning. &lt;strong&gt;Conclusions: &lt;/strong&gt;In conclusion, the research contributes to the field of medical image processing by presenting a comprehensive approach for brain tumor segmentation and 3D reconstruction. The ACRC algorithm, in conjunction with SVM and RMIM, enhances the accuracy of tumor detection and provides critical 3D information for surgical procedures. This advancement holds the potential to improve the efficacy of brain tumor surgeries, underscoring the significance of innovative image processing techniques in modern medical applications.&lt;/p&gt;