Generative Adversarial Networks (GANs) for 3D volume generation and reconstruction, such as shape generation, visualization, automated design, real-time simulation, and research applications, are receiving increased amounts of attention in various fields. However, challenges such as limited training data, high computational costs, and mode collapse issues persist. We propose combining a Variational Autoencoder (VAE) and a GAN to uncover enhanced 3D structures and introduce a stable and scalable progressive growth approach for generating and reconstructing intricate voxel-based 3D shapes. The cascade-structured network involves a generator and discriminator, starting with small voxel sizes and incrementally adding layers, while subsequently supervising the discriminator with ground-truth labels in each newly added layer to model a broader voxel space. Our method enhances the convergence speed and improves the quality of the generated 3D models through stable growth, thereby facilitating an accurate representation of intricate voxel-level details. Through comparative experiments with existing methods, we demonstrate the effectiveness of our approach in evaluating voxel quality, variations, and diversity. The generated models exhibit improved accuracy in 3D evaluation metrics and visual quality, making them valuable across various fields, including virtual reality, the metaverse, and gaming.

In wireless sensor networks, sensor nodes are often deployed in large numbers in places that are difficult for humans to access. However, the energy of the sensor node is limited. Therefore, one of the most important considerations when designing routing protocols in wireless sensor networks is minimizing the energy consumption of each sensor node. When the energy of a wireless sensor node is exhausted, the node can no longer be used. Various protocols are being designed to minimize energy consumption and maintain long-term network life. Therefore, we proposed KOCED, an optimal cluster K-means algorithm that considers the distances between cluster centers, nodes, and residual energies. I would like to perform a performance evaluation on the KOCED protocol. This is a study for energy efficiency and validation. The purpose of this study is to present performance evaluation factors by comparing the K-means algorithm and the K-medoids algorithm, one of the recently introduced machine learning techniques, with the KOCED protocol.

Recently, various applications of indoor location-based services using Wi-Fi fingerprint data have been studied. However, since fingerprint data collected at a specific location does not have continuous information between signals and correlation information between signals, path data cannot exist in principle. Therefore, most indoor positioning technologies are based on predicting the position of a stationary positioner at a specific location based on signal data collected at a specific location in the indoor space. Due to the discontinuous nature of these signals, they are unable to account for user movement. Therefore, there is a need for techniques to improve the accuracy of indoor positioning in moving situations. This paper proposes a method for enriching all data points with relevant information to obtain improved indoor positioning results and an improved technique for generating movement path data. The proposed technique generates relevant information with continuity by expressing data points as Bounding Boxes (BB) and subsequently clustering them using grid cells. Through the proposed method, we represented and expanded the indoor location data, which consists of data points, as BB. However, data points represented by BB do not have any adjacency information with each other, and as a result, it is not possible to create a movement path between neighboring BB. To solve the problem, we used clustering, a machine learning technique that categorizes data points into groups, to group BBs. This was done by constructing a YOLO (You Only Look Once) grid cell that included all BBs and clustered them into grid cells that were divided into specific regions through the suggestion phase. The clustering results align with the indoor structure of the building, indicating that the data points have been appropriately clustered. BBs inside a grid cell are contained within a moveable area and have related information. We also generated association information between neighboring grid cells through the proposal technique, and then generated path information that can be traveled between grid cells. In this paper, we use the movement path information generated from a dataset as training data for machine learning, and through this, we propose an enhanced indoor positioning technology.

Recently, various application fields utilizing Wi-Fi fingerprint data have been under research. However, fingerprint data collected from a specific location does not include relevant information, such as continuity. Therefore, most indoor positioning technologies predict the user’s location based on location signals collected at specific points within the indoor space, without taking into account the user’s movements. Hence, there is a need for technology that improves the accuracy of indoor positioning while moving. This paper proposes a technique to generate movement path data by applying the concepts of “BB” and “Grid Cell” from computer vision to Wi-Fi fingerprint data. This approach represents data points as bounding boxes (BBs), then establishes grid cells and clusters of these BBs to generate adjacency information. Subsequently, movement path data are created based on this information. We utilized the movement path information generated from the dataset as training data for machine learning and introduced an enhanced indoor positioning technology. First, the experiments in this paper assessed the performance of the proposed technology based on the number of paths in the LSTM model. Second, the performance of clustering methods was compared through experiments. Finally, we evaluated the performance of various machine learning models. The experimental results confirmed a maximum accuracy of 94.48% when determining the location based on route information. Clustering performance improved accuracy by up to 3%. In comparative experiments with machine learning models, accuracy improved by up to 2.8%.