• Title/Summary/Keyword: Hexagon

Search Result 150, Processing Time 0.026 seconds

An Adaptive Fast Motion Estimation Based on Directional Correlation and Predictive Values in H.264 (움직임 방향 연관 및 예측치 적용 기반 적응적 고속 H.264 움직임 추정 알고리즘의 설계)

  • Kim, Cheong-Ghil
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.10 no.2
    • /
    • pp.53-61
    • /
    • 2011
  • This research presents an adaptive fast motion estimation (ME) computation on the stage of uneven multi-hexagon grid search (UMHGS) algorithm included in an unsymmetrical-cross multi-hexagon-grid search (UMHexagonS) in H.264 standard. The proposed adaptive method is based on statistical analysis and previously obtained motion vectors to reduce the computational complexity of ME. For this purpose, the algorithm is decomposed into three processes: skipping, terminating, and reducing search areas. Skipping and terminating are determined by the statistical analysis of the collected minimum SAD (sum of absolute difference) and the search area is constrained by the slope of previously obtained motion vectors. Simulation results show that 13%-23% of ME time can be reduced compared with UMHexagonS, while still maintaining a reasonable PSNR (peak signal-to-noise ratio) and average bitrates.

  • PDF

A study on solutions of Jisuguimundo using the range of magic sums (합의 범위를 이용한 지수귀문도 해의 탐구)

  • Kwon, Gyunuk;Park, Sang Hu;Song, Yun Min;Choi, Seong Woong;Park, Poo-Sung
    • Journal for History of Mathematics
    • /
    • v.27 no.2
    • /
    • pp.111-125
    • /
    • 2014
  • Jisuguimundo is an inimitable magic hexagon devised by Choi Seok-Jeong, who was the author of GuSuRyak as well as a prime minister in Joseon dynasty. Jisuguimundo, recorded in GuSuRyak, is also known as Hexagonal Tortoise Problem (HTP) because its nine hexagons resemble a tortoise shell. We call the sum of numbers in a hexagon in Jisuguimundo a magic sum, and show that the magic sum of hexagonal tortoise problem of order 2 varies 40 through 62 exactly and that of hexagonal tortoise problem of order 3 varies 77 through 109 exactly. We also find all of the possible solutions for hexagonal tortoise problem of oder 2.

Lipreading using The Fuzzy Degree of Simuliarity

  • Kurosu, Kenji;Furuya, Tadayoshi;Takeuchi, Shigeru;Soeda, Mitsuru
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.903-906
    • /
    • 1993
  • Lipreading through visual processing techniques help provide some useful systems for the hearing impaired to learn communication assistance. This paper proposes a method to understand spoken words by using visual images taken by a camera with a video-digitizer. The image is processed to obtain the contours of lip, which is approximated into a hexagon. The pattern lists, consisting of lengths and angles of hexagon, are compared and computed to get the fuzzy similarity between two lists. By similarity matching, the mouth shape is recognized as the one which has the pronounced voice. Some experiments, exemplified by recognition of the Japanese vowels, are given to show feasibilities of this method.

  • PDF

A Fast Block Matching Algorithm using Unit-Diamond and Flat-Hexagonal Search Patterns (단위 다이아몬드와 납작한 육각패턴을 이용한 고속 블록 정합 알고리즘)

  • 남현우;위영철;김하진
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.57-65
    • /
    • 2004
  • In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the unit-diamond search pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the unit-diamond search pattern, and then fastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed unit-diamond and flat-hexagonal pattern search algorithm(UDFHS) improves as high as 11∼51% in terms of average number of search point per motion vector estimation and improves about 0.05∼0.74㏈ in terms of PSNR(Peak Signal to Noise Ratio).

Evaluation of Field Applicability of Helical Pile Using Hexagon Joints (육각형 이음부를 이용한 회전관입말뚝의 현장적용성 평가)

  • Jeong, Sangguk
    • The Journal of Engineering Geology
    • /
    • v.30 no.4
    • /
    • pp.635-648
    • /
    • 2020
  • Performance improvement of helical piles in static load tests using hexagon joints that do not require welding or bolting was investigated. Two sites were selected for pile field tests to evaluate their bearing capacity. Static and pull-out load tests were undertaken to assess the method for estimating bearing capacity. The field tests indicated that the bearing capacity of the gravity grout pile was ≥600 kN in the static load test, consistent with the AC 358 Code. The non-grout pile had a bearing capacity of ≤600 kN, suggesting that gravity grouting is required. Field pile load-test results were used to establish the bearing capacity equation, based on a small number of helical pile.

Research on Relay Selection Technology Based on Regular Hexagon Region Segmentation in C-V2X

  • Li, Zhigang;Yue, Xinan;Wang, Xin;Li, Baozhu;Huang, Daoying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3138-3151
    • /
    • 2022
  • Traffic safety and congestion are becoming more and more serious, especially the frequent occurrence of traffic accidents, which have caused great casualties and economic losses. Cellular Vehicle to Everything (C-V2X) can assist in safe driving and improve traffic efficiency through real-time information sharing and communication between vehicles. All vehicles communicate directly with Base Stations (BS), which will increase the base station load. And when the communicating vehicles are too far apart, too fast or there are obstacles in the communication path, the communication link can be unstable or even interrupted. Therefore, choosing an effective and reliable multi-hop relay-assisted Vehicle to Vehicle (V2V) communication can not only reduce the base station load and improve the system throughput but also expand the base station coverage and improve the communication quality of edge vehicles. Therefore, a communication area division scheme based on regular hexagon segmentation technology is proposed, a relay-assisted V2V communication mechanism is designed for the divided communication areas, and an efficient communication link is constructed by selecting the best relay node. Simulation results show that the scheme can improve the throughput of the system by nearly 55% and enhance the robustness of the V2V communication link.

Retrospective study on marginal bone resorption around immediately loaded implants (즉시 하중 임플란트에서 변연골 흡수량에 관한 후향적 연구)

  • Lee, Sung-Hoon;Jung, Ji-Hye;Lee, Jin-Han;Cho, Hye-Won
    • The Journal of Korean Academy of Prosthodontics
    • /
    • v.56 no.2
    • /
    • pp.114-119
    • /
    • 2018
  • Purpose: Patients who treated implant immediate loading within a week after implant placement at Wonkwang University Dental Hospital Implant Center were evaluated marginal bone resorption. These retrospective analyses are intended to reinforce the clinical evidence for the implant immediate loading. Materials and methods: Medical history and radiographic data were investigated, which were the patients' who treated implant immediate loading and restoration with provisional prostheses between January 2005 and June 2016, at Wonkwang University Dental Hospital Implant Center. Total number of implants was 70, marginal bone resorption was measured according to implant length, diameter and connection type. To measure marginal bone resorption, periapical radiographs were taken when the implants were placed and after 6 month. Statistical analysis was done in Mann-whitney U test and Kruskal-wallis test with SPSS 22.0 software (P<.05). Results: Mean marginal bone resorption around immediately loaded implants according to implant connection type was shown $1.24{\pm}0.72mm$ in internal hexagon connection type and $1.73{\pm}1.27mm$ in external hexagon connection type. There was no statically significant difference in marginal bone resorption with implant length and diameter. Conclusion: Implants with immediated loading in internal hexagon connection type showed less marginal bone resorption significantly than in external hexagon connection type.

Robotic Agent Design and Application in the Ubiquitous Intelligent Space (유비쿼터스 지능형 공간에서의 로봇 에이전트 설계 및 응용)

  • Yoon Han-Ul;Hwang Se-Hee;Kim Dae-Wook;Lee Doong-Hoon;Sim Kwee-Bo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.12
    • /
    • pp.1039-1044
    • /
    • 2005
  • This paper presents a robotic agent design and application in the ubiquitous intelligent space. We set up an experimental environment with Bluetooth host, Bluetooth client, furniture and home appliance, and robotic agents. First, the agents basically performed patrol guard to detect unexpected penetration, and to keep home safely from gas-leakage, electric leakage, and so on. They were out to patrol fur a robbery while navigating in a living room and a private room. In this task, we used an area-based action making and a hexagon-based Q-learning to control the agents. Second, the agents communicate with Bluetooth host device to access and control a home appliance. The Bluetooth host offers a manual control to person by inquiring a client robot when one would like to check some place especially. In this exercise, we organize asynchronous connection less (ACL) between the host and the client robots and control the robot maneuver by Bluetooth host controller interface (HCI).

Strategy of Object Search for Distributed Autonomous Robotic Systems

  • Kim Ho-Duck;Yoon Han-Ul;Sim Kwee-Bo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.6 no.3
    • /
    • pp.264-269
    • /
    • 2006
  • This paper presents the strategy for searching a hidden object in an unknown area for using by multiple distributed autonomous robotic systems (DARS). To search the target in Markovian space, DARS should recognize th ε ir surrounding at where they are located and generate some rules to act upon by themselves. First of all, DARS obtain 6-distances from itself to environment by infrared sensor which are hexagonally allocated around itself. Second, it calculates 6-areas with those distances then take an action, i.e., turn and move toward where the widest space will be guaranteed. After the action is taken, the value of Q will be updated by relative formula at the state. We set up an experimental environment with five small mobile robots, obstacles, and a target object, and tried to research for a target object while navigating in a un known hallway where some obstacles were placed. In the end of this paper, we present the results of three algorithms - a random search, an area-based action making process to determine the next action of the robot and hexagon-based Q-learning to enhance the area-based action making process.

Fractal Depth Map Sequence Coding Algorithm with Motion-vector-field-based Motion Estimation

  • Zhu, Shiping;Zhao, Dongyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.242-259
    • /
    • 2015
  • Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.