Optimal odd-periodic complementary sequences for diffuse wireless optical communications

Wang, Junbo; Xie, Xiu-Xiu; Yuan, Jiawei; Song, Xiaoyu; Zhao, Xibin; Gao, Ming; Shen, Ming

doi:10.1117/1.oe.51.9.095002

Cited by 8 publications

(8 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Because the DTW can align the continuity of action, even low resolution videos can get an acceptable recognition rate. Furthermore, the algorithm developed in this study can be applied to thin client communication environment, since the coarse-to-fine feature of CFC-DTW can fit the requirement of action recognition in the environment [28][29][30], and modal data can be transferred in different level based on requirements.…”

Section: Resultsmentioning

confidence: 99%

Action Recognition by Joint Spatial-Temporal Motion Feature

Zhang

Gao

et al. 2013

Journal of Applied Mathematics

View full text Add to dashboard Cite

This paper introduces a method for human action recognition based on optical flow motion features extraction. Automatic spatial and temporal alignments are combined together in order to encourage the temporal consistence on each action by an enhanced dynamic time warping (DTW) algorithm. At the same time, a fast method based on coarse-to-fine DTW constraint to improve computational performance without reducing accuracy is induced. The main contributions of this study include (1) a joint spatialtemporal multiresolution optical flow computation method which can keep encoding more informative motion information than recent proposed methods, (2) an enhanced DTW method to improve temporal consistence of motion in action recognition, and (3) coarse-to-fine DTW constraint on motion features pyramids to speed up recognition performance. Using this method, high recognition accuracy is achieved on different action databases like Weizmann database and KTH database.

show abstract

Section: Resultsmentioning

confidence: 99%

Action Recognition by Joint Spatial-Temporal Motion Feature

Zhang

Gao

et al. 2013

Journal of Applied Mathematics

View full text Add to dashboard Cite

show abstract

“…Select two parents from the ; (10) Perform the crossover to produce two offsprings; (11) Mutate each offspring based on ; (12) Place the offspring to ; (13) end while (14) Replace the by the ; (15) end while (16) return with the best fitness;…”

Section: Problem Definitionmentioning

confidence: 99%

“…The family of exact algorithm includes branch and bound [10][11][12], integer linear programming [6,7,13], and dynamic programming [14][15][16]. Those algorithms are used for partitioning problems with small inputs successfully.…”

Section: Introductionmentioning

confidence: 99%

“…(3) Calculate the fitness of each individual in 0 ; (4) Copy the individual with the highest fitness to the solution; (5) while (termination conditions) do (6) while (number of individuals ≤ number of the generation size) do 7Select two individuals ( 1 , 2 ) from the current generation; (8) Perform crossover on ( 1 , 2 ) to produce two new individuals ( 1 , 2 ); / * start of annealing-crossover * / (9) if (max{fitness( 1 ), fitness( 2 )} ≤ max{fitness( 1 ), fitness( 2 )}) then (10) Δ = max{fitness( 1 ), fitness( 2 )}− max{fitness( 1 ), fitness( 2 )}; (11) if (min{1, exp(−Δ / )} ≥ random[1, 0)) then (12) Accept the crossover; (13) else (14) Reject the crossover with 1 = 1 , 2 = 2 ; (15) end if (16) else (17) Accept the crossover; (18) end if / * end of annealing-crossover * / (19) Perform mutation on 1 to produce 1 ; / * start of annealing-mutation * / (20) if…”

mentioning

confidence: 99%

See 1 more Smart Citation

An Effective Heuristic-Based Approach for Partitioning

Zhao

Zhang

Jiang

et al. 2013

Journal of Applied Mathematics

Self Cite

View full text Add to dashboard Cite

As being one of the most crucial steps in the design of embedded systems, hardware/software partitioning has received more concern than ever. The performance of a system design will strongly depend on the efficiency of the partitioning. In this paper, we construct a communication graph for embedded system and describe the delay-related constraints and the cost-related objective based on the graph structure. Then, we propose a heuristic based on genetic algorithm and simulated annealing to solve the problem near optimally. We note that the genetic algorithm has a strong global search capability, while the simulated annealing algorithm will fail in a local optimal solution easily. Hence, we can incorporate simulated annealing algorithm in genetic algorithm. The combined algorithm will provide more accurate near-optimal solution with faster speed. Experiment results show that the proposed algorithm produce more accurate partitions than the original genetic algorithm.

show abstract

“…Compared with other correlation properties of ZCPs and GCPs, the studies of ZCPs or GCPs in the past took relatively less attention to their odd-period correlation, and some progress was made in relevant research, for more details see [23,34,16,19,17,33,28,10,13]. Sequences with good odd-period correlation also have very important significance in practical applications .…”

Section: Introductionmentioning

confidence: 99%

Z-complementary pairs with flexible lengths and large zero odd-periodic correlation zones

Yao¹,

Ren²,

Wang³

et al. 2023

AMC

View full text Add to dashboard Cite

<p style='text-indent:20px;'>Z-complementary pairs (ZCPs) have been widely used in different communication systems. In this paper, we first investigate the odd-periodic correlation property of ZCPs, and propose a new class of ZCPs, called ZOC-ZCPs with zero correlation zone (ZCZ) width <inline-formula><tex-math id="M1">\begin{document}$ Z $\end{document}</tex-math></inline-formula> and zero odd-period correlation zone (ZOCZ) width <inline-formula><tex-math id="M2">\begin{document}$ Z_{odd} = Z $\end{document}</tex-math></inline-formula> by horizontal concatenation of a certain combination of some known ZCPs. Particularly, based on any known Golay pair, we can generate a class of GCPs of more flexible length whose ZOCZ width is larger than a quarter of the sequence length.</p>

show abstract

Optimal odd-periodic complementary sequences for diffuse wireless optical communications

Cited by 8 publications

References 0 publications

Action Recognition by Joint Spatial-Temporal Motion Feature

Action Recognition by Joint Spatial-Temporal Motion Feature

An Effective Heuristic-Based Approach for Partitioning

Z-complementary pairs with flexible lengths and large zero odd-periodic correlation zones

Contact Info

Product

Resources

About