• 제목/요약/키워드: Geometry algorithms

검색결과 175건 처리시간 0.036초

Adaptive Algorithm in Image Reconstruction Based on Information Geometry

  • Wang, Meng;Ning, Zhen Hu;Yu, Jing;Xiao, Chuang Bai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권2호
    • /
    • pp.461-484
    • /
    • 2021
  • Compressed sensing in image reconstruction has attracted attention and many studies are proposed. As we know, adding prior knowledge about the distribution of the support on the original signal to CS can improve the quality of reconstruction. However, it is still difficult for a recovery framework adjusts its strategy for exploiting the prior knowledge efficiently according to the current estimated signals in serial iterations. With the theory of information geometry, we propose an adaptive strategy based on the current estimated signal in each iteration of the recovery. We also improve the performance of existing algorithms through the adaptive strategy for exploiting the prior knowledge according to the current estimated signal. Simulations are presented to validate the results. In the end, we also show the application of the model in the image.

차량 진동이 궤도 선형 측정에 미치는 영향 (Influence of Vehicle Vibration on Track Geometry Measurement)

  • 배규영;용재철;김이현;권삼영
    • 한국소음진동공학회논문집
    • /
    • 제26권6_spc호
    • /
    • pp.644-650
    • /
    • 2016
  • Track maintenance works based on track geometry recordings are essential to enhance the safety and comfort of railway transportation. Usually, the track irregularity has been measured by a special inspection trains which all were imported from abroad. Because the inspection train speed is limited under 160 km/h, it takes a long time to inspect railways and there is difficulty in daytime operation. To solve this problem, we started to develop a track geometry measuring system (TGMS) with measurement speed up to 300 km/h which can be installed in commercial vehicles such as HEMU-430X. In this paper, we introduce a newly developed inertial TGMS and propose two inertial navigation system (INS) algorithms (method A, B) for measuring track geometry. In order to investigate advantage and disadvantage of each algorithm, we performed vibration test of the TGMS, which was simulated by 6-axis shaking table. Through the vibration test, we analyzed the influence of vehicle vibration on the TGMS which will be installed on bogie frame. To the vibration test, two methods satisfied the required accuracy of track geometry measurement under the level of the actual vehicle vibration of HEMU-430X train. Theoretically, method A is sensitive to vehicle vibration than method B. However, HEMU-430X's bogie vibration frequency range is out of interest range of measurement system. Therefore, method A can also apply the HEMU-430X train.

In-network Distributed Event Boundary Computation in Wireless Sensor Networks: Challenges, State of the art and Future Directions

  • Jabeen, Farhana;Nawaz, Sarfraz
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권11호
    • /
    • pp.2804-2823
    • /
    • 2013
  • Wireless sensor network (WSN) is a promising technology for monitoring physical phenomena at fine-grained spatial and temporal resolution. However, the typical approach of sending each sensed measurement out of the network for detailed spatial analysis of transient physical phenomena may not be an efficient or scalable solution. This paper focuses on in-network physical phenomena detection schemes, particularly the distributed computation of the boundary of physical phenomena (i.e. event), to support energy efficient spatial analysis in wireless sensor networks. In-network processing approach reduces the amount of network traffic and thus achieves network scalability and lifetime longevity. This study investigates the recent advances in distributed event detection based on in-network processing and includes a concise comparison of various existing schemes. These boundary detection schemes identify not only those sensor nodes that lie on the boundary of the physical phenomena but also the interior nodes. This constitutes an event geometry which is a basic building block of many spatial queries. In this paper, we introduce the challenges and opportunities for research in the field of in-network distributed event geometry boundary detection as well as illustrate the current status of research in this field. We also present new areas where the event geometry boundary detection can be of significant importance.

스테레오 비전센서를 이용한 차선감지 시스템 연구 (A Study on Lane Sensing System Using Stereo Vision Sensors)

  • 하건수;박재식;이광운;박재학
    • 대한기계학회논문집A
    • /
    • 제28권3호
    • /
    • pp.230-237
    • /
    • 2004
  • Lane Sensing techniques based on vision sensors are regarded promising because they require little infrastructure on the highway except clear lane markers. However, they require more intelligent processing algorithms in vehicles to generate the previewed roadway from the vision images. In this paper, a lane sensing algorithm using vision sensors is developed to improve the sensing robustness. The parallel stereo-camera is utilized to regenerate the 3-dimensional road geometry. The lane geometry models are derived such that their parameters represent the road curvature, lateral offset and heading angle, respectively. The parameters of the lane geometry models are estimated by the Kalman filter and utilized to reconstruct the lane geometry in the global coordinate. The inverse perspective mapping from the image plane to the global coordinate considers roll and pitch motions of a vehicle so that the mapping error is minimized during acceleration, braking or steering. The proposed sensing system has been built and implemented on a 1/10-scale model car.

점 집합의 보로노이 다이어그램을 이용한 원 집합의 보로노이 다이어그램의 계산: II.기하학적 측면 (The Computation of the Voronoi Diagram of a Circle Set Using the Voronoi Diagram of a Point Set: II. Geometry)

  • 김동욱;김덕수;조동수
    • 한국CDE학회논문집
    • /
    • 제6권1호
    • /
    • pp.31-39
    • /
    • 2001
  • Presented in this paper are algorithms to compute the positions of vertices and equations of edges of the Voronoi diagram of a circle set. The circles are located in a Euclidean plane, the radii of the circles are not necessarily equal and the circles are not necessarily disjoint. The algorithms correctly and efficiently work when the correct topology of the Voronoi diagram was given. Given three circle generators, the position of the Voronoi vertex is computed by treating the plane as a complex plane, the Z-plane, and transforming it into another complex plane, the W-plane, via the Mobius transformation. Then, the problem is formulated as a simple point location problem in regions defined by two lines and two circles in the W-plane. And the center of the inverse-transformed circle in Z-plane from the line in the W-plane becomes the position of the Voronoi vertex. After the correct topology is constructed with the geometry of the vertices, the equations of edge are computed in a rational quadratic Bezier curve farm.

  • PDF

Incorporation of Scene Geometry in Least Squares Correlation Matching for DEM Generation from Linear Pushbroom Images

  • Kim, Tae-Jung;Yoon, Tae-Hun;Lee, Heung-Kyu
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 1999년도 Proceedings of International Symposium on Remote Sensing
    • /
    • pp.182-187
    • /
    • 1999
  • Stereo matching is one of the most crucial parts in DEM generation. Naive stereo matching algorithms often create many holes and blunders in a DEM and therefore a carefully designed strategy must be employed to guide stereo matching algorithms to produce “good” 3D information. In this paper, we describe one such a strategy designed by the use of scene geometry, in particular, the epipolarity for generation of a DEM from linear pushbroom images. The epipolarity for perspective images is a well-known property, i.e., in a stereo image pair, a point in the reference image will map to a line in the search image uniquely defined by sensor models of the image pair. This concept has been utilized in stereo matching by applying epipolar resampling prior to matching. However, the epipolar matching for linear pushbroom images is rather complicated. It was found that the epipolarity can only be described by a Hyperbola- shaped curve and that epipolar resampling cannot be applied to linear pushbroom images. Instead, we have developed an algorithm of incorporating such epipolarity directly in least squares correlation matching. Experiments showed that this approach could improve the quality of a DEM.

  • PDF

고성능/저전력 3D 기하 연산을 위한 오프라인 CORDIC 벡터회전 알고리즘 (Off-line CORDIC Vector Rotation Algorithm for High-Performance and Low-Power 3D Geometry Operations)

  • 김은옥;이정근;이정아
    • 한국정보과학회논문지:컴퓨팅의 실제 및 레터
    • /
    • 제14권8호
    • /
    • pp.763-767
    • /
    • 2008
  • 본 논문에서는 모바일 환경에서의 3D 그래픽 처리에 효과적인 고성능/저전력의 CORDIC 구조를 구성하기 위하여 각도 기반 검색(ABS)과 스케일링 효과를 고려한 검색(SCS)과 같은 두 가지 오프라인 벡터링 방법을 제안하고 이를 통해 연산의 반복횟수를 줄이는 알고리즘을 개발한다. ABS 알고리즘은 3차원 벡터를 두 각으로 표현하고 이를 검색의 기준으로 삼았고, SCS 알고리즘은 단위 벡터를 기준으로 하여 벡터 회전 시에 최소의 반복 연산만으로도 원하는 회전을 수행할 수 있는 최적의 기본각 회전 시퀀스를 오프라인으로 미리 검색하여 적용한다 본 논문에서 제안하는 ABS, SCS 알고리즘을 통해 지연을 각각 50% 감소시킬 수 있었으며, 이와 함께 voltage scaling 기술을 적용하여 전력 소모를 크게 감소시킬 수 있음을 논의한다.

인공지능을 이용한 3차원 구조물의 최적화 설계 : 마이크로 가속도계에 적용 (Optimal Design for 3D Structures Using Artificial Intelligence : Its Application to Micro Accelerometer)

  • Lee, Joon-Seong
    • 한국지능시스템학회논문지
    • /
    • 제14권4호
    • /
    • pp.445-450
    • /
    • 2004
  • 본 논문은 실질적인 최적화 구조물의 설계를 위한 시스템에 대한 것으로 퍼지이론에 바탕을 둔 자동 유한요소 생성 망 기술과 계산 기하학적 기술, 해석코드 및 솔리드모델러를 시스템에 통합시켰다. 최적해 또는 만족해는 자동해석 시스템과 함께 탐색공간을 위한 유전자 알고리즘을 이용하여 자동적으로 탐색되어 진다. 또한, 유전자 알고리즘을 이용함으로써 본 설계 시스템은 다차원 해를 얻을 수 있다. 개발된 시스템은 터널전류에 바탕을 둔 마이크로 가속도계의 형상설계에 적용하였다.

삼각격자에 대한 위상학적 개선과정의 확장 (Extension of Topological Improvement Procedures for Triangular Meshes)

  • 맹주성;한석영;최형일
    • 대한기계학회논문집B
    • /
    • 제25권6호
    • /
    • pp.853-859
    • /
    • 2001
  • This paper describes the extended topological clean up procedures to improve the quality of unstructured triangular meshes. As a postprocessing step, topological improvement procedures are applied both for elements that are interior to the mesh and for elements connected to the boundary and then Laplacian-like smoothing is used by default. Previous clean up algorithms are limited to eliminate the nodes of degree 3,4,8,9,10 and pairs of nodes of degree 5. In this study, new clean up algorithms which minimize the triple connection structures combined with degree 5 and 7 (ie ; 5-7-5, 7-7-5, 7-5-7 etc) are added. The suggested algorithms are applied to two example meshes to demonstrate the effectiveness of the approach in improving element quality in a finite element mesh.

Geometry Information-based Practical Device Identification for Local Device-to-device Communication

  • Park, Eun-hye;Lee, Kwang-Eog;Kang, Joon-hyuk
    • 한국정보전자통신기술학회논문지
    • /
    • 제7권4호
    • /
    • pp.159-167
    • /
    • 2014
  • Local device-to-device (D2D) communication between two smart mobile devices is becoming increasingly popular. The first key step in starting a D2D communication is to discover and identify the remote target device to establish a link. However, existing device discovery mechanisms either require users to explicitly identify the ID of the target device or rely on inaccurate beamforming technology. This paper presents two novel device identification algorithms using a variety of embedded sensors. The algorithms only require that users to point two devices towards each other. This paper describes the algorithms, analyzes their accuracy using analytical models, and verifies the results using simulations.