• Title/Summary/Keyword: Reference objects

Search Result 311, Processing Time 0.027 seconds

Application of Vector Scalar Product to Solve the Kinematic Equations in the Earth's Gravitational Field (지구 중력장 내에서 성립하는 운동 상태 방정식의 해를 구하기 위한 벡터의 스칼라 프로덕트 응용)

  • Um, Kee-Hong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.6
    • /
    • pp.217-222
    • /
    • 2017
  • Any object located in the earth's gravitational field experiences a force in the direction of the center of the earth. In order to describe the motion of objects in the field, the solutions to a system of simultaneous vector kinematic equations need to be obtained. In the analysis of freely-falling objects, the reference direction +y is usually defined to be the downward direction. In the analysis of the motion of objects thrown upward, the reference direction +y is usually defined to be the upward direction. In the analysis of the motion of objects thrown downward, the reference direction +y is usually defined to be the downward direction. In this paper, we show that the choice of reference axis in either upward or direction gives the same results by adopting a scalar product of two vectors in solving the vector kinematic equations. It is rare to find other examples of using a scalar product of two vectors in solving vector kinematic equations describing the motion of objects. An application of this study is that we can arbitrarily choose the reference direction for objects moving in a horizontal direction, including projectile motions.

Reducing False Sharing based on Memory Reference Patterns in Distributed Shared Memory Systems (분산 공유 메모리 시스템에서 메모리 참조 패턴에 근거한 거짓 공유 감속 기법)

  • Jo, Seong-Je
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1082-1091
    • /
    • 2000
  • In Distributed Shared Memory systems, false sharing occurs when two different data items, not shared but accessed by two different processors, are allocated to a single block and is an important factor in degrading system performance. The paper first analyzes shared memory allocation and reference patterns in parallel applications that allocate memory for shared data objects using a dynamic memory allocator. The shared objects are sequentially allocated and generally show different reference patterns. If the objects with the same size are requested successively as many times as the number of processors, each object is referenced by only a particular processor. If the objects with the same size are requested successively much more than the number of processors, two or more successive objects are referenced by only particular processors. On the basis of these analyses, we propose a memory allocation scheme which allocates each object requested by different processors to different pages and evaluate the existing memory allocation techniques for reducing false sharing faults. Our allocation scheme reduces a considerable amount of false sharing faults for some applications with a little additional memory space.

  • PDF

A Fast Algorithm for Target Detection in High Spatial Resolution Imagery

  • Kim Kwang-Eun
    • Proceedings of the KSRS Conference
    • /
    • 2006.03a
    • /
    • pp.7-14
    • /
    • 2006
  • Detection and identification of targets from remotely sensed imagery are of great interest for civilian and military application. This paper presents an algorithm for target detection in high spatial resolution imagery based on the spectral and the dimensional characteristics of the reference target. In this algorithm, the spectral and the dimensional information of the reference target is extracted automatically from the sample image of the reference target. Then in the entire image, the candidate target pixels are extracted based on the spectral characteristics of the reference target. Finally, groups of candidate pixels which form isolated spatial objects of similar size to that of the reference target are extracted as detected targets. The experimental test results showed that even though the algorithm detected spatial objects which has different shape as targets if the spectral and the dimensional characteristics are similar to that of the reference target, it could detect 97.5% of the targets in the image. Using hyperspectral image and utilizing the shape information are expected to increase the performance of the proposed algorithm.

  • PDF

A Fast Algorithm for Target Detection in High Spatial Resolution Imagery

  • Kim Kwang-Eun
    • Korean Journal of Remote Sensing
    • /
    • v.22 no.1
    • /
    • pp.41-47
    • /
    • 2006
  • Detection and identification of targets from remotely sensed imagery are of great interest for civilian and military application. This paper presents an algorithm for target detection in high spatial resolution imagery based on the spectral and the dimensional characteristics of the reference target. In this algorithm, the spectral and the dimensional information of the reference target is extracted automatically from the sample image of the reference target. Then in the entire image, the candidate target pixels are extracted based on the spectral characteristics of the reference target. Finally, groups of candidate pixels which form isolated spatial objects of similar size to that of the reference target are extracted as detected targets. The experimental test results showed that even though the algorithm detected spatial objects which has different shape as targets if the spectral and the dimensional characteristics are similar to that of the reference target, it could detect 97.5% of the targets in the image. Using hyperspectral image and utilizing the shape information are expected to increase the performance of the proposed algorithm.

Experimental Study of Two-step Phase-shifting Digital Holography based on the Calculated Intensity of a Reference Wave

  • Li, Jun;Pan, Yang Yang;Li, Jiao sheng;Li, Rong;Zheng, Tao
    • Journal of the Optical Society of Korea
    • /
    • v.18 no.3
    • /
    • pp.230-235
    • /
    • 2014
  • Two-step quadrature phase-shifting digital holography based on the calculated intensity of a reference wave is proposed. In the Mach-Zehnder interferometer (MZI) architecture, the method only records two quadrature-phase holograms, without reference-wave intensity or object-wave intensity measurement, to perform object recoding and reconstruction. When the reference-wave intensity is calculated from the 2D correlation coefficient (CC) method that we presented, the clear reconstruction image can be obtained by some specific algorithm. Its feasibility and validity were verified by a series of experiments with 2D objects and 3D objects. The presented method will be widely used in real-time or dynamic digital holography applications.

Extraction of Attentive Objects Using Feature Maps (특징 지도를 이용한 중요 객체 추출)

  • Park Ki-Tae;Kim Jong-Hyeok;Moon Young-Shik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.5 s.311
    • /
    • pp.12-21
    • /
    • 2006
  • In this paper, we propose a technique for extracting attentive objects in images using feature maps, regardless of the complexity of images and the position of objects. The proposed method uses feature maps with edge and color information in order to extract attentive objects. We also propose a reference map which is created by integrating feature maps. In order to create a reference map, feature maps which represent visually attentive regions in images are constructed. Three feature maps including edge map, CbCr map and H map are utilized. These maps contain the information about boundary regions by the difference of intensity or colors. Then the combination map which represents the meaningful boundary is created by integrating the reference map and feature maps. Since the combination map simply represents the boundary of objects we extract the candidate object regions including meaningful boundaries from the combination map. In order to extract candidate object regions, we use the convex hull algorithm. By applying a segmentation algorithm to the area of candidate regions to separate object regions and background regions, real object regions are extracted from the candidate object regions. Experiment results show that the proposed method extracts the attentive regions and attentive objects efficiently, with 84.3% Precision rate and 81.3% recall rate.

Effect of reference objects on the accuracy of digital implant impressions in partially edentulous arches

  • Vygandas Rutkunas;Darius Jegelevicius;Justinas Pletkus;Liudas Auskalnis;Mykolas Akulauskas;Tan Firat Eyuboglu;Mutlu Ozcan;Agne Gedrimiene
    • The Journal of Advanced Prosthodontics
    • /
    • v.16 no.5
    • /
    • pp.302-310
    • /
    • 2024
  • PURPOSE. This study assesses the impact of additional reference objects (RO) on the trueness and precision of distance and angle measurements between scan bodies in digital scans with four different intraoral scanners (IOS) in partially edentulous models. MATERIALS AND METHODS. Maxilla models (Frasaco, Frasaco GmbH, Tettnang, Germany) with one (3-U) and two (4-U) missing posterior teeth were 3D printed and fitted with dental implants and scan bodies. Four intraoral scanners (Primescan (Dentsply Sirona, Charlotte, NC, USA) (PS), Trios 3 (3Shape) (T3), Trios 4 (3Shape) (T4), and CS3600 (Carestream Dentistry) (CS)) captured digital implant impressions with and without additional RO. Scans were aligned and assessed for distance and angulation measurements between scan bodies. Statistical analyses compared trueness and precision across model groups using the Student t-test and Welch's ANOVA. RESULTS. CS consistently showed the highest distance values across IOS devices in both the 4-U and 3-U models (P < .05), both with and without RO. The distance values were not considerably affected by the presence of RO (P > .05), except for a few isolated cases in the PS and CS groups of 3-U models. When measuring angles, CS usually showed greater values than the other IOS devices, especially when RO was present both in the 4-U and 3-U variants (P < .05). CONCLUSION. The influence of additional reference objects on accuracy varies with different scanner types, irrespective of edentulous area length.

An Adaptive Web Caching Method based on the Heterogeneity of Web Object (웹 객체 이질성 기반의 적응형 웹캐싱 기법)

  • Ko, Il-Suk;Na, Yun-Ji;Leem, Chun-Seong
    • Annual Conference of KIPS
    • /
    • 2004.05a
    • /
    • pp.1379-1382
    • /
    • 2004
  • The use of a cache for storing and processing of Web objects is becoming larger. Also, many studies on the efficient management of the storing scope of caches are being done. Web caching algorithms have many differences from traditional algorithms. Particularly, heterogeneity of Web objects that are processing units of Web caching, and a variation of Web object reference characteristic with time are the important causes of the decrease the performance of existing algorithms. In this study, we proposed the new web-caching algorithm. A heterogeneity variation of an object can be reduced as the proposed method dividedly managing Web objects and a cache scope with heterogeneity, and it is adaptively reflecting a variation of object reference characteristics with the flowing of time. In the experiments, we verified that the performance of the proposed method was more improved than existing algorithms through the two experiment models which considered heterogeneity of an object.

  • PDF

Enhanced Object Recognition System using Reference Point and Size (기준점과 크기를 사용한 객체 인식 시스템 향상)

  • Lee, Taehwan;Rhee, Eugene
    • Journal of IKEEE
    • /
    • v.22 no.2
    • /
    • pp.350-355
    • /
    • 2018
  • In this paper, a system that can classify the objects in the image according to their sizes using the reference points is proposed. The object is studied with samples. The proposed system recognizes and classifies objects by the size in images acquired using a mobile phone camera. Conventional object recognition systems classify objects using only object size. As the size of the object varies depending on the distance, such systems have the disadvantage that an error may occurs if the image is not acquired with a certain distance. In order to overcome the limitation of the conventional object recognition system, the object recognition system proposed in this paper can classify the object regardless of the distance with comparing the size of the reference point by placing it at the upper left corner of the image.

3D Image Correlator using Computational Integral Imaging Reconstruction Based on Modified Convolution Property of Periodic Functions

  • Jang, Jae-Young;Shin, Donghak;Lee, Byung-Gook;Hong, Suk-Pyo;Kim, Eun-Soo
    • Journal of the Optical Society of Korea
    • /
    • v.18 no.4
    • /
    • pp.388-394
    • /
    • 2014
  • In this paper, we propose a three-dimensional (3D) image correlator by use of computational integral imaging reconstruction based on the modified convolution property of periodic functions (CPPF) for recognition of partially occluded objects. In the proposed correlator, elemental images of the reference and target objects are picked up by a lenslet array, and subsequently are transformed to a sub-image array which contains different perspectives according to the viewing direction. The modified version of the CPPF is applied to the sub-images. This enables us to produce the plane sub-image arrays without the magnification and superimposition processes used in the conventional methods. With the modified CPPF and the sub-image arrays, we reconstruct the reference and target plane sub-image arrays according to the reconstruction plane. 3D object recognition is performed through cross-correlations between the reference and the target plane sub-image arrays. To show the feasibility of the proposed method, some preliminary experiments on the target objects are carried out and the results are presented. Experimental results reveal that the use of plane sub-image arrays enables us to improve the correlation performance, compared to the conventional method using the computational integral imaging reconstruction algorithm.