• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.37-42
• /
• 2024

This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CW_f(G)=max_𝜈∈_VCW_f(𝜈)for given graph G=(V,E),m=｜V｜, n=｜E｜, the proposed algorithm divides neighborhood N_G[𝜈_i] of the maximum degree vertex 𝜈_i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈_i firstly. Then, we split the left and right N_G[𝜈_i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n²) time complexity, that can be obtains the optimal solutions for all of various experimental data

• Honam Mathematical Journal
• /
• v.35 no.1
• /
• pp.37-49
• /
• 2013

Consider a non-degenerate open convex cone C with vertex the origin in the $n$2-dimensional Euclidean space $E^n$. We study volume properties of strictly convex hypersurfaces in the cone C. As a result, for example, if the volume of the region of an elliptic cone C cut off by the tangent hyperplane P of M at $p$ is independent of the point $p{\in}M$, then it is shown that the hypersurface M is part of an elliptic hyperboloid.

• Journal of KIISE:Software and Applications
• /
• v.35 no.11
• /
• pp.671-680
• /
• 2008

Motion capture devices have been utilized in producing several contents, such as movies and video games. However, since motion capture devices are expensive and inconvenient to use, motions segmented from captured data was recycled and synthesized to utilize it in another contents, but the motions were generally segmented by contents producers in manual. Therefore, automatic motion segmentation is recently getting a lot of attentions. Previous approaches are divided into on-line and off-line, where ow line approaches segment motions based on similarities between neighboring frames and off-line approaches segment motions by capturing the global characteristics in feature space. In this paper, we propose a graph-based high-level motion segmentation method. Since high-level motions consist of repeated frames within temporal distances, we consider similarities between neighboring frames as well as all similarities among all frames within the temporal distance. This is achieved by constructing a graph, where each vertex represents a frame and the edges between the frames are weighted by their similarity. Then, normalized cuts algorithm is used to partition the constructed graph into several sub-graphs by globally finding minimum cuts. In the experiments, the results using the proposed method showed better performance than PCA-based method in on-line and GMM-based method in off-line, as the proposed method globally segment motions from the graph constructed based similarities between neighboring frames as well as similarities among all frames within temporal distances.

• Journal of Korean Academy of Oral and Maxillofacial Radiology
• /
• v.19 no.1
• /
• pp.105-121
• /
• 1989

The author analysed tomograms and submento-vertex radiograms of 90 temporomandibular joints from 45 asymptomatic young adults. 15 had Angle class Ⅰ malocclusion, 15 classⅡ and 15 class Ⅲ. Corrected lateral tomograms were obtained in three condylar positions; centric occlusion, centric relation and 1 inch mouth opening. The condylar angulation, depth of cut, joint spaces were analysed in each radiogram. The obtained results were as follows; 1. The mean condylar angulation in Angle class Ⅰ, Ⅱ, Ⅲ group was 17.55±5.51° 13.33±8.85° 16.25±6.60° respectively, and there was no significant difference in each group. The mean condylar angulation of right side (16.62±7.23°) was larger than left side (14.80±7.33°). 2. The mean depth of cut in Angle class Ⅰ, Ⅱ, Ⅲ group was 8.13±1.61㎝, 3.05±3.80㎝, 7.75±2.19㎝, respectively. Angle class Ⅰ and class Ⅱ group revealed significant difference in measurement (p<0.0l). 3. The mean height of articular fossa in Angle class Ⅰ, Ⅱ, Ⅲ group was 8.67±3.06㎜, 9.61±2.57㎜, 8.93±2.83㎜, respectively. And the mean width of articular fossa was 19.90±2.80㎜, 19.48±3.83㎜, 20.36±4.82㎜, respectively. 4. The mean height and width of condylar head was 5.11±1.16㎜, 11.20±2.26㎜, respectively. 5. In centric occlusion, the superior joint space was the largest (3.42±1.42㎜), followed by anterior joint space (2.94±1.95㎜) and the posterior joint space (2.64±1.19㎜. In centric relation, the anterior joint space was the largest (3.86±2.17㎜), followed by the superior joint space (3.64±3.68㎜) and the posterior joint space (1.18±0.77㎜). 6. The displaced measurement from centric relation to centric occlusion was 1.10±1.04㎜ anteriorly and 0.24±0.97㎜ inferiorly. In 1 inch mouth opening state, the condylar head displaced posteroinferiorly (2.49±2.49㎜ posteriorly, 1.17±1.34㎜ inferiorly) from the apex of articular eminence. And Angle class Ⅰ and Ⅱ group, Angle class Ⅱ and Ⅲ group revealed significant difference in posterior measurement, respectively (p<0.01).

• Korean Journal of Optics and Photonics
• /
• v.20 no.2
• /
• pp.94-101
• /
• 2009

A novel method for the reconstruction of 3D shape and texture from elemental images has been proposed. Using this method, we can estimate a full 3D polygonal model of objects with seamless triangulation. But in the triangulation process, all the objects are stitched. This generates phantom surfaces that bridge depth discontinuities between different objects. To solve this problem we need to connect points only within a single object. We adopt a segmentation process to this end. The entire process of the proposed method is as follows. First, the central pixel of each elemental image is computed to extract spatial position of objects by correspondence analysis. Second, the object points of central pixels from neighboring elemental images are projected onto a specific elemental image. Then, the center sub-image is segmented and each object is labeled. We used the normalized cut algorithm for segmentation of the center sub-image. To enhance the speed of segmentation we applied the watershed algorithm before the normalized cut. Using the segmentation results, the subdivision process is applied to pixels only within the same objects. The refined grid is filtered with median and Gaussian filters to improve reconstruction quality. Finally, each vertex is connected and an object-based triangular mesh is formed. We conducted experiments using real objects and verified our proposed method.

• Journal of KIISE:Software and Applications
• /
• v.35 no.9
• /
• pp.572-587
• /
• 2008

The Self-organizing Feature Map(SOFM) that is one of unsupervised neural networks is a very powerful tool for data clustering and visualization in high-dimensional data sets. Although the SOFM has been applied in many engineering problems, it needs to cluster similar weights into one class on the trained SOFM as a post-processing, which is manually performed in many cases. The traditional clustering algorithms, such as t-means, on the trained SOFM however do not yield satisfactory results, especially when clusters have arbitrary shapes. This paper proposes automatic clustering on trained SOFM, which can deal with arbitrary cluster shapes and be globally optimized by graph cuts. When using the graph cuts, the graph must have two additional vertices, called terminals, and weights between the terminals and vertices of the graph are generally set based on data manually obtained by users. The Proposed method automatically sets the weights based on mode-seeking on a distance matrix. Experimental results demonstrated the effectiveness of the proposed method in texture segmentation. In the experimental results, the proposed method improved precision rates compared with previous traditional clustering algorithm, as the method can deal with arbitrary cluster shapes based on the graph-theoretic clustering.

• The Journal of Korean Academy of Prosthodontics
• /
• v.49 no.1
• /
• pp.8-15
• /
• 2011

Purpose: This study evaluated the bonding strength of direct relining resin to Co-Cr denture base material according to surface treatment and immersion time. Materials and methods: In this study, Co-Cr alloy was used in hexagon shape. Each specimen was cut in flat surface, and sandblasted with $110\;{\mu}m$ $Al_2O_3$ for 1 minute. 54 specimens were divided into 3 groups; group A-control group, group B-applied with surface primer A, group C-applied with surface primer B. Self curing direct resin was used for this study. Each group was subdivided into another 3 groups according to the immersion time. After the wetting storage, shear bond strength of the specimens were measured with universal testing machine. The data were analyzed using two-way analysis of variance and Tukey post hoc method. Results: In experiment of sandblasting specimens, surface roughness of the alloy was the highest after 1 minute sandblasting. In experiment of testing shear bond strength, bonding strength was lowered on group B, C, A. There were significant differences between 3 groups. According to period, Bonding strength was the highest on 0 week storage group, and the weakest on 2 week storage group. But there were no significant differences between 3 periods. According to group and period, bonding strength of all group were lowered according to immersion time but there were no significant differences on group B and group C, but there was significant difference according to immersion time on group A. Conclusion: It is useful to sandblast and adopt metal primers when relining Co-Cr metal base dentures in chair-side.