• Journal of Information Processing Systems
• /
• 제16권3호
• /
• pp.688-698
• /
• 2020

Point clouds have ability to express the spatial entities, however, the point clouds redundancy always involves some uncertainties in computer recognition and model construction. Therefore, point clouds thinning is an indispensable step in point clouds model reconstruction and other applications. To overcome the shortcomings of complex classification index and long time consuming in existing point clouds thinning algorithms, this paper proposes a point clouds fast thinning algorithm. Specifically, the two-dimensional index is established in plane linear array (x, y) for the scanned point clouds, and the thresholds of adjacent point distance difference and height difference are employed to further delete or retain the selected sample point. Sequentially, the index of sample point is traversed forwardly and backwardly until the process of point clouds thinning is completed. The results suggest that the proposed new algorithm can be applied to different targets when the thresholds are built in advance. Besides, the new method also performs superiority in time consuming, modelling accuracy and feature retention by comparing with octree thinning algorithm.

• Journal of information and communication convergence engineering
• /
• 제8권5호
• /
• pp.570-574
• /
• 2010

A thinning algorithm changes a binary fingerprint image to one pixel width. A thinning stage occupies 40% cycle of 32-bit RISC microprocessor system for a fingerprint identification algorithm. Hardware block processing is more effective than software one in speed, because a thinning algorithm is iteration of simple instructions. This paper describes an effective hardware scheme for thinning stage processing using the Verilog-HDL in $160\times192$ Pixel Array. The ZS algorithm was applied for a thinning stage. The hardware scheme was designed and simulated in RTL. The logic was also synthesized by XST in FPGA environment. Experimental results show the performance of the proposed scheme.

• 대한전자공학회논문지SP
• /
• 제46권1호
• /
• pp.1-6
• /
• 2009

세선화 알고리즘은 문자인식, 도형 및 도면 인식 등에 매우 중요하게 사용되고 있다. 세선화 알고리즘은 여러 가지 방법으로 제안되어 왔다. 본 논문에서는 이전에 제안된 세선화 알고리즘 중 선처리가 후처리에 영향을 주지 않는 병렬 세선화 알고리즘 중에서 ZS, LW, 및 WHF 알고리즘의 문제점을 찾아내었다. ZS 알고리즘은 사선 방향에서 화소가 손실되는 문제점을 안고 있으며, LW 알고리즘은 사선 방향에서의 화소 두께가 1이 되지 못하는 문제점을 내포하고 있다. 따라서 본 알고리즘에서는 사선 방향에서 8근방을 이루며, 화소의 두께도 완전히 1이 되도록 개선시킨 병렬 세선화 알고리즘을 제안한다.

• Journal of information and communication convergence engineering
• /
• 제8권6호
• /
• pp.716-720
• /
• 2010

This paper proposes an effective fingerprint identification system with hardware block for thinning stage processing of a verification algorithm based on minutiae with 39% occupation of 32-bit RISC microprocessor cycle. Each step of a fingerprint algorithm is analyzed based on FPGA and ARMulator. This paper designs an effective hardware scheme for thinning stage processing using the Verilog-HDL in $160{\times}192$ pixel array. The ZS algorithm is applied for a thinning stage. The logic is also synthesized in $0.35{\mu}m$ 4-metal CMOS process. The layout is performed based on an auto placement-routing and post-simulation is performed in logic level. The result is compared with a conventional one.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.60.2-60
• /
• 2001

In this paper, manufacturing system and Internet are combined and NC milling machine engraves image and text on nameplate. Image and text are input through Internet. And NC tool path is obtained by thinning algorithm and NC part program is generated. Thinning algorithm detects center lines from image and text by using connectivity and tool path is obtained along the center line. Actually experiments are performed and thinning algorithm and G-code generation module are verified.

• Journal of Computational Design and Engineering
• /
• 제3권1호
• /
• pp.63-70
• /
• 2016

Deep drawing is a forming process in which a blank of sheet metal is radially drawn into a forming die by the mechanical action of a punch and converted to required shape. Deep drawing involves complex material flow conditions and force distributions. Radial drawing stresses and tangential compressive stresses are induced in flange region due to the material retention property. These compressive stresses result in wrinkling phenomenon in flange region. Normally blank holder is applied for restricting wrinkles. Tensile stresses in radial direction initiate thinning in the wall region of cup. The thinning results into cracking or fracture. The finite element method is widely applied worldwide to simulate the deep drawing process. For real-life simulations of deep drawing process an accurate numerical model, as well as an accurate description of material behavior and contact conditions, is necessary. The finite element method is a powerful tool to predict material thinning deformations before prototypes are made. The proposed innovative methodology combines two techniques for prediction and optimization of thinning in automotive sealing cover. Taguchi design of experiments and analysis of variance has been applied to analyze the influencing process parameters on Thinning. Mathematical relations have been developed to correlate input process parameters and Thinning. Optimization problem has been formulated for thinning and Genetic Algorithm has been applied for optimization. Experimental validation of results proves the applicability of newly proposed approach. The optimized component when manufactured is observed to be safe, no thinning or fracture is observed.

• 산업공학
• /
• 제15권1호
• /
• pp.20-25
• /
• 2002

In this research, a nameplate engraving system for images and texts downloaded through Internet on nameplate is developed. The system consists of two subsystems: thinning algorithm and NC code generation module. In the thinning algorithm, the concept of connectivity is used and center lines of images and texts, which will be used as NC tool paths, can be obtained successfully. Because the center lines are composed of a lot of pixels, NC code would be too long. In the NC code generation module, many useless pixel data are removed and linear interpolation algorithm is applied to only the remaining pixels. By performing actual experiments, the thinning algorithm and the NC code generation module are verified.

• 대한수학회지
• /
• 제44권6호
• /
• pp.1479-1503
• /
• 2007

In this paper, we study a strong k-deformation retract derived from a relative k-homotopy and investigate its properties in relation to both a k-homotopic thinning and the k-fundamental group. Moreover, we show that the k-fundamental group of a wedge product of closed k-curves not k-contractible is a free group by the use of some properties of both a strong k-deformation retract and a digital covering. Finally, we write an algorithm for calculating the k-fundamental group of a dosed k-curve by the use of a k-homotopic thinning.

• 한국지리정보학회지
• /
• 제2권1호
• /
• pp.45-53
• /
• 1999

지리정보시스템은 지리정보를 가장 효과적으로 저장하여 검색할 수 있고, 가공 처리할 수 있는 유용한 도구이다. 지리정보시스템을 구축하는데 있어서 가장 많은 시간과 비용이 소요되는 것은 입력 부분이기 때문에 벡터라이징 시스템의 개발은 매우 중요하다. 지리정보시스템에서 처리되는 모든 종류의 도면 중에서 특히 등고선도가 가장 많은 노력을 요한다. 본 논문에서는 지리정보시스템에서 등고선 벡터라이징을 위한 최적 세선화 알고리즘에 관하여 고찰하였고, 실험 결과로서 연결값을 이용한 세선화 알고리즘이 유사도가 가장 우수한 알고리즘임을 입증하였다.

• 한국지리정보학회지
• /
• 제2권1호
• /
• pp.54-62
• /
• 1999

도면의 입력 처리를 위한 벡터라이징은 많은 시간과 비용이 소모되는 작업이고, 도면 데이터의 질은 그 처리 결과에 관계된다. 그러므로 지리정보시스템에서 우수한 벡터라이징 시스템의 개발은 매우 중요한 과제이다. 벡터라이징 시스템에서 세선화 알고리즘은 벡터 데이터의 질을 결정하는 가장 중요한 기술이 된다. 본 논문에서는 도면 벡터라이징에 적합한 세선화 알고리즘으로 위상적, 기하학적 특성을 유지하면서 윤곽선의 변형을 최소화하는 알고리즘들을 고찰하였다. 결과로서, WPTA4와 잘 알려진 세선화 알고리즘들 구현하였고, 각각의 수행 결과를 비교하였다.