• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.2
• /
• pp.73-79
• /
• 2000

The part-surface of mold or stamping-dies consists of a compound surface which consists of lots of composite surfaces, and may have various types of feature shapes including convex sharp edge (CSE). Those CSE features should be considered with care in machining the surface, which necessitates extraction of CSE curves on a compound surface. This work can be done rather easily for a solid model which has a complete topology information. In case of the compound surface without topology information, however, such CSE curves must be gathered through some geometrical calculations paying much computation time. In the paper, extracting CSE curves by the construction of a CSE region-map which can reduce time, and detecting various common edge types are presented.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.547-549
• /
• 2001

본 논문에서는 MC의 알고리즘을 이용하여 등가면 추출시간을 단축할 수 있는 방법을 제안한다. 각 복셀 꼭지점의 밀도값을 비교하여 등가면이 형성될 수 있는 셀을 선택한다. 등가면이 형성되지 않는 빈 셀은 알고리즘을 진행하지 않고, 선택된 셀에 대해서만 등가면을 형성하기 위한 연산을 수행한다. 이때, 등가면 형성을 위한 꼭지점은 해당 모서리상에서 중앙점 보간으로 찾는다. 이러한 방법으로 형성된 등가면의 정보를 저장하는 객인 테이블을 효과적인 탐색이 가능하도록 개선함으로써 기존의 연구되다 빠르게 등가면을 추출하고 형성할 수 있다.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.81-89
• /
• 2009

To support dynamic Region-of-Interest(ROI) in JPEG2000, a fast ROI mask generation is needed. In the existing methods of ROI coding, after scanning all the pixels in order and discriminating ROI, an ROI mask has been generated. Our method scans 4 pixels of the corners in one code block, and then based on those informations, scans the edges from the corners to get the boundaries of ROI and background. These informations are consisted of a distributed information of ROI and two coordinates of the pixels, which are the points the edges and the boundaries meet. These informations are transmitted to encoder and supported for fast ROI mask generation. There were no great differences between the proposed method and the existing methods in quality, but the proposed method showed superiority in speed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.168-185
• /
• 2003

This paper presents a progressive algorithm that not only can narrow down the search domain in the course of face identification but also can fast reconstruct various 3D objects from a sketch drawing. The sketch drawing, edge-vertex graph without hidden line removal, which serves as input for reconstruction process, is obtained from an inaccurate freehand sketch of a 3D wireframe object. The algorithm is executed in two stages. In the face identification stage, we generate and classify potential faces into implausible, basis, and minimal faces by using geometrical and topological constraints to reduce search space. The proposed algorithm searches the space of minimal faces only to identify actual faces of an object fast. In the object reconstruction stage, we progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order of faces. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. Furthermore, it allows the designer to change viewpoint during sketching. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.624-627
• /
• 2000

This paper describes a local modification capability on shell meshes, which can change a 'constant or variable radius of rounding for the s h q edges of the stamping die shoulder in the mesh. The algorithm consists of the followin_e three main steps; (1) the rounding area for sharp edges of a die shoulder are detected from the given shell mesh, (2) a rolling-ball surface with a given constant or variable radius is generated, which is contacti% with two incident face groups of the sharp edges, (3) the rounding area of the mesh is cut off, and a new mesh for the rolling-ball surface is generated and implanted into the gap. Owing to this rounding modification capability, CAE engineers can examine various cases based on the existing dies by scanning them to form polyhedral models and then changing radii of die shoulders for stamping process simulation.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.934-938
• /
• 2000

This paper presents a laser cutting of 2D image. 2D image in pixel graphic format is converted into vector graphic image by image processing. Bitmap graphics are made easily, but can not being used in application works for geometry transition. The Sobel's Edge detection method is used to find boundary points on 2D image. The points are fitted into curves with sampling and filtering. Sampling can provide efficient computation and filtering reconstuct features in image. The NC code is generated on MURBS curve of the points. Also, the offset of contour and cutting conditions are considered.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2015.07a
• /
• pp.268-271
• /
• 2015

본 논문에서는 고해상도 비디오를 위한 프레임 레이트 변환 방법을 제시한다. 서로 다른 방식이나 포맷을 가진 영상 신호를 변환할 때에는 시각적으로 거슬리는 움직임 지터(motion jitter)나 영상의 모서리에서의 블러링(blurring) 현상이 일어날 수 있다. 제시하는 방법에서는 이러한 문제점을 해결하기 위해 양방향 움직임 추정/보상을 이용하여 프레임 레이트를 증가 변환한다. 또한 보다 정확한 움직임 벡터를 찾기 위해 다중 프레임을 통한 양방향 탐색 방법을 제안한다. 먼저, 픽셀 값을 알고 있는 현재 프레임과 이전 프레임간의 움직임 벡터를 이용하여 양방향 움직임 벡터를 얻는다. 얻은 움직임 벡터는 벡터 스무딩 블록을 거친다. 그 후 OBMC(Overlapped Block Motion Compensation)를 이용하여 보간 프레임을 구성한다. 실험 결과는 기존 방법들보다 제안 방법이 주관적 화질 면에서 우수함을 나타낸다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.12
• /
• pp.982-992
• /
• 2017

In this paper, we introduce a method of selection for the optimal transmission polarization of a W-band seeker through the extraction of the one-dimensional scattering center of a ground tank target. We calculated the surface scattering and edge scattering using the shooting and bouncing ray tracing method of the CST A-solver. Based on 4-channel RCS data, using the one-dimensional RELAX algorithm, which is a kind of spectral estimation technique, scattering centers of ground targets were extracted. According to the changes in the polarization state and look angle, we compared and analyzed the scattering center results. Through simulation, we verified that the scattering center results can be applied when feature vectors are used for target recognition.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.2
• /
• pp.87-93
• /
• 2014

Cadastral parcel objects as polygons are fundamental dataset which represent land administration and management of the real world. Thus it is necessary to assure topological seamlessness of cadastral datasets which means no overlaps or gaps between adjacent parcels. However, the problem of overlaps or gaps are frequently found due to non-coinciding edges between adjacent parcels. These erroneous edges are called uncertain edges, and polygons containing at least one uncertain edge are called uncertain polygons. In this paper, we proposed a new algorithm to efficiently search parcels of uncertain polygons between two adjacent cadastral datasets. The algorithm first selects points and polylines around adjacent datasets. Then the Constrained Delaunay Triangulation (CDT) is applied to extract triangles. These triangles are tagged by the number of the original cadastral datasets which intersected with the triangles. If the tagging value is zero, the area of triangles mean gaps, meanwhile, the value is two, the area means overlaps. Merging these triangles with the same tagging values according to adjacency analysis, uncertain edges and uncertain polygons could be found. We have performed experimental application of this automated derivation of partitioned boundary from a real land-cadastral dataset.

• Journal of Broadcast Engineering
• /
• v.22 no.3
• /
• pp.313-320
• /
• 2017

The In-loop filtering methods such as de-blocking filter and SAO(Sample Adaptive Offset) applied to the HEVC standard achieves coding efficiency and subjective quality improvement by reducing the blocking artifacts and the ringing artifacts. However, despite the use of In-loop filtering methods, the artifacts called a corner outlier occurring at the corner points of block boundaries are not removed. In this paper, the corner outlier artifacts are reduced by the detection, determination, and filtering processes on the corner outlier pixels. Experimental results show that the proposed method improves the subjective picture quality and slightly increases the coding efficiency in Inter prediction.