• Korean Journal of Remote Sensing
• /
• v.19 no.2
• /
• pp.159-169
• /
• 2003

This paper presents a method for automatic 3-d building reconstruction using high resolution aerial imagery. First, by using edge preserving filtering, noise is eliminated and then images are segmented by watershed algorithm, which preserves location of edge pixels. To extract line segments between control points from boundary of each region, we calculate curvature of each pixel on the boundary and then find the control points. Line segment linking is performed according to direction and length of line segments and the location of line segments is adjusted using gradient magnitudes of all pixels of the line segment. Coplanar grouping and pplygonal patch formation are performed per region by selecting 3-d line segments that are matched using epipolar geometry and flight information. The algorithm has been applied to high resolution aerial images and the results show accurate 3D building reconstruction.

• ETRI Journal
• /
• v.42 no.3
• /
• pp.420-432
• /
• 2020

The reconstruction of archaeological fragments in 3D geometry is an important problem in pattern recognition and computer vision. Therefore, we implement an algorithm with the help of a 3D model to perform reconstruction from the real datasets using the slope features. This approach avoids the problem of gaps created through the loss of parts of the artifacts. Therefore, the aim of this study is to assemble the object without previous knowledge about the form of the original object. We utilize the edges of the fragments as an important feature in reconstructing the objects and apply multiple procedures to extract the 3D edge points. In order to assign the positions of the unknown parts that are supposed to match, the contour must be divided into four parts. Furthermore, to classify the fragments under reconstruction, we apply a backpropagation neural network. We test the algorithm on several models of ceramic fragments. It achieves highly accurate results in reconstructing the objects into their original forms, in spite of absent pieces.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1987.04a
• /
• pp.27-30
• /
• 1987

Some modification of laplacian pyramidal coding have been done and tested for a test image, From our studies, its apperar that 3-D redictor which exploits inter and intra plane redundancy simultaneously somewhat imporves the image quality, We also have tried to reduce the bit rate by only sending zeroth plane image values that correstpond to estimated dege points which can be obtained from the first plane For both cases the feedback of quantization errof in the previous plane has been in the reconstruction of each plane. Subjective and SNR tests show the better performance of the studied methods oner the conventional one.

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.9-15
• /
• 2013

An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the concept of uncertain ${\alpha}$-minimum spanning tree is initiated for minimum spanning tree problem with uncertain edge weights. Using different decision criteria, two uncertain programming models are presented to formulate a specific inverse minimum spanning tree problem with uncertain edge weights involving a sum-type model and a minimax-type model. By means of the operational law of independent uncertain variables, the two uncertain programming models are transformed to their equivalent deterministic models which can be solved by classic optimization methods. Finally, some numerical examples on a traffic network reconstruction problem are put forward to illustrate the effectiveness of the proposed models.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.3
• /
• pp.84-96
• /
• 1997

In this paper an efficient morphologica algorithm for reducing gaussian and impulse noise in gray-scale image is presented. Based on the edge information the input image is partitioned into a flat region and an edge region, then different algorithms are selectively applied to each region. in case of impulse noise, MGR (morphologica grayscale reconstruction) algorithm with directional SE (structuring element) is applied to the flat region. For theedge region opening-closing (closing-opening) is used instead of dialation (erosion), so that the remaining noise around large objects can be removed. In case of gaussian noise, 5*5 OCCO(opening closing closing opening) and 3*3 DMF(directional morphological filter ) are used for the flat region and the edgeregion, respectively. In order to remove discontinuity at the edge boundary, the algorithm uses 3*3 OCCO around the edge region to reconstruct the final image. Experimetnal results have shown that the proposed algorithm achieves a high performance in terms of noise removal, detail preservation, and NMSE.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.9
• /
• pp.1369-1373
• /
• 2015

Curve subdivision interpolation reconstructs edge well with low complexity, however it lacks of ability to recover texture components, instead. While, neighbor embedding is superior in texture reconstruction. Therefore, in this paper, a novel Super Resolution technique which combines curve subdivision interpolation and neighbor embedding is proposed. First, edge region and non-edge regions are classified. Then, for edge region, the curve subdivision algorithm is used to make two polynomials derived from discrete pixels and adaptive weights are adapted for gradients of 4 different sides to make smooth edge. For non edge region, neighbor-embedding method is used to conserve texture property in original image. Consequently results show that the proposed technique conserves sharp edges and details in texture better, simultaneously.

• Korean Journal of Radiology
• /
• v.23 no.11
• /
• pp.1044-1054
• /
• 2022

Objective: This study aimed to investigate whether a deep learning reconstruction (DLR) method improves the image quality, stent evaluation, and visibility of the valve apparatus in coronary computed tomography angiography (CCTA) when compared with filtered back projection (FBP) and hybrid iterative reconstruction (IR) methods. Materials and Methods: CCTA images of 51 patients (mean age ± standard deviation [SD], 63.9 ± 9.8 years, 36 male) who underwent examination at a single institution were reconstructed using DLR, FBP, and hybrid IR methods and reviewed. CT attenuation, image noise, signal-to-noise ratio (SNR), contrast-to-noise ratio (CNR), and stent evaluation, including 10%-90% edge rise slope (ERS) and 10%-90% edge rise distance (ERD), were measured. Quantitative data are summarized as the mean ± SD. The subjective visual scores (1 for worst -5 for best) of the images were obtained for the following: overall image quality, image noise, and appearance of stent, vessel, and aortic and tricuspid valve apparatus (annulus, leaflets, papillary muscles, and chordae tendineae). These parameters were compared between the DLR, FBP, and hybrid IR methods. Results: DLR provided higher Hounsfield unit (HU) values in the aorta and similar attenuation in the fat and muscle compared with FBP and hybrid IR. The image noise in HU was significantly lower in DLR (12.6 ± 2.2) than in hybrid IR (24.2 ± 3.0) and FBP (54.2 ± 9.5) (p < 0.001). The SNR and CNR were significantly higher in the DLR group than in the FBP and hybrid IR groups (p < 0.001). In the coronary stent, the mean value of ERS was significantly higher in DLR (1260.4 ± 242.5 HU/mm) than that of FBP (801.9 ± 170.7 HU/mm) and hybrid IR (641.9 ± 112.0 HU/mm). The mean value of ERD was measured as 0.8 ± 0.1 mm for DLR while it was 1.1 ± 0.2 mm for FBP and 1.1 ± 0.2 mm for hybrid IR. The subjective visual scores were higher in the DLR than in the images reconstructed with FBP and hybrid IR. Conclusion: DLR reconstruction provided better images than FBP and hybrid IR reconstruction.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2009.08a
• /
• pp.331-331
• /
• 2009

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.612-615
• /
• 2003

The error diffusion is a good method to reconstruct the continuous tones of an image to the bilevel tones However the reconstruction of edge characteristic by the nor diffusion is represented work when power spectrum is analyzed fer display error. In this paper, we present an edge enhanced error diffusion method to preprocess original image to achieve the enhancement for the edge characteristic. The preprocessing algorithm consist of two processes. First the difference value between the current pixel and the local average of the surrounding pixel in original image is obtained. Second, the weighting function is composed by the magnitude and the sign of the local average. To confirm the effect of the proposed method, it is compared with the conventional edge enhanced error diffusion methods by measuring the radially averaged power spectrum densities (RAPSDs) for their display errors. The comparison result demonstrate the superiority of the proposed method over the conventional ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.487-495
• /
• 2007

When error occurs during the network transmission of the image, the quality of the restored image is very serious. Therefore to maintain the received image quality, the error concealment technique is necessary. This paper presents an efficient spatial error concealment method using adaptive edge-oriented interpolation. It deals with errors on slice level. The proposed method uses boundary matching method having 2-step processes. We divide error block into external and internal region, adaptively restore each region. Because this method use overall as well as local edge characteristics, it preserves edge continuity and texture feature. The proposed technique reduces the complexity and provide better reconstruction quality for damaged images than the previous methods.