• Title/Summary/Keyword: Hole Searching

Search Result 24, Processing Time 0.019 seconds

Efficient Hole Searching Algorithm for the Overset Grid System with Relative Body Motion (상대운동이 있는 중첩격자계에 효율적인 Hole Searching Algorithm 개발)

  • Lee, Seon-Hyeong;Chae, Sang-Hyun;Oh, Se-Jong;Yee, Kwan-Jung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.39 no.11
    • /
    • pp.995-1004
    • /
    • 2011
  • Object X-ray method commonly used for hole search in overset grids requires huge amount of time due to complicated vector calculations to search the cross-points as well as time-consuming hole search algorithm with respect to background grids. Especially, when the grid system is in motion relative to the background, hole points should be searched at every time step, leading to hung computational burden. To cope with this difficulties, this study presents an efficient hole search algorithm mainly designed to reduce hole searching time. To this end, virtual surface with reduced grid points is suggested and logical operators are employed as a classification algorithm instead of complicated vector calculations. In addition, the searching process is further accelerated by designating hole points in a row rather than discriminating hole points with respect to each background grid points. If there exists a relative motion, the present algorithm requires much less time because only the virtual surface needs to be moved at every time step. The hole searching time has been systematically compared for a few selected geometries.

Virtual View Generation by a New Hole Filling Algorithm

  • Ko, Min Soo;Yoo, Jisang
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.3
    • /
    • pp.1023-1033
    • /
    • 2014
  • In this paper, performance improved hole-filling algorithm which includes the boundary noise removing pre-process that can be used for an arbitrary virtual view synthesis has been proposed. Boundary noise occurs due to the boundary mismatch between depth and texture images during the 3D warping process and it usually causes unusual defects in a generated virtual view. Common-hole is impossible to recover by using only a given original view as a reference and most of the conventional algorithms generate unnatural views that include constrained parts of the texture. To remove the boundary noise, we first find occlusion regions and expand these regions to the common-hole region in the synthesized view. Then, we fill the common-hole using the spiral weighted average algorithm and the gradient searching algorithm. The spiral weighted average algorithm keeps the boundary of each object well by using depth information and the gradient searching algorithm preserves the details. We tried to combine strong points of both the spiral weighted average algorithm and the gradient searching algorithm. We also tried to reduce the flickering defect that exists around the filled common-hole region by using a probability mask. The experimental results show that the proposed algorithm performs much better than the conventional algorithms.

Boundary Noise Removal and Hole Filling Algorithm for Virtual Viewpoint Image Generation (가상시점 영상 생성을 위한 경계 잡음 제거와 홀 채움 기법)

  • Ko, Min-Soo;Yoo, Ji-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8A
    • /
    • pp.679-688
    • /
    • 2012
  • In this paper, performance improved hole-filling algorithm including boundary noise removing pre-process which can be used for an arbitrary view synthesis with given two views is proposed. Boundary noise usually occurs because of the boundary mismatch between the reference image and depth map and common-hole is defined as the occluded region. These boundary noise and common-hole created while synthesizing a virtual view result in some defects and they are usually very difficult to be completely recovered by using only given two images as references. The spiral weighted average algorithm gives a clear boundary of each object by using depth information and the gradient searching algorithm is able to preserve details. In this paper, we combine these two algorithms by using a weighting factor ${\alpha}$ to reflect the strong point of each algorithm effectively in the virtual view synthesis process. The experimental results show that the proposed algorithm performs much better than conventional algorithms.

Realization of PCB Insert Machine Automation (PCB 조립로봇 자동화를 위한 시스템 구현)

  • 김상주;강진구;최승욱;이장명
    • Proceedings of the IEEK Conference
    • /
    • 2002.06e
    • /
    • pp.239-242
    • /
    • 2002
  • This paper has been realized PCB insert machine automation system. For the reduction of the install programming time as well as possible, a new technique is addressed. In detail, an image frame is initially divided into one area whose size decreases according to the distance from hole to hole on PCB. Searching center of hole using a threshold method after median filtering. At every moment of mouse click, area is shifted to locate the hole, and detect a center of hole in a new area. Experimental results are demonstrated to verify the superiority of this scheme in detecting position of part by comparing with a man of experience.

  • PDF

A Remote SNMP Connection Request Mechanism for NATed Devices using UDP Hole Punching and Heuristic Hole Binding Time Search (UDP 홀 펀칭과 경험적 홀 유지시간 탐색을 이용한 NAT 환경단말의 SNMP 원격 접속요청 메커니즘)

  • Park, Choon-Gul;Kim, Seong-Il;Jeong, Ki-Tae;Lee, Young-Seok
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.5
    • /
    • pp.367-373
    • /
    • 2008
  • Recently, the NAT middlebox widely deployed in the home network environment prohibits DM operations from reaching user devices behind NAT. In this article, we focus on NAT issues to manage home network devices. Particularly, we discuss standardization efforts, and present our proposal to deploy DM services for VoIP and IPTV devices under NAT. By slightly changing behaviors of Simple Network Management Protocol (SNMP) Manager and Agent, and defining additional Management Objects (MOs) to gather NAT binding information, we could solve the NAT traversal problem under symmetric NAT. Moreover, we propose an enhanced method to search the UDP hole binding time of the NAT box. We applied our method to randomly selected 22 VoIP devices out of 194 NATed hosts in the real broadband network and have achieved 99% of the success ratio for exchanging SNMP request messages and 26% of enhancement for searching the UDP hole binding time.

Compliance Control of a 6-tink Electro-Hydraulic Manipulator (6축 전기 유압 매니퓰레이터의 컴플라이언스 제어)

  • 안경관;표성만
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.1
    • /
    • pp.47-53
    • /
    • 2004
  • An electro-hydraulic manipulator using hydraulic actuators has many nonlinear elements, and its parameter fluctuations are greater than those of an electrically driven manipulator. So it is quite difficult to obtain stable control performance. We have applied a disturbance estimation and compensation type robust control to all the axes in a 6-link electro-hydraulic manipulator. It was confirmed that the performance of trajectory tracking and attitude regulating was greatly improved by the disturbance observer. For autonomous assembly tasks, it is said that compliance control is one of the most popular methods in contact task. We have proposed a compliance control based on the position control by a disturbance observer for our manipulator system. To realize more stable contact work, the states in the compliance loop are feedbacked, where not only displacement but also the velocity and acceleration are considered. We have also applied this compliance control to the Peg-in-Hole insertion task and proposed new methods of (1)rotating of the end-effector periodically in order to reduce the friction force, (2)random searching for the center of a hole and (3)trajectory modification to reduce the impact force. As a result of these new methods, it could be experimentally confirmed that the Peg-in-Hole insertion task with a clearance of 0.007 [mm] could be achieved.

Hole Filling Algorithm for a Virtual-viewpoint Image by Using a Modified Exemplar Based In-painting

  • Ko, Min Soo;Yoo, Jisang
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.1003-1011
    • /
    • 2016
  • In this paper, a new algorithm by using 3D warping technique to effectively fill holes that are produced when creating a virtual-viewpoint image is proposed. A hole is defined as the region that cannot be seen in the reference view when a virtual view is created. In the proposed algorithm, to reduce the blurring effect that occurs on the hole region filled by conventional algorithms and to enhance the texture quality of the generated virtual view, Exemplar Based In-painting algorithm is used. The boundary noise which occurs in the initial virtual view obtained by 3D warping is also removed. After 3D warping, we estimate the relative location of the background to the holes and then pixels adjacent to the background are filled in priority to get better result by not using only adjacent object's information. Also, the temporal inconsistency between frames can be reduced by expanding the search region up to the previous frame when searching for most similar patch. The superiority of the proposed algorithm compared to the existing algorithms can be shown through the experimental results.

Consider the directional hole filling method for virtual view point synthesis (가상 시점 영상 합성을 위한 방향성 고려 홀 채움 방법)

  • Mun, Ji Hun;Ho, Yo Sung
    • Smart Media Journal
    • /
    • v.3 no.4
    • /
    • pp.28-34
    • /
    • 2014
  • Recently the depth-image-based rendering (DIBR) method is usually used in 3D image application filed. Virtual view image is created by using a known view with associated depth map to make a virtual view point which did not taken by the camera. But, disocclusion area occur because the virtual view point is created using a depth image based image 3D warping. To remove those kind of disocclusion region, many hole filling methods are proposed until now. Constant color region searching, horizontal interpolation, horizontal extrapolation, and variational inpainting techniques are proposed as a hole filling methods. But when using those hole filling method some problem occurred. The different types of annoying artifacts are appear in texture region hole filling procedure. In this paper to solve those problem, the multi-directional extrapolation method is newly proposed for efficiency of expanded hole filling performance. The proposed method is efficient when performing hole filling which complex texture background region. Consideration of directionality for hole filling method use the hole neighbor texture pixel value when estimate the hole pixel value. We can check the proposed hole filling method can more efficiently fill the hole region which generated by virtual view synthesis result.

A Study of UWB Placement Optimization Based on Genetic Algorithm

  • Jung, Doyeon;Kim, Euiho
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.11 no.2
    • /
    • pp.99-107
    • /
    • 2022
  • Urban Air Mobility (UAM) such as a drone taxi is one of the future transportations that have recently been attracting attention. Along with the construction of an urban terminal, an accurate landing system for UAM is also essential. However, in urban environments, reliable Global Navigation Satellite Systems (GNSS) signals cannot be received due to obstacles such as high-rise buildings which causes multipath and non-line of sight signal. Thus, the positioning result in urban environments from the GNSS signal is unreliable. Consequently, we propose the Ultra-Wideband (UWB) network to assist the soft landing of UAM on a vertiport. Since the positioning performance of UWB network depends on the layout of UWB anchors, it is necessary to optimize the layout of UWB anchors. In this paper, we propose a two-steps genetic algorithm that consists of binary genetic algorithm involved multi objectives fitness function and integer genetic algorithm involved robust solution searching fitness function in order to optimize taking into account Fresnel hole effects.

Design and Implementation of HoleInOne Metasearch System (HoleInOne 메타검색 시스템의 설계 및 구현)

  • 김현주;배종민
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.2
    • /
    • pp.360-373
    • /
    • 2003
  • The Meta Search system proposed in this paper is operated based on relevance distribution Infer mation(RDI). It first evaluates the sources applicable to the search, and then selects the most appropriate source. According to the evaluation of the sources, it discreetly collects the documents from the concerned sources and classifies them into a useful order based on the RDI, which is an evaluation score of the sources. The documents are classified into order and presented to the user as a single search result. For this Purpose, this study presents evaluation factor models to present the RDI between the query, and source, and proposes a method for drawing out the RDI based on the evaluation factors. The system for selecting the most appropriate sources according to the query has been developed based on an algorithm that selects the best source. Finally, after searching the documents suitable for query from extracted sources, we present a Meta Search system, HoleInOne, that ranks and merges them.

  • PDF