Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matching”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Power matching to pulsed inductively coupled plasmas

Matching of power delivery to nonlinear loads in plasma processing is a continuing challenge. Plasma reactors used in microelectronics fabrication are increasingly multi-frequency and/or pulsed, producing a non-linear and, in many cases, non-steady state electrical termination that can complicate efficient power coupling to the plasma. This is particularly the case for pulsed inductively coupled plasmas where the impedance of the plasma can significantly change during the start-up-transient and undergo an E–H (capacitive-to-inductive) transition. In this paper, we discuss the results from a computational investigation of the dynamics of power matching to pulsed inductively coupled plasmas (Ar/Cl 2 mixtures of tens of mTorr pressure) using fixed component impedance matching networks and their consequences on plasma properties. In this investigation, we used set-point matching where the components of the matching network provide a best-case impedance match (relative to the characteristic impedance of the power supply) at a chosen time during the pulsed cycle. Matching impedance early during the pulse enables power to feed the E-mode, thereby emphasizing capacitive coupling and large excursions in the plasma potential. This early power coupling enables a more rapid ramp-up in plasma density while being mismatched during the H-mode later in the pulse. The early match also produces more energetic ion bombardment of surfaces. Matching late in the pulse diminishes power dissipated in the E-mode at the cost of also reducing the rate of increase in plasma density.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2014

SU-E-T-622: Identification and Improvement of Patients Eligible for Dose Escalation with Matched Plans

Purpose: Radiation-therapy dose-escalation beyond 80Gy may improve tumor control rates for patients with localized prostate cancer. Since toxicity remains a concern, treatment planners must achieve dose-escalation while still adhering to dose-constraints for surrounding structures. Patientmatching is a machine-learning technique that identifies prior patients that dosimetrically match DVH parameters of target volumes and critical structures prior to actual treatment planning. We evaluated the feasibility of patient-matching in (1)identifying candidates for safe dose-escalation; and (2)improving DVH parameters for critical structures in actual dose-escalated plans. Methods: We analyzed DVH parameters from 319 historical treatment plans to determine which plans could achieve dose-escalation (8640cGy) without exceeding Zelefsky dose-constraints (rectal and bladder V47Gy<53%, and V75.6Gy<30%, max-point dose to rectum of 8550cGy, max dose to PTV< 9504cGy). We then estimated the percentage of cases that could achieve safe dose-escalation using software that enables patient matching (QuickMatch, Siris Medical, Mountain View, CA). We then replanned a case that had violated DVH constraints with DVH parameters from patient matching, in order to determine whether this previously unacceptable plan could be made eligible with this automated technique. Results: Patient-matching improved the percentage of patients eligible for dose-escalation from 40% to 63% (p=4.7e-4, t-test). Using a commercial optimizer augmented with patient-matching, we demonstrated a case where patient-matching improved the toxicity-profile such that dose-escalation would have been possible; this plan was rapidly achieved using patientmatching software. In this patient, all lower-dose constraints were met with both the denovo and patient-matching plan. In the patient-matching plan, maximum dose to the rectum was 8385cGy, while the denovo plan failed to meet the maximum rectal constraint at 8571cGy. Conclusion: Patientmatching is a promising method to identify eligible patients, and to assist in creating acceptable plans for dose-escalation. Further study will investigate other disease states. Additionally, the time-savings provided by patientmatching warrants further investigation. The following authors have equity ownership in Siris Medical, Inc: K Bush, TF Atwood.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2013

Efficient Aho-Corasick String Matching on Emerging Multicore Architectures

String matching algorithms are critical to several scientific fields. Beside text processing and databases, emerging applications such as DNA protein sequence analysis, data mining, information security software, antivirus, ma- chine learning, all exploit string matching algorithms [3]. All these applica- tions usually process large quantity of textual data, require high performance and/or predictable execution times. Among all the string matching algorithms, one of the most studied, especially for text processing and security applica- tions, is the Aho-Corasick algorithm. 1 2 Book title goes here Aho-Corasick is an exact, multi-pattern string matching algorithm which performs the search in a time linearly proportional to the length of the input text independently from pattern set size. However, depending on the imple- mentation, when the number of patterns increase, the memory occupation may raise drastically. In turn, this can lead to significant variability in the performance, due to the memory access times and the caching effects. This is a significant concern for many mission critical applications and modern high performance architectures. For example, security applications such as Network Intrusion Detection Systems (NIDS), must be able to scan network traffic against very large dictionaries in real time. Modern Ethernet links reach up to 10 Gbps, and malicious threats are already well over 1 million, and expo- nentially growing [28]. When performing the search, a NIDS should not slow down the network, or let network packets pass unchecked. Nevertheless, on the current state-of-the-art cache based processors, there may be a large per- formance variability when dealing with big dictionaries and inputs that have different frequencies of matching patterns. In particular, when few patterns are matched and they are all in the cache, the procedure is fast. Instead, when they are not in the cache, often because many patterns are matched and the caches are continuously thrashed, they should be retrieved from the system memory and the procedure is slowed down by the increased latency. Efficient implementations of string matching algorithms have been the fo- cus of several works, targeting Field Programmable Gate Arrays [4, 25, 15, 5], highly multi-threaded solutions like the Cray XMT [34], multicore proces- sors [19] or heterogeneous processors like the Cell Broadband Engine [35, 22]. Recently, several researchers have also started to investigate the use Graphic Processing Units (GPUs) for string matching algorithms in security applica- tions [20, 10, 32, 33]. Most of these approaches mainly focus on reaching high peak performance, or try to optimize the memory occupation, rather than looking at performance stability. However, hardware solutions supports only small dictionary sizes due to lack of memory and are difficult to customize, while platforms such as the Cell/B.E. are very complex to program.

Tumeo, Antonino↗
DOE OSTI2016

Feature detection and matching on atmospheric nuclear detonation video

Automated feature matching of nuclear detonations (NUDETs) enables three‐dimensional point cloud reconstruction, and establishment a volume‐based model to reduce uncertainty in estimating the yield of NUDETs solely from video. Establishing a volume‐based model requires feature correspondences between wide viewpoints of 58°–110° that are larger than scale‐invariant feature transform‐based techniques can reliably match. The presented technique detects relative bright features in the NUDET known as ‘hotspots,’ and matches them across wide viewpoints using a spherical based object model. Results show that hotspots can be detected with a 71.95% hit rate and 86.03% precision. Hotspots are matched to films from different viewpoints with 76.6% correctness and a standard deviation of 16.4%. Hotspot descriptors are also matched in time sequence with 99.6% correctness and a standard deviation of 1.07%. The results demonstrate that a spherical model can serve as a viable descriptor model for matching across wide viewpoints when the object is known to be spherical. It also demonstrates an automated feature detection and matching combination that enables features to be matched from unsynchronised video across wide viewpoints of 58°–110° on spherical objects where state‐of‐the‐art techniques are insufficient.

Schmitt, Daniel T.↗
DOE OSTI2014

Numerical matching of the sheath and presheath solutions for a spherical probe in radial-motion theory

The theory of positive-ion collection by a probe immersed in a low-pressure plasma was reviewed and extended by Allen, Boyd, and Reynolds [Proc. Phys. Soc. 70, 297 (1957)]. For a given value of the ion current, the boundary values of the matched “nonneutral” or “sheath” solution V{sup ~}{sub nn}{sup (m)}(r; r{sub m}) were obtained from the “quasineutral” or “presheath” solution V{sup ~}{sub qn}(r) by choosing the small potential and electric-field values corresponding to some large “matching radius” r{sub m}. Here, a straightforward but efficient numerical method is presented for systematically determining an optimal value of the matching radius at which the presheath and sheath solutions are joined to yield the “matched” potential profile. Some suitable initial matching radius r{sub m1} is chosen and the related potential and electric-field values of the quasineutral solution are calculated. Using these as boundary conditions, Poisson's equation is integrated to yield the matched nonneutral solution including the corresponding potential at the probe surface. This procedure is repeated for increasing values r{sub m2}, r{sub m3},…. until the resulting potential at the probe surface becomes practically constant. The corresponding value of r{sub m} is taken as the “optimal” matching radius r{sub mo} at which the presheath and sheath solutions are ultimately joined to yield the “optimal” matched potential profile in the entire plasma-probe transition region. It is also shown that the Bohm criterion is inapplicable in the present problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study

Traditional implementations of parallel graph operations on distributed memory platforms are written using Message Passing Interface (MPI) point to point communication primitives such as Send-Recv (blocking and nonblocking). Apart from this classical model, the MPI community has over the years added other communication models; however, their suitability for handling the irregular traffic workloads typical of graph operations remain comparatively less explored. Our aim in this paper is to study these relatively underutilized communication models of MPI for graph applications. More specifically, we evaluate MPI’s one-sided programming, or Remote Memory Access (RMA), and nearest neighborhood collectives using a process graph topology. There are features in these newer models that are intended to better map to irregular communication patterns, as exemplified in graph algorithms. As a concrete application for our case study, we use distributed memory implementations of a weighted graph matching algorithm to investigate performances of MPI-3 RMA and neighborhood collective operations compared to nonblocking Send- Recv. A matching in a graph is a subset of edges such that no two matched edges are incident on the same vertex. A maximum weight matching is a matching of maximum weight computed as the sum of the weights of matched edges. Algorithms for optimal matching have quadratic complexity and are difficult to parallelize. More importantly, execution of graph matching is dominated by high volume of irregular memory accesses, making it an ideal candidate for studying the effects of various MPI communication models on graph applications at scale. Our neighborhood collectives and RMA implementations yields up to 6× speedup over traditional optimized nonblocking Send-Recv implementations, on thousands of cores of the NERSC Cori supercomputer. We believe the lessons learned from this case study can be adopted to benefit a wider range of graph application codes.

Ghosh, Sayan↗
DOE OSTI2016

SU-F-T-487: On-Site Beam Matching of An Elekta Infinity with Agility MLC with An Elekta Versa HD

Purpose: Historically, beam matching of similar Linear Accelerators has been accomplished by sending beam data to the manufacturer to match at their factory. The purpose of this work is to demonstrate that fine beam matching can be carried out on-site as part of the acceptance test, with similar or better results. Methods: Initial scans of a 10 × 10 Percent depth dose (PDD) and a 40 × 40 beam profile at the depth of Dmax, for 6MV and 10 MV were taken to compare with the standard beam data from the Versa. The energy was then adjusted and the beam steered to achieve agreement between the depth dose and the horns of the beam profile. This process was repeated until the best agreement between PDD and profiles was achieved. Upon completion, all other clinical data were measured to verify match. This included PDD, beam profiles, output factors and Wedge factors. For electron beams PDD’s were matched and the beam profiles verified for the final beam energy. Confirmatory PDD and beam profiles for clinical field sizes, as well as Output Factors were measured. Results: The average difference in PDD’s for 6MV and 10MV were within 0.4% for both wedged and open fields. Beam profile comparisons over the central 80% of the field, at multiple depths, show agreement of 0.8% or less for both wedged and open fields. Average output factor agreement over all field sizes was 0.4% for 6MV and 0.2 % for 10MV. Wedge factors agreement was less than 0.6% for both photon energies over all field sizes. Electron PDD agreed to 0.5mm. Cone ratios agreed to 1% or less. Conclusion: This work indicates that beam matching can be carried out on-site simply and quickly. The results of this beam matching can achieve similar or better results than factory matching.

43 PARTICLE ACCELERATORS↗
DOE OSTI2016

SU-F-T-491: Photon Beam Matching Analysis at Multiple Sites Up to Twelve Years Post Installation

Purpose: To determine if the photon beams associated with several models of accelerators are matched with ‘Golden Beam’ data (VGBD) to assess treatment planning modeling and delivery. Methods: Six accelerators’ photon beams were evaluated to determine if they matched the manufacturer’s (Varian Medical Systems, Inc.) VGBD. Additional direct comparisons of the 6X and 18X beams using the manufacturer’s specification of Basic and Fine beam matching were also performed. The Cseries accelerator models were 21 EX (3), IX (2), and a IX Trilogy, ranging from three to twelve years post installation. Computerized beam scanning was performed (IBA Blue Phantom 2) with 2 CC13 ion chambers in water at 100 cm SSD. Dmax (10 cm2 field size), percentage depth dose (6 cm2, 10 cm2, 20 cm2, and 30 cm2 field sizes) and beam uniformity (10 cm2, 30 cm2 and 40 cm2 field sizes) were evaluated. Results: When comparing the beams with VGBD using the ‘Basic’ matching criteria, all beams were within the specifications ( 1.5mm at dmax, 1% PDD, and 2% Profiles). When considering the “Fine” matching criteria ( 1.5mm at dmax, 0.5% PDD, and 2% Profiles), only three of six 6MV beams and two of six high energy (five 18MV & one 15MV) beams passed. Direct comparisons between accelerators using the Clinac IX (installed 2012) as the reference beam datasets resulted in all 6 MV and 18MV beams meeting both the “Basic” and “Fine” criterion with the exception of two accelerators. Conclusion: Linear accelerators installed up to nine years apart are capable of meeting the manufacturers beam matching criteria for “Basic” matching. Without any adjustments most beams, when evaluated, may meet the “Fine” match criteria. The use of a single dataset (VGBD or designated accelerator reference data) for treatment planning commissioning is acceptable and can provide quality treatment delivery.

61 RADIATION PROTECTION AND DOSIMETRY↗
NASA NTRS2021

Hybrid phenology matching model for robust crop phenological retrieval

Crop phenology regulates seasonal agroecosystem carbon, water, and energy exchanges, and is a key component in empirical and process-based crop models for simulating biogeochemical cycles of farmlands, assessing gross and net primary production, and forecasting the crop yield. The advances in phenology matching models provide a feasible means to monitor crop phenological progress using remote sensing observations, with a priori information of reference shapes and reference phenological transition dates. Yet the underlying geometrical scaling assumption of models, together with the challenge in defining phenological references, hinders the applicability of phenology matching in crop phenological studies. The objective of this study is to develop a novel hybrid phenology matching model to robustly retrieve a diverse spectrum of crop phenological stages using satellite time series. The devised hybrid model leverages the complementary strengths of phenometric extraction methods and phenology matching models. It relaxes the geometrical scaling assumption and can characterize key phenological stages of crop cycles, ranging from farming practice-relevant stages (e.g., planted and harvested) to crop development stages (e.g., emerged and mature). To systematically evaluate the influence of phenological references on phenology matching, four representative phenological reference scenarios under varying levels of phenological calibrations in terms of time and space are further designed with publicly accessible phenological information. The results indicate that the hybrid phenology matching model can achieve high accuracies for estimating corn and soybean phenological growth stages in Illinois, particularly with the year- and region-adjusted phenological reference (R-squared higher than 0.9 and RMSE less than 5 days for most phenological stages). The inter-annual and regional phenological patterns characterized by the hybrid model correspond well with those in the crop progress reports (CPRs) from the USDA National Agricultural Statistics Service (NASS). Compared to the benchmark phenology matching model, the hybrid model is more robust to the decreasing levels of phenological reference calibrations, and is particularly advantageous in retrieving crop early phenological stages (e.g., planted and emerged stages) when the phenological reference information is limited. This innovative hybrid phenology matching model, together with CPR-enabled phenological reference calibrations, holds 3 considerable promise in revealing spatio-temporal patterns of crop phenology over extended geographical regions.

Phenology↗
DOE OSTI2018

ULAMA: A Utilization-Aware Matching Approach for robust on-demand spatial service brokers

This article investigates an on-demand spatial service broker for suggesting service provider propositions and the corresponding time of service to mobile consumers while meeting the consumer’s maximum travel time and wait time constraints. The goal of the broker is to maximize the number of matched requests while also keeping the “eco-system” functioning and robust against variations in the supply–demand ratio by engaging as many service providers as possible and maintaining providers’ participation to ensure that providers do not drop out. This problem is important because of its many related societal applications in the on-demand and sharing economy (e.g., on-demand ride-hailing services, on-demand food delivery, etc.). Challenges of this problem include the need to satisfy many conflicting requirements of the broker, consumers and service providers and the high computational complexity since solving the problem for a number of available consumers at any time instant is NP-hard. Related work in spatial crowdsourcing and ridesharing has mainly focused on maximizing the number of matched requests and minimizing travel cost, but did not consider the importance of maintaining provider engagement and balancing provider utilization, which could become a priority when the available supply exceeds the demand. In this paper, we propose a Utilization-Aware Matching Approach (ULAMA) which employs novel provider-centric heuristics for balancing the utilization of providers, and a consumer-priority-based greedy matching algorithm that prioritizes consumers for maximizing the number of matched requests. Experimental results show that our proposed approach outperforms related work by achieving the lowest variance in provider utilization while matching all available providers even when supply greatly exceeds demand. Our approach also achieved a larger number of matched requests, particularly when supply exceeds demand and also when both supply and demand are balanced.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Integrity of the National Resident Matching Program for Radiation Oncology: National Survey of Applicant Experiences

Purpose: The aim of this study was to examine the experiences of radiation oncology applicants and to evaluate the prevalence of behaviors that may be in conflict with established ethical standards. Methods and Materials: An anonymous survey was sent to all 2013 applicants to a single domestic radiation oncology residency program through the National Resident Matching Program (NRMP). Questions included demographics, survey of observed behaviors, and opinions regarding the interview and matching process. Descriptive statistics were presented. Characteristics and experiences of respondents who matched were compared with those who did not match. Results: Questionnaires were returned by 87 of 171 applicants for a 51% response rate. Eighty-two questionnaires were complete and included for analysis. Seventy-eight respondents (95.1%) reported being asked at least 1 question in conflict with the NRMP code of conduct. When asked where else they were interviewing, 64% stated that this query made them uncomfortable. Forty-five respondents (54.9%) reported unsolicited post-interview contact by programs, and 31 (37.8%) felt pressured to give assurances. Fifteen respondents (18.3%) reported being told their rank position or that they were “ranked to match” prior to Match day, with 27% of those individuals indicating this information influenced how they ranked programs. Half of respondents felt applicants often made dishonest or misleading assurances, one-third reported that they believed their desired match outcome could be improved by deliberately misleading programs, and more than two-thirds felt their rank position could be improved by having faculty from their home institutions directly contact programs on their behalf. Conclusions: Radiation oncology applicants report a high prevalence of behaviors in conflict with written NRMP policies. Post-interview communication should be discouraged in order to enhance fairness and support the professional development of future radiation oncologists.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2014

SU-E-T-262: Planning for Proton Pencil Beam Scanning (PBS): Applications of Gradient Optimization for Field Matching

Purpose: To propose the gradient optimization(GO) approach in planning for matching proton PBS fields and present two commonly used applications in our institution. Methods: GO is employed for PBS field matching in the scenarios that when the size of the target is beyond the field size limit of the beam delivery system or matching is required for beams from different angles to either improve the sparing of important organs or to pass through a short and simple beam path. Overlap is designed between adjacent fields and in the overlapped junction, the dose was optimized such that it gradually decreases in one field and the decrease is compensated by increase from another field. Clinical applications of this approach on craniospinal irradiation(CSI) and whole pelvis treatment were presented. Mathematical model was developed to study the relationships between dose errors, setup errors and junction lengths. Results: Uniform and conformal dose coverage to the entire target volumes was achieved for both applications using GO approach. For CSI, the gradient matching (6.7cm junction) between fields overcame the complexity of planning associated with feathering match lines. A slow dose gradient in the junction area significantly reduced the sensitivity of the treatment to setup errors. For whole pelvis, gradient matching (4cm junction) between posterior fields for superior target and bilateral fields for inferior target provided dose sparing to organs such as bowel, bladder and rectum. For a setup error of 3 mm in longitudinal direction from one field, mathematical model predicted dose errors of 10%, 6% and 4.3% for junction length of 3, 5 and 7cm. Conclusion: This GO approach improves the quality of the PBS treatment plan with matching fields while maintaining the safety of treatment delivery relative to potential misalignments.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Four-dimensional dose reconstruction through in vivo phase matching of cine images of electronic portal imaging device

Purpose: A method is proposed to reconstruct a four-dimensional (4D) dose distribution using phase matching of measured cine images to precalculated images of electronic portal imaging device (EPID). Methods: (1) A phantom, designed to simulate a tumor in lung (a polystyrene block with a 3 cm diameter embedded in cork), was placed on a sinusoidally moving platform with an amplitude of 1 cm and a period of 4 s. Ten-phase 4D computed tomography (CT) images of the phantom were acquired. A planning target volume (PTV) was created by adding a margin of 1 cm around the internal target volume of the tumor. (2) Three beams were designed, which included a static beam, a theoretical dynamic beam, and a planning-optimized dynamic beam (PODB). While the theoretical beam was made by manually programming a simplistic sliding leaf motion, the planning-optimized beam was obtained from treatment planning. From the three beams, three-dimensional (3D) doses on the phantom were calculated; 4D dose was calculated by means of the ten phase images (integrated over phases afterward); serving as “reference” images, phase-specific EPID dose images under the lung phantom were also calculated for each of the ten phases. (3) Cine EPID images were acquired while the beams were irradiated to the moving phantom. (4) Each cine image was phase-matched to a phase-specific CT image at which common irradiation occurred by intercomparing the cine image with the reference images. (5) Each cine image was used to reconstruct dose in the phase-matched CT image, and the reconstructed doses were summed over all phases. (6) The summation was compared with forwardly calculated 4D and 3D dose distributions. Accounting for realistic situations, intratreatment breathing irregularity was simulated by assuming an amplitude of 0.5 cm for the phantom during a portion of breathing trace in which the phase matching could not be performed. Intertreatment breathing irregularity between the time of treatment and the time of planning CT was considered by utilizing the same reduced amplitude when the phantom was irradiated. To examine the phase matching in a humanoid environment, the matching was also performed in a digital phantom (4D XCAT phantom). Results: For the static, the theoretical, and the planning-optimized dynamic beams, the 4D reconstructed doses showed agreement with the forwardly calculated 4D doses within the gamma pass rates of 92.7%, 100%, and 98.1%, respectively, at the isocenter plane given by 3%/3 mm criteria. Excellent agreement in dose volume histogram of PTV and lung-PTV was also found between the two 4D doses, while substantial differences were found between the 3D and the 4D doses. The significant breathing irregularities modeled in this study were found not to be noticeably affecting the reconstructed dose. The phase matching was performed equally well in a digital phantom. Conclusions: The method of retrospective phase determination of a moving object under irradiation provided successful 4D dose reconstruction. This method will provide accurate quality assurance and facilitate adaptive therapy when distinguishable objects such as well-defined tumors, diaphragm, and organs with markers (pancreas and liver) are covered by treatment beam apertures.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Dense Image Matching Uncertainty Estimation and Confidence Metrics

Dense stereo matching takes overlapping image pairs as input and outputs a disparity map which encodes pixel-by-pixel matches between the images. Recently, there has been an interest in ranking the quality, or even quantifying the accuracy, of disparity estimates. The proposed methods can be described as either uncertainty estimators or confidence metrics. Uncertainty estimators are a small minority of the research. However, they have the potential to be the most useful because they estimate disparity accuracy (in pixel units) that can be used to threshold matches or carried forward using error propagation. The majority of the research deals with confidence metrics which give an ordinal (or binary) ranking of a match’s quality relative to other matches. Confidence metrics do not have units and thus are useful primarily for thresholding matches from mismatches. The methods could also be described as handcrafted or deep-learning based. The majority of the research focused on outdoor driving scenes. Hence, our interest–application to a satellite semi-global matching pipeline–is a domain shift that may challenge deep-learning based methods. We conclude by recommending five handcrafted and two deep-learning based methods for evaluation in our pipeline.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1987

Constraint-based stereo matching

The major difficulty in stereo vision is the correspondence problem that requires matching features in two stereo images. Researchers describe a constraint-based stereo matching technique using local geometric constraints among edge segments to limit the search space and to resolve matching ambiguity. Edge segments are used as image features for stereo matching. Epipolar constraint and individual edge properties are used to determine possible initial matches between edge segments in a stereo image pair. Local edge geometric attributes such as continuity, junction structure, and edge neighborhood relations are used as constraints to guide the stereo matching process. The result is a locally consistent set of edge segment correspondences between stereo images. These locally consistent matches are used to generate higher-level hypotheses on extended edge segments and junctions to form more global contexts to achieve global consistency.

Kuan, D. T.↗
NASA NTRS1991

A graph theoretic approach to scene matching

The ability to match two scenes is a fundamental requirement in a variety of computer vision tasks. A graph theoretic approach to inexact scene matching is presented which is useful in dealing with problems due to imperfect image segmentation. A scene is described by a set of graphs, with nodes representing objects and arcs representing relationships between objects. Each node has a set of values representing the relations between pairs of objects, such as angle, adjacency, or distance. With this method of scene representation, the task in scene matching is to match two sets of graphs. Because of segmentation errors, variations in camera angle, illumination, and other conditions, an exact match between the sets of observed and stored graphs is usually not possible. In the developed approach, the problem is represented as an association graph, in which each node represents a possible mapping of an observed region to a stored object, and each arc represents the compatibility of two mappings. Nodes and arcs have weights indicating the merit or a region-object mapping and the degree of compatibility between two mappings. A match between the two graphs corresponds to a clique, or fully connected subgraph, in the association graph. The task is to find the clique that represents the best match. Fuzzy relaxation is used to update the node weights using the contextual information contained in the arcs and neighboring nodes. This simplifies the evaluation of cliques. A method of handling oversegmentation and undersegmentation problems is also presented. The approach is tested with a set of realistic images which exhibit many types of sementation errors.

Ranganath, Heggere S.↗
NASA NTRS1997

Efficient algorithms for robust feature matching

One of the basic building blocks in any point-based registration scheme involves matching feature points that are extracted from the sensed image to their counterparts in the reference image. This leads to the fundamental problem of point matching: given two sets of points, find the affine transformation that transforms one point set so that its distance from the other point set is minimized. Because of measurement errors and the presence of outlying data points, it is important that the distance measure between two point sets be robust to these effects. We measure distances using the generalized Hausdorff distance. Point matching can be a computationally intensive task, and there have been a number of algorithms and approaches proposed for solving this problem both theoretical and applied. We present two approaches to the point matching problem, in an attempt to reduce the computational complexity of the problem, while still providing guarantees on the quality of the final match. Our first method is an approximation algorithm, which is loosely based on a branch-and-bound approach due to Huttenlocher and Rucklidge. We show that by varying the approximation error bounds, it is possible to achieve a tradeoff between the quality of the match and the running time of the algorithm. Our second method involves a Monte Carlo method for accelerating the search process used in the first algorithm. With high probability this method succeeds in finding an approximately optimal match. We establish the efficiency of our approaches empirically.

Mount, David M.↗
NASA NTRS2014

Processing of ICARTT Data Files Using Fuzzy Matching and Parser Combinators

In this paper, the task of parsing and matching inconsistent, poorly formed text data through the use of parser combinators and fuzzy matching is discussed. An object-oriented implementation of the parser combinator technique is used to allow for a relatively simple interface for adapting base parsers. For matching tasks, a fuzzy matching algorithm with Levenshtein distance calculations is implemented to match string pair, which are otherwise difficult to match due to the aforementioned irregularities and errors in one or both pair members. Used in concert, the two techniques allow parsing and matching operations to be performed which had previously only been done manually.

Rutherford, Matthew T.↗