• Title/Summary/Keyword: Attention algorithm

Search Result 766, Processing Time 0.024 seconds

Compressive Sensing-Based L1-SVD DOA Estimation (압축센싱기법 기반 L1-SVD 도래각 추정)

  • Cho, Yunseong;Paik, Ji-Woong;Lee, Joon-Ho;Ko, Yo Han;Cho, Sung-Woo
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.27 no.4
    • /
    • pp.388-394
    • /
    • 2016
  • There have been many studies on the direction-of-arrival(DOA) estimation algorithm using antenna arrays. Beamforming, Capon's method, maximum likelihood, MUSIC algorithms are the main algorithms for the DOA estimation. Recently, compressive sensing-based DOA estimation algorithm exploiting the sparsity of the incident signals has attracted much attention in the signal processing community. In this paper, the performance of the L1-SVD algorithm, which is based on fitting of the data matrix, is compared with that of the MUSIC algorithm.

An Efficient Algorithm for Mining Ranged Association Rules (영역 연관규칙 탐사를 위한 효율적 알고리즘)

  • 조일래
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.1 no.2
    • /
    • pp.169-181
    • /
    • 1997
  • Some association rules can have very high confidence in a sub-interval or a subrange of the domain, though not quite high confidence in the whole domain. In this paper, we define a ranged association rule, an association with high confidence worthy of special attention in a sub-domain, and further propose an efficient algorithm which finds out ranged association rules. The proposed algorithm is data-driven method in a sense that hypothetical subranges are built based on data distribution itself. In addition, to avoid redundant database scanning, we devise an effective in-memory data structure, that is collected through single database scanning. The simulation shows that the suggested algorithm has reliable performance at the acceptable time cost in actual application areas.

  • PDF

Design and Implementation of Intelligent Medical Service System Based on Classification Algorithm

  • Yu, Linjun;Kang, Yun-Jeong;Choi, Dong-Oun
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.3
    • /
    • pp.92-103
    • /
    • 2021
  • With the continuous acceleration of economic and social development, people gradually pay attention to their health, improve their living environment, diet, strengthen exercise, and even conduct regular health examination, to ensure that they always understand the health status. Even so, people still face many health problems, and the number of chronic diseases is increasing. Recently, COVID-19 has also reminded people that public health problems are also facing severe challenges. With the development of artificial intelligence equipment and technology, medical diagnosis expert systems based on big data have become a topic of concern to many researchers. At present, there are many algorithms that can help computers initially diagnose diseases for patients, but they want to improve the accuracy of diagnosis. And taking into account the pathology that varies from person to person, the health diagnosis expert system urgently needs a new algorithm to improve accuracy. Through the understanding of classic algorithms, this paper has optimized it, and finally proved through experiments that the combined classification algorithm improved by latent factors can meet the needs of medical intelligent diagnosis.

Incremental Strategy-based Residual Regression Networks for Node Localization in Wireless Sensor Networks

  • Zou, Dongyao;Sun, Guohao;Li, Zhigang;Xi, Guangyong;Wang, Liping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2627-2647
    • /
    • 2022
  • The easy scalability and low cost of range-free localization algorithms have led to their wide attention and application in node localization of wireless sensor networks. However, the existing range-free localization algorithms still have problems, such as large cumulative errors and poor localization performance. To solve these problems, an incremental strategy-based residual regression network is proposed for node localization in wireless sensor networks. The algorithm predicts the coordinates of the nodes to be solved by building a deep learning model and fine-tunes the prediction results by regression based on the intersection of the communication range between the predicted and real coordinates and the loss function, which improves the localization performance of the algorithm. Moreover, a correction scheme is proposed to correct the augmented data in the incremental strategy, which reduces the cumulative error generated during the algorithm localization. The analysis through simulation experiments demonstrates that our proposed algorithm has strong robustness and has obvious advantages in localization performance compared with other algorithms.

Importance Assessment of Multiple Microgrids Network Based on Modified PageRank Algorithm

  • Yeonwoo LEE
    • Korean Journal of Artificial Intelligence
    • /
    • v.11 no.2
    • /
    • pp.1-6
    • /
    • 2023
  • This paper presents a comprehensive scheme for assessing the importance of multiple microgrids (MGs) network that includes distributed energy resources (DERs), renewable energy systems (RESs), and energy storage system (ESS) facilities. Due to the uncertainty of severe weather, large-scale cascading failures are inevitable in energy networks. making the assessment of the structural vulnerability of the energy network an attractive research theme. This attention has led to the identification of the importance of measuring energy nodes. In multiple MG networks, the energy nodes are regarded as one MG. This paper presents a modified PageRank algorithm to assess the importance of MGs that include multiple DERs and ESS. With the importance rank order list of the multiple MG networks, the core MG (or node) of power production and consumption can be identified. Identifying such an MG is useful in preventing cascading failures by distributing the concentration on the core node, while increasing the effective link connection of the energy flow and energy trade. This scheme can be applied to identify the most profitable MG in the energy trade market so that the deployment operation of the MG connection can be decided to increase the effectiveness of energy usages. By identifying the important MG nodes in the network, it can help improve the resilience and robustness of the power grid system against large-scale cascading failures and other unexpected events. The proposed algorithm can point out which MG node is important in the MGs power grid network and thus, it could prevent the cascading failure by distributing the important MG node's role to other MG nodes.

A Novel Social Aware Reverse Relay Selection Scheme for Underlaying Multi- Hop D2D Communications

  • Liang Li;Xinjie Yang;Yuanjie Zheng;Jiazhi Yang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.10
    • /
    • pp.2732-2749
    • /
    • 2023
  • Device-to-Device (D2D) communication has received increasing attention and been studied extensively thanks to its advantages in improving spectral efficiency and energy efficiency of cellular networks. This paper proposes a novel relay selection algorithm for multi-hop full-duplex D2D communications underlaying cellular networks. By selecting the relay of each hop in a reverse manner, the proposed algorithm reduces the heavy signaling overhead that traditional relay selection algorithms introduce. In addition, the social domain information of mobile terminals is taken into consideration and its influence on the performance of D2D communications studied, which is found significant enough not to be overlooked. Moreover, simulations show that the proposed algorithm, in absence of social relationship information, improves data throughput by around 70% and 7% and energy efficiency by 64% and 6%, compared with two benchmark algorithms, when D2D distance is 260 meters. In a more practical implementation considering social relationship information, although the proposed algorithm naturally achieves less throughput, it substantially increases the energy efficiency than the benchmarks.

A Study of Tool Wear Measurement Using Image Processing (이미지 프로세싱을 활용한 공구의 마모 측정법 연구)

  • Sumin Kim;Minsu Jung;Jong-kyu Park
    • The Journal of Korea Robotics Society
    • /
    • v.19 no.1
    • /
    • pp.65-70
    • /
    • 2024
  • Tool wear is considered an important issue in manufacturing and engineering, as worn tools can negatively impact productivity and product quality. Given that the wear status of tools plays a decisive role in the production process, measuring tool wear is a key task. Consequently, there is significant attention in manufacturing fields on the precise measurement of tool wear. Current domestic methods for measuring wear are limited in terms of speed and efficiency, with traditional methods being time-consuming and reliant on subjective evaluation. To address these issues, we developed a measurement module implementing the DeepContour algorithm, which uses image processing technology for rapid measurement and evaluation of tool wear. This algorithm accurately extracts the tool's outline, assesses its condition, determines the degree of wear, and proves more efficient than existing, subjective, and time-consuming methods. The main objective of this paper is to design and apply in practice an algorithm and measurement module that can measure and evaluate tool wear using image processing technology. It focuses on determining the degree of wear by extracting the tool's outline, assessing its condition, and presenting the measured value to the operator.

Automatic Frequency Conversion Algorithm for Vehicle Radio (차량 라디오 주파수 자동변환 알고리즘)

  • Kim, Tae-Yun;Hwang, Suk-Seung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.8
    • /
    • pp.939-944
    • /
    • 2014
  • Traffic accidents caused by the attention dispersion are increasing and the behavior of the attention dispersion affects the front-observing rate, road keeping ability, and reaction time for a dangerous situation. Many drivers listen to a radio broadcast and they have to change the frequency for continuously listening a radio broadcast of the specific broadcasting station in case of crossing a boundary of the particular area. In this situation, the possibility of a car accident increases, because the attention dispersion of a driver might be occurred. Especially, the risk of a car accident caused by changing the frequency of a radio is more serious in the highway, due to the high speed of a vehicle. In order to reduce the risk of a car accident caused by handling a radio during driving car, in this paper, we propose an automatic frequency conversion algorithm for vehicle radio, which saves normal system frequencies of primary broadcasting stations in a database and determines new frequency of the changed area using the location information obtained from a navigation system in a boundary of the specific area. After determining new frequency, the proposed algorithm selects a frequency with better receiving rate comparing signal-to-noise ratios (SNRs) of two signals corresponding previous and new frequencies.

Passage Planning in Coastal Waters for Maritime Autonomous Surface Ships using the D* Algorithm

  • Hyeong-Tak Lee;Hey-Min Choi
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.29 no.3
    • /
    • pp.281-287
    • /
    • 2023
  • Establishing a ship's passage plan is an essential step before it starts to sail. The research related to the automatic generation of ship passage plans is attracting attention because of the development of maritime autonomous surface ships. In coastal water navigation, the land, islands, and navigation rules need to be considered. From the path planning algorithm's perspective, a ship's passage planning is a global path-planning problem. Because conventional global path-planning methods such as Dijkstra and A* are time-consuming owing to the processes such as environmental modeling, it is difficult to modify a ship's passage plan during a voyage. Therefore, the D* algorithm was used to address these problems. The starting point was near Busan New Port, and the destination was Ulsan Port. The navigable area was designated based on a combination of the ship trajectory data and grid in the target area. The initial path plan generated using the D* algorithm was analyzed with 33 waypoints and a total distance of 113.946 km. The final path plan was simplified using the Douglas-Peucker algorithm. It was analyzed with a total distance of 110.156 km and 10 waypoints. This is approximately 3.05% less than the total distance of the initial passage plan of the ship. This study demonstrated the feasibility of automatically generating a path plan in coastal navigation for maritime autonomous surface ships using the D* algorithm. Using the shortest distance-based path planning algorithm, the ship's fuel consumption and sailing time can be minimized.

Detecting Salient Regions based on Bottom-up Human Visual Attention Characteristic (인간의 상향식 시각적 주의 특성에 바탕을 둔 현저한 영역 탐지)

  • 최경주;이일병
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.2
    • /
    • pp.189-202
    • /
    • 2004
  • In this paper, we propose a new salient region detection method in an image. The algorithm is based on the characteristics of human's bottom-up visual attention. Several features known to influence human visual attention like color, intensity and etc. are extracted from the each regions of an image. These features are then converted to importance values for each region using its local competition function and are combined to produce a saliency map, which represents the saliency at every location in the image by a scalar quantity, and guides the selection of attended locations, based on the spatial distribution of saliency region of the image in relation to its Perceptual importance. Results shown indicate that the calculated Saliency Maps correlate well with human perception of visually important regions.