Search results

In the literature, while designing broadband matching networks, transducer power gain (TPG) is used to measure the transferred power. Generally, in TPG expressions, load and back-end impedances of the matching network are used. This study aims to derive a new quality factor-based TPG expression.

In deriving the new expression, narrowband L type-matching network design approach is used and the new expression in terms of back-end quality factor, load quality factor and output port quality factor is obtained. Then, a broadband-matching network design approach using the derived TPG expression is proposed.

Two broadband double-matching networks are designed by using the proposed design approach using the derived TPG expression. Performances of the designed-matching networks are compared with the performances of the matching networks designed by means of simplified real frequency technique which is a well-known technique in the literature, and it is shown that they are nearly the same.

In broadband-matching problems, generally an impedance-based TPG expression is used, and it must be satisfied by the designed broadband-matching networks. But, in the literature, there is no quality factor-based TPG expression that can be used in broadband-matching problems. So, this gap in the literature has been filled by this paper.

Stereo vision is an attractive perception technique for mobile robots navigation. Stereo matching is a crucial part of stereo vision and its precision dominates the precision of reconstruction. Based on a geometry constraint applicable to natural terrain, the purpose of this paper is to present a multi‐stage stereo matching algorithm to improve matching accuracy.

In the multi‐stage matching algorithm, points with larger intensity gradient are matched in earlier stages. Using several constraints and statistical means, information from earlier stages is utilized to assist in matching of later stages to improve matching accuracy.

The multi‐stage matching algorithm improves the matching accuracy of stereo pairs of natural terrain in various conditions.

The algorithm demonstrates advantages over area‐matching algorithm both in matching accuracy and computation efficiency. However, if used for real‐time navigation, it still needs the assistance of specialized hardware or window selection technique.

The algorithm is able to produce dense disparity maps of natural terrain with fairly high accuracy and can be used for the navigation of planetary rover or other outdoor mobile robots.

The paper provides a new approach to produce accurate and dense disparity maps of natural terrain, which laid the foundation for its use in outdoor mobile robots navigation.

To present a stereo matching algorithm which satisfies the need of visual navigation on outdoor natural terrain for lunar rover or other mobile robots.

A feature‐assisted matching algorithm is presented to generate dense and accurate disparity map of natural terrain. Multi‐feature matching strategy produces reliable matching results for edge points. Disparity monotony constraint is derived and other geometrical constraints are introduced. With these constraints the edge‐matching results are used to limit the search region in area‐matching. As a result the algorithm produces dense disparity maps with fairly high accuracy and demonstrates advantages over straightforward area‐matching algorithm in improving matching accuracy.

With the help of several constraints, the feature‐assisted matching algorithm performs well in the matching of stereo image pairs of natural terrain.

The algorithm focus on improving the accuracy of stereo image pairs matching of natural terrain and computation complexity is not an important designing factor. Only with the assistance of special hardware or other technique can the algorithm be used for real‐time navigation.

The algorithm is able to produce dense disparity map of natural terrain with rather high accuracy and can be used for the navigation of lunar rover or other outdoor mobile robots.

The paper provides a new approach to produce accurate and dense disparity map of natural terrain.

The motion vector estimation algorithm is very widely used in many image process applications, such as the image stabilization and object tracking algorithms. The conventional searching algorithm, based on the block matching manipulation, is used to estimate the motion vectors in conventional image processing algorithms. During the block matching manipulation, the violent motion will result in greater amount of computation. However, too large amount of calculation will reduce the effectiveness of the motion vector estimation algorithm. This paper aims to present a novel searching method to estimate the motion vectors effectively.

This paper presents a novel searching method to estimate the motion vectors for high-resolution image sequences. The searching strategy of this algorithm includes three steps: the larger area searching, the adaptive directional searching and the small area searching.

The achievement of this paper is to develop a motion vector searching strategy to improve the computation efficiency. Compared with the conventional motion vector searching algorithms, the novel motion vector searching algorithm can reduce the motion matching manipulation effectively by 50 per cent.

This paper presents a novel searching strategy to estimate the motion vectors effectively. From the experimental results, the novel motion vector searching algorithm can reduce the motion matching manipulation effectively, compared with the conventional motion vector searching algorithms.

The purpose of this paper is to study the application of feature‐based image matching algorithm for PCB matching without using special fiducial marks.

Speed‐up robust feature (SURF) is applied to extract the interest points in PCB images. An advanced threshold is set to reject the interest points with low responses to speed up feature computation. In order to improve the performance for rotation, the descriptors are based on multi‐orientations. The many‐to‐many tentative correspondences are determined with a maximum distance. Hough transform is used to reject the mismatches and the affine parameters are computed with a square‐least solution.

Results show that the method proposed in this paper can match the PCB images without using special fiducial marks effectively. The image matching algorithm shows a better performance for image rotation than the standard SURF and it succeeds in matching the image including repetitive patterns which will deteriorate the distinctiveness of feature descriptors.

Additional orientations produce more descriptors so that it takes extra time for feature description and matching.

The paper proposes a SURF‐based image matching algorithm to match the PCB images without special fiducial marks. This can reduce the complexity of PCB production. The image matching algorithm is robust to image rotation and repetitive patterns and can be used in other applications of image matching.

Describing musical pieces, whether sound recordings, scores, librettos, videos, has always involved cataloger interpretation and judgment. There is considerable variation in records created for exactly the same item. And there is never “proof” that two records which seem to describe the same item actually do. This paper aims to address this issue.

This paper describes some of the challenges encountered in developing software for matching music records, and some approaches to making the software reliable.

The paper finds that matching can be used successfully to create GLIMIR clusters in the WorldCat database. Work is needed in several areas to complete the implementation, but intermediate results are promising.

This implementation will allow end‐user applications to collocate resources, to improve discovery and delivery in a complex bibliographic universe

This paper aims to investigate the law and logic mechanism of management control matching pattern and company strategy aggressiveness under different strategies by textual analysis, based on the empirical data of Chinese A-share listed companies during the period from 2010 to 2018. Additional analyses further investigate the moderating effect of environmental uncertainty and R&D intensity on the relationship between management control matching type and strategy aggressiveness. The conclusion can help relevant departments to develop management control theory and method system with Chinese characteristics and provide theoretical reference for the matching mode of dual control.

This paper uses the text analysis method. The main explanatory variables are analyzed using the computer SQL Server database software through the relevant text of the board of directors report in the company annual report. Other financial data came from the CSMAR database, excluding ST and PT and companies with missing data, and 16,902 samples were finally obtained. This paper conducted statistical analysis through Stata12.

This paper shows that the matching pattern between formal and informal control is divided into three types. They have different impacts on strategy aggressiveness. Specifically, consistent matching type II significantly positively influences the aggressiveness of offensive strategy. Consistent matching type I significantly positively influences the aggressiveness of defensive strategy. Complementary matching type I significantly positively influences the aggressiveness of analytical strategy. Additional analyses find that compared with non-high-tech companies, high-tech companies have more significant influence on the relationship between management control matching pattern and company strategic aggressiveness. And compared with other two “strategy-control” matching patterns, both environmental uncertainty and product innovation have more significant influence on the relationship between consistent matching II and offensive strategy aggressiveness.

To the best of the authors’ knowledge, this paper divides the formal and informal control matching patterns of management control into three categories for the first time. It examines the relationship between the formal and informal control matching of management accounting and the degree of strategy aggressiveness. The conclusion provides new empirical evidence to promote the effective implementation of development strategies for companies. It can help relevant departments to develop management control theory and method systems with Chinese characteristics and provide theoretical references for the matching mode of dual control.

In this paper, the authors explore the consequences of showrooming and price matching strategy to combat showrooming under the consideration that brick-and-mortar (BM) stores and online retailers hold different costs.

The authors use a duopoly model to analyze the impact of showrooming behavior on competition between a BM store and an online retailer with different types of customers and different costs. Then, they consider the price matching strategy that a BM store could employ to combat showrooming and explore the effect of such a strategy.

Showrooming behavior is detrimental to the profit of the BM store, and the online retailer suffers a loss of their profit unless the relative cost of the BM store is high and only part of the customers exhibit showrooming behavior. As the fraction of customers who seek price matching increases, profits of both the BM store and the online retailer initially decrease and then may increase, even if there is no showrooming.

Unlike existing studies that ignore different costs between online and offline retailers, the authors set different costs between the BM store and the online retailer to consider the effects of showrooming and price matching strategy.

This paper mainly focuses on how to induce all members to represent members' true preferences for supply and demand matching of E-commerce platform in order to generate stable matching schemes with more social welfare of Multi-agent Matching Platform (MMP) and individually stable advantages than traditional methods.

An MMP is designed. Meanwhile, a true preference inducing method, Lower-Bid Ranking (LBR), is proposed to reduce the number of false preferences, which is helpful to solve the problem that too much false preferences leads to low efficiency of platform operation and supply and demand matching. Then, a systematic model of LBR-based Stable Matching (SM-LBR) is proposed.

To obtain an ideal transaction partner, the adequate preference ordering and modifying according to market environment is needed for everyone, and the platform should give full play to the platforms' information advantages and process historical transaction and cooperation data. Meanwhile, the appropriate supply and demand matching is beneficial to improve the efficiency and quality of platform operation, and the design of matching guidance mechanism is essential.

The numerical experiments show that, the proposed model (SM-LBR) can induce members to represent the model's true preferences for stable matching and generate effective matchings with more social welfare of MMP and individually stable advantages than traditional methods, which may provide necessary method and model reference for the research of stable matching and E-commerce platform operation.

Template matching is one of the most suitable choices for full six degrees of freedom pose estimation in many practical industrial applications. However, the increasing number of templates while dealing with a wide range of viewpoint changes results in a long runtime, which may not meet the real-time requirements. This paper aims to improve matching efficiency while maintaining sample resolution and matching accuracy.

A multi-pyramid-based hierarchical template matching strategy is proposed. Three pyramids are established at the sphere subdivision, radius and in-plane rotation levels during the offline template render stage. Then, a hierarchical template matching is performed from the highest to the lowest level in each pyramid, narrowing the global search space and expanding the local search space. The initial search parameters at the top level can be determined by the preprocessing of the YOLOv3 object detection network to further improve real-time performance.

Experimental results show that this matching strategy takes only 100 ms under 100k templates without loss of accuracy, promising for real industrial applications. The authors further validated the approach by applying it to a real robot grasping task.

The matching framework in this paper improves the template matching efficiency by two orders of magnitude and is validated using a common template definition and viewpoint sampling methods. In addition, it can be easily adapted to other template definitions and viewpoint sampling methods.