- 标题
- 摘要
- 关键词
- 实验方案
- 产品
-
Radiative characteristics of Voronoi open-cell foams made from semitransparent media
摘要： The radiative characterization of open-cell foams made from semitransparent solids is more complex than that made from opaque media. This study aims to understand how the component radiative properties and structural parameters of such open-cell foams affect their radiative characteristics. A radiative transfer model was established in the limit of geometric optics for the radiative characterization of a family of numerically generated Voronoi foams with open cells. It considers the reflection and refraction at the solid surface and the transmission, absorption and scattering process inside the solid phase. It is found that when the solid phase is in reality partially transparent, the opaque solid assumption will lead to inaccurate outcomes. Strongly scattering solid phase may cause much radiative energy to be rejected via reflection behavior, which will weaken the absorptive capability of the foam sheets as radiation absorbers. In addition, the radiative transfer model established was applied in three popular ceramic foams (alumina, silicon carbide and zirconia). The model shows advances in the field of analyzing and explaining the spectral radiative characteristics of ceramic foams. The present work can provide useful guidance when open-cell foams made from semitransparent media become potential candidates for thermal applications.
关键词： Voronoi tessellation,Radiative characterization,Ceramic foam,Semitransparent
更新于2025-09-23 15:23:52
-
A Skeleton-Based Hierarchical Method for Detecting 3-D Pole-Like Objects From Mobile LiDAR Point Clouds
摘要： The pole-like object detection is of signi?cance for robot navigation, autonomous driving, road infrastructure inventory, and detailed 3-D map generation. In this letter, we develop a skeleton-based hierarchical method for automatic detection of pole-like objects from mobile LiDAR point clouds. First, coarse extraction of building facades is adopted for the occlusion analysis. Second, slice-based Euclidean clustering algorithm is implemented to derive a set of pole-like object candidates. Third, skeleton-based principal component analysis shape recognition is presented to robustly locate all possible positions of pole-like objects. Finally, a Voronoi-constrained vertical region growing algorithm is proposed to adaptively producing the individual pole-like objects. Experiments were conducted on the public Paris–Lille-3-D data set. Experimental results demonstrate that the proposed method is robust and ef?cient for extracting the pole-like objects, with average quality of 90.43%. Furthermore, the proposed method outperforms other existing methods, especially for detecting pole-like objects with a large radius.
关键词： pole-like object extraction,Voronoi tessellation,Laplacian smoothing,principal component analysis (PCA)
更新于2025-09-23 15:22:29
-
[IEEE 2018 - 3DTV-Conference: The True Vision - Capture, Transmission and Display of 3D Video (3DTV-CON) - Helsinki (2018.6.3-2018.6.5)] 2018 - 3DTV-Conference: The True Vision - Capture, Transmission and Display of 3D Video (3DTV-CON) - DYNAMIC FRACTURING OF 3D MODELS FOR REAL TIME COMPUTER GRAPHICS
摘要： This work proposes a method of fracturing one-sided 3D objects, in real time, using standard GPU shaders. Existing implementations include either pre-fracturing objects and replacing them at run-time, or precomputing the fracture patterns and using them to fracture the objects depending on user interaction. In this article we describe a novel method in which the fracturing calculations are handled by the GPU and only having the initial positions of the fracture fields handled by the CPU. To obtain higher resolutions of fractures, scalable tessellation is also implemented. As a result, this method allows for fast fracturing that could be utilized in real-time applications such as videogames.
关键词： fracture in computer graphics,GPGPU,VFX,Voronoi tessellation,3D games
更新于2025-09-23 15:21:01
-
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
-
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
-
Correlations between optical properties and Voronoi-cell area of quantum dots
摘要： A semiconductor quantum dot (QD) can generate highly indistinguishable single photons at a high rate. For application in quantum communication and integration in hybrid systems, control of the QD optical properties is essential. Understanding the connection between the optical properties of a QD and the growth process is therefore important. Here, we show for GaAs QDs, grown by infilling droplet-etched nanoholes, that the emission wavelength, the neutral-to-charged exciton splitting, and the diamagnetic shift are strongly correlated with the capture-zone area, an important concept from nucleation theory. We show that the capture-zone model applies to the growth of this system even in the limit of a low QD density in which atoms diffuse over μm distances. The strong correlations between the various QD parameters facilitate preselection of QDs for applications with specific requirements on the QD properties; they also suggest that a spectrally narrowed QD distribution will result if QD growth on a regular lattice can be achieved.
关键词： capture-zone model,optical properties,Voronoi-cell area,GaAs QDs,quantum dots
更新于2025-09-11 14:15:04
-
[IEEE IGARSS 2018 - 2018 IEEE International Geoscience and Remote Sensing Symposium - Valencia, Spain (2018.7.22-2018.7.27)] IGARSS 2018 - 2018 IEEE International Geoscience and Remote Sensing Symposium - Tabular K-Means Clustering on Remote Sensing Images
摘要： This research develops a Tabular K-means clustering approach that derives a discriminant look-up table (LUT) from the Voronoi diagram of initial K peaks automatically selected from the scatter plot of the top two principal components of the input images. Numerical experiments in clustering 7-band Landsat TM images into specified number of spectral clusters are illustrated for the advantages in convergence and computational efficiency of the proposed tabular approach against traditional approach in K-means clustering.
关键词： Voronoi diagram,peak detection,principal component transformation,K-means,clustering
更新于2025-09-10 09:29:36