• 제목/요약/키워드: Model Objects

검색결과 2,120건 처리시간 0.032초

YOLO를 이용한 이미지 Blur 처리 (Blur the objects in image by YOLO)

  • 강동연
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2019년도 춘계학술발표대회
    • /
    • pp.431-434
    • /
    • 2019
  • In the case of blur processing, it is common to use a tool such as Photoshop to perform processing manually. However, it can be considered very efficient if the blur is processed at one time in the object detection process. Based on this point, we can use the object detection model to blur the objects during the process. The object detection is performed by using the YOLO [3] model. If such blur processing is used, it may be additionally applied to streaming data of video or image.

광역 객체 컴퓨팅 환경에서 부하를 고려한 통합 바인딩 서비스의 설계 및 구현 ((Design and Implementation of Integrated Binding Service of Considering Loads in Wide-Area Object Computing Environments))

  • 정창원;오성권;주수종
    • 한국정보과학회논문지:정보통신
    • /
    • 제30권3호
    • /
    • pp.293-306
    • /
    • 2003
  • 최근 분산 컴퓨팅 환경은 급진적으로 광역화되고, 이질적이며, 연합형태의 광역 시스템 구조로 변화하고 있다. 이러한 환경은 네트워크상에 광범위한 서비스를 제공하는 통신 네트워크 기반에서 구현된 수많은 객체로 구성된다. 더욱, 지구상에 존재하는 모든 객체들은 이름이나 속성에 의해 중복된 특성을 갖는다. 그러나 기존의 네이밍이나 트레이딩 메커니즘은 독립적인 위치 투명성 결여로 중복된 객체들의 바인딩 서비스 지원이 불가능하다. 서로 다른 시스템 상에 존재하는 중복된 객체들이 동일한 서비스를 제공한다면, 각 시스템의 부하를 고려하여 클라이언트의 요청을 분산시킬 수 있다. 이러한 이유로 본 논문에서는 광역 컴퓨팅 환경에서 중복된 객체들의 위치 관리뿐만 아니라 시스템들간의 부하 균형화를 유지하기 위해 서 최소부하를 갖는 시스템에 위치한 객체의 선정하여 동적 바인딩 서비스를 제공할 수 있는 새로운 모델을 설계하고 구현하였다. 이 모델은 네이밍 및 트레이딩 기능을 통합한 서비스에 의해 중복된 객체들에 대한 단일 객체 핸들을 얻는 부분과, 얻어진 객체 핸들을 사용하여 위치 서비스에 의해 하나 이상의 컨택 주소를 얻는 부분으로 구성하였다. 주어진 모델로부터, 우리는 네이밍/트레이딩 서비스와 위치 서비스에 의한 전체 바인딩 메커니즘의 처리과정을 나타내고, 통합 바인딩 서비스의 구성요소들에 대한 구조를 상세하게 기술하였다. 끝으로 구현 환경과 구성요소에 대한 수행 화면을 보였다.

EVALUATING AND EXTENDING SPATIO-TEMPORAL DATABASE FUNCTIONALITIES FOR MOVING OBJECTS

  • Dodge Somayeh;Alesheikh Ali A.
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
    • /
    • pp.778-784
    • /
    • 2005
  • Miniaturization of computing devices, and advances in wireless communication and positioning systems will create a wide and increasing range of database applications such as location-based services, tracking and transportation systems that has to deal with Moving Objects. Various types of queries could be posted to moving objects, including past, present and future queries. The key problem is how to model the location of moving objects and enable Database Management System (DBMS) to predict the future location of a moving object. It is obvious that there is a need for an innovative, generic, conceptually clean and application-independent approach for spatio-temporal handling data. This paper presents behavioral aspect of the spatio-temporal databases for managing and querying moving objects. Our objective is to impelement and extend the Spatial TAU (STAU) system developed by Dr.Pelekis that provides spatio-temporal functionality to an Object-Relational Database Management System to support modeling and querying moving objecs. The results of the impelementation are demonstrated in this paper.

  • PDF

A Fast Snake Algorithm for Tracking Multiple Objects

  • Fang, Hua;Kim, Jeong-Woo;Jang, Jong-Whan
    • Journal of Information Processing Systems
    • /
    • 제7권3호
    • /
    • pp.519-530
    • /
    • 2011
  • A Snake is an active contour for representing object contours. Traditional snake algorithms are often used to represent the contour of a single object. However, if there is more than one object in the image, the snake model must be adaptive to determine the corresponding contour of each object. Also, the previous initialized snake contours risk getting the wrong results when tracking multiple objects in successive frames due to the weak topology changes. To overcome this problem, in this paper, we present a new snake method for efficiently tracking contours of multiple objects. Our proposed algorithm can provide a straightforward approach for snake contour rapid splitting and connection, which usually cannot be gracefully handled by traditional snakes. Experimental results of various test sequence images with multiple objects have shown good performance, which proves that the proposed method is both effective and accurate.

CHEMICAL EVOLUTION IN VeLLOs

  • Lee, Jeong-Eun
    • 천문학회지
    • /
    • 제40권4호
    • /
    • pp.83-89
    • /
    • 2007
  • A new type of object called "Very Low Luminosity Objects (VeLLOs)" has been discovered by the Spitzer Space Telescope. VeLLOs might be substellar objects forming by accretion. However, some VeLLOs are associated with strong outflows, indicating the previous existence of massive accretion. The thermal history, which significantly affects the chemistry, between substellar objects with a continuous low accretion rate and objects in a quiescent phase after massive accretion (outburst) must be greatly different. In this study, the chemical evolution has been calculated in an episodic accretion model to show that CO and $N_2H^+$ have a relation different from starless cores or Class 0/I objects. Furthermore, the $CO_2$ ice feature at $15.2{\mu}m$ will be a good tracer of the thermal process in VeLLOs.

임의 형상의 복합재 모델링을 위한 CSG 기반 표현 (CSG-based Representation for Free-form Heterogeneous Object Modeling)

  • 신기훈;이진구
    • 한국CDE학회논문집
    • /
    • 제11권4호
    • /
    • pp.235-245
    • /
    • 2006
  • This paper proposes a CSG-based representation scheme for heterogeneous objects including multi-material objects and Functionally Graded Materials (FGMs). In particular, this scheme focuses on the construction of complicated heterogeneous objects guaranteeing desired material continuities at all the interfaces. In order to create various types of heterogeneous primitives, we first describe methods for specifying material composition functions such as geometry-independent, geometry-dependent functions. Constructive Material Composition (CMC) and corresponding heterogeneous Boolean Operators (e.g. material union, difference, intersection. and partition) are then proposed to illustrate how material continuities are dealt with. Finally, we describe the model hierarchy and data structure for computer representation. Even though the proposed scheme alone is sufficient for modeling all sorts of heterogeneous objects, the proposed scheme adopts a hybrid representation between CSG and decomposition. That is because hybrid representation can avoid the unnecessary growth of binary trees.

Development of a 3D earthwork model based on reverse engineering

  • Kim, Sung-Keun
    • 국제학술발표논문집
    • /
    • The 6th International Conference on Construction Engineering and Project Management
    • /
    • pp.641-642
    • /
    • 2015
  • Unlike for other building processes, BIM for earthwork does not need a large variety of 3D model shapes; however, it requires a 3D model that can efficiently reflect the changing features of the ground shape and provide soil type-dependent workload calculation and information on equipment for optimal management. Objects for earthwork have not yet been defined because the current BIM system does not provide them. The BIM technology commonly applied in the manufacturing center uses real-object data obtained through 3D scanning to generate 3D parametric solid models. 3D scanning, which is used when there are no existing 3D models, has the advantage of being able to rapidly generate parametric solid models. In this study, A method to generate 3D models for earthwork operations using reverse engineering is suggested. 3D scanning is used to create a point cloud of a construction site and the point cloud data are used to generate a surface model, which was then converted into a parametric model with 3D objects for earthwork

  • PDF

Automated texture mapping for 3D modeling of objects with complex shapes --- a case study of archaeological ruins

  • Fujiwara, Hidetomo;Nakagawa, Masafumi;Shibasaki, Ryosuke
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
    • /
    • pp.1177-1179
    • /
    • 2003
  • Recently, the ground-based laser profiler is used for acquisition of 3D spatial information of a rchaeological objects. However, it is very difficult to measure complicated objects, because of a relatively low-resolution. On the other hand, texture mapping can be a solution to complement the low resolution, and to generate 3D model with higher fidelity. But, a huge cost is required for the construction of textured 3D model, because huge labor is demanded, and the work depends on editor's experiences and skills . Moreover, the accuracy of data would be lost during the editing works. In this research, using the laser profiler and a non-calibrated digital camera, a method is proposed for the automatic generation of 3D model by integrating these data. At first, region segmentation is applied to laser range data to extract geometric features of an object in the laser range data. Various information such as normal vectors of planes, distances from a sensor and a sun-direction are used in this processing. Next, an image segmentation is also applied to the digital camera images, which include the same object. Then, geometrical relations are determined by corresponding the features extracted in the laser range data and digital camera’ images. By projecting digital camera image onto the surface data reconstructed from laser range image, the 3D texture model was generated automatically.

  • PDF

SDE 공간 모델의 이력지원 확장 (A historical Extension for SDE Data Model)

  • 이종연;안병익;류근호
    • 한국정보처리학회논문지
    • /
    • 제5권9호
    • /
    • pp.2281-2293
    • /
    • 1998
  • 공간상의 지형객체는 토지의 소유주 변경이나 소유주의 신상 변경, 토지의 합병과 분할, 도로의 신설 및 변경에 따른 지형 변경 등과 같은 공간 또는 속성 변화에 의해 공간이력 데이터가 발생한다. 하지만 기존의 GIS(Geographic Information System)는 측정시점에서 지형객체의 스냅샷 정보만을 관리하므로 시간 흐름에 따른 공간이력을 유지할 수 없다. 따라서 이 연구는 공간 데이터베이스의 시간차원 확장을 통하여 시간과 공간을 동시에 지원하는 시공간 데이터베이스 모델과 이력 관리 체계를 설계하고 구현한다. 이 연구의 결과는 GIS 공간 데이터베이스의 시간차원 확장으로 지형객체의 모든 이력정보를 유지 관리할 수 있다.

  • PDF

TPR-tree의 성능 예측을 위한 비용 모델 (A Cost Model for the Performance Prediction of the TPR-tree)

  • 최용진;정진완
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제31권3호
    • /
    • pp.252-260
    • /
    • 2004
  • 최근에 움직이는 객체의 미래 위치를 위한 TPR-tree가 제안되었으며, TPR-tree를 이용한 많은 연구들이 제안되었다. 그러나, TPR-tree가 시공간 데이타베이스에서 널리 사용됨에도 불구하고, TPR-tree를 위한 비용 모델은 제안되지 않았다. R-tree와 같은 공간 색인을 위한 비용 모델들은 움직이는 객체들의 미래 위치를 전혀 고려하지 않기 때문에, TPR-tree에 대한 시공간 질의를 위한 디스크 액세스 수를 정확하게 예측하지 못한다. 본 논문에서는 움직이는 객체들의 미래 위치를 고려한 TPR-tree를 위한 비용 모델을 처음으로 제안한다. 다양한 실험 결과, 제안된 TPR-tree의 비용 모델은 디스크 액세스 수를 정확하게 예측한다.