Log in

Relevant bibliographies by topics / Bidirectional matching / Journal articles

To see the other types of publications on this topic, follow the link: Bidirectional matching.

Journal articles on the topic 'Bidirectional matching'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Bidirectional matching.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Liu, XiangShao, Shangbo Zhou, Hua Li, and Kun Li. "Bidirectional scale-invariant feature transform feature matching algorithms based on priority k-d tree search." International Journal of Advanced Robotic Systems 14, no. 1 (December 19, 2016): 172988141668270. http://dx.doi.org/10.1177/1729881416682700.

Full text

Abstract:

In this article, a bidirectional feature matching algorithm and two extended algorithms based on the priority k-d tree search are presented for the image registration using scale-invariant feature transform features. When matching precision of image registration is below 50%, the discarding wrong match performance of many robust fitting methods like Random Sample Consensus (RANSAC) is poor. Therefore, improving matching precision is a significant work. Generally, a feature matching algorithm is used once in the image registration system. We propose a bidirectional algorithm that utilizes the priority k-d tree search twice to improve matching precision. There are two key steps in the bidirectional algorithm. According to the case of adopting the ratio restriction of distances in the two key steps, we further propose two extended bidirectional algorithms. Experiments demonstrate that there are some special properties of these three bidirectional algorithms, and the two extended algorithms can achieve higher precisions than previous feature matching algorithms.

APA, Harvard, Vancouver, ISO, and other styles

2

Gai, Rong Li, Fei Gao, Li Ming Duan, Xiao Hui Sun, and Hong Zheng Li. "Bidirectional Maximal Matching Word Segmentation Algorithm with Rules." Advanced Materials Research 926-930 (May 2014): 3368–72. http://dx.doi.org/10.4028/www.scientific.net/amr.926-930.3368.

Full text

Abstract:

Bidirectional maximum matching algorithm (BMM) combined positive maximal matching and reverse maximal matching algorithm, it was a more commonly used word segmentation method now, but it was low efficient and couldn’t solve the ambiguity. Therefore, an improved method was proposed combining with improved dictionary structure, and changing maximal matching word length dynamically to improve the efficiency of word segmentation. In order to get the correct segmentation results, we also proposed several rules. Compared with traditional segmentation methods, it proves that bidirectional maximal matching word segmentation with rules has higher speed and precision.

APA, Harvard, Vancouver, ISO, and other styles

3

Belhadef, Hacene. "A New Bidirectional Method for Ontologies Matching." Procedia Engineering 23 (2011): 558–64. http://dx.doi.org/10.1016/j.proeng.2011.11.2547.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kucherov, Gregory, Kamil Salikhov, and Dekel Tsur. "Approximate string matching using a bidirectional index." Theoretical Computer Science 638 (July 2016): 145–58. http://dx.doi.org/10.1016/j.tcs.2015.10.043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Schnattinger, Thomas, Enno Ohlebusch, and Simon Gog. "Bidirectional search in a string with wavelet trees and bidirectional matching statistics." Information and Computation 213 (April 2012): 13–22. http://dx.doi.org/10.1016/j.ic.2011.03.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Dou, Jian Fang, and Jian Xun Li. "Automatic Image Mosaic Based on SIFT Using Bidirectional Matching." Advanced Materials Research 457-458 (January 2012): 841–47. http://dx.doi.org/10.4028/www.scientific.net/amr.457-458.841.

Full text

Abstract:

In the paper, an image mosaic algorithm based on SIFT feature matching is proposed. For an image mosaic method based on feature matching, feature detection is needed to perform in each image. Thus a rapid detection operator is essential to the efficiency of the whole algorithm. In this paper, we use SIFT to extract features. The extracted features are matched by k-d tree and bidirectional matching strategy to enhance the accuracy of matching. Then, a RANSAC algorithm is applied to eliminate outliers to ensure effectiveness of the matching. Finally images are stitched by weighted average blending algorithm. The presented algorithm overcomes the disadvantages of the traditional image mosaic methods which are susceptible to different scale and moving objects, and can achieve sub-pixel accuracy of matching and algorithm is still available to the images at different scale. Experimental results show that the method with strong robustness performs effectively.

APA, Harvard, Vancouver, ISO, and other styles

7

Jia, Xiaogang, Wei Chen, and Zhengfa Liang. "Bidirectional Stereo Matching Network With Double Cost Volumes." IEEE Access 9 (2021): 19651–58. http://dx.doi.org/10.1109/access.2021.3050540.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chala, Sisay Adugna, Fazel Ansari, Madjid Fathi, and Kea Tijdens. "Semantic matching of job seeker to vacancy: a bidirectional approach." International Journal of Manpower 39, no. 8 (November 5, 2018): 1047–63. http://dx.doi.org/10.1108/ijm-10-2018-0331.

Full text

Abstract:

Purpose The purpose of this paper is to propose a framework of an automatic bidirectional matching system that measures the degree of semantic similarity of job-seeker qualifications and skills, against the vacancy provided by employers or job-agents. Design/methodology/approach The paper presents a framework of bidirectional jobseeker-to-vacancy matching system. Using occupational data from various sources such as the WageIndicator web survey, International Standard Classification of Occupations, European Skills, Competences, Qualifications, and Occupations as well as vacancy data from various open access internet sources and job seekers information from social networking sites, the authors apply machine learning techniques for bidirectional matching of job vacancies and occupational standards to enhance the contents of job vacancies and job seekers profiles. The authors also apply bidirectional matching of job seeker profiles and vacancies, i.e., semantic matching vacancies to job seekers and vice versa in the individual level. Moreover, data from occupational standards and social networks were utilized to enhance the relevance (i.e. degree of similarity) of job vacancies and job seekers, respectively. Findings The paper provides empirical insights of increase in job vacancy advertisements on the selected jobs – Internet of Things – with respect to other job vacancies, and identifies the evolution of job profiles and its effect on job vacancies announcements in the era of Industry 4.0. In addition, the paper shows the gap between job seeker interests and available jobs in the selected job area. Research limitations/implications Due to limited data about jobseekers, the research results may not guarantee high quality of recommendation and maturity of matching results. Therefore, further research is required to test if the proposed system works for other domains as well as more diverse data sets. Originality/value The paper demonstrates how online jobseeker-to-vacancy matching can be improved by use of semantic technology and the integration of occupational standards, web survey data, and social networking data into user profile collection and matching.

APA, Harvard, Vancouver, ISO, and other styles

9

Dou, Jian Fang, and Jian Xun Li. "Automatic Image Mosaic Based on SIFT Using Bidirectional Matching." Advanced Materials Research 457-458 (January 2012): 841–47. http://dx.doi.org/10.4028/scientific5/amr.457-458.841.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kwok-Wai Cheung, Dit-Yan Yeung, and R. T. Chin. "Bidirectional deformable matching with application to handwritten character extraction." IEEE Transactions on Pattern Analysis and Machine Intelligence 24, no. 8 (August 2002): 1133–39. http://dx.doi.org/10.1109/tpami.2002.1024135.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Lin, Yan, and Bo Liu. "Underwater image bidirectional matching for localization based on SIFT." Journal of Marine Science and Application 13, no. 2 (May 21, 2014): 225–29. http://dx.doi.org/10.1007/s11804-014-1252-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Jiang, Fan, Wei Ping Chen, and Zhong Wei Liang. "Bidirectional Fractal Test of Dust Particle." Advanced Materials Research 108-111 (May 2010): 954–59. http://dx.doi.org/10.4028/www.scientific.net/amr.108-111.954.

Full text

Abstract:

To describe surface shape of the dust particle comprehensively, uses the bidirectional CCD to shoot picture of dust particle, through recognizing the bidirectional particle picture, matching the particle, computing the fractal results of identical particle in two pictures, and integrating two fractal results, obtains the dust particle bidirectional fractal. The results indicated that three fractal dimensions of spherical particle are quite closed, but the three fractal dimensions of flat type particle are significantly different.

APA, Harvard, Vancouver, ISO, and other styles

13

LI Xin-lu, 李欣璐, 杨进华 YANG Jin-hua, 张刘 ZHANG Liu, 金光 JIN Guang, and 支帅 ZHI Shuai. "Bidirectional selective rule out matching recognition of fast star tracking." Optics and Precision Engineering 23, no. 5 (2015): 1443–49. http://dx.doi.org/10.3788/ope.20152305.1443.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Ma, Lin, Wenhao Jiang, Zequn Jie, and Xu Wang. "Bidirectional image-sentence retrieval by local and global deep matching." Neurocomputing 345 (June 2019): 36–44. http://dx.doi.org/10.1016/j.neucom.2018.11.089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Xie, Rong, Ke Yan, and Jie Zhou. "Taxi Bidirectional Search System Based on Smart Phone." Applied Mechanics and Materials 571-572 (June 2014): 829–32. http://dx.doi.org/10.4028/www.scientific.net/amm.571-572.829.

Full text

Abstract:

For the issues of unreasonable taxi distribution, high load rate and low dispatching efficiency etc. in the current city calling taxi services, the paper presents some key technologies of implementation of taxi driver-passenger bidirectional search system based on smart phones, including map matching, hotspot analysis, taxi route planning and bidirectional search UI. The results help achieve efficiency of urban taxi service.

APA, Harvard, Vancouver, ISO, and other styles

16

Chen, Shihong, and Tianjiao Xu. "Long Text QA Matching Model Based on BiGRU–DAttention–DSSM." Mathematics 9, no. 10 (May 17, 2021): 1129. http://dx.doi.org/10.3390/math9101129.

Full text

Abstract:

QA matching is a very important task in natural language processing, but current research on text matching focuses more on short text matching rather than long text matching. Compared with short text matching, long text matching is rich in information, but distracting information is frequent. This paper extracted question-and-answer pairs about psychological counseling to research long text QA-matching technology based on deep learning. We adjusted DSSM (Deep Structured Semantic Model) to make it suitable for the QA-matching task. Moreover, for better extraction of long text features, we also improved DSSM by enriching the text representation layer, using a bidirectional neural network and attention mechanism. The experimental results show that BiGRU–Dattention–DSSM performs better at matching questions and answers.

APA, Harvard, Vancouver, ISO, and other styles

17

Yang, Feihong, Ying Wang, Chunlei Fu, Chunqiang Hu, and Arwa Alrawais. "An Efficient Blockchain-Based Bidirectional Friends Matching Scheme in Social Networks." IEEE Access 8 (2020): 150902–13. http://dx.doi.org/10.1109/access.2020.3016986.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Lou, Xi Yin. "Research of Track-Type Full Feeding Combine Harvester Walking Design Scheme Based on Hydraulic Close System." Applied Mechanics and Materials 697 (November 2014): 187–89. http://dx.doi.org/10.4028/www.scientific.net/amm.697.187.

Full text

Abstract:

Hydraulic technology is one of the key techniques of modern transmission and control. Closed type hydraulic power transmission system is weight ratio, fast action, easy to realize the advantages of flexible stepless speed regulation, flexible power transmission. In this paper, the closed hydraulic system of double bidirectional variable hydraulic pump and the bidirectional quantitative motor, the drive system for crawler type machinery, advantages, in the walking system design process can reasonable calculation and power matching, reasonable selection of power components, the universal value of engineering application.

APA, Harvard, Vancouver, ISO, and other styles

19

Park, Jae-Hyun, Woo-Jeoung Nam, and Seong-Whan Lee. "A Two-Stream Symmetric Network with Bidirectional Ensemble for Aerial Image Matching." Remote Sensing 12, no. 3 (February 2, 2020): 465. http://dx.doi.org/10.3390/rs12030465.

Full text

Abstract:

In this paper, we propose a novel method to precisely match two aerial images that were obtained in different environments via a two-stream deep network. By internally augmenting the target image, the network considers the two-stream with the three input images and reflects the additional augmented pair in the training. As a result, the training process of the deep network is regularized and the network becomes robust for the variance of aerial images. Furthermore, we introduce an ensemble method that is based on the bidirectional network, which is motivated by the isomorphic nature of the geometric transformation. We obtain two global transformation parameters without any additional network or parameters, which alleviate asymmetric matching results and enable significant improvement in performance by fusing two outcomes. For the experiment, we adopt aerial images from Google Earth and the International Society for Photogrammetry and Remote Sensing (ISPRS). To quantitatively assess our result, we apply the probability of correct keypoints (PCK) metric, which measures the degree of matching. The qualitative and quantitative results show the sizable gap of performance compared to the conventional methods for matching the aerial images. All code and our trained model, as well as the dataset are available online.

APA, Harvard, Vancouver, ISO, and other styles

20

Fathalla, Said. "Detecting Human Diseases Relatedness." International Journal on Semantic Web and Information Systems 14, no. 3 (July 2018): 120–33. http://dx.doi.org/10.4018/ijswis.2018070106.

Full text

Abstract:

Due to the ubiquitous availability of the information on the web, there is a great need for a standardized representation of this information. Therefore, developing an efficient algorithm for retrieving information from knowledge graphs is a key challenge for many semantic web applications. This article presents spreading activation over ontology (SAOO) approach in order to detect the relatedness between two human diseases by applying spreading activation algorithm based on bidirectional search technique. The proposed approach detects two diseases relatedness by considering semantic domain knowledge. The methodology of the proposed work is divided into two phases: Semantic Matching and Diseases Relatedness Detection. In semantic matching, diseases within the user-submitted query are semantically identified in the ontology graph. In diseases relatedness detection, the relatedness between the two diseases is detected by using bidirectional-based spreading activation on the ontology graph. The classification of these diseases is provided as well.

APA, Harvard, Vancouver, ISO, and other styles

21

Hu, Tao, Peng Yi, Zehua Guo, Julong Lan, and Jianhui Zhang. "Bidirectional Matching Strategy for Multi-Controller Deployment in Distributed Software Defined Networking." IEEE Access 6 (2018): 14946–53. http://dx.doi.org/10.1109/access.2018.2798665.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Liu, Xue-jun, Bi-xian Yuan, Yu-chen Wei, Yong Yan, Yong-xu Liu, Qi-si Yang, and Jiao-jiao Qin. "Research on Bidirectional Matching Algorithm of Variable Threshold SIFT Based on DBSCAN." JOURNAL OF CHEMICAL ENGINEERING OF JAPAN 53, no. 5 (May 20, 2020): 222–28. http://dx.doi.org/10.1252/jcej.19we041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Abdullah, Taghreed, Yakoub Bazi, Mohamad M. Al Rahhal, Mohamed L. Mekhalfi, Lalitha Rangarajan, and Mansour Zuair. "TextRS: Deep Bidirectional Triplet Network for Matching Text to Remote Sensing Images." Remote Sensing 12, no. 3 (January 27, 2020): 405. http://dx.doi.org/10.3390/rs12030405.

Full text

Abstract:

Exploring the relevance between images and their respective natural language descriptions, due to its paramount importance, is regarded as the next frontier in the general computer vision literature. Thus, recently several works have attempted to map visual attributes onto their corresponding textual tenor with certain success. However, this line of research has not been widespread in the remote sensing community. On this point, our contribution is three-pronged. First, we construct a new dataset for text-image matching tasks, termed TextRS, by collecting images from four well-known different scene datasets, namely AID, Merced, PatternNet, and NWPU datasets. Each image is annotated by five different sentences. All the five sentences were allocated by five people to evidence the diversity. Second, we put forth a novel Deep Bidirectional Triplet Network (DBTN) for text to image matching. Unlike traditional remote sensing image-to-image retrieval, our paradigm seeks to carry out the retrieval by matching text to image representations. To achieve that, we propose to learn a bidirectional triplet network, which is composed of Long Short Term Memory network (LSTM) and pre-trained Convolutional Neural Networks (CNNs) based on (EfficientNet-B2, ResNet-50, Inception-v3, and VGG16). Third, we top the proposed architecture with an average fusion strategy to fuse the features pertaining to the five image sentences, which enables learning of more robust embedding. The performances of the method expressed in terms Recall@K representing the presence of the relevant image among the top K retrieved images to the query text shows promising results as it yields 17.20%, 51.39%, and 73.02% for K = 1, 5, and 10, respectively.

APA, Harvard, Vancouver, ISO, and other styles

24

Pan, Heping, and Julian Magarey. "Multiresolution Phase-Based Bidirectional Stereo Matching with Provision for Discontinuity and Occlusion." Digital Signal Processing 8, no. 4 (October 1998): 255–66. http://dx.doi.org/10.1006/dspr.1998.0323.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Dou, J., Q. Qin, and Z. Tu. "Multi-Modal Image Registration Based on Local Self-Similarity and Bidirectional Matching." Pattern Recognition and Image Analysis 31, no. 1 (January 2021): 7–17. http://dx.doi.org/10.1134/s1054661820040112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Gao, C., and G. Xue. "A MATCHING METHOD TO REDUCE THE INFLUENCE OF SAR GEOMETRIC DEFORMATION." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-3 (April 30, 2018): 355–58. http://dx.doi.org/10.5194/isprs-archives-xlii-3-355-2018.

Full text

Abstract:

There are large geometrical deformations in SAR image, including foreshortening, layover, shade，which leads to SAR Image matching with low accuracy. Especially in complex terrain area, the control points are difficult to obtain, and the matching is difficult to achieve. Considering the impact of geometric distortions in SAR image pairs, a matching algorithm with a combination of speeded up robust features (SURF) and summed of normalize cross correlation (SNCC) was proposed, which can avoid the influence of SAR geometric deformation. Firstly, SURF algorithm was utilized to predict the search area. Then the matching point pairs was selected based on summed of normalized cross correlation. Finally, false match points were eliminated by the bidirectional consistency. SURF algorithm can control the range of matching points, and the matching points extracted from the deformation area are eliminated, and the matching points with stable and even distribution are obtained. The experimental results demonstrated that the proposed algorithm had high precision, and can effectively avoid the effect of geometric distortion on SAR image matching. Meet accuracy requirements of the block adjustment with sparse control points.

APA, Harvard, Vancouver, ISO, and other styles

27

Park, Goo-Man, Byung-Wan Han, Tae-Ki An, and Kwang-Jeek Lee. "Object Detection by Gaussian Mixture Model and Shape Adaptive Bidirectional Block Matching Algorithm." Journal of Broadcast Engineering 13, no. 5 (September 30, 2008): 681–84. http://dx.doi.org/10.5909/jbe.2008.13.5.681.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Okae, J., J. Du, and T. Huang. "A novel depth estimation approach based on bidirectional matching for stereo vision systems." Advanced Robotics 34, no. 15 (August 2, 2020): 998–1011. http://dx.doi.org/10.1080/01691864.2020.1803127.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Liang, Meiyu, Junping Du, Linghui Li, and Shouxin Cao. "Super-resolution reconstruction based on multisource bidirectional similarity and non-local similarity matching." IET Image Processing 9, no. 11 (November 1, 2015): 931–42. http://dx.doi.org/10.1049/iet-ipr.2014.0658.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Johnson, Addie, Marieke Jepma, and Ritske De Jong. "Colours Sometimes Count: Awareness and Bidirectionality in Grapheme–Colour Synaesthesia." Quarterly Journal of Experimental Psychology 60, no. 10 (October 2007): 1406–22. http://dx.doi.org/10.1080/17470210601063597.

Full text

Abstract:

Three experiments were conducted with 10 grapheme–colour synaesthetes and 10 matched controls to investigate (a) whether awareness of the inducer grapheme is necessary for synaesthetic colour induction and (b) whether grapheme–colour synaesthesia may be bidirectional in the sense that not only do graphemes induce colours, but that colours influence the processing of graphemes. Using attentional blink and Stroop paradigms with digit targets, we found that some synaesthetes did report “seeing” synaesthetic colours even when they were not able to report the inducing digit. Moreover, congruency effects (effects of matching the colour of digit presentation with the synaesthetic colour associated with that digit) suggested that grapheme–colour synaesthesia can be bidirectional, at least for some synaesthetes.

APA, Harvard, Vancouver, ISO, and other styles

31

Fathalla, Said, and Yaman M. Khalid Kannot. "Bidirectional Spreading Activation Method for Finding Human Diseases Relatedness Using Well-Formed Disease Ontology." International Journal of Computers in Clinical Practice 2, no. 1 (January 2017): 45–58. http://dx.doi.org/10.4018/ijccp.2017010104.

Full text

Abstract:

The successful application of semantic web in medical informatics and the fast expanding of biomedical knowledge have prompted to the requirement for a standardized representation of knowledge and an efficient algorithm for querying this extensive information. Spreading activation algorithm is suitable to work on incomplete and large datasets. This article presents a method called SAOO (Spreading Activation over Ontology) which identifies the relatedness between two human diseases by applying spreading activation algorithm based on bidirectional search technique over large disease ontology. The proposed methodology is divided into two phases: Semantic matching and Disease relatedness detection. In Semantic Matching, semantically identify diseases in user's query in the ontology. In the Disease Relatedness Detection, URIs of the diseases are passed to the relatedness detector which returns the set of diseases that may connect them. The proposed method improves the non-semantic medical systems by considering semantic domain knowledge to infer diseases relatedness.

APA, Harvard, Vancouver, ISO, and other styles

32

Luo, A., and H. Burkhardt. "An intensity-based cooperative bidirectional stereo matching with simultaneous detection of discontinuities and occlusions." International Journal of Computer Vision 15, no. 3 (July 1995): 171–88. http://dx.doi.org/10.1007/bf01451740.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Tao, Rongshu, Yuming Xiang, and Hongjian You. "An Edge-Sense Bidirectional Pyramid Network for Stereo Matching of VHR Remote Sensing Images." Remote Sensing 12, no. 24 (December 9, 2020): 4025. http://dx.doi.org/10.3390/rs12244025.

Full text

Abstract:

As an essential step in 3D reconstruction, stereo matching still faces unignorable problems due to the high resolution and complex structures of remote sensing images. Especially in occluded areas of tall buildings and textureless areas of waters and woods, precise disparity estimation has become a difficult but important task. In this paper, we develop a novel edge-sense bidirectional pyramid stereo matching network to solve the aforementioned problems. The cost volume is constructed from negative to positive disparities since the disparity range in remote sensing images varies greatly and traditional deep learning networks only work well for positive disparities. Then, the occlusion-aware maps based on the forward-backward consistency assumption are applied to reduce the influence of the occluded area. Moreover, we design an edge-sense smoothness loss to improve the performance of textureless areas while maintaining the main structure. The proposed network is compared with two baselines. The experimental results show that our proposed method outperforms two methods, DenseMapNet and PSMNet, in terms of averaged endpoint error (EPE) and the fraction of erroneous pixels (D1), and the improvements in occluded and textureless areas are significant.

APA, Harvard, Vancouver, ISO, and other styles

34

Bogenhagen, D. F., and M. F. Romanelli. "Template sequences required for transcription of Xenopus laevis mitochondrial DNA from two bidirectional promoters." Molecular and Cellular Biology 8, no. 7 (July 1988): 2917–24. http://dx.doi.org/10.1128/mcb.8.7.2917.

Full text

Abstract:

Previous work from our laboratory has shown that transcription of Xenopus laevis mitochondrial DNA initiates both in vivo and in vitro from bidirectional promoters located between the gene for tRNA(Phe) and the 5' termini of displacement loop DNA strands. A consensus sequence matching the octanucleotide ACGTTATA surrounds each transcription start site. In the present study, we used in vitro mutagenesis to define sequences required for specific transcription in vitro. First, cloned mitochondrial DNA templates generated by deletion mutagenesis were transcribed in vitro to define the limits of functional promoters. The bidirectional promoter located approximately 33 nucleotides upstream from the gene for tRNA(Phe), termed promoter 1, was studied in greatest detail. The results confirmed the hypothesis that the consensus octanucleotide sequence surrounding each start site is an essential promoter element. A duplex 18-base-pair oligonucleotide encoding the symmetrical promoter 1 region was synthesized and cloned in a plasmid vector. This synthetic oligonucleotide was sufficient to support bidirectional transcription. Point mutations within this oligonucleotide were used to identify critical residues within the consensus sequence.

APA, Harvard, Vancouver, ISO, and other styles

35

Bogenhagen, D. F., and M. F. Romanelli. "Template sequences required for transcription of Xenopus laevis mitochondrial DNA from two bidirectional promoters." Molecular and Cellular Biology 8, no. 7 (July 1988): 2917–24. http://dx.doi.org/10.1128/mcb.8.7.2917-2924.1988.

Full text

Abstract:

Previous work from our laboratory has shown that transcription of Xenopus laevis mitochondrial DNA initiates both in vivo and in vitro from bidirectional promoters located between the gene for tRNA(Phe) and the 5' termini of displacement loop DNA strands. A consensus sequence matching the octanucleotide ACGTTATA surrounds each transcription start site. In the present study, we used in vitro mutagenesis to define sequences required for specific transcription in vitro. First, cloned mitochondrial DNA templates generated by deletion mutagenesis were transcribed in vitro to define the limits of functional promoters. The bidirectional promoter located approximately 33 nucleotides upstream from the gene for tRNA(Phe), termed promoter 1, was studied in greatest detail. The results confirmed the hypothesis that the consensus octanucleotide sequence surrounding each start site is an essential promoter element. A duplex 18-base-pair oligonucleotide encoding the symmetrical promoter 1 region was synthesized and cloned in a plasmid vector. This synthetic oligonucleotide was sufficient to support bidirectional transcription. Point mutations within this oligonucleotide were used to identify critical residues within the consensus sequence.

APA, Harvard, Vancouver, ISO, and other styles

36

Xu, Xiaoyue, Ying Chen, and Qiaoyuan Chen. "Dynamic Hybrid Graph Matching for Unsupervised Video-based Person Re-identification." International Journal on Artificial Intelligence Tools 29, no. 01 (February 2020): 2050004. http://dx.doi.org/10.1142/s0218213020500049.

Full text

Abstract:

Taking videos as nodes in a graph, graph matching is an effective technique for unsupervised video-based person re-identification (re-ID). However, most of existing methods are sensitive to noisy training data and mainly only focus on visual content relations between query and gallery videos, which may introduce large amount of false positives. To enhance the robustness to training data and alleviate the visual ambiguity, a Dynamic Hybrid Graph Matching (DHGM) method is proposed, which jointly considers both content and context information for person re-ID in an iterative manner. The content relations between video nodes are obtained by metric learning, based on which the context relation is acquired by encoding the bidirectional feature of each probe node relative to its graph neighbors. The model is iteratively updated during the process of graph construction for promoted distance measurement and further better matching performance. Experimental results on the PRID 2011 and iLIDS-VID datasets demonstrate the superiority of the DHGM.

APA, Harvard, Vancouver, ISO, and other styles

37

Ray, E. D., M. R. Gardner, and C. M. Heyes. "Seeing how it's done: matching conditions for observer rats ( Rattus norvegicus ) in the bidirectional control." Animal Cognition 3, no. 3 (December 1, 2000): 147–57. http://dx.doi.org/10.1007/s100710000069.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Shi, Zhiyong, Fengchun Tian, Minjun Deng, and Depeng Liu. "Motion-Compensated Temporal Frame Interpolation Algorithm Based on Global Entirety Unidirectional Motion Estimation and Local Fast Bidirectional Motion Estimation." International Journal of Pattern Recognition and Artificial Intelligence 31, no. 01 (January 2017): 1758001. http://dx.doi.org/10.1142/s0218001417580010.

Full text

Abstract:

To solve the uncertainty of motion for objects displayed on liquid crystal display (LCD), the motion estimation (ME) algorithm on the basis of global entirety unidirectional motion and local fast bidirectional motion (GEU-LFB) is proposed for motion-compensated temporal frame interpolation (MCTFI). Firstly, by observing the moving objects in the scene, we will obtain a set of global motion vectors (MVs). Secondly, the fast local search based on the bidirectional ME is executed. Additionally, to make up for the defect of the bidirectional ME, a method to generate the exposure mask and the occlusion mask is proposed by cleverly using the matching criterion of absolute difference and the set of global MVs. Next, the optimal MV field is smoothed by the vector median filter. Finally, the temporal interpolation frame obtained through the weighted filtering compensation method is further improved by using masks. Overall, the experimental results show that the proposed algorithm has better performance than the existing methods in terms of objective and subjective criteria. Moreover, it can solve problems of exposure and occlusion, and get better frame interpolation for the video sequence with fast moving targets.

APA, Harvard, Vancouver, ISO, and other styles

39

Dai, Chenguang, Zhenchao Zhang, and Dong Lin. "An Object-Based Bidirectional Method for Integrated Building Extraction and Change Detection between Multimodal Point Clouds." Remote Sensing 12, no. 10 (May 24, 2020): 1680. http://dx.doi.org/10.3390/rs12101680.

Full text

Abstract:

Building extraction and change detection are two important tasks in the remote sensing domain. Change detection between airborne laser scanning data and photogrammetric data is vulnerable to dense matching errors, mis-alignment errors and data gaps. This paper proposes an unsupervised object-based method for integrated building extraction and change detection. Firstly, terrain, roofs and vegetation are extracted from the precise laser point cloud, based on “bottom-up” segmentation and clustering. Secondly, change detection is performed in an object-based bidirectional manner: Heightened buildings and demolished buildings are detected by taking the laser scanning data as reference, while newly-built buildings are detected by taking the dense matching data as reference. Experiments on two urban data sets demonstrate its effectiveness and robustness. The object-based change detection achieves a recall rate of 92.31% and a precision rate of 88.89% for the Rotterdam dataset; it achieves a recall rate of 85.71% and a precision rate of 100% for the Enschede dataset. It can not only extract unchanged building footprints, but also assign heightened or demolished labels to the changed buildings.

APA, Harvard, Vancouver, ISO, and other styles

40

Li, Jiamin, Xingbo Liu, Xiushan Nie, Lele Ma, Peng Li, Kai Zhang, and Yilong Yin. "Weighted-Attribute Triplet Hashing for Large-Scale Similar Judicial Case Matching." Computational Intelligence and Neuroscience 2021 (April 16, 2021): 1–11. http://dx.doi.org/10.1155/2021/6650962.

Full text

Abstract:

Similar judicial case matching aims to enable an accurate selection of a judicial document that is most similar to the target document from multiple candidates. The core of similar judicial case matching is to calculate the similarity between two fact case documents. Owing to similar judicial case matching techniques, legal professionals can promptly find and judge similar cases in a candidate set. These techniques can also benefit the development of judicial systems. However, the document of judicial cases not only is long in length but also has a certain degree of structural complexity. Meanwhile, a variety of judicial cases are also increasing rapidly; thus, it is difficult to find the document most similar to the target document in a large corpus. In this study, we present a novel similar judicial case matching model, which obtains the weight of judicial feature attributes based on hash learning and realizes fast similar matching by using a binary code. The proposed model extracts the judicial feature attributes vector using the bidirectional encoder representations from transformers (BERT) model and subsequently obtains the weighted judicial feature attributes through learning the hash function. We further impose triplet constraints to ensure that the similarity of judicial case data is well preserved when projected into the Hamming space. Comprehensive experimental results on public datasets show that the proposed method is superior in the task of similar judicial case matching and is suitable for large-scale similar judicial case matching.

APA, Harvard, Vancouver, ISO, and other styles

41

Stephen, Terri-Leigh, Swati Gupta-Agarwal, and Josef T. Kittler. "Mitochondrial dynamics in astrocytes." Biochemical Society Transactions 42, no. 5 (September 18, 2014): 1302–10. http://dx.doi.org/10.1042/bst20140195.

Full text

Abstract:

Astrocytes exhibit cellular excitability through variations in their intracellular calcium (Ca2+) levels in response to synaptic activity. Astrocyte Ca2+ elevations can trigger the release of neuroactive substances that can modulate synaptic transmission and plasticity, hence promoting bidirectional communication with neurons. Intracellular Ca2+ dynamics can be regulated by several proteins located in the plasma membrane, within the cytosol and by intracellular organelles such as mitochondria. Spatial dynamics and strategic positioning of mitochondria are important for matching local energy provision and Ca2+ buffering requirements to the demands of neuronal signalling. Although relatively unresolved in astrocytes, further understanding the role of mitochondria in astrocytes may reveal more about the complex bidirectional relationship between astrocytes and neurons in health and disease. In the present review, we discuss some recent insights regarding mitochondrial function, transport and turnover in astrocytes and highlight some important questions that remain to be answered.

APA, Harvard, Vancouver, ISO, and other styles

42

Prechelt, Lutz, and Alexander Pepper. "Bflinks: Reliable Bugfix Links via Bidirectional References and Tuned Heuristics." International Scholarly Research Notices 2014 (October 29, 2014): 1–13. http://dx.doi.org/10.1155/2014/701357.

Full text

Abstract:

Background. Data from software version archives and defect databases can be used for defect insertion circumstance analysis and defect prediction. The first step in such analyses is identifying defect-correcting changes in the version archive (bugfix commits) and enriching them with additional metadata by establishing bugfix links to corresponding entries in the defect database. Candidate bugfix commits are typically identified via heuristic string matching on the commit message. Research Questions. Which filters could be used to obtain a set of bugfix links? How to tune their parameters? What accuracy is achieved? Method. We analyze a modular set of seven independent filters, including new ones that make use of reverse links, and evaluate visual heuristics for setting cutoff parameters. For a commercial repository, a product expert manually verifies over 2500 links to validate the results with unprecedented accuracy. Results. The heuristics pick a very good parameter value for five filters and a reasonably good one for the sixth. The combined filtering, called bflinks, provides 93% precision and only 7% results loss. Conclusion. Bflinks can provide high-quality results and adapts to repositories with different properties.

APA, Harvard, Vancouver, ISO, and other styles

43

Guo, Li Qian, Jun Bi Liao, Fang Ping Zhong, Xiang Yu, and Jun Tao. "An Optimal Algorithm for Estimating Fundamental Matrix by Removing the Outliers." Advanced Materials Research 989-994 (July 2014): 1435–40. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.1435.

Full text

Abstract:

The accurate estimation of the fundamental matrix is one of the most important steps in many computer vision applications such as 3D reconstruction, camera self-calibration, motion estimation and stereo matching. In this paper, an optimal fundamental matrix estimation method based on removing exceptional match points is proposed. Firstly, the initial mismatch is reduced by the bidirectional SIFT feature matching algorithm. Secondly, the partial concentration problem of random samples is solved by the bucket segmentation method. In order to obtain robustness, the fundamental matrix is estimated in a RANSAC framework according to the principle of minimizing the geometric distance. Finally, the iterate process improves the accuracy of the fundamental matrix by using the LM algorithm. Experimental results show that the proposed method can reduce the outlier’s interference better and improve the estimation precision of the fundamental matrix.

APA, Harvard, Vancouver, ISO, and other styles

44

Gog, Simon, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, and Niko Välimäki. "Multi-pattern matching with bidirectional indexes ☆ ☆Preliminary version of this article appeared in COCOON 2012 [12]." Journal of Discrete Algorithms 24 (January 2014): 26–39. http://dx.doi.org/10.1016/j.jda.2013.03.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Cui, Wei, Shuxu Guo, and Jianwu Tao. "Reconstruction for Sparse Signal Based on Bidirectional Sparsity Adaptive and Weak Selection of Atoms Matching Pursuit." Circuits, Systems, and Signal Processing 40, no. 10 (April 11, 2021): 4850–76. http://dx.doi.org/10.1007/s00034-021-01695-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Kim, Byung-Jun, and Inyoung Kim. "Flexible omnibus test in 1:M matched case-crossover study with measurement error in covariate." Statistical Methods in Medical Research 29, no. 10 (April 28, 2020): 3019–31. http://dx.doi.org/10.1177/0962280220913996.

Full text

Abstract:

The matched case-crossover study design is used in public health, biomedical, and epidemiological research with clustered binary outcomes. Conditional logistic regression is commonly used for analysis because any effects associated with the matching covariates by stratum can be removed. However, some matching covariates often play an important role as effect modifications, causing incorrect statistical testing. The covariates in such studies are often measured with error, so that not accounting for this error can also lead to incorrect inferences for all covariates in the model. However, the methods available for simultaneously evaluating effect modification by matching covariates as well as assessing and characterizing error-in-covariates are limited. In this paper, we propose a flexible omnibus test for testing (1) the significance of a functional association between the clustered binary outcomes and covariates with the measurement error, (2) the existence of effect modifications by matching covariates, and (3) the significance of an interaction effect between the measurement error covariate and other covariates, without specifying the functional forms for these testings. The proposed omnibus test has the flexibility to allow inferences on various hypothesis settings. The advantages of the proposed flexible omnibus test are demonstrated through simulation studies and 1:4 bidirectional matched data analyses from an epidemiology study.

APA, Harvard, Vancouver, ISO, and other styles

47

Zhang, Hongwei, Fu Ren, Huiting Li, Renfei Yang, Shuai Zhang, and Qingyun Du. "Recognition Method of New Address Elements in Chinese Address Matching Based on Deep Learning." ISPRS International Journal of Geo-Information 9, no. 12 (December 12, 2020): 745. http://dx.doi.org/10.3390/ijgi9120745.

Full text

Abstract:

Location services based on address matching play an important role in people’s daily lives. However, with the rapid development of cities, new addresses are constantly emerging. Due to the untimely updating of word segmentation dictionaries and address databases, the accuracy of address segmentation and the certainty of address matching face severe challenges. Therefore, a new address element recognition method for address matching is proposed. The method first uses the bidirectional encoder representations from transformers (BERT) model to learn the contextual information and address model features. Second, the conditional random field (CRF) is used to model the constraint relationships among the tags. Finally, a new address element is recognized according to the tag, and the new address element is put into the word segmentation dictionary. The spatial information is assigned to it, and it is put into the address database. Different sequence tagging models and different vector representations of addresses are used for comparative evaluation. The experimental results show that the method introduced in this paper achieves the maximum generalization ability, its F1 score is 0.78, and the F1 score on the testing dataset also achieves a high value (0.95).

APA, Harvard, Vancouver, ISO, and other styles

48

Doelling, David R., Conor O. Haney, Benjamin R. Scarino, Arun Gopalan, and Rajendra Bhatt. "Improvements to the Geostationary Visible Imager Ray-Matching Calibration Algorithm for CERES Edition 4." Journal of Atmospheric and Oceanic Technology 33, no. 12 (December 2016): 2679–98. http://dx.doi.org/10.1175/jtech-d-16-0113.1.

Full text

Abstract:

AbstractThe Clouds and the Earth’s Radiant Energy System (CERES) project relies on geostationary imager–derived TOA broadband fluxes and cloud properties to account for the regional diurnal fluctuations between the Terra and Aqua CERES and MODIS measurements. The CERES project employs a ray-matching calibration algorithm in order to transfer the Aqua MODIS calibration to the geostationary (GEO) imagers, thereby allowing the derivation of consistent fluxes and cloud retrievals across the 16 GEO imagers utilized in the CERES record. The CERES Edition 4 processing scheme grants the opportunity to recalibrate the GEO record using an improved GEO/MODIS all-sky ocean ray-matching algorithm. Using a graduated angle matching method, which is most restrictive for anisotropic clear-sky ocean radiances and least restrictive for isotropic bright cloud radiances, reduces the bidirectional bias while preserving the dynamic range. Furthermore, SCIAMACHY hyperspectral radiances are used to account for both the solar incoming and Earth-reflected spectra in order to correct spectral band differences. As a result, the difference between the linear regression offset and the maintained GEO space count was reduced, and the calibration slopes computed from the linear fit and the regression through the space count agreed to within 0.4%. A deep convective cloud (DCC) ray-matching algorithm is also presented. The all-sky ocean and DCC ray-matching timeline gains are within 0.7% of one another. Because DCC are isotropic and the brightest, Earth targets with near-uniform visible spectra, the temporal standard error of GEO imager gains, are reduced by up to 60% from that of all-sky ocean targets.

APA, Harvard, Vancouver, ISO, and other styles

49

Prokopchuk-Gauk, Oksana, Joanna McCarthy, Peter Duggan, Meer-Taher Shabani-Rad, and Nicole L. Prokopishyn. "Impact of ABO Incompatibility on Engraftment in Allogeneic Hematopoietic Stem Cell Transplantation." Blood 128, no. 22 (December 2, 2016): 3394. http://dx.doi.org/10.1182/blood.v128.22.3394.3394.

Full text

Abstract:

Abstract Introduction: The selection of an allogeneic hematopoietic stem cell transplant (allo-HSCT) donor is highly dependent on human leukocyte antigen (HLA) allele profile matching with that of the intended recipient to minimize graft-related complications and improve post-transplant outcomes. Although ABO compatibility simplifies recipient transfusion needs, transplantation of an ABO incompatible graft has been identified not to have a significant impact on marrow engraftment or recipient survival. We completed an audit of adult allo-HSCT recipients of the Alberta Bone Marrow and Blood Cell Transplant Program to evaluate the impact of ABO incompatibility on engraftment in our allo-HSCT recipient population. Methods: A retrospective review including all adult allo-HSCT recipients between January 1, 2008 and January 1, 2015 was performed. Data was obtained from review of cellular therapy laboratory electronic records, with blood group confirmation by the transfusion medicine laboratory information system. Statistical calculations were completed using the unpaired t test. Results:A total of 513 adult patients underwent 528 allo-HSCT procedures (493 peripheral blood, 12 marrow, 23 cord blood). The mean HSCT recipient age was 46 (range 17-66) with 291 (57%) male recipients. The most common HSCT indication was acute myeloid leukemia. All allo-HSCT recipients received myeloablative conditioning. A total of 91% of recipients were conditioned with a regimen of Fludarabine-Busulfan-ATG, with or without total body irradiation. ABO compatibility status for allo-HSCT procedures included the following: 264 (50%) ABO identical grafts, 125 (24%) grafts with a minor incompatibility, 113 (21%) grafts with a major incompatibility, and 26 (5%) grafts with bidirectional incompatibility. HLA matching data was available for 447 allo-HSCT procedures. A total of 350 (78%) patients were recipients of fully HLA matched grafts (340 peripheral blood, 9 marrow, 1 cord blood). Taking into consideration ABO compatibility status, 10/10 HLA matched peripheral blood or marrow grafts were provided to 89% of ABO identical graft recipients, 77% of recipients each with a minor or major incompatibility, and 65% of recipients with a bidirectional incompatibility. Cellular engraftment including the number of days until absolute neutrophil count (ANC) > 1.0 x 106/L and platelet count > 20 x 109/L was available for 496 (94%) of all transplant procedures. A total of 34 transplant recipients did not successfully engraft one or both cell lines. A summary of recipient engraftment data for each category of ABO matching according to stem cell source appears in Table 1. Conclusion:In our study population, the risk of non-engraftment is lowest in recipients of ABO identical peripheral blood or marrow source donor stem cells. Time to cellular engraftment following allo-HSCT transplant with peripheral blood or marrow source stem cells of minor or major ABO incompatibility is similar to that of an ABO identical donor, while platelet engraftment appears to be prolonged in the setting of a bidirectional incompatibility. However, the small number of recipients of grafts with a bidirectional incompatibility and the large standard deviation affects our confidence in this result. The impact of ABO matching on engraftment appears to be the greatest in cord blood transplants. The risk of cellular non-engraftment is variable among all ABO compatibility categories, though the time to platelet engraftment is significantly prolonged in recipients of grafts with major ABO or bidirectional incompatibility. These findings are limited by our small cord blood recipient population and the presence of some degree of HLA mismatching in nearly all recipients of cord blood transplants evaluated. Further study is required in larger populations of cord blood transplant recipients to better understand the impact of ABO compatibility status on marrow engraftment, together with variables including the cellular composition of the cord blood graft and host immune factors. Table 1 Rate of non-engraftment and days to neutrophil and platelet engraftment following allo-HSCT according to ABO compatibility, including standard deviation and statistical calculation (*indicates statistically significant value). Table 1. Rate of non-engraftment and days to neutrophil and platelet engraftment following allo-HSCT according to ABO compatibility, including standard deviation and statistical calculation (*indicates statistically significant value). Disclosures No relevant conflicts of interest to declare.

APA, Harvard, Vancouver, ISO, and other styles

50

Kim, Yoo Hwan, Jung Woo Lee, Yerim Kim, Jong Seok Bae, Yeo Jin Kim, Chanyang Min, and Hyo Geun Choi. "Bidirectional association between migraine and rheumatoid arthritis: two longitudinal follow-up studies with a national sample cohort." BMJ Open 11, no. 6 (June 2021): e046283. http://dx.doi.org/10.1136/bmjopen-2020-046283.

Full text

Abstract:

ObjectiveTo investigate the bidirectional association between migraine and rheumatoid arthritis (RA).DesignTwo longitudinal follow-up studies.SettingData collected from a national cohort between 2002 and 2013 by the Korean National Health Insurance Service-Health Screening Cohort.ParticipantsIn cohort 1, matching resulted in the inclusion of 31 589 migraine patients and 126 356 control I participants. In cohort 2, matching resulted in the inclusion of 9287 RA patients and 37 148 control II participants.Primary and secondary outcome measuresThe HRs for RA in patients with migraine (cohort 1) and migraine in patients with RA (cohort 2) were analysed using stratified Cox proportional hazard models after adjusting for autoimmune disease, Charlson Comorbidity Index scores without rheumatoid diseases, obesity (body mass index), smoking and history of alcohol intake. Subgroup analyses stratified by age, sex, income and region of residence were also performed.ResultsThe incidence of RA in the migraine group (2.0% (640/31 589)) was higher than that in the control I group (1.4% (1709/126 356), p<0.001). The adjusted HR for RA in the migraine without aura group was 1.48 (95% CIs=1.34 to 1.63, p<0.001).The incidence of migraine in the RA group (6.4% (590/9287)) was higher than that in the control II group (4.6% (1721/37 148), p<0.001). The adjusted HR for migraine without aura in the RA group was 1.35 (95% CI=1.23 to 1.49, p<0.001).ConclusionMigraine increases the risk of RA, and RA is also associated with an increased risk of migraine.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!