BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T143138Z
LOCATION:B304
DTSTART;TZID=America/New_York:20241117T171500
DTEND;TZID=America/New_York:20241117T173000
UID:submissions.supercomputing.org_SC24_sess745_ws_scalah106@linklings.com
SUMMARY:An Ising-based Decision Method for Intra Prediction Mode in Video 
 Coding
DESCRIPTION:Takuto Momominami and Naoya Niwa (Tokyo University of Agricult
 ure and Technology); Masahito Kumagai, Kazuhiko Komatsu, and Hiroaki Kobay
 ashi (Tohoku University); and Hiroe Iwasaki (Tokyo University of Agricultu
 re and Technology, Tohoku University)\n\nVideo AI and transmission are use
 d in various fields.  Video compression is based on many combinatorial opt
 imization problems.  It is difficult for conventional computers to solve p
 roblems because these problems take exponential time as the problem size i
 ncreases. To solve these problems, Ising machines specialized for combinat
 orial optimization have attracted attention. In video encoding, selecting 
 appropriate prediction modes while considering the specific characteristic
 s of the videos is essential. This paper proposes an Ising-based decision 
 method for intra prediction mode in video coding. The combinatorial optimi
 zation problem in intra prediction is formulated into a QUBO model and the
 n is executed using an Ising machine. The experiments using the Fixstars A
 mplify Annealing Engine show the proposed method can achieve 70 times fast
 er than conventional computers while choosing the same optimal mode. As a 
 result, problems of sizes previously unsolvable by conventional computers 
 can be solved by the proposed method.\n\nTag: Algorithms, Heterogeneous Co
 mputing\n\nRegistration Category: Workshop Reg Pass\n\nSession Chairs: Vas
 sil Alexandrov (Hartree Centre, STFC); Jack Dongarra (University of Tennes
 see, Knoxville; Oak Ridge National Laboratory (ORNL)); Erik Draeger (Lawre
 nce Livermore National Laboratory (LLNL), Center for Applied Scientific Co
 mputing); Christian Engelmann (Oak Ridge National Laboratory (ORNL)); and 
 Dieter A. Kranzlmueller (Ludwig-Maxmilians-Universität München, Leibniz Su
 percomputing Centre (LRZ))\n\n
END:VEVENT
END:VCALENDAR
