• 한국통신학회논문지
• /
• 제7권1호
• /
• pp.25-28
• /
• 1982

본 논문에서는 조합논리회로의 기호적 신뢰도 계정식을 구하는 한 방법을 제시하였다. 한 회로의 모든 입력이(0,1) 값을 갖는 확율변수로 나타내어지고 출력이 부울 적의합(sum of product)식으로 표시되어 지면 출력확률의 계정은 sharp 산법이라고 명명되는 부울 대수 산법에 의하여 기호적으로 계정된다.

• 한국정밀공학회지
• /
• 제25권3호
• /
• pp.147-156
• /
• 2008

A new approach based on cone prism intersection method combined with sorting algorithm is proposed for the fast and robust signed distance field computation. In the method, the space bounding the geometric model composed of triangular net is divided into multiple smaller cells. For the efficient calculation of distance fields, valid points among the triangular net which will generate minimum distances with current cell are selected by checking the intersection between current cell and cone prism generated at each point. The method is simple to implement and able to achieve an order of magnitude improvement in the computation time as compared to earlier approaches. Further the method is robust in handling the traditional sign problems. The validity of the suggested method was demonstrated by providing numerous examples including Boolean operation, shape deformation and morphing of complex geometric models.

• 한국CDE학회논문집
• /
• 제4권1호
• /
• pp.43-51
• /
• 1999

Producing the relevant information (features) from the CAD models of CAM, called feature recognition or extraction, is the essential stage for the integration of CAD and CAM. Most feature recognition methods, however, have problems in the recognition of intersecting features because they do not handle the intersection geometry properly. In this paper, we propose a machining feature recognition algorithm, which has a solid model consisting of orthogonal primitives as input. The algorithm calculates candidate features and constitutes the Intersection Geometry Matrix which is necessary to represent the spatial relation of candidate features. Finally, it recognizes machining features from the proposed candidate features dividing and growing systems using half space and Boolean operation. The algorithm has the following characteristics: Though the geometry of part is complex due to the intersections of design primitives, it can recognize the necessary machining features. In addition, it creates the Maximal Feature Volumes independent of the machining sequences at the feature recognition stage so that it can easily accommodate the change of decision criteria of machining orders.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2008년도 International Symposium on Remote Sensing
• /
• pp.11-13
• /
• 2008

This study proposes the method to use existing digital maps as one of the technologies to exclude individual differences that occur in the process of manually determining GCP for the geometric correction of KOMPSAT images and applying it to the images and to automate the generation of ortho-images. It is known that, in case high-resolution satellite images are corrected geometrically by using RPC, first order polynomials are generally applied as the correction formula in order to obtain good results. In this study, we matched the corresponding objects between 1:25,000 digital map and a KOMPSAT image to obtain the coefficients of the zero order polynomial and showed the differences in the pixel locations obtained through the matching. We performed proximity corrections using the Boolean operation between the point data of the surface linear objects and the point data of the edge objects of the image. The surface linear objects are road, water, building from topographic map.

• Journal of Applied and Pure Mathematics
• /
• 제5권1_2호
• /
• pp.1-8
• /
• 2023

This study is on a Boolean B or Boolean lattice L in abstract algebra with closed binary operation *, complement and distributive properties. Both Binary operations and logic properties dominate this set. A lattice sheds light on binary operations and other algebraic structures. In particular, the construction of the elements of this L set from idempotent elements, our definition of k-order idempotent has led to the expanded definition of the definition of the lattice theory. In addition, a lattice offers clever solutions to vital problems in life with the concept of logic. The restriction on a lattice is clearly also limit such applications. The flexibility of logical theories adds even more vitality to practices. This is the main theme of the study. Therefore, the properties of the set elements resulting from the binary operation force the logic theory. According to the new definition given, some properties, lemmas and theorems of the lattice theory are examined. Examples of different situations are given.

• 한국지능시스템학회논문지
• /
• 제14권4호
• /
• pp.418-423
• /
• 2004

블록 정합 움직임 추정 알고리즘은 국제 표준인 MPEG, H.26x등 대부분의 표준 비디오 압축 기법에 채택되어 시간적 중복성을 제거하여 압축률을 높이는 핵심적인 기술로 사용되고 있다. 이러한 블록 정합 알고리즘 중 전역 탐색은 탐색영역이 증가하는 경우 막대한 양의 연산이 필요하다는 단점을 갖고 있다. 반면에 고속 탐색 및 이진 연산 알고리즘은 전역 탐색보다 연산량과 속도는 개선할 수 있지만, 성능이 크게 떨어지는 단점을 가지고 있다. 따라서 본 논문에서는 하드웨어 구현이 용이하고 움직임 추정을 고속으로 수행 할 수 있는 새로운 BCBM(Bit Converted Boolean Matching)알고리즘을 제안한다. BCBM 알고리즘은 움직임 추정 시 필요한 연산을 이진 연산으로만 수행하면서 전역 탐색에 근접한 성능을 나타낸다. 움직임 추정 성능은 CIF 포맷의 영상 100프레임을 이용하여 분석하였다. BCBM 알고리즘의 PSNR 성능은 전역 탐색 알고리즘보다 약 0.08㏈ 떨어지지만, 고속 탐색 알고리즘 및 기존의 이진 연산 알고리즘 보다 0.96∼2.02㏈ 정도 우수함을 실험을 통해 확인하였다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1991년도 춘계학술대회 논문집
• /
• pp.243-250
• /
• 1991

This paper concerns the development of NC programming system TIG (Turning with Interactive Graphics) with interactive graphics for turning operation. The system cosists of the processor, the post-processor and the system-user interface. Different from previous segment contour based NC graphic programming systems, the frliability and efficiencyof programming is realized by using Boolean operation with block unit based ICONs for the geometry definition. The tool motion can be also displayed on the screen together with the part contour. The system calculate automatically the number of passes based on the user specified cutting conditions.

• 한국해양공학회지
• /
• 제25권3호
• /
• pp.47-52
• /
• 2011

3D geometric modeling has a lot of advantages in the field of design and manufacturing. Many manufacturing processes and production lines are using 3D geometric modeling technique. These help reduce the cost and time for manufacturing. The purpose of this study is the realization of a 3D cutting shape for an H-Beam used in ships and ocean plants. The complex 3D cutting shapes could be represented by using the boolean operation of basic figures. Graphic functions with parameters were used to simply define the basic figures. The developed system can show the complex cutting shape of an H-beam simply and quickly. This system can be utilized for the automatic cutting system for an H-beam.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.547-552
• /
• 2003

In mold machining, there are many concave machining regions where chatter and tool deflection occur since MRR (material removal rate) increases as curvature increases even though cutting speed and depth of cut are constant. Boolean operation between stock and tool model is widely used to compute MRR in NC milling simulation. In finish cutting, the side step is reduced to about 0.3mm and tool path length is sometimes over 300m. so Boolean operation takes long computation time and includes much error if the resolution of stock and tool model is larger than the side step. In this paper, curvature of CL(cutter location) surface and side step of tool path is used to compute the feedrate for constant MRR machining. The data structure of CL surface is Z-map generated from NC tool path. The algorithm to get local curvature from discrete data was developed and applied to compute local curvature of CL surface. The side step of tool path was computed by point density map which includes cutter location point density at each grid element. The feedrate computed from curvature and side step is inserted to new tool path to regulate MRR. The resultants wire applied to feedrate optimization system which generates new tool path with feedrate from NC codes for finish cutting. The system was applied to speaker mold machining. The finishing time was reduced to 12.6%. tool wear was reduced from 2mm to 1.1mm and chatter marks and over cut on corner were removed.

• 한국생산제조학회지
• /
• 제5권2호
• /
• pp.20-28
• /
• 1996

Compound surface modeling is widely used for die cavities and punches. A compound surface is defined in 3-D space by specifying the topological relationship of several anlytic surface elements and a sculptured surface. A constructive solid gemonetry scheme is employed to model the analytic compound surface. the desired compound surface can be accomplished by specifying topological reationship in terms of boolean relations between pimitives and the sculptured surfaces. Additionally, a method is presented for checking and avoiding the tool interference occuued in machining the compound surface. Using this method. the interference of concave, convex, and side region can be checked easily and avoided rpapidly.