Three Dimensional Point Clouds Watermarking Algorithm Based on Sphere Degenerated Octree

2011 ◽  
Vol 314-316 ◽  
pp. 2064-2070 ◽  
Author(s):  
Jian Xin Liu ◽  
Han Guo Cui ◽  
Xing Dai
Keyword(s):  
Three Dimensional ◽  
Point Clouds ◽  
Component Analysis ◽  
Primary Component ◽  
Experimental Results ◽  
Synchronization Error ◽  
Blind Detection ◽  
Extraction Algorithm ◽  
Uniform Scaling ◽  
Original Point

To ensure the security and integrity of three dimensional point clouds model during transmission in the network, according to their own characteristics, after the pretreatment of PCA (Primary Component Analysis), three dimensional point clouds watermarking embedding algorithm based on sphere degenerated octree was proposed, and the octree that contained the original point clouds model was subdivided multilevel from top to bottom, and the nodes of the octree were ordered. And three dimensional point clouds watermarking extraction algorithm was proposed, and the original point clouds model and the watermarked model were registered accurately, and the occurrence of synchronization error was avoided. Experimental results showed that the presented algorithm was robust to many attacks such as rotation, translation, uniform scaling, vertices reordering, simplifying, noise and cropping under blind detection.

scholarly journals EXPLOITING 3D ULTRASOUND FOR FETAL DIAGNOSTIC PURPOSE THROUGH FACIAL LANDMARKING

2014 ◽  
Vol 33 (3) ◽  
pp. 167 ◽  
Author(s):  
Enrico Vezzetti ◽  
Domenico Speranza ◽  
Federica Marcolin ◽  
Giulia Fracastoro ◽  
Giorgia Buscicchio
Keyword(s):  
State Of The Art ◽  
Three Dimensional ◽  
Aesthetic Surgery ◽  
Point Clouds ◽  
3D Ultrasound ◽  
Diagnostic Purpose ◽  
Expression Recognition ◽  
Principal Curvatures ◽  
Extraction Algorithm ◽  
The Mean

In the last decade, three-dimensional landmarking has gained attention for different applications, such as face recognition for both identification of suspects and authentication, facial expression recognition, corrective and aesthetic surgery, syndrome study and diagnosis. This work focuses on the last one by proposing a geometrically-based landmark extraction algorithm aimed at diagnosing syndromes on babies before their birth. Pivotal role in this activity is the support provided by physicians and 3D ultrasound tools for working on real faces. In particular, the landmarking algorithm here proposed only relies on descriptors coming from Differential Geometry (Gaussian, mean, and principal curvatures, derivatives, coefficients of first and second fundamental forms, Shape and Curvedness indexes) and is tested on nine facial point clouds referred to nine babies taken by a three-dimensional ultrasound tool at different weeks' gestation. The results obtained, validated with the support of four practitioners, show that the localization is quite accurate. All errors lie in the range between 0 and 3.5 mm and the mean distance for each shell is in the range between 0.6 and 1.6 mm. The landmarks showing the highest errors are the ones belonging to the mouth region. Instead, the most precise landmark is the pronasal, on the nose tip, with a mean distance of 0.55 mm. Relying on current literature, this study is something missing in the state-of-the-art of the field, as present facial studies on 3D ultrasound do not work on automatic landmarking yet.

scholarly journals Super Edge 4-Points Congruent Sets-Based Point Cloud Global Registration

2021 ◽  
Vol 13 (16) ◽  
pp. 3210
Author(s):  
Shikun Li ◽  
Ruodan Lu ◽  
Jianya Liu ◽  
Liang Guo
Keyword(s):  
Three Dimensional ◽  
Initial Point ◽  
Point Clouds ◽  
Search Space ◽  
Frame Rate ◽  
Registration Method ◽  
Dense Point ◽  
Coarse Registration ◽  
Fine Registration ◽  
Original Point

With the acceleration in three-dimensional (3D) high-frame-rate sensing technologies, dense point clouds collected from multiple standpoints pose a great challenge for the accuracy and efficiency of registration. The combination of coarse registration and fine registration has been extensively promoted. Unlike the requirement of small movements between scan pairs in fine registration, coarse registration can match scans with arbitrary initial poses. The state-of-the-art coarse methods, Super 4-Points Congruent Sets algorithm based on the 4-Points Congruent Sets, improves the speed of registration to a linear order via smart indexing. However, the lack of reduction in the scale of original point clouds limits the application. Besides, the coplanarity of registration bases prevents further reduction of search space. This paper proposes a novel registration method called the Super Edge 4-Points Congruent Sets to address the above problems. The proposed algorithm follows a three-step procedure, including boundary segmentation, overlapping regions extraction, and bases selection. Firstly, an improved method based on vector angle is used to segment the original point clouds aiming to thin out the scale of the initial point clouds. Furthermore, overlapping regions extraction is executed to find out the overlapping regions on the contour. Finally, the proposed method selects registration bases conforming to the distance constraints from the candidate set without consideration about coplanarity. Experiments on various datasets with different characteristics have demonstrated that the average time complexity of the proposed algorithm is improved by 89.76%, and the accuracy is improved by 5 mm on average than the Super 4-Points Congruent Sets algorithm. More encouragingly, the experimental results show that the proposed algorithm can be applied to various restrictive cases, such as few overlapping regions and massive noise. Therefore, the algorithm proposed in this paper is a faster and more robust method than Super 4-Points Congruent Sets under the guarantee of the promised quality.

Non-Uniform Simplification of Point Clouds

2011 ◽  
Vol 311-313 ◽  
pp. 1806-1809
Author(s):  
Sheng Yong Chen ◽  
Qiu Guan ◽  
Lan Lan Li ◽  
Wei Huang ◽  
Li Yong Qian
Keyword(s):  
Reverse Engineering ◽  
Mechanical Design ◽  
Three Dimensional ◽  
Point Clouds ◽  
New Method ◽  
Affinity Propagation ◽  
Data Sets ◽  
Affinity Propagation Clustering ◽  
Geometrical Shapes ◽  
Original Point

For three-dimensional mechanical design and reverse engineering in manufacturing, point clouds are obtained from some scanners before they are used to generate geometrical shapes in a design. However, original point clouds are poor in quality because of noise, incomplete, and non-uniform data samples. Simplification is an important step to generate a good result prior to polygonal meshes. Usually we cannot obtain uniform points using traditional cloud simplification methods. This paper proposes a new method for non-uniform points cloud simplification (NUPCS), which is based on affinity propagation clustering. Experiments are carried out for some data sets and results show that our proposed method can deliver good simplification performances.

scholarly journals Matching Point Clouds with STL Models by Using the Principle Component Analysis and a Decomposition into Geometric Primitives

2021 ◽  
Vol 11 (5) ◽  
pp. 2268
Author(s):  
Erika Straková ◽  
Dalibor Lukáš ◽  
Zdenko Bobovský ◽  
Tomáš Kot ◽  
Milan Mihola ◽  
...  
Keyword(s):  
Point Cloud ◽  
Principal Component ◽  
Point Clouds ◽  
Component Analysis ◽  
Language Models ◽  
Computational Time ◽  
Dominant Eigenvalue ◽  
Eigenvalues And Eigenvectors ◽  
Correct Model ◽  
Geometric Primitives

While repairing industrial machines or vehicles, recognition of components is a critical and time-consuming task for a human. In this paper, we propose to automatize this task. We start with a Principal Component Analysis (PCA), which fits the scanned point cloud with an ellipsoid by computing the eigenvalues and eigenvectors of a 3-by-3 covariant matrix. In case there is a dominant eigenvalue, the point cloud is decomposed into two clusters to which the PCA is applied recursively. In case the matching is not unique, we continue to distinguish among several candidates. We decompose the point cloud into planar and cylindrical primitives and assign mutual features such as distance or angle to them. Finally, we refine the matching by comparing the matrices of mutual features of the primitives. This is a more computationally demanding but very robust method. We demonstrate the efficiency and robustness of the proposed methodology on a collection of 29 real scans and a database of 389 STL (Standard Triangle Language) models. As many as 27 scans are uniquely matched to their counterparts from the database, while in the remaining two cases, there is only one additional candidate besides the correct model. The overall computational time is about 10 min in MATLAB.

Conical SNA using fuzzy k-medoids based on user experience

2021 ◽  
pp. 002072092098849
Author(s):  
Poonam Rani ◽  
MPS Bhatia ◽  
Devendra K Tayal
Keyword(s):  
Social Networks ◽  
Social Network ◽  
User Experience ◽  
Three Dimensional ◽  
Experimental Results ◽  
Dynamic Parameters ◽  
Clustering Method ◽  
Cone Model ◽  
Intelligent Approach ◽  
Conical Model

The paper presents an intelligent approach for the comparison of social networks through a cone model by using the fuzzy k-medoids clustering method. It makes use of a geometrical three-dimensional conical model, which astutely represents the user experience views. It uses both the static as well as the dynamic parameters of social networks. In this, we propose an algorithm that investigates which social network is more fruitful. For the experimental results, the proposed work is employed on the data collected from students from different universities through the Google forms, where students are required to rate their experience of using different social networks on different scales.

Robust-PCA-based hierarchical plane extraction for application to geometric 3D indoor mapping

2014 ◽  
Vol 41 (2) ◽  
pp. 203-212 ◽  
Author(s):  
Suyong Yeon ◽  
ChangHyun Jun ◽  
Hyunga Choi ◽  
Jaehyeon Kang ◽  
Youngmok Yun ◽  
...  
Keyword(s):  
Principal Component ◽  
Point Clouds ◽  
Previous Method ◽  
Divide And Conquer ◽  
Sensor Data ◽  
Estimation Accuracy ◽  
Content Type ◽  
Extraction Algorithm ◽  
Plane Extraction ◽  
Scan Data

Purpose – The authors aim to propose a novel plane extraction algorithm for geometric 3D indoor mapping with range scan data. Design/methodology/approach – The proposed method utilizes a divide-and-conquer step to efficiently handle huge amounts of point clouds not in a whole group, but in forms of separate sub-groups with similar plane parameters. This method adopts robust principal component analysis to enhance estimation accuracy. Findings – Experimental results verify that the method not only shows enhanced performance in the plane extraction, but also broadens the domain of interest of the plane registration to an information-poor environment (such as simple indoor corridors), while the previous method only adequately works in an information-rich environment (such as a space with many features). Originality/value – The proposed algorithm has three advantages over the current state-of-the-art method in that it is fast, utilizes more inlier sensor data that does not become contaminated by severe sensor noise and extracts more accurate plane parameters.

scholarly journals Multi-Dimensional Underwater Point Cloud Detection Based on Deep Learning

Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 884
Author(s):  
Chia-Ming Tsai ◽  
Yi-Horng Lai ◽  
Yung-Da Sun ◽  
Yu-Jen Chung ◽  
Jau-Woei Perng
Keyword(s):  
Deep Learning ◽  
Point Cloud ◽  
Three Dimensional ◽  
Point Clouds ◽  
Training Data ◽  
Network Architectures ◽  
Point Cloud Data ◽  
Data Types ◽  
Raw Data ◽  
Cloud Data

Numerous sensors can obtain images or point cloud data on land, however, the rapid attenuation of electromagnetic signals and the lack of light in water have been observed to restrict sensing functions. This study expands the utilization of two- and three-dimensional detection technologies in underwater applications to detect abandoned tires. A three-dimensional acoustic sensor, the BV5000, is used in this study to collect underwater point cloud data. Some pre-processing steps are proposed to remove noise and the seabed from raw data. Point clouds are then processed to obtain two data types: a 2D image and a 3D point cloud. Deep learning methods with different dimensions are used to train the models. In the two-dimensional method, the point cloud is transferred into a bird’s eye view image. The Faster R-CNN and YOLOv3 network architectures are used to detect tires. Meanwhile, in the three-dimensional method, the point cloud associated with a tire is cut out from the raw data and is used as training data. The PointNet and PointConv network architectures are then used for tire classification. The results show that both approaches provide good accuracy.

scholarly journals Principal Component Analysis of Munich Functional Developmental Diagnosis

2021 ◽  
Vol 13 (2) ◽  
pp. 227-233
Author(s):  
Grażyna Pazera ◽  
Marta Młodawska ◽  
Jakub Młodawski ◽  
Kamila Klimowska
Keyword(s):  
Principal Component Analysis ◽  
Social Skills ◽  
Motor Development ◽  
Three Dimensional ◽  
Principal Component ◽  
Component Analysis ◽  
Three Dimensions ◽  
Matrix Analysis ◽  
Psychomotor Development ◽  
First Year Of Life

Objectives: Munich Functional Developmental Diagnosis (MFDD) is a scale for assessing the psychomotor development of children in the first months or years of life. The tool is based on standardized tables of physical development and is used to detect developmental deficits. It consists of eight axes on which the following skills are assessed: crawling, sitting, walking, grasping, perception, speaking, speech understanding, social skills. Methods: The study included 110 children in the first year of life examined with the MFDD by the same physician. The score obtained on a given axis was coded as a negative value (defined in months) below the child’s age-specific developmental level. Next, we examined the dimensionality of the scale and the intercorrelation of its axes using polychoric correlation and principal component analysis. Results: Correlation matrix analysis showed high correlation of MFDD axes 1–4, and MFDD 6–8. The PCA identified three principal components consisting of children’s development in the areas of large and small motor skills (axis 1–4), perception (axis 5), active speech, passive speech and social skills (axis 6–8). The three dimensions obtained together account for 80.27% of the total variance. Conclusions: MFDD is a three-dimensional scale that includes motor development, perception, and social skills and speech. There is potential space for reduction in the number of variables in the scale.

Robotic motion compensation for bone movement, using ultrasound images

2015 ◽  
Vol 42 (5) ◽  
pp. 466-474 ◽  
Author(s):  
P.M.B. Torres ◽  
P. J. S. Gonçalves ◽  
J.M.M. Martins
Keyword(s):  
Motion Compensation ◽  
Optical Measurement ◽  
Three Dimensional ◽  
Point Clouds ◽  
Robotic System ◽  
Ultrasound Images ◽  
Bone Drilling ◽  
Content Type ◽  
3D Point Clouds ◽  
Robotic Motion

Purpose – The purpose of this paper is to present a robotic motion compensation system, using ultrasound images, to assist orthopedic surgery. The robotic system can compensate for femur movements during bone drilling procedures. Although it may have other applications, the system was thought to be used in hip resurfacing (HR) prosthesis surgery to implant the initial guide tool. The system requires no fiducial markers implanted in the patient, by using only non-invasive ultrasound images. Design/methodology/approach – The femur location in the operating room is obtained by processing ultrasound (USA) and computer tomography (CT) images, obtained, respectively, in the intra-operative and pre-operative scenarios. During surgery, the bone position and orientation is obtained by registration of USA and CT three-dimensional (3D) point clouds, using an optical measurement system and also passive markers attached to the USA probe and to the drill. The system description, image processing, calibration procedures and results with simulated and real experiments are presented and described to illustrate the system in operation. Findings – The robotic system can compensate for femur movements, during bone drilling procedures. In most experiments, the update was always validated, with errors of 2 mm/4°. Originality/value – The navigation system is based entirely on the information extracted from images obtained from CT pre-operatively and USA intra-operatively. Contrary to current surgical systems, it does not use any type of implant in the bone to track the femur movements.

Sign in / Sign up

Export Citation Format

Share Document