Generation of a depth-map from 2D video is the kernel of DIBR (Depth Image Based Rendering) in 2D-3D video conversion systems. However it occupies over most of the system resource where the motion search module takes ...Generation of a depth-map from 2D video is the kernel of DIBR (Depth Image Based Rendering) in 2D-3D video conversion systems. However it occupies over most of the system resource where the motion search module takes up 90% time-consuming in typical motion estimation-based depth-map generation algorithms. In order to reduce the computational complexity, in this paper a new fast depth-map generation algorithm based on motion search is developed, in which a fast diamond search algorithm is adopted to decide whether a 16x16 or 4x4 block size is used based on Sobel operator in the motion search module to obtain a sub-depth-map. Then the sub-depth-map will be fused with the sub-depth-maps gotten from depth from color component Cr and depth from linear perspective modules to compensate and refine detail of the depth-map, finally obtain a better depth-map. The simulation results demonstrate that the new approach can greatly reduce over 50% computational complexity compared to other existing methods.展开更多
This paper presents search model for a randomly moving target which follows truncated Brownian motion. The conditions that make the expected value of the first meeting time between the searcher and the target is finit...This paper presents search model for a randomly moving target which follows truncated Brownian motion. The conditions that make the expected value of the first meeting time between the searcher and the target is finite are given. We show the existence of an optimal strategy which minimizes this first meeting time.展开更多
A minimum distortion direction prediction-based novel fast half-pixel motion vector search algorithm is proposed, which can reduce considerably the computation load of half-pixel search. Based on the single valley cha...A minimum distortion direction prediction-based novel fast half-pixel motion vector search algorithm is proposed, which can reduce considerably the computation load of half-pixel search. Based on the single valley characteristic of half-pixel error matching function inside search grid, the minimum distortion direction is predicted with the help of comparative results of sum of absolute difference(SAD) values of four integer-pixel points around integer-pixel motion vector. The experimental results reveal that, to all kinds of video sequences, the proposed algorithm can obtain almost the same video quality as that of the half-pixel full search algorithm with a decrease of computation cost by more than 66%.展开更多
Motion estimation is an important and intensive task in video coding applications. Since the complexity of integer pixel search has been greatly reduced by the numerous fast ME algorithm, the computation overhead requ...Motion estimation is an important and intensive task in video coding applications. Since the complexity of integer pixel search has been greatly reduced by the numerous fast ME algorithm, the computation overhead required by fractional pixel ME has become relatively significant. To reduce the complexity of the fractional pixel ME algorithm, a directionality-based fractional pixel ME algorithm is proposed. The proposed algorithm efficiently explores the neighborhood positions which with high probability to be the best matching around the minimum one and skips over other unlikely ones. Thus, the proposed algorithm can complete the search by examining only 3 points on appropriate condition instead of 17 search points in the search algorithm of reference software. The simulation results show that the proposed algorithm successfully optimizes the fractional-pixel motion search on both half and quarter-pixel accuracy and improves the processing speed with low PSNR penalty.展开更多
虚拟管道宽度直接影响了管道内无人机的流速,但目前虚拟管道规划的方法并不能保证管道宽度,容易造成堵塞,严重影响无人机通行效率。对此,提出一种虚拟管道空间满足规划方法,可以在包含障碍物的环境中得到一条满足虚拟管道空间要求的管...虚拟管道宽度直接影响了管道内无人机的流速,但目前虚拟管道规划的方法并不能保证管道宽度,容易造成堵塞,严重影响无人机通行效率。对此,提出一种虚拟管道空间满足规划方法,可以在包含障碍物的环境中得到一条满足虚拟管道空间要求的管道生成线。主要包括路径搜索和轨迹优化,基于快速探索随机树*(rapidly exploring random tree*,RRT*)搜索,通过空间检测判断每段路径周围是否有足够空间,若无足够空间则重新拓展搜索,替换掉空间不足的路径段。在轨迹优化过程中,使用均匀B样条参数化轨迹,并设计碰撞代价函数和光滑代价函数,使轨迹远离障碍物,为虚拟管道规划提供足够空间。仿真测试验证了所提方法在大规模集群中的优越性和鲁棒性。在仿真测试中,15架无人机集群通行时间平均降低20%。展开更多
This article addresses the issues of falling into local optima and insufficient exploration capability in the Arithmetic Optimization Algorithm (AOA), proposing an improved Arithmetic Optimization Algorithm with a mul...This article addresses the issues of falling into local optima and insufficient exploration capability in the Arithmetic Optimization Algorithm (AOA), proposing an improved Arithmetic Optimization Algorithm with a multi-strategy mechanism (BSFAOA). This algorithm introduces three strategies within the standard AOA framework: an adaptive balance factor SMOA based on sine functions, a search strategy combining Spiral Search and Brownian Motion, and a hybrid perturbation strategy based on Whale Fall Mechanism and Polynomial Differential Learning. The BSFAOA algorithm is analyzed in depth on the well-known 23 benchmark functions, CEC2019 test functions, and four real optimization problems. The experimental results demonstrate that the BSFAOA algorithm can better balance the exploration and exploitation capabilities, significantly enhancing the stability, convergence mode, and search efficiency of the AOA algorithm.展开更多
A correlation tracking algorithm based on template partition motion estimation proposed for improving real time performance of the conventional correlation matching algorithms. The target trajectory fitted using the l...A correlation tracking algorithm based on template partition motion estimation proposed for improving real time performance of the conventional correlation matching algorithms. The target trajectory fitted using the least square with equal space in whole interval and the target prediction point is found out. According to the requirements of block motion estimation(BME) algorithm,the template divided into some macro blocks. The searching process is conducted by using diamond search algorithm around the prediction point and the optimal motion vector of each block is calculated. A point corresponding to the motion vector with the best matching is taken as a rough matching point of the template. The relation of relative position between the block with matching point and the searching area determined to decide whether to conduct precise matching search or to construct a new search area in the gradient direction. The target tracking experiment results show that over 70% time cost can be reduced caompared with the conventional correlation matching algorithm based on full search method.展开更多
Diamond search （DS） is an excellent fast block matching motion estimation （BMME） algorithm. In this paper, we propose an improved diamond search （IDS） algorithm, which revises the two search patterns of DS. The ...Diamond search （DS） is an excellent fast block matching motion estimation （BMME） algorithm. In this paper, we propose an improved diamond search （IDS） algorithm, which revises the two search patterns of DS. The proposed algorithm is compared with several mainstream algorithms. The simulation results show that the proposed algorithm over DS can be up to 20% gain on speedup on average, while maintain the similar or even better quality, both objectively and subjectively. The proposed algorithm is also competitive with other fast algorithms.展开更多
A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to...A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to visit about half points of all search candidates by subsampling them, using a spiral-scanning path with one skip. Two sdected candidates that have minimal and second minimal block distortion measures are obtained. Then a fine-tune step is taken around them to find the best one. Some analyses are given to approve the rationality of the approach of this paper. Experimental results show that, as compared to APDS, the proposed algorithm can enhance the block-matching speed by about 30% while maintaining its MSE performance very close to that of it. And it performs much better than many other BMAs such as TSS, NTSS, UCDBS and NPDS.展开更多
文摘Generation of a depth-map from 2D video is the kernel of DIBR (Depth Image Based Rendering) in 2D-3D video conversion systems. However it occupies over most of the system resource where the motion search module takes up 90% time-consuming in typical motion estimation-based depth-map generation algorithms. In order to reduce the computational complexity, in this paper a new fast depth-map generation algorithm based on motion search is developed, in which a fast diamond search algorithm is adopted to decide whether a 16x16 or 4x4 block size is used based on Sobel operator in the motion search module to obtain a sub-depth-map. Then the sub-depth-map will be fused with the sub-depth-maps gotten from depth from color component Cr and depth from linear perspective modules to compensate and refine detail of the depth-map, finally obtain a better depth-map. The simulation results demonstrate that the new approach can greatly reduce over 50% computational complexity compared to other existing methods.
文摘This paper presents search model for a randomly moving target which follows truncated Brownian motion. The conditions that make the expected value of the first meeting time between the searcher and the target is finite are given. We show the existence of an optimal strategy which minimizes this first meeting time.
文摘A minimum distortion direction prediction-based novel fast half-pixel motion vector search algorithm is proposed, which can reduce considerably the computation load of half-pixel search. Based on the single valley characteristic of half-pixel error matching function inside search grid, the minimum distortion direction is predicted with the help of comparative results of sum of absolute difference(SAD) values of four integer-pixel points around integer-pixel motion vector. The experimental results reveal that, to all kinds of video sequences, the proposed algorithm can obtain almost the same video quality as that of the half-pixel full search algorithm with a decrease of computation cost by more than 66%.
文摘Motion estimation is an important and intensive task in video coding applications. Since the complexity of integer pixel search has been greatly reduced by the numerous fast ME algorithm, the computation overhead required by fractional pixel ME has become relatively significant. To reduce the complexity of the fractional pixel ME algorithm, a directionality-based fractional pixel ME algorithm is proposed. The proposed algorithm efficiently explores the neighborhood positions which with high probability to be the best matching around the minimum one and skips over other unlikely ones. Thus, the proposed algorithm can complete the search by examining only 3 points on appropriate condition instead of 17 search points in the search algorithm of reference software. The simulation results show that the proposed algorithm successfully optimizes the fractional-pixel motion search on both half and quarter-pixel accuracy and improves the processing speed with low PSNR penalty.
文摘虚拟管道宽度直接影响了管道内无人机的流速,但目前虚拟管道规划的方法并不能保证管道宽度,容易造成堵塞,严重影响无人机通行效率。对此,提出一种虚拟管道空间满足规划方法,可以在包含障碍物的环境中得到一条满足虚拟管道空间要求的管道生成线。主要包括路径搜索和轨迹优化,基于快速探索随机树*(rapidly exploring random tree*,RRT*)搜索,通过空间检测判断每段路径周围是否有足够空间,若无足够空间则重新拓展搜索,替换掉空间不足的路径段。在轨迹优化过程中,使用均匀B样条参数化轨迹,并设计碰撞代价函数和光滑代价函数,使轨迹远离障碍物,为虚拟管道规划提供足够空间。仿真测试验证了所提方法在大规模集群中的优越性和鲁棒性。在仿真测试中,15架无人机集群通行时间平均降低20%。
文摘This article addresses the issues of falling into local optima and insufficient exploration capability in the Arithmetic Optimization Algorithm (AOA), proposing an improved Arithmetic Optimization Algorithm with a multi-strategy mechanism (BSFAOA). This algorithm introduces three strategies within the standard AOA framework: an adaptive balance factor SMOA based on sine functions, a search strategy combining Spiral Search and Brownian Motion, and a hybrid perturbation strategy based on Whale Fall Mechanism and Polynomial Differential Learning. The BSFAOA algorithm is analyzed in depth on the well-known 23 benchmark functions, CEC2019 test functions, and four real optimization problems. The experimental results demonstrate that the BSFAOA algorithm can better balance the exploration and exploitation capabilities, significantly enhancing the stability, convergence mode, and search efficiency of the AOA algorithm.
基金Sponsored by the National Defense Pre-Research Foundation of China
文摘A correlation tracking algorithm based on template partition motion estimation proposed for improving real time performance of the conventional correlation matching algorithms. The target trajectory fitted using the least square with equal space in whole interval and the target prediction point is found out. According to the requirements of block motion estimation(BME) algorithm,the template divided into some macro blocks. The searching process is conducted by using diamond search algorithm around the prediction point and the optimal motion vector of each block is calculated. A point corresponding to the motion vector with the best matching is taken as a rough matching point of the template. The relation of relative position between the block with matching point and the searching area determined to decide whether to conduct precise matching search or to construct a new search area in the gradient direction. The target tracking experiment results show that over 70% time cost can be reduced caompared with the conventional correlation matching algorithm based on full search method.
基金Supported by the National High Technology Research and Development Program of China (2001AA132050-03)the Key Foundation of Ministry of Education of China (211CERS-10)
文摘Diamond search （DS） is an excellent fast block matching motion estimation （BMME） algorithm. In this paper, we propose an improved diamond search （IDS） algorithm, which revises the two search patterns of DS. The proposed algorithm is compared with several mainstream algorithms. The simulation results show that the proposed algorithm over DS can be up to 20% gain on speedup on average, while maintain the similar or even better quality, both objectively and subjectively. The proposed algorithm is also competitive with other fast algorithms.
基金This project was supported by the National Natural Science Foundation of China (60272099) .
文摘A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to visit about half points of all search candidates by subsampling them, using a spiral-scanning path with one skip. Two sdected candidates that have minimal and second minimal block distortion measures are obtained. Then a fine-tune step is taken around them to find the best one. Some analyses are given to approve the rationality of the approach of this paper. Experimental results show that, as compared to APDS, the proposed algorithm can enhance the block-matching speed by about 30% while maintaining its MSE performance very close to that of it. And it performs much better than many other BMAs such as TSS, NTSS, UCDBS and NPDS.
