- 标题
- 摘要
- 关键词
- 实验方案
- 产品
-
Transmission Characteristics and Fano-like Lineshape in Coupled-slotted Microresonators
摘要： A new unique class of foldable distance transforms of digital images (DT) is introduced, baptized: Fast exact euclidean distance (FEED) transforms. FEED class algorithms calculate the DT starting directly from the de?nition or rather its inverse. The principle of FEED class algorithms is introduced, followed by strategies for their ef?cient implementation. It is shown that FEED class algorithms unite properties of ordered propagation, raster scanning, and independent scanning DT. Moreover, FEED class algorithms shown to have a unique property: they can be tailored to the images under investigation. Benchmarks are conducted on both the Fabbri et al. data set and on a newly developed data set. Three baseline, three approximate, and three state-of-the-art DT algorithms were included, in addition to two implementations of FEED class algorithms. It illustrates that FEED class algorithms i) provide truly exact Euclidean DT; ii) do no suffer from disconnected Voronoi tiles, which is a unique feature for non-parallel but fast DT; iii) outperform any other approximate and exact Euclidean DT with its time complexity OeNT, even after their optimization; and iv) are unequaled in that they can be adapted to the characteristics of the image class at hand.
关键词： Fast exact euclidean distance (FEED),computational complexity,distance transformation,distance transform,benchmark,adaptive,Voronoi
更新于2025-09-23 15:19:57
-
[IEEE 2019 Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC) - Munich, Germany (2019.6.23-2019.6.27)] 2019 Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC) - Multi-Pulse Fitting of Transition Edge Sensor Signals from a Near-Infrared Continuous-Wave Source
摘要： A new unique class of foldable distance transforms of digital images (DT) is introduced, baptized: Fast exact euclidean distance (FEED) transforms. FEED class algorithms calculate the DT starting directly from the de?nition or rather its inverse. The principle of FEED class algorithms is introduced, followed by strategies for their ef?cient implementation. It is shown that FEED class algorithms unite properties of ordered propagation, raster scanning, and independent scanning DT. Moreover, FEED class algorithms shown to have a unique property: they can be tailored to the images under investigation. Benchmarks are conducted on both the Fabbri et al. data set and on a newly developed data set. Three baseline, three approximate, and three state-of-the-art DT algorithms were included, in addition to two implementations of FEED class algorithms. It illustrates that FEED class algorithms i) provide truly exact Euclidean DT; ii) do no suffer from disconnected Voronoi tiles, which is a unique feature for non-parallel but fast DT; iii) outperform any other approximate and exact Euclidean DT with its time complexity OeNT, even after their optimization; and iv) are unequaled in that they can be adapted to the characteristics of the image class at hand.
关键词： benchmark,computational complexity,Fast exact euclidean distance (FEED),distance transform,Voronoi,distance transformation,adaptive
更新于2025-09-19 17:13:59
-
[IEEE 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Chicago, IL, USA (2019.6.16-2019.6.21)] 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Investigation of Radiative Coupling from InGaAsP Quantum Wells for Improving End-of-Life (EOL) Efficiency in Multijunction Solar Cells
摘要： A new unique class of foldable distance transforms of digital images (DT) is introduced, baptized: Fast exact euclidean distance (FEED) transforms. FEED class algorithms calculate the DT starting directly from the de?nition or rather its inverse. The principle of FEED class algorithms is introduced, followed by strategies for their ef?cient implementation. It is shown that FEED class algorithms unite properties of ordered propagation, raster scanning, and independent scanning DT. Moreover, FEED class algorithms shown to have a unique property: they can be tailored to the images under investigation. Benchmarks are conducted on both the Fabbri et al. data set and on a newly developed data set. Three baseline, three approximate, and three state-of-the-art DT algorithms were included, in addition to two implementations of FEED class algorithms. It illustrates that FEED class algorithms i) provide truly exact Euclidean DT; ii) do no suffer from disconnected Voronoi tiles, which is a unique feature for non-parallel but fast DT; iii) outperform any other approximate and exact Euclidean DT with its time complexity OeNT, even after their optimization; and iv) are unequaled in that they can be adapted to the characteristics of the image class at hand.
关键词： Fast exact euclidean distance (FEED),computational complexity,distance transformation,distance transform,benchmark,adaptive,Voronoi
更新于2025-09-19 17:13:59
-
Room-temperature power-stabilized narrow-linewidth tunable erbium-doped fiber ring laser based on cascaded Mach-Zehnder interferometers with different free spectral range for strain sensing
摘要： A new unique class of foldable distance transforms of digital images (DT) is introduced, baptized: Fast exact euclidean distance (FEED) transforms. FEED class algorithms calculate the DT starting directly from the de?nition or rather its inverse. The principle of FEED class algorithms is introduced, followed by strategies for their ef?cient implementation. It is shown that FEED class algorithms unite properties of ordered propagation, raster scanning, and independent scanning DT. Moreover, FEED class algorithms shown to have a unique property: they can be tailored to the images under investigation. Benchmarks are conducted on both the Fabbri et al. data set and on a newly developed data set. Three baseline, three approximate, and three state-of-the-art DT algorithms were included, in addition to two implementations of FEED class algorithms. It illustrates that FEED class algorithms i) provide truly exact Euclidean DT; ii) do no suffer from disconnected Voronoi tiles, which is a unique feature for non-parallel but fast DT; iii) outperform any other approximate and exact Euclidean DT with its time complexity OeNT, even after their optimization; and iv) are unequaled in that they can be adapted to the characteristics of the image class at hand.
关键词： benchmark,computational complexity,Fast exact euclidean distance (FEED),distance transform,Voronoi,distance transformation,adaptive
更新于2025-09-19 17:13:59
-
[IEEE 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Chicago, IL, USA (2019.6.16-2019.6.21)] 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Transparent Cu <sub/>2</sub> O solar cell for high-efficiency and low-cost tandem photovoltaics
摘要： In this paper, the convergence analysis and the improvement of the chicken swarm optimization (CSO) algorithm are investigated. The stochastic process theory is employed to establish the Markov chain model for CSO whose state sequence is proved to be finite homogeneous Markov chain and some properties of the Markov chain are analyzed. According to the convergence criteria of the random search algorithms, the CSO algorithm is demonstrated to meet two convergence criteria, which ensures the global convergence. For the problem that the CSO algorithm is easy to fall into local optimum in solving high-dimensional problems, an improved CSO is proposed, in which the relevant parameters analysis and the verification of optimization capability are made by lots of test functions in high-dimensional case.
关键词： global convergence,Markov chain,Chicken swarm optimization,benchmark function,state transition
更新于2025-09-19 17:13:59
-
[IEEE 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Chicago, IL, USA (2019.6.16-2019.6.21)] 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - A 100% solar-powered quadcopter with monocrystalline silicon cells
摘要： We propose NM landscapes as a new class of tunably rugged benchmark problems. NM landscapes are well defined on alphabets of any arity, including both discrete and real-valued alphabets, include epistasis in a natural and transparent manner, are proven to have known value and location of the global maximum and, with some additional constraints, are proven to also have a known global minimum. Empirical studies are used to illustrate that, when coefficients are selected from a recommended distribution, the ruggedness of NM landscapes is smoothly tunable and correlates with several measures of search difficulty. We discuss why these properties make NM landscapes preferable to both NK landscapes and Walsh polynomials as benchmark landscape models with tunable epistasis.
关键词： fitness landscapes,NK landscapes,Benchmark landscapes,Walsh polynomials
更新于2025-09-19 17:13:59
-
Tris-(8-hydroxyquinoline) aluminium thin film as saturable absorber for passively Q-switched erbium-doped fibre laser
摘要： A new unique class of foldable distance transforms of digital images (DT) is introduced, baptized: Fast exact euclidean distance (FEED) transforms. FEED class algorithms calculate the DT starting directly from the de?nition or rather its inverse. The principle of FEED class algorithms is introduced, followed by strategies for their ef?cient implementation. It is shown that FEED class algorithms unite properties of ordered propagation, raster scanning, and independent scanning DT. Moreover, FEED class algorithms shown to have a unique property: they can be tailored to the images under investigation. Benchmarks are conducted on both the Fabbri et al. data set and on a newly developed data set. Three baseline, three approximate, and three state-of-the-art DT algorithms were included, in addition to two implementations of FEED class algorithms. It illustrates that FEED class algorithms i) provide truly exact Euclidean DT; ii) do no suffer from disconnected Voronoi tiles, which is a unique feature for non-parallel but fast DT; iii) outperform any other approximate and exact Euclidean DT with its time complexity OeNT, even after their optimization; and iv) are unequaled in that they can be adapted to the characteristics of the image class at hand.
关键词： Fast exact euclidean distance (FEED),benchmark,distance transform,distance transformation,computational complexity,Voronoi,adaptive
更新于2025-09-19 17:13:59
-
Performance of time-dependent density functional theory on twisted intramolecular charge transfer state of emerging visible light photoswitches
摘要： Hemithioindigo dyes (HTIs) are a class of emerging visible light photoswitches. By using M06, M062X, B3LYP and BMK density functionals, we have investigated the local excited (LE) state and twisted intramolecular charge transfer (TICT) state of HTIs. Both the two excited states are located in HTIs Z1 and Z2 after combining the results of all functionals. The formation of either the LE or TICT state is found to be controlled by the direction of the C2eC3 single bond rotation. Di?erent functionals are found to have intrinsic biases on LE and TICT states. Thus, a reasonable combination of various functionals is a convenient method to investigate a system possessing multiple excited-state minima. We recommend a combination of the M06 and M062X functionals.
关键词： Benchmark,Hula twist,Molecular machine,Molecular motor,Photoisomerization
更新于2025-09-10 09:29:36
-
[IEEE 2018 24th International Conference on Pattern Recognition (ICPR) - Beijing, China (2018.8.20-2018.8.24)] 2018 24th International Conference on Pattern Recognition (ICPR) - Masked Label Learning for Optical Flow Regression
摘要： Optical flow estimation is a challenging task in computer vision. Recent methods formulate such task as a supervised-learning problem. But it often suffers from limited realistic ground truth. In this paper, a compact network, embedded with cost volume, residual encoder and deconvolutional decoder, is presented to regress optical flow in an end-to-end manner. To overcome the lack of flow labels, we propose a novel data-driven strategy called masked label learning, where a large amount of masked labels are generated from the FlowNet2.0 model and filtered by warping calibration for model training. We also present an extended-Huber loss to handle large displacements. With pretraining on massive masked flow data, followed by fine tuning on a small number of sparse labels, our method achieves state-of-the-art accuracy on KITTI flow benchmark.
关键词： optical flow estimation,extended-Huber loss,FlowNet2.0,KITTI flow benchmark,masked label learning
更新于2025-09-09 09:28:46
-
Guidelines for Underwater Image Enhancement Based on Benchmarking of Different Methods
摘要： Images obtained in an underwater environment are often affected by colour casting and suffer from poor visibility and lack of contrast. In the literature, there are many enhancement algorithms that improve different aspects of the underwater imagery. Each paper, when presenting a new algorithm or method, usually compares the proposed technique with some alternatives present in the current state of the art. There are no studies on the reliability of benchmarking methods, as the comparisons are based on various subjective and objective metrics. This paper would pave the way towards the definition of an effective methodology for the performance evaluation of the underwater image enhancement techniques. Moreover, this work could orientate the underwater community towards choosing which method can lead to the best results for a given task in different underwater conditions. In particular, we selected five well-known methods from the state of the art and used them to enhance a dataset of images produced in various underwater sites with different conditions of depth, turbidity, and lighting. These enhanced images were evaluated by means of three different approaches: objective metrics often adopted in the related literature, a panel of experts in the underwater field, and an evaluation based on the results of 3D reconstructions.
关键词： automatic colour equalization,3D reconstruction,non-local dehazing,benchmark,lab,colour correction,screened poisson equation,CLAHE,underwater image enhancement,dehazing
更新于2025-09-09 09:28:46