• Title/Summary/Keyword: geometric shape information

Search Result 196, Processing Time 0.025 seconds

Development of New Rapid Prototyping System Performing both Deposition and Machining (II) (적층과 절삭을 복합적으로 수행하는 새로운 개념의 판재 적층식 쾌속 시작 시스템의 개발(II) - 공정계획 시스템 -)

  • Heo, Jeong-Hun;Lee, Geon-U
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.9 s.180
    • /
    • pp.2235-2245
    • /
    • 2000
  • The necessity of using rapid prototyping(RP) for short-run manufacturing is continuously driving a development of a cost-effective technique that will produce completely-finished quality parts in a very short time. To meet these demands, the improvements in production speed, accuracy, materials, aid cost are crucial. Thus, a new hybrid-RP system performing both deposition and machining in a station is proposed. For the new hybrid RP process to maintain the same degree of process automation as in currently available processes like SLA or FDNI, a sophisticated process planning system is developed. In the process planner, CAD models(STEP AP203) are partitioned into 3D manufacturable volumes called 'Ueposition feature segment"(DFS) after machining features called "machining feature segmenf'(MFS) are extracted from the initial CAD model. Once MFS and DFS are identified, the process planner arranges them into a chain of processes and automatically generates machining information for each DFS and MFS. The goal of this paper is to present a framework for a process planning system for hybrid RP processes and to outline the geometric algorithms involved in developing such an environment.

A study on local facial features using LDP (LDP를 이용한 지역적 얼굴 특징 표현 방법에 관한 연구)

  • Cho, Young Tak;Jung, Woong Kyung;Ahn, Yong Hak;Chae, Ok Sam
    • Convergence Security Journal
    • /
    • v.14 no.5
    • /
    • pp.49-56
    • /
    • 2014
  • In this paper, we proposed a method for representing local facial features based on LDP (Local Directional Pattern). To represent both PFF (Permanent Facial Features) and TFF (Transient Facial Features) effectively, the proposed method configure local facial feature vectors based on overlapped blocks for each facial feature in the forms of various size and shape. There are three advantages - it take advantages of geometric feature based method; it shows robustness about detection error using movement characteristics of each facial feature; and it shows reduced sampling error because maintain spatial information caused by block size variability. Proposed method shows better classification accuracy and reduced amount of calculation than existing methods.

3D scanning based mold correction for planar and cylindrical parts in aluminum die casting

  • Seno, Takashi;Ohtake, Yutaka;Kikuchi, Yuji;Saito, Noriaki;Suzuki, Hiromasa;Nagai, Yukie
    • Journal of Computational Design and Engineering
    • /
    • v.2 no.2
    • /
    • pp.96-104
    • /
    • 2015
  • Aluminum die casting is an important manufacturing process for mechanical components. Die casting is known to be more accurate than other types of casting; however, post-machining is usually necessary to achieve the required accuracy. The goal of this investigation is to develop machining- free aluminum die casting. Improvement of the accuracy of planar and cylindrical parts is expected by correcting metal molds. In the proposed method, the shape of cast aluminum made with the initial metal molds is measured by 3D scanning. The 3D scan data includes information about deformations that occur during casting. Therefore, it is possible to estimate the deformation and correction amounts by comparing 3D scan data with product computer-aided design (CAD) data. We corrected planar and cylindrical parts of the CAD data for the mold. In addition, we corrected the planar part of the metal mold using the corrected mold data. The effectiveness of the proposed method is demonstrated by evaluating the accuracy improvement of the cast aluminum made with the corrected mold.

A Region-based Comparison Algorithm of k sets of Trapezoids (k 사다리꼴 셋의 영역 중심 비교 알고리즘)

  • Jung, Hae-Jae
    • The KIPS Transactions:PartA
    • /
    • v.10A no.6
    • /
    • pp.665-670
    • /
    • 2003
  • In the applications like automatic masks generation for semiconductor production, a drawing consists of lots of polygons that are partitioned into trapezoids. The addition/deletion of a polygon to/from the drawing is performed through geometric operations such as insertion, deletion, and search of trapezoids. Depending on partitioning algorithm being used, a polygon can be partitioned differently in terms of shape, size, and so on. So, It's necessary to invent some comparison algorithm of sets of trapezoids in which each set represents interested parts of a drawing. This comparison algorithm, for example, may be used to verify a software program handling geometric objects consisted of trapezoids. In this paper, given k sets of trapezoids in which each set forms the regions of interest of each drawing, we present how to compare the k sets to see if all k sets represent the same geometric scene. When each input set has the same number n of trapezoids, the algorithm proposed has O(2$^{k-2}$ $n^2$(log n+k)) time complexity. It is also shown that the algorithm suggested has the same time complexity O( $n^2$ log n) as the sweeping-based algorithm when the number k(<< n) of input sets is small. Furthermore, the proposed algorithm can be kn times faster than the sweeping-based algorithm when all the trapezoids in the k input sets are almost the same.

Generation of 3-Dimensional Landscape Map from Aerial Photos (항공사진을 이용한 3차원 경관도 제작)

  • Yeu, Bock-Mo;Jeong, Soo;Kim, Won-Dae
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.3 no.1 s.5
    • /
    • pp.105-113
    • /
    • 1995
  • Three-dimensional landscape map is very useful in terrain analysis as it looks like real shape of terrain. When three-dimensional landscape map is needed, landscape photos achieved at a position of high elevation or by airplane are generally used. But, this approach can not fully satisfy the user's need to get pictures from various view points. In addition, because photos have some geometric displacement caused by the principle of central projection of camera, it is hard to get accurate locations from the photo. This paper aims to get three-dimensional landscape map similar to real terrain feature from vertical stereo aerial photos by digital photogrammetric techniques. This approach can provide a very useful data for three-dimensional terrain analysis as a function of Geo-Spatial Information System.

  • PDF

3D Model Retrieval Using Geometric Information (기하학 정보를 이용한 3차원 모델 검색)

  • Lee Kee-Ho;Kim Nac-Woo;Kim Tae-Yong;Choi Jong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.10C
    • /
    • pp.1007-1016
    • /
    • 2005
  • This paper presents a feature extraction method for shape based retrieval of 3D models. Since the feature descriptor of 3D model should be invariant to translation, rotation and scaling, it is necessary to preprocess the 3D models to represent them in a canonical coordinate system. We use the PCA(Principal Component Analysis) method to preprocess the 3D models. Also, we apply that to make a MBR(Minimum Boundary Rectangle) and a circumsphere. The proposed algorithm is as follows. We generate a circumsphere around 3D models, where radius equals 1(r=1) and locate each model in the center of the circumsphere. We produce the concentric spheres with a different radius($r_i=i/n,\;i=1,2,{\ldots},n$). After looking for meshes intersected with the concentric spheres, we compute the curvature of the meshes. We use these curvatures as the model descriptor. Experimental results numerically show the performance improvement of proposed algorithm from min. 0.1 to max. 0.6 in comparison with conventional methods by ANMRR, although our method uses .relatively small bins. This paper uses $R{^*}-tree$ as the indexing.

An Implementation of Smart E-Calipers for Mobile Phones (모바일 폰을 이용한 스마트 E-캘리퍼스 구현)

  • Yun, Han-Kyung
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.5
    • /
    • pp.331-337
    • /
    • 2020
  • The study is underway with the goal of developing an app that will replace vernier calipers using a smartphone's high-performance camera. The specifications of the camera mounted on recent smart phones have evolved so that usually has a 12 Mpixels of image sensor and its size of the pixel is 1.4㎛ and the size of the image sensor is 1 / 2.55 in. The proposed algorithm will apply to develop a precision measuring application that will compete with the Vernier calipers. Most existing applications cannot guarantee an accuracy in scale because the scale of the ruler displayed on the image is unclear or the size of the measurement object varies depending on the distance between the camera and the measurement object. In addition, another accurate measuring tools using lasers are also available, but they are limited because they are expensive. Therefore, if easy-to-carry and precise applications are developed, it is possible to substitute existing measurement tools. The proposed correction algorithm is an algorithm that automatically corrects the distorted source image using the shape and size information of the known template. The e-calipers are applications that display the distance when the area to be measured is specified in the corrected image.

Edge Strength Hough Transform : An Improvement on Hough Transform Using Edge Strength (경계선 강도를 이용한 허프 변환의 개선)

  • Heo, gyeong-Yong;Lee, Kwang-Eui;Woo, Young-Woon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.11
    • /
    • pp.2055-2061
    • /
    • 2006
  • The detection of geometric primitives from a digital image is one of the basic tasks in computer vision area and the Hough transform is a well-known method for detecting analytical shape represented by a number of free parameters. However the basic property of the Hough transform, the one-to-many mapping from an image space to a Hough space, causes the innate problem, the sensitivity to noise. In this paper, we proposed Edge Strength Hough Transform which uses edge strength to reduce the sensitivity to noise and proved the insensitivity using the ratio of peaks in a Mough space. We also experimented the proposed method on lines and got small number of peaks in a Hough space compared to traditional Hough transform, which supports the noise insensitivity of the proposed method.

Extended Cartoon Rendering using 3D Texture (3차원 텍스처를 이용한 카툰 렌더링의 만화적 스타일 다양화)

  • Byun, Hae-Won;Jung, Hye-Moon
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.8
    • /
    • pp.123-133
    • /
    • 2011
  • In this paper, we propose a new method for toon shading using 3D texture which renders 3d objects in a cartoon style. The conventional toon shading using 1D texture displays shading tone by computing the relative position and orientation between a light vector and surface normal. The 1D texture alone has limits to express the various tone change according to any viewing condition. Therefore Barla et. al. replaces a 1D texture with a 2D texture whose the second dimension corresponds to the view-dependent effects such as level-of-abstraction, depthof-field. The proposed scheme extends 2D texture to 3D texture by adding one dimension with the geometric information of 3D objects such as curvature, saliency, and coordinates. This approach supports two kinds of extensions for cartoon style diversification. First, we support "shape exaggeration effect" to emphasize silhouette or highlight according to the geometric information of 3D objects. Second, we further incorporate "cartoon specific effect", which is examples of screen tone and out focusing frequently appeared in cartoons. We demonstrate the effectiveness of our approach through examples that include a number of 3d objects rendered in various cartoon style.

ViStoryNet: Neural Networks with Successive Event Order Embedding and BiLSTMs for Video Story Regeneration (ViStoryNet: 비디오 스토리 재현을 위한 연속 이벤트 임베딩 및 BiLSTM 기반 신경망)

  • Heo, Min-Oh;Kim, Kyung-Min;Zhang, Byoung-Tak
    • KIISE Transactions on Computing Practices
    • /
    • v.24 no.3
    • /
    • pp.138-144
    • /
    • 2018
  • A video is a vivid medium similar to human's visual-linguistic experiences, since it can inculcate a sequence of situations, actions or dialogues that can be told as a story. In this study, we propose story learning/regeneration frameworks from videos with successive event order supervision for contextual coherence. The supervision induces each episode to have a form of trajectory in the latent space, which constructs a composite representation of ordering and semantics. In this study, we incorporated the use of kids videos as a training data. Some of the advantages associated with the kids videos include omnibus style, simple/explicit storyline in short, chronological narrative order, and relatively limited number of characters and spatial environments. We build the encoder-decoder structure with successive event order embedding, and train bi-directional LSTMs as sequence models considering multi-step sequence prediction. Using a series of approximately 200 episodes of kids videos named 'Pororo the Little Penguin', we give empirical results for story regeneration tasks and SEOE. In addition, each episode shows a trajectory-like shape on the latent space of the model, which gives the geometric information for the sequence models.