Jinyoung Shin

Mr. Jinyoung Shin


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 January 2024 in Electronics
Verified
Journal Article
Open access
PDF file
JOUNGMIN PARKJOUNGMIN PARK
JOUNGMIN PARK
Jinyoung ShinJinyoung Shin
Jinyoung Shin
RKRaehyeong Kim
Raehyeong Kim
Seongmo AnSeongmo An
Seongmo An
SLSangho Lee
Sangho Lee
SLSeung Eun Lee
Seung Eun Lee
Image analysis-based artificial intelligence (AI) models leveraging convolutional neural networks (CNN) take a significant role in evaluating the ripeness of strawberry, contributing to the maximization of productivity. However, the convolution, which constitutes the majority of the CNN models, imposes significant computational burdens. Additionally, the dense operations in the fully connected (FC) layer necessitate a vast number of parameters and entail extensive external memory access. Therefore, reducing the computational burden of convolution operations and alleviating memory overhead is essential in embedded environment. In this paper, we propose a strawberry ripeness classification system utilizing a convolution-based feature extractor (CoFEx) for accelerating convolution operations and an edge AI processor, Intellino, for replacing FC layer operations. We accelerated feature map extraction utilizing the CoFEx constructed with systolic array (SA) and alleviated the computational burden and memory overhead associated with the FC layer operations by replacing them with the k-nearest neighbors (k-NN) algorithm. The CoFEx and the Intellino both were designed with Verilog HDL and implemented on a field-programmable gate array (FPGA). The proposed system achieved a high precision of 93.4%, recall of 93.3%, and F1 score of 0.933. Therefore, we demonstrated a feasibility of the strawberry ripeness classification system operating in an embedded environment.

5 December 2024 in Electronics
Verified
Journal Article
Open access
PDF file
Jinyoung ShinJinyoung Shin
Jinyoung Shin
Seongmo AnSeongmo An
Seongmo An
SLSangho Lee
Sangho Lee
SLSeung Eun Lee
Seung Eun Lee
As the scope of artificial intelligence (AI) expands and the structure becomes more complex, the amount of data for inference and training has increased. In traditional computer architectures, the memory bandwidth limitations have intensified bottlenecks in AI systems, and processing-in-memory (PIM) architectures have been proposed to overcome this issue. PIM is an architecture that performs computations within memory, thereby reducing data movement between the CPU and memory. However, since PIM is difficult to optimize as a general-purpose architecture, it is essential to adopt an architecture suitable for the target application. While various simulators and emulators have been introduced for the design space exploration (DSE) of different PIM architectures, simulators are limited in debugging hardware operations, and emulators face challenges in flexibly modifying the system configuration, as emulators implement the entire architecture in hardware. Therefore, this paper introduces PIMCoSim, a comprehensive hardware–software co-simulator for the DSE of DRAM-PIM systems. This co-simulator partially emulates simplified hardware-implemented processing elements (PEs) and integrates software models for memory operations, facilitating the DSE of PIM systems. To validate PIMCoSim, we analyzed results for different computational workloads by varying PIM structures and operational policies, demonstrating the efficiency of DRAM-PIM systems. The co-simulation approach in PIMCoSim aims to contribute to analyzing DRAM-PIM configurations and adopting optimized structures.

8 July 2025 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
Jinyoung ShinJinyoung Shin
Jinyoung Shin
JOUNGMIN PARKJOUNGMIN PARK
JOUNGMIN PARK
Jinyeol KimJinyeol Kim
Jinyeol Kim
YJYue Ri Jeong
Yue Ri Jeong
Seongmo AnSeongmo An
Seongmo An
SLSeung Eun Lee
Seung Eun Lee
Path planning is crucial to ensure the safe navigation of autonomous mobile robots (AMRs). However, as the scale of maps and paths increases, achieving faster and more efficient computations becomes challenging due to constraints in memory and computational resources. In this paper, we present a hardware architecture for global path planning utilizing block searching A* (BSA*) for AMRs. The BSA* designates surrounding nodes as blocks and searching nodes for expansion with collision detection based on block-based jump point search (JPS(B)). This reduces the amount of stored data, enables faster map scanning, and provides advantages in parallelized architecture. The BSA* accelerator, consisting of a memory controller based on heap sorting and a parallelized collision detector, was implemented on a field-programmable gate array (FPGA). In the benchmarks for grid-based pathfinding, experimental results showed that BSA* stored 83.2% less data compared to A* and BSA* accelerator demonstrated real-time performance, ranging from 0.528 ms to 2.983 ms, successfully verifying the feasibility of real-time path planning with a block searching approach.