• Journal of the Korea Computer Graphics Society
• /
• v.14 no.1
• /
• pp.27-33
• /
• 2008

Mobile systems have relatively limited resources such as low memory, slow CPU, or low power comparing to desktop systems. In this paper, we present a new 3D mesh connectivity coding algorithm especially optimized for mobile systems(i.e., mobile phones). By using adaptive octree data structure for vertex positions, a new distance-based connectivity coding is proposed. Our algorithm uses fixed point arithmetic and minimizes dynamic memory allocation, appropriate for mobile systems. We also demonstrate test data to show the utility of our mobile 3D mesh codec.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.47-56
• /
• 2009

We investigate the connectivity of fading wireless ad-hoc networks with a pair of novel connectivity metrics. Our first metric looks at the problem of connectivity relying on the outage capacity of MIMO channels. Our second metric relies on a probabilistic treatment of the symbol error rates for such channels. We relate both capacity and symbol error rates to the characteristics of the underlying communication system such as antenna configuration, modulation, coding, and signal strength measured in terms of signal-to-interference-noise-ratio. For each metric of connectivity, we also provide a simplified treatment in the case of ergodic fading channels. In each case, we assume a pair of nodes are connected if their bi-directional measure of connectivity is better than a given threshold. Our analysis relies on the central limit theorem to approximate the distribution of the combined undesired signal affecting each link of an ad-hoc network as Gaussian. Supported by our simulation results, our analysis shows that (1) a measure of connectivity purely based on signal strength is not capable of accurately capturing the connectivity phenomenon, and (2) employing multiple antenna mobile nodes improves the connectivity of fading ad-hoc networks.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.160-174
• /
• 2008

In this paper, we propose new coding techniques for photometry data of three-dimensional(3-D) mesh models. We make a good use of geometry and connectivity information to improve coding efficiency of color, normal vector, and texture data. First of all, we determine the coding order of photometry data exploiting connectivity information. Then, we exploit the obtained geometry information of neighboring vortices through the previous process to predict the photometry data. For color coding, the predicted color of the current vertex is computed by a weighted sum of colors for adjacent vortices considering geometrical characteristics between the current vortex and the adjacent vortices at the geometry predictor. For normal vector coding, the normal vector of the current vertex is equal to one of the optimal plane produced by the optimal plane generator with distance equalizer owing to the property of an isosceles triangle. For texture coding, our proposed method removes discontinuity in the texture coordinates and reallocates texture image segments according to the coding order. Simulation results show that the proposed compression schemes provide improved performance over previous works for various 3-D mesh models.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.745-746
• /
• 2006

In this paper, we propose a new predictive coding scheme for color data of three-dimensional (3-D) mesh models. We exploit connectivity and geometry information to improve coding efficiency. After ordering all vertices in a 3-D mesh model with a vertex traversal technique, we employ a geometry predictor to compress the color data. The predicted color can be acquired by a weighted sum of reconstructed colors for adjacent vertices using both angles and distances between the current vertex and adjacent vertices.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.422-429
• /
• 2008

Mobile peer-to-peer (P2P) systems have recently got in the limelight of the research community that is striving to build efficient and effective mobile content addressable networks. Along this line of research, we propose a new peer-to-peer file sharing protocol suited to mobile ad hoc networks (MANET). The main ingredients of our protocol are network coding and mobility assisted data propagation, i.e., single-hop communication. We argue that network coding in combination with single-hop communication allows P2P file sharing systems in MANET to operate in a more efficient manner and helps the systems to deal with typical MANET issues such as dynamic topology and intermittent connectivity as well as various other issues that have been disregarded in previous MANET P2P researches such as addressing, node/user density, non-cooperativeness, and unreliable channel. Via simulation, we show that our P2P protocol based on network coding and single-hop communication allows shorter file downloading delays compared to an existing MANET P2P protocol.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.8
• /
• pp.547-553
• /
• 2006

We present a new geometry coding method for 3D meshes, an adaptive subdivision. Previous localized geometry coding methods have demonstrated better compression ratios than the global approach but they are considered hard to use in practice partly due to time - consuming quantization. Our new localized scheme replaces this quantization with an adaptive subdivision of the localized range. The deeper level a user chooses, the closer to the original the mesh will be restored. We also present an improved connectivity coder upon the current leading Angle-Analyzer's by applying a context-modeling. As a result, our new coder provides reliable and intuitive controls between bit-rate and distortion without losing efficiency.

• Journal of Biomedical Engineering Research
• /
• v.25 no.1
• /
• pp.43-47
• /
• 2004

Interests in human brain functionality and its connectivity have much frown up. DTI (Diffusion tensor imaging) has been known as a non-invasive MR) technique capable of providing information on water diffusion in tissues and the organization of white matter tract. Thus. It can provide us the information on the direction of brain fiber tract and the connectivity among many important cortical regions which can not be examined by other anatomical or functional MRI techniques. In this study. was used the 24 bit color coding scheme on the IDL platform in the windows environment to visualize the orientation of major fiber tracts of brain such as main association, projection, commissural fibers and corticospinal tracts. We additionally implemented a color coding scheme for each directional component and FA (fractional anisotropy), and used various color tables for them to be visualized more definitely. Consequently we implemented a fancy and basic technique to visualize the directional information of fiber tracts efficiently and we confirmed the feasibility of the 24 bit color coding scheme in DTI by visualizing main fiber tracts.

• Research in Mathematical Education
• /
• v.18 no.4
• /
• pp.273-288
• /
• 2014

In recent years, coding education has been globally emphasized and the Free Semester System will be executed to the public schools in Korea from 2016. With the introduction of the Free Semester System and the rising demand of Computational Thinking (CT) capacity, this research aims to design 'learning environment' in which learners can design and construct mathematical objects through computers and print them out through 3D printers. Furthermore, it will design learning mathematics by constructing the figurate number patterns from 'soma cubes' in the playing context and connecting those to algebraic and combinatorial patterns, which will allow students to experience mathematical connectivity. It is expected that the activities of designing figurate number patterns suggested in this research will not only strengthen CT capacity in relation to mathematical thinking but also serve as a meaningful program for the Free Semester System in terms of career experience as 3D printers can be widely used.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.10a
• /
• pp.53-55
• /
• 1986

The edge detection system makes use or 3*3 compass gradient masks, which are well suited for digital implementation. Edge angles are quantized to eight equally spaced directions, suitable for chain coding of contours. Use of edge direction msp improves the simple thresholding of gradient modulus image. The concept of local connectivity of the edge direction map is useful improving the performance of this method as well as other edge operators such as Kirsch and Sobel.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.525-535
• /
• 2011

In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity of ${\Theta}$(nT$^3$(n)) can be achieved as a tight bound when each session contains a constant number of sinks where n is the total number of nodes and T(n) is the transmission range. Surprisingly, an identical order capacity can be achieved when nodes have only MPR and MPT capabilities. This result proves that NC does not contribute to the order capacity of multicast traffic in wireless ad hoc networks when MPR and MPT are used in the network. The result is in sharp contrast to the general belief (conjecture) that NC improves the order capacity of multicast. Furthermore, if the communication range is selected to guarantee the connectivity in the network, i.e., ${\Omega}$($\sqrt{log\;n/n}$)=T(n) = O(log log n / log n), then the combination of MPR and MPT achieves a throughput capacity of ${\Theta}$(log$^{\frac{3}{2}}$ n/$\sqrt{n}$) which provides an order capacity gain of ${\Theta}$(log$^2$ n) compared to the point-to-point multicast capacity with the same number of destinations.