• Convergence Security Journal
• /
• v.8 no.4
• /
• pp.161-166
• /
• 2008

This paper proposes a new approach to align 3D data sets by using curvatures of feature surface. We use the Gaussian curvatures and the covariance matrix which imply the physical characteristics of the model to achieve registration of unaligned 3D data sets. First, the physical characteristics of local area are obtained by the Gaussian curvature. And the camera position of 3D range finder system is calculated from by using the projection matrix between 3D data set and 2D image. Then, the physical characteristics of whole area are obtained by the covariance matrix of the model. The corresponding points can be found in the overlapping region with the cross-projection method and it concentrates by removed points of self-occlusion. By the repeatedly the process discussed above, we finally find corrected points of overlapping region and get the optimized registration result.

• ETRI Journal
• /
• v.33 no.4
• /
• pp.517-527
• /
• 2011

Currently, there is a considerable interest in 3D object reconstruction using terrestrial laser scanner (TLS) systems due to their ability to automatically generate a considerable amount of points in a very short time. To fully map an object, multiple scans are captured. The different scans need to be registered with the help of the point cloud in the overlap regions. To guarantee reliable registration, the scans should have large overlap ratio with good geometry for the estimation of the transformation parameters among these scans. The objective of this paper is to propose a registration method that relaxes/eliminates the overlap requirement through the utilization of photogrammetrically reconstructed features. More specifically, a point-based procedure, which utilizes non-conjugate points along corresponding linear features from photogrammetric and TLS data, will be used for the registration. The non-correspondence of the selected points along the linear features is compensated for by artificially modifying their weight matrices. The paper presents experimental results from simulated and real datasets to illustrate the feasibility of the proposed procedure.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.151-159
• /
• 2006

In this paper. we Present an estimation method of a face pose by using two camera images. First, it finds corresponding facial feature points of eyebrow, eye and lip from two images After that, it computes three dimensional location of the facial feature points by using the triangulation method of stereo vision techniques. Next. it makes a triangle by using the extracted facial feature points and computes the surface normal vector of the triangle. The surface normal of the triangle represents the direction of the face. We applied the computed face pose to display a 3D face model. The experimental results show that the proposed method extracts correct face pose.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.795-797
• /
• 2014

The visibility polygon of a simple polygon P is the set of points which are visible from a visibility source in P such as a point or an edge. Since a visibility polygon is the set of points, the set operations such as intersection and union can be executed on them. The intersection(resp. union) of two visibility polygons is the set of points which are visible from both (resp. either) of the corresponding two visibility sources. As previous results, there exist O(n) time algorithms for the set operations of two visibility polygons with total n vertices. In this paper, we present $O(log^2n)$ time algorithms for solving the problems on a reconfigurable mesh with size $O(n^2)$.

• Phonetics and Speech Sciences
• /
• v.11 no.1
• /
• pp.1-8
• /
• 2019

Formant trajectories reflect the continuous variation of speakers' articulatory movements over time. This study examined formant trajectories of English vowels produced by ninety-three American men and women; the values were normalized using the scale function in R and compared using generalized additive mixed models (GAMMs). Praat was used to read the sound data of Hillenbrand et al. (1995). A formant analysis script was prepared, and six formant values at the corresponding time points within each vowel segment were collected. The results indicate that women yielded proportionately higher formant values than men. The standard deviations of each group showed similar patterns at the first formant (F1) and the second formant (F2) axes and at the measurement points. R was used to scale the first two formant data sets of men and women separately. GAMMs of all the scaled formant data produced various patterns of deviation along the measurement points. Generally, more group difference exists in F1 than in F2. Also, women's trajectories appear more dynamic along the vertical and horizontal axes than those of men. The trajectories are related acoustically to F1 and F2 and anatomically to jaw opening and tongue position. We conclude that scaling and nonlinear testing are useful tools for pinpointing differences between speaker group's formant trajectories. This research could be useful as a foundation for future studies comparing curvilinear data sets.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.528-529
• /
• 2023

Due to vast points and irregular structure, labeling full points in large-scale point clouds is highly tedious and time-consuming. To resolve this issue, we propose a novel point-based transformer network in weakly-supervised semantic segmentation, which only needs 0.1% point annotations. Our network introduces general local features, representing global factors from different neighborhoods based on their order positions. Then, we share query point weights to local features through point attention to reinforce impacts, which are essential in determining sparse point labels. Geometric encoding is introduced to balance query point impact and remind point position during training. As a result, one point in specific local areas can obtain global features from corresponding ones in other neighborhoods and reinforce from its query points. Experimental results on benchmark large-scale point clouds demonstrate our proposed network's state-of-the-art performance.

• East Asian mathematical journal
• /
• v.16 no.1
• /
• pp.97-103
• /
• 2000

In this work, we consider a finite difference operator $L^2_N$ corresponding to $$Lu:=-(u_{xx}+u_{yy})\;in\;{\Omega},\;u=0\;on\;{\partial}{\Omega}$$, in $S_{h^2,1}$. We derive the relation between the absolute value of the bilinear form $l_{N^2}$(u, v) on $S_{h^2,1}{\times}S_{h^2,1}$ and Sobolev $H^1$ norms.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1411-1414
• /
• 1997

It is essential to obtain a distane informaion in order to completely execute assembly tasks such as a grasping and an insertion. In this paper, we propose a method estimating a measurement distance from a sensor to an object through using the omni-directional image sensing system for assembly(OISSA) and show its features and feasibility by a computer simulation. The method, utilizing a forwarded motion stereo technique, is simple to search the corresponding points and possible to immediatiely obtain a three-dimensional 2.pi.-shape information.

• Journal of Korean Library and Information Science Society
• /
• v.31 no.1
• /
• pp.143-165
• /
• 2000

Successful organizations have special quality that acts reciprocally for the change of environment effectively. This report presented the here after subject of checking the inspection points on positive management and element of the management circle process as checkup about pending questions of library management corresponding the conversion of the management paradigm for library in the rapidly changing digital circumstances.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.161-173
• /
• 2009

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping, the set of solutions of the variational inequality for an inverse-strongly monotone mapping and the set of solutions of an equilibrium problem in a Hilbert space. We show that the iterative sequence converges strongly to a common element of the three sets. The results of this paper extend and improve the corresponding results announced by many others.