• Honam Mathematical Journal
• /
• v.30 no.4
• /
• pp.589-602
• /
• 2008

As a survey-type article, the paper reviews various digital topological utilities from digital covering theory. Digital covering theory has strongly contributed to the calculation of the digital k-fundamental group of both a digital space(a set with k-adjacency or digital k-graph) and a digital product. Furthermore, it has been used in classifying digital spaces, establishing almost Van Kampen theory which is the digital version of van Kampen theorem in algebrate topology, developing the generalized universal covering property, and so forth. Finally, we remark on the digital k-surface structure of a Cartesian product of two simple closed $k_i$-curves in ${\mathbf{Z}}^n$, $i{\in}{1,2}$.

• Journal of the Korean Geophysical Society
• /
• v.9 no.1
• /
• pp.7-19
• /
• 2006

Laser scanning is a new technology for obtaining Digital Surface Models(DSM) of the earth surface.It is a fast method for sampling the earth surface with high density and high point accuracy. This paper is for buildings extraction from LiDAR points data. The core part of building construction is based on a parameters filter for distinguishing between terrain and non-terrain laser points. The 3D geometrical properties of the building facades are obtained based on plane fitting using least-squares adjustment. The reconstruction part of the procedure is based on the adjacency among the roof facades. Primitive extraction and facade intersections are used for building reconstruction. For overcome the difficulty just reconstruct of laser points data used with digital camera images. Also, 3D buildings of city area reconstructed using digital map. Finally, In this paper show 3D building Modeling using digital map and LiDAR data.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.7
• /
• pp.167-174
• /
• 1998

This paper presents an unoccluded cylindrical object pose measurement using a slit beam laser in which a robot recognizes all of the unoccluded objects from the top of jumbled objects, and picks them up one by one. The elliptical equation parameters of a projected curve edge on a slice are calculated using LSM. The coefficients of standard elliptical equation are compared with these parameters to estimate the object pose. The hamming distances between the estimated coordinates and the calculated ones are extracted as measures to evaluate a local constraint and a smoothing surface curvature. The edges between slices are linked using error function based on the edge types and the hamming distances. The linked edges on slices are compared with the model object's length to recognize the unoccluded object. This proposed method may provide a solution to the automation of part handling in manufacturing environments such as punch press operation or part assembly.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.28.3-28
• /
• 2001

This paper proposes a new algorithm that detects and separates the occluding and occluded objects in a 2D image. An input image is represented by the attributed graph where a node corresponds to a surface and an arc connecting two nodes describes the adjacency of the nodes in the image. Each end of arc is weighted by relation value which tells the number of edges connected to the surface represented by the node in the opposite side of the arc. In attributed graph homogeneous nodes pertained to the same object always construct one of three special patterns which can be simply classified by comparison of relation values of the arcs. The experimental results have shown that the proposed algorithm efficiently separates the objects ...

• Korean Journal of Remote Sensing
• /
• v.23 no.3
• /
• pp.199-209
• /
• 2007

Traditionally, aerial images have been used as main sources for compiling topographic maps. In recent years, lidar data has been exploited as another type of mapping data. Regarding their performances, aerial imagery has the ability to delineate object boundaries but omits much of these boundaries during feature extraction. Lidar provides direct information about heights of object surfaces but have limitations with respect to boundary localization. Considering the characteristics of the sensors, this paper proposes an approach to extracting buildings from lidar and aerial imagery, which is based on the complementary characteristics of optical and range sensors. For detecting building regions, relationships among elevation contours are represented into directional graphs and searched for the contours corresponding to external boundaries of buildings. For generating building models, a wing model is proposed to assemble roof surface patches into a complete building model. Then, building models are projected and checked with features in aerial images. Experimental results show that the proposed approach provides an efficient and accurate way to extract building models.

• Proceedings of the KSRS Conference
• /
• 1998.09a
• /
• pp.103-109
• /
• 1998

A technique on atmospheric correction algorithm for a single band (0.76-0.90 $\mu$m) reflective of Landsat TM imagery has been developed using a radiation transfer model simulation. It proceeds in two steps: First, calculation of the surface reflectance of each pixel based on precomputed planetary albedo functions for actual atmospheres(e. g. radiosonde) and two kinds of atmospheric visibility states. Second, approximate correction of the adjacency pixel effect by taking into account the average reflectance in an 7 $\times$ 7 pixel neighbourhood and using appropriate land cover classification in reflectance. The correction functions are provided by MODTRAN model.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.1
• /
• pp.28-37
• /
• 2007

This paper addresses a new surface reconstruction scheme for approximating the isosurface from a set of tomographic cross sectional images. Differently from the novel Marching cube algorithm, our method does not extract iso-density surface(isosurface) directly from the voxels but calculates the iso-density point(isopoint) first. After building the relatively coarse initial mesh by the Cell-boundary algorithm approximating the isosurface, it produces the final isosurface by iteratively shrinking and smoothing the initial mesh. Comparing with the Marching Cube algorithm, our method is robust and does not make any crack in resulting surface model. Furthermore, the proposed method surmounts the O(1)-adjacency limitation of MC in defining the isopoints by permitting the O(2) and O(3)-adjacent isopoints in surface reconstruction, and can produce more accurate isosurface. According to experiments, it is proved to be very robust and efficient for isosurface reconstruction from cross sectional images.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.511-520
• /
• 2009

In this paper, we present a new iso-density surface reconstruction scheme based on a hierarchy on the input volume data and the output mesh data. From the input volume data, we construct a hierarchy of volumes, called a volume pyramid, based on a 3D dilation filter. After constructing the volume pyramid, we extract a coarse base mesh from the coarsest resolution of the pyramid with the Cell-boundary representation scheme. We iteratively fit this mesh to the iso-points extracted from the volume data under O(3)-adjacency constraint. For the surface fitting, the shrinking process and the smoothing process are adopted as in the SWIS (Shrink-wrapped isosurface) algorithm[6], and we subdivide the mesh to be able to reconstruct fine detail of the isosurface. The advantage of our method is that it generates a mesh which can be utilized by several multiresolution algorithms such as compression and progressive transmission.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.54-68
• /
• 2001

This paper proposes a new algorithm that detects and separates the occluding and occluded objects in a 2D image. An input image is represented by the attributed graph where a node corresponds to a surface and an arc connecting two nodes describes the adjacency of the nodes in the image. Each end of arc is weighted by relation value which tells the number of edges connected to the surface represented by the node in the opposite side of the arc. In attributed graph, homogeneous nodes pertained to a same object always construct one of three special patterns which can be simply classified by comparison of relation values of the arcs. The experimental results have shown that the proposed algorithm efficiently separates the objects overlapped arbitrarily, and that this approach of separating objects before matching operation reduces the matching time significantly by simplifying the matching problem of overlapped objects as the one of individual single object.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1591-1596
• /
• 1991

The present paper describes a method of recognizing a polyhedron employing the notion of network constraint analysis. Typical difficulties in three-dimensional object recognition, other than shading, reflection, and hidden line problems, include the case where appearances of an object vary according to observation points and the case where an object to be recognized is occluded by other objects placed in its front, resulting in incomplete information on the object shape. These difficulties can, however, be solved to a large extent, by taking account of certain local constraints defined on a polyhedral shape. The present paper assumes a model-based vision employing an appearance-oriented model of a polyhedron which is provided by placing it at the origin of a large sphere and observing it from various positions on the surface of the sphere. The model is actually represented by the sets of adjacent faces pairs of the polyhedron observed from those positions. Since the shape of a projected face gives constraint to that of its adjacent face, this results in a local constraint relation between these faces. Each projected face of an unknown polyhedron on an acquired image is examined its match with those faces in the model, producing network constraint relations between faces in the image and faces in the model. Taking adjacency of faces into consideration, these network constraint relations are analyzed. And if the analysis finally provides a solution telling existence of one to one match of the faces between the unknown polyhedron and the model, the unknown polyhedron is understood to be one of those memorized models placed in a certain posture. In the performed experiment, a polyhedron was observed from 320 regularly arranged points on a sphere to provide its appearance model and a polyhedron with arbitrarily postured, occluded, or imposed another difficulty was successfully recognized.